%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NLP267_2 : TPTP v8.2.0. Released v8.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n019.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 3.96s 1.30s % Output : Proof 5.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NLP267_2 : 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 : n019.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 12:12:43 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.91/1.00 Prover 1: Preprocessing ... % 2.30/1.00 Prover 4: Preprocessing ... % 2.30/1.05 Prover 0: Preprocessing ... % 2.30/1.05 Prover 2: Preprocessing ... % 2.30/1.05 Prover 3: Preprocessing ... % 2.30/1.05 Prover 5: Preprocessing ... % 2.30/1.05 Prover 6: Preprocessing ... % 3.34/1.16 Prover 2: Proving ... % 3.34/1.17 Prover 5: Proving ... % 3.60/1.19 Prover 6: Constructing countermodel ... % 3.60/1.21 Prover 3: Constructing countermodel ... % 3.60/1.21 Prover 1: Constructing countermodel ... % 3.96/1.28 Prover 6: gave up % 3.96/1.28 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.96/1.29 Prover 3: gave up % 3.96/1.29 Prover 4: Constructing countermodel ... % 3.96/1.30 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.96/1.30 Prover 1: gave up % 3.96/1.30 Prover 5: proved (658ms) % 3.96/1.30 % 3.96/1.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.96/1.30 % 4.38/1.31 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 4.38/1.31 Prover 2: proved (666ms) % 4.38/1.31 % 4.38/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.38/1.31 % 4.38/1.32 Prover 7: Preprocessing ... % 4.38/1.32 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.38/1.32 Prover 8: Preprocessing ... % 4.38/1.32 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.38/1.34 Prover 0: Proving ... % 4.38/1.34 Prover 10: Preprocessing ... % 4.38/1.34 Prover 7: Warning: ignoring some quantifiers % 4.38/1.34 Prover 0: stopped % 4.38/1.36 Prover 9: Preprocessing ... % 4.38/1.36 Prover 7: Constructing countermodel ... % 4.38/1.36 Prover 11: Preprocessing ... % 4.38/1.36 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.38/1.37 Prover 10: Warning: ignoring some quantifiers % 4.38/1.38 Prover 13: Preprocessing ... % 4.38/1.38 Prover 10: Constructing countermodel ... % 4.38/1.40 Prover 13: Warning: ignoring some quantifiers % 4.38/1.41 Prover 13: Constructing countermodel ... % 4.38/1.41 Prover 8: Warning: ignoring some quantifiers % 4.38/1.41 Prover 8: Constructing countermodel ... % 4.38/1.45 Prover 10: Found proof (size 10) % 4.38/1.45 Prover 10: proved (136ms) % 4.38/1.45 Prover 13: stopped % 4.38/1.45 Prover 4: stopped % 4.38/1.45 Prover 7: Found proof (size 10) % 4.38/1.45 Prover 7: proved (169ms) % 4.38/1.45 Prover 8: stopped % 5.01/1.50 Prover 11: Constructing countermodel ... % 5.01/1.50 Prover 9: Constructing countermodel ... % 5.01/1.51 Prover 11: stopped % 5.01/1.51 Prover 9: stopped % 5.01/1.51 % 5.01/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.01/1.51 % 5.01/1.51 % SZS output start Proof for theBenchmark % 5.01/1.51 Assumptions after simplification: % 5.01/1.51 --------------------------------- % 5.01/1.51 % 5.01/1.51 (belief1) % 5.01/1.52 $ki_world($ki_local_world) & $i(paris) & ! [v0: $ki_world] : ( ~ % 5.01/1.52 $ki_world(v0) | ~ $ki_accessible($ki_local_world, v0) | dest(v0, paris)) % 5.01/1.52 % 5.01/1.52 (belief2) % 5.01/1.52 $ki_world($ki_local_world) & $i(second) & ! [v0: $ki_world] : ( ~ % 5.01/1.52 $ki_world(v0) | ~ $ki_accessible($ki_local_world, v0) | class(v0, second)) % 5.01/1.52 % 5.01/1.52 (law2) % 5.01/1.52 $ki_world($ki_local_world) & $i(paris) & $i(second) & $i(seventy) & ! [v0: % 5.01/1.52 $ki_world] : ( ~ $ki_world(v0) | ~ class(v0, second) | ~ dest(v0, paris) | % 5.01/1.52 ~ $ki_accessible($ki_local_world, v0) | price(v0, seventy)) % 5.01/1.52 % 5.01/1.52 (verify) % 5.01/1.52 $ki_world($ki_local_world) & $i(seventy) & ? [v0: $ki_world] : ($ki_world(v0) % 5.01/1.52 & $ki_accessible($ki_local_world, v0) & ~ price(v0, seventy)) % 5.01/1.52 % 5.01/1.52 Further assumptions not needed in the proof: % 5.01/1.52 -------------------------------------------- % 5.01/1.52 law1, law3, law4, mrel_reflexive % 5.01/1.52 % 5.01/1.52 Those formulas are unsatisfiable: % 5.01/1.52 --------------------------------- % 5.01/1.52 % 5.01/1.52 Begin of proof % 5.01/1.52 | % 5.01/1.52 | ALPHA: (verify) implies: % 5.01/1.53 | (1) ? [v0: $ki_world] : ($ki_world(v0) & $ki_accessible($ki_local_world, % 5.01/1.53 | v0) & ~ price(v0, seventy)) % 5.01/1.53 | % 5.01/1.53 | ALPHA: (belief2) implies: % 5.01/1.53 | (2) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ % 5.01/1.53 | $ki_accessible($ki_local_world, v0) | class(v0, second)) % 5.01/1.53 | % 5.01/1.53 | ALPHA: (belief1) implies: % 5.01/1.53 | (3) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ % 5.01/1.53 | $ki_accessible($ki_local_world, v0) | dest(v0, paris)) % 5.01/1.53 | % 5.01/1.53 | ALPHA: (law2) implies: % 5.01/1.53 | (4) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ class(v0, second) | ~ % 5.01/1.53 | dest(v0, paris) | ~ $ki_accessible($ki_local_world, v0) | price(v0, % 5.01/1.53 | seventy)) % 5.01/1.53 | % 5.01/1.53 | DELTA: instantiating (1) with fresh symbol all_12_0 gives: % 5.01/1.53 | (5) $ki_world(all_12_0) & $ki_accessible($ki_local_world, all_12_0) & ~ % 5.01/1.53 | price(all_12_0, seventy) % 5.01/1.53 | % 5.01/1.53 | ALPHA: (5) implies: % 5.01/1.53 | (6) ~ price(all_12_0, seventy) % 5.01/1.53 | (7) $ki_accessible($ki_local_world, all_12_0) % 5.01/1.53 | (8) $ki_world(all_12_0) % 5.01/1.53 | % 5.01/1.53 | GROUND_INST: instantiating (2) with all_12_0, simplifying with (7), (8) gives: % 5.01/1.53 | (9) class(all_12_0, second) % 5.01/1.53 | % 5.01/1.53 | GROUND_INST: instantiating (3) with all_12_0, simplifying with (7), (8) gives: % 5.01/1.53 | (10) dest(all_12_0, paris) % 5.01/1.53 | % 5.01/1.53 | GROUND_INST: instantiating (4) with all_12_0, simplifying with (6), (7), (8), % 5.01/1.53 | (9), (10) gives: % 5.01/1.53 | (11) $false % 5.01/1.54 | % 5.01/1.54 | CLOSE: (11) is inconsistent. % 5.01/1.54 | % 5.01/1.54 End of proof % 5.01/1.54 % SZS output end Proof for theBenchmark % 5.01/1.54 % 5.01/1.54 920ms %------------------------------------------------------------------------------