%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYO892_15 : TPTP v8.2.0. Released v8.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n026.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Fri Sep 1 04:54:08 EDT 2023 % Result : Theorem 3.79s 1.32s % Output : Proof 4.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SYO892_15 : TPTP v8.2.0. Released v8.2.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n026.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Sat Aug 26 07:49:18 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.21/1.07 Prover 4: Preprocessing ... % 2.21/1.07 Prover 1: Preprocessing ... % 2.21/1.11 Prover 3: Preprocessing ... % 2.21/1.11 Prover 5: Preprocessing ... % 2.21/1.11 Prover 0: Preprocessing ... % 2.21/1.11 Prover 2: Preprocessing ... % 2.21/1.11 Prover 6: Preprocessing ... % 3.19/1.20 Prover 5: Proving ... % 3.19/1.20 Prover 2: Proving ... % 3.19/1.21 Prover 6: Proving ... % 3.19/1.22 Prover 1: Warning: ignoring some quantifiers % 3.19/1.23 Prover 1: Constructing countermodel ... % 3.19/1.24 Prover 3: Warning: ignoring some quantifiers % 3.19/1.25 Prover 4: Warning: ignoring some quantifiers % 3.19/1.25 Prover 3: Constructing countermodel ... % 3.67/1.25 Prover 4: Constructing countermodel ... % 3.79/1.28 Prover 0: Proving ... % 3.79/1.32 Prover 3: proved (667ms) % 3.79/1.32 % 3.79/1.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.79/1.32 % 3.79/1.32 Prover 2: proved (668ms) % 3.79/1.32 % 3.79/1.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.79/1.32 % 3.79/1.32 Prover 5: proved (669ms) % 3.79/1.32 % 3.79/1.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.79/1.32 % 3.79/1.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.79/1.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.79/1.33 Prover 6: stopped % 3.79/1.33 Prover 0: stopped % 3.79/1.33 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.79/1.33 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.79/1.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.79/1.34 Prover 7: Preprocessing ... % 3.79/1.36 Prover 11: Preprocessing ... % 3.79/1.36 Prover 8: Preprocessing ... % 3.79/1.36 Prover 10: Preprocessing ... % 3.79/1.38 Prover 13: Preprocessing ... % 3.79/1.38 Prover 7: Warning: ignoring some quantifiers % 3.79/1.38 Prover 7: Constructing countermodel ... % 3.79/1.39 Prover 4: Found proof (size 14) % 3.79/1.39 Prover 4: proved (739ms) % 3.79/1.39 Prover 1: stopped % 3.79/1.39 Prover 7: stopped % 3.79/1.40 Prover 10: Warning: ignoring some quantifiers % 3.79/1.40 Prover 13: Warning: ignoring some quantifiers % 3.79/1.40 Prover 10: Constructing countermodel ... % 3.79/1.40 Prover 10: stopped % 3.79/1.40 Prover 13: Constructing countermodel ... % 3.79/1.40 Prover 13: stopped % 3.79/1.42 Prover 8: Warning: ignoring some quantifiers % 3.79/1.42 Prover 8: Constructing countermodel ... % 3.79/1.43 Prover 8: stopped % 3.79/1.43 Prover 11: Warning: ignoring some quantifiers % 4.24/1.43 Prover 11: Constructing countermodel ... % 4.24/1.44 Prover 11: stopped % 4.24/1.44 % 4.24/1.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.24/1.44 % 4.24/1.44 % SZS output start Proof for theBenchmark % 4.24/1.44 Assumptions after simplification: % 4.24/1.44 --------------------------------- % 4.24/1.44 % 4.24/1.44 ($ki_exists_in_world_$i_cumul) % 4.93/1.48 ! [v0: $ki_world] : ! [v1: $ki_world] : ! [v2: $i] : ! [v3: int] : (v3 = 0 % 4.93/1.48 | ~ ($ki_exists_in_world_$i(v1, v2) = v3) | ~ ($ki_exists_in_world_$i(v0, % 4.93/1.48 v2) = 0) | ~ $ki_world(v1) | ~ $ki_world(v0) | ~ $i(v2) | ? [v4: % 4.93/1.48 int] : ( ~ (v4 = 0) & $ki_accessible(v0, v1) = v4)) & ! [v0: $ki_world] : % 4.93/1.48 ! [v1: $ki_world] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 4.93/1.48 ($ki_exists_in_world_$i(v1, v2) = v3) | ~ ($ki_accessible(v0, v1) = 0) | ~ % 4.93/1.48 $ki_world(v1) | ~ $ki_world(v0) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & % 4.93/1.48 $ki_exists_in_world_$i(v0, v2) = v4)) & ! [v0: $ki_world] : ! [v1: % 4.93/1.48 $ki_world] : ! [v2: $i] : ( ~ ($ki_exists_in_world_$i(v0, v2) = 0) | ~ % 4.93/1.48 ($ki_accessible(v0, v1) = 0) | ~ $ki_world(v1) | ~ $ki_world(v0) | ~ % 4.93/1.48 $i(v2) | $ki_exists_in_world_$i(v1, v2) = 0) % 4.93/1.48 % 4.93/1.48 (verify) % 4.93/1.48 $ki_world($ki_local_world) & ? [v0: $i] : ? [v1: $ki_world] : % 4.93/1.48 ($ki_exists_in_world_$i($ki_local_world, v0) = 0 & % 4.93/1.48 $ki_accessible($ki_local_world, v1) = 0 & $ki_world(v1) & $i(v0) & ! [v2: % 4.93/1.48 $i] : ! [v3: int] : (v3 = 0 | ~ (f(v1, v2) = v3) | ~ $i(v2) | ? [v4: % 4.93/1.48 int] : ( ~ (v4 = 0) & $ki_exists_in_world_$i(v1, v2) = v4)) & ! [v2: % 4.93/1.48 $ki_world] : ( ~ (f(v2, v0) = 0) | ~ $ki_world(v2) | ? [v3: int] : ( ~ % 4.93/1.48 (v3 = 0) & $ki_accessible($ki_local_world, v2) = v3)) & ! [v2: $i] : ( % 4.93/1.49 ~ ($ki_exists_in_world_$i(v1, v2) = 0) | ~ $i(v2) | f(v1, v2) = 0) & ! % 4.93/1.49 [v2: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v2) = 0) | ~ % 4.93/1.49 $ki_world(v2) | ? [v3: int] : ( ~ (v3 = 0) & f(v2, v0) = v3))) % 4.93/1.49 % 4.93/1.49 (function-axioms) % 4.93/1.49 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 4.93/1.49 [v3: $ki_world] : (v1 = v0 | ~ (f(v3, v2) = v1) | ~ (f(v3, v2) = v0)) & ! % 4.93/1.49 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 4.93/1.49 $ki_world] : (v1 = v0 | ~ ($ki_exists_in_world_$i(v3, v2) = v1) | ~ % 4.93/1.49 ($ki_exists_in_world_$i(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 4.93/1.49 [v1: MultipleValueBool] : ! [v2: $ki_world] : ! [v3: $ki_world] : (v1 = v0 | % 4.93/1.49 ~ ($ki_accessible(v3, v2) = v1) | ~ ($ki_accessible(v3, v2) = v0)) % 4.93/1.49 % 4.93/1.49 Further assumptions not needed in the proof: % 4.93/1.49 -------------------------------------------- % 4.93/1.49 $ki_exists_in_world_$i_nonempty, mrel_serial % 4.93/1.49 % 4.93/1.49 Those formulas are unsatisfiable: % 4.93/1.49 --------------------------------- % 4.93/1.49 % 4.93/1.49 Begin of proof % 4.93/1.49 | % 4.93/1.49 | ALPHA: ($ki_exists_in_world_$i_cumul) implies: % 4.93/1.49 | (1) ! [v0: $ki_world] : ! [v1: $ki_world] : ! [v2: $i] : ( ~ % 4.93/1.49 | ($ki_exists_in_world_$i(v0, v2) = 0) | ~ ($ki_accessible(v0, v1) = % 4.93/1.49 | 0) | ~ $ki_world(v1) | ~ $ki_world(v0) | ~ $i(v2) | % 4.93/1.49 | $ki_exists_in_world_$i(v1, v2) = 0) % 4.93/1.49 | % 4.93/1.49 | ALPHA: (verify) implies: % 4.93/1.49 | (2) $ki_world($ki_local_world) % 4.93/1.50 | (3) ? [v0: $i] : ? [v1: $ki_world] : % 4.93/1.50 | ($ki_exists_in_world_$i($ki_local_world, v0) = 0 & % 4.93/1.50 | $ki_accessible($ki_local_world, v1) = 0 & $ki_world(v1) & $i(v0) & ! % 4.93/1.50 | [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (f(v1, v2) = v3) | ~ $i(v2) | % 4.93/1.50 | ? [v4: int] : ( ~ (v4 = 0) & $ki_exists_in_world_$i(v1, v2) = v4)) % 4.93/1.50 | & ! [v2: $ki_world] : ( ~ (f(v2, v0) = 0) | ~ $ki_world(v2) | ? % 4.93/1.50 | [v3: int] : ( ~ (v3 = 0) & $ki_accessible($ki_local_world, v2) = % 4.93/1.50 | v3)) & ! [v2: $i] : ( ~ ($ki_exists_in_world_$i(v1, v2) = 0) | % 4.93/1.50 | ~ $i(v2) | f(v1, v2) = 0) & ! [v2: $ki_world] : ( ~ % 4.93/1.50 | ($ki_accessible($ki_local_world, v2) = 0) | ~ $ki_world(v2) | ? % 4.93/1.50 | [v3: int] : ( ~ (v3 = 0) & f(v2, v0) = v3))) % 4.93/1.50 | % 4.93/1.50 | ALPHA: (function-axioms) implies: % 4.93/1.50 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.93/1.50 | ! [v3: $ki_world] : (v1 = v0 | ~ (f(v3, v2) = v1) | ~ (f(v3, v2) = % 4.93/1.50 | v0)) % 4.93/1.50 | % 4.93/1.50 | DELTA: instantiating (3) with fresh symbols all_9_0, all_9_1 gives: % 4.93/1.51 | (5) $ki_exists_in_world_$i($ki_local_world, all_9_1) = 0 & % 4.93/1.51 | $ki_accessible($ki_local_world, all_9_0) = 0 & $ki_world(all_9_0) & % 4.93/1.51 | $i(all_9_1) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (f(all_9_0, v0) % 4.93/1.51 | = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 4.93/1.51 | $ki_exists_in_world_$i(all_9_0, v0) = v2)) & ! [v0: $ki_world] : ( % 4.93/1.51 | ~ (f(v0, all_9_1) = 0) | ~ $ki_world(v0) | ? [v1: int] : ( ~ (v1 = % 4.93/1.51 | 0) & $ki_accessible($ki_local_world, v0) = v1)) & ! [v0: $i] : ( % 4.93/1.51 | ~ ($ki_exists_in_world_$i(all_9_0, v0) = 0) | ~ $i(v0) | f(all_9_0, % 4.93/1.51 | v0) = 0) & ! [v0: $ki_world] : ( ~ % 4.93/1.51 | ($ki_accessible($ki_local_world, v0) = 0) | ~ $ki_world(v0) | ? % 4.93/1.51 | [v1: int] : ( ~ (v1 = 0) & f(v0, all_9_1) = v1)) % 4.93/1.51 | % 4.93/1.51 | ALPHA: (5) implies: % 4.93/1.51 | (6) $i(all_9_1) % 4.93/1.51 | (7) $ki_world(all_9_0) % 4.93/1.51 | (8) $ki_accessible($ki_local_world, all_9_0) = 0 % 4.93/1.51 | (9) $ki_exists_in_world_$i($ki_local_world, all_9_1) = 0 % 4.93/1.51 | (10) ! [v0: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v0) = 0) | % 4.93/1.51 | ~ $ki_world(v0) | ? [v1: int] : ( ~ (v1 = 0) & f(v0, all_9_1) = % 4.93/1.51 | v1)) % 4.93/1.51 | (11) ! [v0: $i] : ( ~ ($ki_exists_in_world_$i(all_9_0, v0) = 0) | ~ % 4.93/1.51 | $i(v0) | f(all_9_0, v0) = 0) % 4.93/1.51 | % 4.93/1.51 | GROUND_INST: instantiating (10) with all_9_0, simplifying with (7), (8) gives: % 4.93/1.51 | (12) ? [v0: int] : ( ~ (v0 = 0) & f(all_9_0, all_9_1) = v0) % 4.93/1.51 | % 4.93/1.51 | GROUND_INST: instantiating (1) with $ki_local_world, all_9_0, all_9_1, % 4.93/1.51 | simplifying with (2), (6), (7), (8), (9) gives: % 4.93/1.51 | (13) $ki_exists_in_world_$i(all_9_0, all_9_1) = 0 % 4.93/1.51 | % 4.93/1.51 | DELTA: instantiating (12) with fresh symbol all_18_0 gives: % 4.93/1.51 | (14) ~ (all_18_0 = 0) & f(all_9_0, all_9_1) = all_18_0 % 4.93/1.51 | % 4.93/1.51 | ALPHA: (14) implies: % 4.93/1.51 | (15) ~ (all_18_0 = 0) % 4.93/1.51 | (16) f(all_9_0, all_9_1) = all_18_0 % 4.93/1.51 | % 4.93/1.51 | GROUND_INST: instantiating (11) with all_9_1, simplifying with (6), (13) % 4.93/1.51 | gives: % 4.93/1.51 | (17) f(all_9_0, all_9_1) = 0 % 4.93/1.51 | % 4.93/1.51 | GROUND_INST: instantiating (4) with all_18_0, 0, all_9_1, all_9_0, simplifying % 4.93/1.51 | with (16), (17) gives: % 4.93/1.51 | (18) all_18_0 = 0 % 4.93/1.51 | % 4.93/1.51 | REDUCE: (15), (18) imply: % 4.93/1.52 | (19) $false % 4.93/1.52 | % 4.93/1.52 | CLOSE: (19) is inconsistent. % 4.93/1.52 | % 4.93/1.52 End of proof % 4.93/1.52 % SZS output end Proof for theBenchmark % 4.93/1.52 % 4.93/1.52 889ms %------------------------------------------------------------------------------