%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NLP267_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 : n031.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:05:00 EDT 2023 % Result : Theorem 4.43s 1.30s % Output : Proof 6.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NLP267_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.12/0.34 % Computer : n031.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Thu Aug 24 11:20:21 EDT 2023 % 0.12/0.34 % CPUTime : % 0.18/0.59 ________ _____ % 0.18/0.59 ___ __ \_________(_)________________________________ % 0.18/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.59 % 0.18/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.59 (2023-06-19) % 0.18/0.59 % 0.18/0.59 (c) Philipp Rümmer, 2009-2023 % 0.18/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.59 Amanda Stjerna. % 0.18/0.59 Free software under BSD-3-Clause. % 0.18/0.59 % 0.18/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.59 % 0.18/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.18/0.60 Running up to 7 provers in parallel. % 0.18/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.49/0.99 Prover 1: Preprocessing ... % 2.49/0.99 Prover 4: Preprocessing ... % 2.49/1.02 Prover 0: Preprocessing ... % 2.49/1.02 Prover 5: Preprocessing ... % 2.49/1.02 Prover 3: Preprocessing ... % 2.49/1.02 Prover 2: Preprocessing ... % 2.49/1.02 Prover 6: Preprocessing ... % 3.41/1.15 Prover 5: Proving ... % 3.41/1.16 Prover 2: Proving ... % 3.80/1.20 Prover 3: Constructing countermodel ... % 3.80/1.21 Prover 1: Constructing countermodel ... % 3.80/1.22 Prover 6: Constructing countermodel ... % 4.43/1.29 Prover 4: Constructing countermodel ... % 4.43/1.30 Prover 5: proved (688ms) % 4.43/1.30 % 4.43/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.43/1.30 % 4.43/1.30 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.43/1.30 Prover 3: stopped % 4.43/1.30 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.43/1.30 Prover 6: stopped % 4.43/1.31 Prover 2: stopped % 4.43/1.31 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.43/1.32 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.43/1.33 Prover 7: Preprocessing ... % 4.43/1.36 Prover 10: Preprocessing ... % 4.43/1.36 Prover 8: Preprocessing ... % 4.43/1.36 Prover 11: Preprocessing ... % 4.43/1.37 Prover 7: Warning: ignoring some quantifiers % 4.84/1.38 Prover 7: Constructing countermodel ... % 4.84/1.38 Prover 0: Proving ... % 4.84/1.38 Prover 0: stopped % 4.84/1.38 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.84/1.39 Prover 10: Warning: ignoring some quantifiers % 4.84/1.40 Prover 10: Constructing countermodel ... % 5.57/1.42 Prover 13: Preprocessing ... % 5.68/1.44 Prover 13: Warning: ignoring some quantifiers % 5.68/1.45 Prover 13: Constructing countermodel ... % 5.68/1.46 Prover 8: Warning: ignoring some quantifiers % 5.68/1.47 Prover 8: Constructing countermodel ... % 5.68/1.47 Prover 7: Found proof (size 9) % 5.68/1.47 Prover 7: proved (172ms) % 5.68/1.47 Prover 13: stopped % 5.68/1.48 Prover 4: stopped % 5.68/1.48 Prover 1: stopped % 5.68/1.48 Prover 10: stopped % 5.68/1.48 Prover 8: stopped % 5.68/1.50 Prover 11: Constructing countermodel ... % 6.22/1.51 Prover 11: stopped % 6.22/1.51 % 6.22/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.22/1.51 % 6.22/1.51 % SZS output start Proof for theBenchmark % 6.22/1.52 Assumptions after simplification: % 6.22/1.52 --------------------------------- % 6.22/1.52 % 6.22/1.52 (axiom_2) % 6.22/1.52 $ki_index(#idx(b_s)) & $ki_world($ki_local_world) & $i(paris) & $i(second) & % 6.22/1.52 $i(seventy) & ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ class(v0, second) | % 6.22/1.52 ~ dest(v0, paris) | ~ $ki_accessible(#idx(b_s), $ki_local_world, v0) | % 6.22/1.52 price(v0, seventy)) % 6.22/1.52 % 6.22/1.52 (axiom_5) % 6.22/1.53 $ki_index(#idx(b_s)) & $ki_world($ki_local_world) & $i(paris) & $i(second) & % 6.22/1.53 ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible(#idx(b_s), % 6.22/1.53 $ki_local_world, v0) | class(v0, second)) & ! [v0: $ki_world] : ( ~ % 6.22/1.53 $ki_world(v0) | ~ $ki_accessible(#idx(b_s), $ki_local_world, v0) | dest(v0, % 6.22/1.53 paris)) % 6.22/1.53 % 6.22/1.53 (verify) % 6.22/1.53 $ki_index(#idx(b_s)) & $ki_world($ki_local_world) & $i(seventy) & ? [v0: % 6.22/1.53 $ki_world] : ($ki_world(v0) & $ki_accessible(#idx(b_s), $ki_local_world, v0) % 6.22/1.53 & ~ price(v0, seventy)) % 6.22/1.53 % 6.22/1.53 Further assumptions not needed in the proof: % 6.22/1.53 -------------------------------------------- % 6.22/1.53 axiom_1, axiom_3_s, axiom_3_u, axiom_4_s, axiom_4_u, mrel_universal_#idx(b_s), % 6.22/1.53 mrel_universal_#idx(b_u) % 6.22/1.53 % 6.22/1.53 Those formulas are unsatisfiable: % 6.22/1.53 --------------------------------- % 6.22/1.53 % 6.22/1.53 Begin of proof % 6.22/1.53 | % 6.22/1.53 | ALPHA: (verify) implies: % 6.22/1.53 | (1) ? [v0: $ki_world] : ($ki_world(v0) & $ki_accessible(#idx(b_s), % 6.22/1.53 | $ki_local_world, v0) & ~ price(v0, seventy)) % 6.22/1.53 | % 6.22/1.53 | ALPHA: (axiom_5) implies: % 6.22/1.53 | (2) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible(#idx(b_s), % 6.22/1.53 | $ki_local_world, v0) | dest(v0, paris)) % 6.22/1.53 | (3) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible(#idx(b_s), % 6.22/1.53 | $ki_local_world, v0) | class(v0, second)) % 6.22/1.53 | % 6.22/1.53 | ALPHA: (axiom_2) implies: % 6.22/1.53 | (4) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ class(v0, second) | ~ % 6.22/1.53 | dest(v0, paris) | ~ $ki_accessible(#idx(b_s), $ki_local_world, v0) | % 6.22/1.53 | price(v0, seventy)) % 6.22/1.53 | % 6.22/1.54 | DELTA: instantiating (1) with fresh symbol all_16_0 gives: % 6.22/1.54 | (5) $ki_world(all_16_0) & $ki_accessible(#idx(b_s), $ki_local_world, % 6.22/1.54 | all_16_0) & ~ price(all_16_0, seventy) % 6.22/1.54 | % 6.22/1.54 | ALPHA: (5) implies: % 6.22/1.54 | (6) ~ price(all_16_0, seventy) % 6.22/1.54 | (7) $ki_accessible(#idx(b_s), $ki_local_world, all_16_0) % 6.22/1.54 | (8) $ki_world(all_16_0) % 6.22/1.54 | % 6.22/1.54 | GROUND_INST: instantiating (3) with all_16_0, simplifying with (7), (8) gives: % 6.22/1.54 | (9) class(all_16_0, second) % 6.22/1.54 | % 6.22/1.54 | GROUND_INST: instantiating (2) with all_16_0, simplifying with (7), (8) gives: % 6.22/1.54 | (10) dest(all_16_0, paris) % 6.22/1.54 | % 6.22/1.54 | GROUND_INST: instantiating (4) with all_16_0, simplifying with (6), (7), (8), % 6.22/1.54 | (9), (10) gives: % 6.22/1.54 | (11) $false % 6.22/1.54 | % 6.22/1.54 | CLOSE: (11) is inconsistent. % 6.22/1.54 | % 6.22/1.54 End of proof % 6.22/1.54 % SZS output end Proof for theBenchmark % 6.22/1.54 % 6.22/1.54 955ms %------------------------------------------------------------------------------