%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT334_8 : TPTP v8.2.0. Released v8.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n005.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 : Wed Aug 30 22:19:46 EDT 2023 % Result : Theorem 3.95s 1.30s % Output : Proof 4.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : DAT334_8 : TPTP v8.2.0. Released v8.2.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n005.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 14:20:23 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.02/0.99 Prover 4: Preprocessing ... % 2.02/1.00 Prover 1: Preprocessing ... % 2.39/1.05 Prover 5: Preprocessing ... % 2.39/1.05 Prover 0: Preprocessing ... % 2.39/1.05 Prover 2: Preprocessing ... % 2.39/1.05 Prover 3: Preprocessing ... % 2.39/1.05 Prover 6: Preprocessing ... % 2.98/1.15 Prover 3: Warning: ignoring some quantifiers % 2.98/1.16 Prover 3: Constructing countermodel ... % 2.98/1.16 Prover 1: Warning: ignoring some quantifiers % 2.98/1.16 Prover 2: Proving ... % 2.98/1.16 Prover 5: Proving ... % 2.98/1.17 Prover 1: Constructing countermodel ... % 2.98/1.18 Prover 6: Proving ... % 3.42/1.20 Prover 4: Warning: ignoring some quantifiers % 3.42/1.21 Prover 4: Constructing countermodel ... % 3.42/1.23 Prover 0: Proving ... % 3.95/1.27 Prover 3: gave up % 3.95/1.28 Prover 1: gave up % 3.95/1.28 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.95/1.28 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.95/1.30 Prover 5: proved (668ms) % 3.95/1.30 % 3.95/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.95/1.30 % 3.95/1.31 Prover 2: proved (679ms) % 3.95/1.31 % 3.95/1.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.95/1.31 % 3.95/1.31 Prover 7: Preprocessing ... % 3.95/1.31 Prover 0: stopped % 3.95/1.31 Prover 6: stopped % 3.95/1.33 Prover 8: Preprocessing ... % 3.95/1.33 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.95/1.33 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.95/1.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.95/1.33 Prover 7: Warning: ignoring some quantifiers % 3.95/1.33 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 3.95/1.34 Prover 7: Constructing countermodel ... % 3.95/1.34 Prover 10: Preprocessing ... % 3.95/1.34 Prover 13: Preprocessing ... % 3.95/1.34 Prover 11: Preprocessing ... % 4.23/1.35 Prover 10: Warning: ignoring some quantifiers % 4.23/1.36 Prover 16: Preprocessing ... % 4.23/1.36 Prover 13: Warning: ignoring some quantifiers % 4.23/1.37 Prover 13: Constructing countermodel ... % 4.23/1.37 Prover 8: Warning: ignoring some quantifiers % 4.23/1.37 Prover 10: Constructing countermodel ... % 4.77/1.39 Prover 16: Warning: ignoring some quantifiers % 4.77/1.39 Prover 7: Found proof (size 9) % 4.77/1.39 Prover 7: proved (114ms) % 4.77/1.39 Prover 4: stopped % 4.77/1.39 Prover 10: stopped % 4.77/1.39 Prover 16: Constructing countermodel ... % 4.77/1.39 Prover 8: Constructing countermodel ... % 4.77/1.40 Prover 13: stopped % 4.77/1.40 Prover 16: stopped % 4.77/1.40 Prover 8: stopped % 4.98/1.43 Prover 11: Warning: ignoring some quantifiers % 4.98/1.44 Prover 11: Constructing countermodel ... % 4.98/1.44 Prover 11: stopped % 4.98/1.44 % 4.98/1.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.98/1.44 % 4.98/1.45 % SZS output start Proof for theBenchmark % 4.98/1.45 Assumptions after simplification: % 4.98/1.45 --------------------------------- % 4.98/1.45 % 4.98/1.45 (db) % 4.98/1.46 $ki_world($ki_local_world) & $i(psych) & $i(math) & $i(john) & $i(mary) & % 4.98/1.46 $i(sue) & $i(cs) & ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ % 4.98/1.46 $ki_accessible($ki_local_world, v0) | teach(v0, john, math)) & ! [v0: % 4.98/1.46 $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible($ki_local_world, v0) | % 4.98/1.46 teach(v0, mary, psych)) & ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ % 4.98/1.46 $ki_accessible($ki_local_world, v0) | teach(v0, sue, psych)) & ! [v0: % 4.98/1.46 $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible($ki_local_world, v0) | ? % 4.98/1.46 [v1: $i] : ($i(v1) & $ki_exists_in_world_$i(v0, v1) & teach(v0, v1, cs))) % 4.98/1.46 % 4.98/1.46 (verify) % 4.98/1.46 $ki_world($ki_local_world) & $i(cs) & ? [v0: $ki_world] : ($ki_world(v0) & % 4.98/1.46 $ki_accessible($ki_local_world, v0) & ! [v1: $i] : ( ~ $i(v1) | ~ % 4.98/1.46 $ki_exists_in_world_$i(v0, v1) | ~ teach(v0, v1, cs))) % 4.98/1.46 % 4.98/1.46 Further assumptions not needed in the proof: % 4.98/1.46 -------------------------------------------- % 4.98/1.46 $ki_exists_in_world_$i_nonempty, mrel_reflexive % 4.98/1.46 % 4.98/1.46 Those formulas are unsatisfiable: % 4.98/1.46 --------------------------------- % 4.98/1.46 % 4.98/1.46 Begin of proof % 4.98/1.46 | % 4.98/1.46 | ALPHA: (verify) implies: % 4.98/1.46 | (1) ? [v0: $ki_world] : ($ki_world(v0) & $ki_accessible($ki_local_world, % 4.98/1.46 | v0) & ! [v1: $i] : ( ~ $i(v1) | ~ $ki_exists_in_world_$i(v0, v1) % 4.98/1.46 | | ~ teach(v0, v1, cs))) % 4.98/1.46 | % 4.98/1.46 | ALPHA: (db) implies: % 4.98/1.46 | (2) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ % 4.98/1.46 | $ki_accessible($ki_local_world, v0) | ? [v1: $i] : ($i(v1) & % 4.98/1.46 | $ki_exists_in_world_$i(v0, v1) & teach(v0, v1, cs))) % 4.98/1.46 | % 4.98/1.47 | DELTA: instantiating (1) with fresh symbol all_8_0 gives: % 4.98/1.47 | (3) $ki_world(all_8_0) & $ki_accessible($ki_local_world, all_8_0) & ! [v0: % 4.98/1.47 | $i] : ( ~ $i(v0) | ~ $ki_exists_in_world_$i(all_8_0, v0) | ~ % 4.98/1.47 | teach(all_8_0, v0, cs)) % 4.98/1.47 | % 4.98/1.47 | ALPHA: (3) implies: % 4.98/1.47 | (4) $ki_accessible($ki_local_world, all_8_0) % 4.98/1.47 | (5) $ki_world(all_8_0) % 4.98/1.47 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ $ki_exists_in_world_$i(all_8_0, v0) | ~ % 4.98/1.47 | teach(all_8_0, v0, cs)) % 4.98/1.47 | % 4.98/1.47 | GROUND_INST: instantiating (2) with all_8_0, simplifying with (4), (5) gives: % 4.98/1.47 | (7) ? [v0: $i] : ($i(v0) & $ki_exists_in_world_$i(all_8_0, v0) & % 4.98/1.47 | teach(all_8_0, v0, cs)) % 4.98/1.47 | % 4.98/1.47 | DELTA: instantiating (7) with fresh symbol all_17_0 gives: % 4.98/1.47 | (8) $i(all_17_0) & $ki_exists_in_world_$i(all_8_0, all_17_0) & % 4.98/1.47 | teach(all_8_0, all_17_0, cs) % 4.98/1.47 | % 4.98/1.47 | ALPHA: (8) implies: % 4.98/1.47 | (9) teach(all_8_0, all_17_0, cs) % 4.98/1.47 | (10) $ki_exists_in_world_$i(all_8_0, all_17_0) % 4.98/1.47 | (11) $i(all_17_0) % 4.98/1.47 | % 4.98/1.47 | GROUND_INST: instantiating (6) with all_17_0, simplifying with (9), (10), (11) % 4.98/1.47 | gives: % 4.98/1.47 | (12) $false % 4.98/1.47 | % 4.98/1.47 | CLOSE: (12) is inconsistent. % 4.98/1.47 | % 4.98/1.47 End of proof % 4.98/1.47 % SZS output end Proof for theBenchmark % 4.98/1.48 % 4.98/1.48 874ms %------------------------------------------------------------------------------