%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PHI011+1 : TPTP v8.1.2. Released v7.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.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 12:56:39 EDT 2023 % Result : Theorem 4.01s 1.25s % Output : Proof 4.85s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : PHI011+1 : TPTP v8.1.2. Released v7.2.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n016.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 : Sun Aug 27 09:20:13 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 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 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 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 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 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/0.97 Prover 1: Preprocessing ... % 1.91/0.97 Prover 4: Preprocessing ... % 2.20/1.01 Prover 2: Preprocessing ... % 2.20/1.01 Prover 5: Preprocessing ... % 2.20/1.02 Prover 3: Preprocessing ... % 2.20/1.02 Prover 0: Preprocessing ... % 2.20/1.03 Prover 6: Preprocessing ... % 2.67/1.10 Prover 2: Constructing countermodel ... % 2.67/1.11 Prover 5: Constructing countermodel ... % 3.38/1.16 Prover 6: Constructing countermodel ... % 3.38/1.16 Prover 1: Constructing countermodel ... % 3.38/1.18 Prover 3: Constructing countermodel ... % 3.38/1.19 Prover 4: Constructing countermodel ... % 3.38/1.21 Prover 0: Proving ... % 4.01/1.25 Prover 5: proved (602ms) % 4.01/1.25 Prover 6: proved (602ms) % 4.01/1.25 % 4.01/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.01/1.25 % 4.01/1.25 % 4.01/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.01/1.25 % 4.01/1.25 Prover 3: proved (606ms) % 4.01/1.25 % 4.01/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.01/1.25 % 4.01/1.25 Prover 2: stopped % 4.01/1.25 Prover 0: stopped % 4.01/1.28 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.01/1.28 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.01/1.28 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.01/1.28 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.01/1.28 Prover 8: Preprocessing ... % 4.01/1.28 Prover 7: Preprocessing ... % 4.01/1.28 Prover 10: Preprocessing ... % 4.01/1.28 Prover 11: Preprocessing ... % 4.01/1.28 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.34/1.30 Prover 13: Preprocessing ... % 4.34/1.31 Prover 10: Constructing countermodel ... % 4.34/1.31 Prover 7: Constructing countermodel ... % 4.34/1.32 Prover 13: Constructing countermodel ... % 4.74/1.35 Prover 8: Warning: ignoring some quantifiers % 4.74/1.35 Prover 8: Constructing countermodel ... % 4.85/1.35 Prover 7: Found proof (size 4) % 4.85/1.35 Prover 13: Found proof (size 4) % 4.85/1.35 Prover 10: Found proof (size 4) % 4.85/1.35 Prover 10: proved (102ms) % 4.85/1.35 Prover 7: proved (100ms) % 4.85/1.35 Prover 13: proved (75ms) % 4.85/1.35 Prover 4: stopped % 4.85/1.35 Prover 1: stopped % 4.85/1.35 Prover 8: stopped % 4.85/1.39 Prover 11: Constructing countermodel ... % 4.85/1.39 Prover 11: stopped % 4.85/1.40 % 4.85/1.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.85/1.40 % 4.85/1.40 % SZS output start Proof for theBenchmark % 4.85/1.40 Assumptions after simplification: % 4.85/1.40 --------------------------------- % 4.85/1.40 % 4.85/1.40 (description_theorem_2) % 4.85/1.41 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 4.85/1.41 is_the(v2, v0) & is_the(v1, v0) & property(v0) & object(v2) & object(v1) & % 4.85/1.41 ~ exemplifies_property(v0, v1)) % 4.85/1.41 % 4.85/1.41 (lemma_1) % 4.85/1.41 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v0, v1) | ~ % 4.85/1.41 property(v1) | ~ object(v0) | exemplifies_property(v1, v0)) % 4.85/1.41 % 4.85/1.41 Further assumptions not needed in the proof: % 4.85/1.41 -------------------------------------------- % 4.85/1.41 description_is_property_and_described_is_object, % 4.85/1.41 exemplifier_is_object_and_exemplified_is_property, objects_are_not_properties % 4.85/1.41 % 4.85/1.41 Those formulas are unsatisfiable: % 4.85/1.41 --------------------------------- % 4.85/1.41 % 4.85/1.41 Begin of proof % 4.85/1.41 | % 4.85/1.41 | DELTA: instantiating (description_theorem_2) with fresh symbols all_6_0, % 4.85/1.41 | all_6_1, all_6_2 gives: % 4.85/1.41 | (1) $i(all_6_0) & $i(all_6_1) & $i(all_6_2) & is_the(all_6_0, all_6_2) & % 4.85/1.41 | is_the(all_6_1, all_6_2) & property(all_6_2) & object(all_6_0) & % 4.85/1.41 | object(all_6_1) & ~ exemplifies_property(all_6_2, all_6_1) % 4.85/1.42 | % 4.85/1.42 | ALPHA: (1) implies: % 4.85/1.42 | (2) ~ exemplifies_property(all_6_2, all_6_1) % 4.85/1.42 | (3) object(all_6_1) % 4.85/1.42 | (4) property(all_6_2) % 4.85/1.42 | (5) is_the(all_6_1, all_6_2) % 4.85/1.42 | (6) $i(all_6_2) % 4.85/1.42 | (7) $i(all_6_1) % 4.85/1.42 | % 4.85/1.42 | GROUND_INST: instantiating (lemma_1) with all_6_1, all_6_2, simplifying with % 4.85/1.42 | (2), (3), (4), (5), (6), (7) gives: % 4.85/1.42 | (8) $false % 4.85/1.42 | % 4.85/1.42 | CLOSE: (8) is inconsistent. % 4.85/1.42 | % 4.85/1.42 End of proof % 4.85/1.42 % SZS output end Proof for theBenchmark % 4.85/1.42 % 4.85/1.42 802ms %------------------------------------------------------------------------------