%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PHI014+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 : n021.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:40 EDT 2023 % Result : Theorem 4.28s 1.42s % Output : Proof 6.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : PHI014+1 : TPTP v8.1.2. Released v7.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n021.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Aug 27 08:53:12 EDT 2023 % 0.12/0.33 % 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/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.27/1.00 Prover 1: Preprocessing ... % 2.27/1.00 Prover 4: Preprocessing ... % 2.27/1.04 Prover 3: Preprocessing ... % 2.27/1.04 Prover 0: Preprocessing ... % 2.27/1.04 Prover 2: Preprocessing ... % 2.27/1.04 Prover 5: Preprocessing ... % 2.27/1.04 Prover 6: Preprocessing ... % 3.61/1.23 Prover 2: Constructing countermodel ... % 3.61/1.23 Prover 5: Constructing countermodel ... % 3.61/1.25 Prover 6: Proving ... % 3.61/1.27 Prover 3: Constructing countermodel ... % 3.61/1.31 Prover 1: Constructing countermodel ... % 3.61/1.41 Prover 4: Constructing countermodel ... % 3.61/1.42 Prover 2: proved (793ms) % 4.28/1.42 % 4.28/1.42 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.28/1.42 % 4.28/1.42 Prover 5: stopped % 4.28/1.43 Prover 6: stopped % 4.28/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.28/1.44 Prover 3: gave up % 4.28/1.45 Prover 1: gave up % 4.28/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.28/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.28/1.46 Prover 7: Preprocessing ... % 4.28/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.28/1.46 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.28/1.47 Prover 8: Preprocessing ... % 4.28/1.47 Prover 7: Constructing countermodel ... % 4.28/1.48 Prover 10: Preprocessing ... % 4.28/1.49 Prover 11: Preprocessing ... % 4.28/1.49 Prover 0: Proving ... % 4.28/1.49 Prover 13: Preprocessing ... % 4.28/1.50 Prover 0: stopped % 5.43/1.51 Prover 10: Constructing countermodel ... % 5.43/1.51 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 5.43/1.53 Prover 16: Preprocessing ... % 5.43/1.54 Prover 13: Constructing countermodel ... % 5.43/1.55 Prover 8: Warning: ignoring some quantifiers % 5.43/1.55 Prover 8: Constructing countermodel ... % 5.43/1.56 Prover 7: Found proof (size 13) % 5.43/1.56 Prover 10: Found proof (size 13) % 5.43/1.56 Prover 10: proved (121ms) % 5.43/1.56 Prover 7: proved (138ms) % 5.43/1.56 Prover 13: stopped % 5.43/1.56 Prover 4: stopped % 5.43/1.56 Prover 8: stopped % 5.43/1.57 Prover 16: Constructing countermodel ... % 5.43/1.57 Prover 16: stopped % 6.07/1.64 Prover 11: Constructing countermodel ... % 6.07/1.65 Prover 11: stopped % 6.07/1.65 % 6.07/1.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.07/1.65 % 6.07/1.66 % SZS output start Proof for theBenchmark % 6.07/1.66 Assumptions after simplification: % 6.07/1.66 --------------------------------- % 6.07/1.66 % 6.07/1.66 (definition_god) % 6.07/1.67 $i(god) & $i(none_greater) & is_the(god, none_greater) % 6.07/1.67 % 6.07/1.67 (definition_none_greater) % 6.07/1.67 $i(greater_than) & $i(conceivable) & $i(none_greater) & ! [v0: $i] : ! [v1: % 6.07/1.67 $i] : ( ~ $i(v1) | ~ $i(v0) | ~ exemplifies_relation(greater_than, v1, v0) % 6.07/1.67 | ~ exemplifies_property(conceivable, v1) | ~ % 6.07/1.67 exemplifies_property(none_greater, v0) | ~ object(v1) | ~ object(v0)) & ! % 6.07/1.67 [v0: $i] : ( ~ $i(v0) | ~ exemplifies_property(conceivable, v0) | ~ % 6.07/1.67 object(v0) | exemplifies_property(none_greater, v0) | ? [v1: $i] : ($i(v1) % 6.07/1.67 & exemplifies_relation(greater_than, v1, v0) & % 6.07/1.67 exemplifies_property(conceivable, v1) & object(v1))) & ! [v0: $i] : ( ~ % 6.07/1.67 $i(v0) | ~ exemplifies_property(none_greater, v0) | ~ object(v0) | % 6.07/1.67 exemplifies_property(conceivable, v0)) % 6.07/1.67 % 6.07/1.67 (description_is_property_and_described_is_object) % 6.07/1.68 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v0, v1) | % 6.07/1.68 object(v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 6.07/1.68 is_the(v0, v1) | property(v1)) % 6.07/1.68 % 6.07/1.68 (description_theorem_2) % 6.07/1.68 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 6.07/1.68 ~ is_the(v2, v0) | ~ is_the(v1, v0) | ~ object(v2) | ~ object(v1) | ~ % 6.07/1.68 property(v0) | exemplifies_property(v0, v1)) % 6.07/1.68 % 6.07/1.68 (god_exists) % 6.07/1.68 $i(god) & $i(existence) & ~ exemplifies_property(existence, god) % 6.07/1.68 % 6.07/1.68 (premise_2) % 6.07/1.68 $i(existence) & $i(greater_than) & $i(conceivable) & $i(none_greater) & ! % 6.07/1.68 [v0: $i] : ( ~ $i(v0) | ~ is_the(v0, none_greater) | ~ object(v0) | % 6.07/1.68 exemplifies_property(existence, v0) | ? [v1: $i] : ($i(v1) & % 6.07/1.68 exemplifies_relation(greater_than, v1, v0) & % 6.07/1.68 exemplifies_property(conceivable, v1) & object(v1))) % 6.07/1.68 % 6.07/1.68 Those formulas are unsatisfiable: % 6.07/1.68 --------------------------------- % 6.07/1.68 % 6.07/1.68 Begin of proof % 6.07/1.68 | % 6.07/1.68 | ALPHA: (god_exists) implies: % 6.07/1.69 | (1) ~ exemplifies_property(existence, god) % 6.07/1.69 | % 6.07/1.69 | ALPHA: (definition_god) implies: % 6.07/1.69 | (2) is_the(god, none_greater) % 6.07/1.69 | (3) $i(god) % 6.07/1.69 | % 6.07/1.69 | ALPHA: (premise_2) implies: % 6.07/1.69 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ is_the(v0, none_greater) | ~ object(v0) % 6.07/1.69 | | exemplifies_property(existence, v0) | ? [v1: $i] : ($i(v1) & % 6.07/1.69 | exemplifies_relation(greater_than, v1, v0) & % 6.07/1.69 | exemplifies_property(conceivable, v1) & object(v1))) % 6.07/1.69 | % 6.07/1.69 | ALPHA: (definition_none_greater) implies: % 6.07/1.69 | (5) $i(none_greater) % 6.07/1.69 | (6) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 6.07/1.69 | exemplifies_relation(greater_than, v1, v0) | ~ % 6.07/1.69 | exemplifies_property(conceivable, v1) | ~ % 6.07/1.69 | exemplifies_property(none_greater, v0) | ~ object(v1) | ~ % 6.07/1.69 | object(v0)) % 6.07/1.69 | % 6.07/1.69 | ALPHA: (description_is_property_and_described_is_object) implies: % 6.42/1.69 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v0, v1) % 6.42/1.69 | | property(v1)) % 6.42/1.69 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v0, v1) % 6.43/1.69 | | object(v0)) % 6.43/1.69 | % 6.43/1.70 | GROUND_INST: instantiating (8) with god, none_greater, simplifying with (2), % 6.43/1.70 | (3), (5) gives: % 6.43/1.70 | (9) object(god) % 6.43/1.70 | % 6.43/1.70 | GROUND_INST: instantiating (7) with god, none_greater, simplifying with (2), % 6.43/1.70 | (3), (5) gives: % 6.43/1.70 | (10) property(none_greater) % 6.43/1.70 | % 6.44/1.70 | GROUND_INST: instantiating (description_theorem_2) with none_greater, god, % 6.44/1.70 | god, simplifying with (2), (3), (5), (9), (10) gives: % 6.44/1.70 | (11) exemplifies_property(none_greater, god) % 6.44/1.70 | % 6.44/1.70 | GROUND_INST: instantiating (4) with god, simplifying with (1), (2), (3), (9) % 6.44/1.70 | gives: % 6.44/1.70 | (12) ? [v0: $i] : ($i(v0) & exemplifies_relation(greater_than, v0, god) & % 6.44/1.70 | exemplifies_property(conceivable, v0) & object(v0)) % 6.44/1.70 | % 6.44/1.70 | DELTA: instantiating (12) with fresh symbol all_19_0 gives: % 6.46/1.70 | (13) $i(all_19_0) & exemplifies_relation(greater_than, all_19_0, god) & % 6.46/1.70 | exemplifies_property(conceivable, all_19_0) & object(all_19_0) % 6.46/1.70 | % 6.46/1.70 | ALPHA: (13) implies: % 6.46/1.70 | (14) object(all_19_0) % 6.46/1.70 | (15) exemplifies_property(conceivable, all_19_0) % 6.46/1.70 | (16) exemplifies_relation(greater_than, all_19_0, god) % 6.46/1.70 | (17) $i(all_19_0) % 6.46/1.70 | % 6.46/1.70 | GROUND_INST: instantiating (6) with god, all_19_0, simplifying with (3), (9), % 6.46/1.70 | (11), (14), (15), (16), (17) gives: % 6.46/1.70 | (18) $false % 6.46/1.71 | % 6.46/1.71 | CLOSE: (18) is inconsistent. % 6.46/1.71 | % 6.46/1.71 End of proof % 6.46/1.71 % SZS output end Proof for theBenchmark % 6.46/1.71 % 6.46/1.71 1105ms %------------------------------------------------------------------------------