%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n027.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 : Thu Aug 31 10:04:58 EDT 2023 % Result : Theorem 4.51s 1.47s % Output : Proof 6.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n027.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 : Thu Aug 24 13:36:47 EDT 2023 % 0.13/0.35 % CPUTime : % 0.21/0.58 ________ _____ % 0.21/0.58 ___ __ \_________(_)________________________________ % 0.21/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.58 % 0.21/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.58 (2023-06-19) % 0.21/0.58 % 0.21/0.58 (c) Philipp Rümmer, 2009-2023 % 0.21/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.58 Amanda Stjerna. % 0.21/0.58 Free software under BSD-3-Clause. % 0.21/0.58 % 0.21/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.58 % 0.21/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.59 Running up to 7 provers in parallel. % 0.21/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.21/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.31/1.04 Prover 4: Preprocessing ... % 2.70/1.07 Prover 1: Preprocessing ... % 2.70/1.10 Prover 2: Preprocessing ... % 2.70/1.10 Prover 3: Preprocessing ... % 2.70/1.10 Prover 6: Preprocessing ... % 2.70/1.10 Prover 5: Preprocessing ... % 2.70/1.10 Prover 0: Preprocessing ... % 4.06/1.25 Prover 5: Proving ... % 4.06/1.27 Prover 2: Proving ... % 4.06/1.30 Prover 6: Proving ... % 4.51/1.33 Prover 1: Constructing countermodel ... % 4.51/1.34 Prover 3: Constructing countermodel ... % 4.51/1.41 Prover 4: Constructing countermodel ... % 4.51/1.43 Prover 3: gave up % 4.51/1.44 Prover 1: gave up % 4.51/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.51/1.45 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.51/1.45 Prover 6: gave up % 4.51/1.46 Prover 0: Proving ... % 4.51/1.46 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 4.51/1.47 Prover 2: proved (875ms) % 4.51/1.47 % 4.51/1.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.51/1.47 % 5.23/1.48 Prover 0: stopped % 5.23/1.49 Prover 7: Preprocessing ... % 5.23/1.49 Prover 5: stopped % 5.23/1.49 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.23/1.49 Prover 8: Preprocessing ... % 5.23/1.49 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.23/1.50 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.23/1.51 Prover 9: Preprocessing ... % 5.23/1.51 Prover 7: Warning: ignoring some quantifiers % 5.23/1.52 Prover 7: Constructing countermodel ... % 5.23/1.52 Prover 13: Preprocessing ... % 5.23/1.52 Prover 11: Preprocessing ... % 5.23/1.53 Prover 10: Preprocessing ... % 5.23/1.54 Prover 4: Found proof (size 14) % 5.23/1.54 Prover 4: proved (941ms) % 5.23/1.54 Prover 7: stopped % 5.23/1.56 Prover 10: Warning: ignoring some quantifiers % 5.23/1.56 Prover 10: Constructing countermodel ... % 5.23/1.56 Prover 13: Warning: ignoring some quantifiers % 5.23/1.57 Prover 13: Constructing countermodel ... % 5.23/1.57 Prover 10: stopped % 5.23/1.57 Prover 11: stopped % 6.28/1.57 Prover 13: stopped % 6.28/1.58 Prover 8: Warning: ignoring some quantifiers % 6.28/1.58 Prover 8: Constructing countermodel ... % 6.28/1.59 Prover 8: stopped % 6.50/1.63 Prover 9: Constructing countermodel ... % 6.50/1.63 Prover 9: stopped % 6.50/1.63 % 6.50/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.50/1.63 % 6.64/1.64 % SZS output start Proof for theBenchmark % 6.64/1.64 Assumptions after simplification: % 6.64/1.64 --------------------------------- % 6.64/1.64 % 6.64/1.64 (axiom_2) % 6.64/1.67 $ki_index(#idx(b_alice)) & $ki_world($ki_local_world) & $i(portland) & ! [v0: % 6.64/1.67 $ki_world] : ! [v1: int] : (v1 = 0 | ~ (bigcity(v0, portland) = v1) | ~ % 6.64/1.67 $ki_world(v0) | ? [v2: int] : ( ~ (v2 = 0) & $ki_accessible(#idx(b_alice), % 6.64/1.67 $ki_local_world, v0) = v2)) & ! [v0: $ki_world] : ( ~ % 6.64/1.67 ($ki_accessible(#idx(b_alice), $ki_local_world, v0) = 0) | ~ $ki_world(v0) % 6.64/1.67 | bigcity(v0, portland) = 0) % 6.64/1.67 % 6.64/1.67 (mrel_universal_#idx(b_alice)) % 6.64/1.67 $ki_index(#idx(b_alice)) & ! [v0: $ki_world] : ! [v1: $ki_world] : ! [v2: % 6.64/1.67 int] : (v2 = 0 | ~ ($ki_accessible(#idx(b_alice), v0, v1) = v2) | ~ % 6.64/1.67 $ki_world(v1) | ~ $ki_world(v0)) % 6.64/1.67 % 6.64/1.67 (verify) % 6.64/1.67 $ki_index(#idx(i_alice)) & $ki_index(#idx(b_bob)) & $ki_world($ki_local_world) % 6.64/1.67 & $i(portland) & ? [v0: $ki_world] : ? [v1: $ki_world] : ? [v2: int] : ( ~ % 6.64/1.67 (v2 = 0) & bigcity(v1, portland) = v2 & $ki_accessible(#idx(i_alice), % 6.64/1.67 $ki_local_world, v0) = 0 & $ki_accessible(#idx(b_bob), v0, v1) = 0 & % 6.64/1.67 $ki_world(v1) & $ki_world(v0)) % 6.64/1.67 % 6.64/1.67 Further assumptions not needed in the proof: % 6.64/1.67 -------------------------------------------- % 6.64/1.67 axiom_1_alice, axiom_1_bob, axiom_3, mrel_universal_#idx(b_bob), % 6.64/1.67 mrel_universal_#idx(i_alice), mrel_universal_#idx(i_bob) % 6.64/1.67 % 6.64/1.67 Those formulas are unsatisfiable: % 6.64/1.67 --------------------------------- % 6.64/1.67 % 6.64/1.67 Begin of proof % 6.64/1.67 | % 6.64/1.67 | ALPHA: (mrel_universal_#idx(b_alice)) implies: % 6.64/1.67 | (1) ! [v0: $ki_world] : ! [v1: $ki_world] : ! [v2: int] : (v2 = 0 | ~ % 6.64/1.67 | ($ki_accessible(#idx(b_alice), v0, v1) = v2) | ~ $ki_world(v1) | ~ % 6.64/1.67 | $ki_world(v0)) % 6.64/1.67 | % 6.64/1.67 | ALPHA: (axiom_2) implies: % 6.64/1.68 | (2) ! [v0: $ki_world] : ! [v1: int] : (v1 = 0 | ~ (bigcity(v0, portland) % 6.64/1.68 | = v1) | ~ $ki_world(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 6.64/1.68 | $ki_accessible(#idx(b_alice), $ki_local_world, v0) = v2)) % 6.64/1.68 | % 6.64/1.68 | ALPHA: (verify) implies: % 6.64/1.68 | (3) $ki_world($ki_local_world) % 6.64/1.68 | (4) ? [v0: $ki_world] : ? [v1: $ki_world] : ? [v2: int] : ( ~ (v2 = 0) & % 6.64/1.68 | bigcity(v1, portland) = v2 & $ki_accessible(#idx(i_alice), % 6.64/1.68 | $ki_local_world, v0) = 0 & $ki_accessible(#idx(b_bob), v0, v1) = 0 % 6.64/1.68 | & $ki_world(v1) & $ki_world(v0)) % 6.64/1.68 | % 6.64/1.68 | DELTA: instantiating (4) with fresh symbols all_16_0, all_16_1, all_16_2 % 6.64/1.68 | gives: % 6.64/1.68 | (5) ~ (all_16_0 = 0) & bigcity(all_16_1, portland) = all_16_0 & % 6.64/1.68 | $ki_accessible(#idx(i_alice), $ki_local_world, all_16_2) = 0 & % 6.64/1.68 | $ki_accessible(#idx(b_bob), all_16_2, all_16_1) = 0 & % 6.64/1.68 | $ki_world(all_16_1) & $ki_world(all_16_2) % 6.64/1.68 | % 6.64/1.68 | ALPHA: (5) implies: % 6.64/1.68 | (6) ~ (all_16_0 = 0) % 6.64/1.68 | (7) $ki_world(all_16_1) % 6.64/1.68 | (8) bigcity(all_16_1, portland) = all_16_0 % 6.64/1.68 | % 6.64/1.68 | GROUND_INST: instantiating (2) with all_16_1, all_16_0, simplifying with (7), % 6.64/1.68 | (8) gives: % 6.64/1.68 | (9) all_16_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 6.64/1.68 | $ki_accessible(#idx(b_alice), $ki_local_world, all_16_1) = v0) % 6.64/1.68 | % 6.64/1.68 | BETA: splitting (9) gives: % 6.64/1.68 | % 6.64/1.68 | Case 1: % 6.64/1.68 | | % 6.64/1.68 | | (10) all_16_0 = 0 % 6.64/1.68 | | % 6.64/1.68 | | REDUCE: (6), (10) imply: % 6.64/1.68 | | (11) $false % 6.64/1.68 | | % 6.64/1.68 | | CLOSE: (11) is inconsistent. % 6.64/1.68 | | % 6.64/1.68 | Case 2: % 6.64/1.68 | | % 6.64/1.69 | | (12) ? [v0: int] : ( ~ (v0 = 0) & $ki_accessible(#idx(b_alice), % 6.64/1.69 | | $ki_local_world, all_16_1) = v0) % 6.64/1.69 | | % 6.64/1.69 | | DELTA: instantiating (12) with fresh symbol all_25_0 gives: % 6.64/1.69 | | (13) ~ (all_25_0 = 0) & $ki_accessible(#idx(b_alice), $ki_local_world, % 6.64/1.69 | | all_16_1) = all_25_0 % 6.64/1.69 | | % 6.64/1.69 | | ALPHA: (13) implies: % 6.64/1.69 | | (14) ~ (all_25_0 = 0) % 6.64/1.69 | | (15) $ki_accessible(#idx(b_alice), $ki_local_world, all_16_1) = all_25_0 % 6.64/1.69 | | % 6.64/1.69 | | GROUND_INST: instantiating (1) with $ki_local_world, all_16_1, all_25_0, % 6.64/1.69 | | simplifying with (3), (7), (15) gives: % 6.64/1.69 | | (16) all_25_0 = 0 % 6.64/1.69 | | % 6.64/1.69 | | REDUCE: (14), (16) imply: % 6.64/1.69 | | (17) $false % 6.64/1.69 | | % 6.64/1.69 | | CLOSE: (17) is inconsistent. % 6.64/1.69 | | % 6.64/1.69 | End of split % 6.64/1.69 | % 6.64/1.69 End of proof % 6.64/1.69 % SZS output end Proof for theBenchmark % 6.64/1.69 % 6.64/1.69 1110ms %------------------------------------------------------------------------------