%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PHI015+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 : 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 : Thu Aug 31 12:56:40 EDT 2023 % Result : Theorem 8.30s 1.90s % Output : Proof 10.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : PHI015+1 : TPTP v8.1.2. Released v7.2.0. % 0.08/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n005.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sun Aug 27 08:50:23 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.42/1.06 Prover 4: Preprocessing ... % 2.42/1.06 Prover 1: Preprocessing ... % 2.62/1.11 Prover 6: Preprocessing ... % 2.62/1.11 Prover 3: Preprocessing ... % 2.62/1.11 Prover 5: Preprocessing ... % 2.62/1.11 Prover 0: Preprocessing ... % 2.62/1.11 Prover 2: Preprocessing ... % 4.40/1.38 Prover 5: Constructing countermodel ... % 4.40/1.39 Prover 2: Constructing countermodel ... % 5.09/1.43 Prover 1: Constructing countermodel ... % 5.09/1.44 Prover 3: Constructing countermodel ... % 5.31/1.47 Prover 6: Proving ... % 6.10/1.59 Prover 3: gave up % 6.10/1.61 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.10/1.62 Prover 1: gave up % 6.10/1.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.10/1.64 Prover 7: Preprocessing ... % 6.66/1.67 Prover 8: Preprocessing ... % 6.86/1.71 Prover 7: Constructing countermodel ... % 7.49/1.76 Prover 4: Constructing countermodel ... % 7.49/1.78 Prover 8: Warning: ignoring some quantifiers % 7.49/1.78 Prover 8: Constructing countermodel ... % 7.49/1.80 Prover 0: Proving ... % 8.02/1.86 Prover 8: gave up % 8.30/1.87 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 8.30/1.90 Prover 5: proved (1247ms) % 8.30/1.90 % 8.30/1.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.30/1.90 % 8.30/1.90 Prover 2: stopped % 8.30/1.90 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.30/1.90 Prover 6: stopped % 8.30/1.91 Prover 9: Preprocessing ... % 8.30/1.91 Prover 0: stopped % 8.30/1.91 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.30/1.91 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.30/1.91 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.30/1.94 Prover 13: Preprocessing ... % 8.30/1.94 Prover 10: Preprocessing ... % 8.30/1.98 Prover 11: Preprocessing ... % 8.30/1.98 Prover 16: Preprocessing ... % 8.30/2.01 Prover 13: Constructing countermodel ... % 9.05/2.03 Prover 10: Constructing countermodel ... % 9.05/2.04 Prover 16: Constructing countermodel ... % 9.92/2.14 Prover 13: Found proof (size 22) % 9.92/2.14 Prover 13: proved (225ms) % 9.92/2.14 Prover 4: stopped % 9.92/2.14 Prover 7: stopped % 9.92/2.14 Prover 16: stopped % 9.92/2.14 Prover 10: stopped % 10.32/2.18 Prover 9: Constructing countermodel ... % 10.32/2.18 Prover 9: stopped % 10.32/2.20 Prover 11: Constructing countermodel ... % 10.32/2.20 Prover 11: stopped % 10.32/2.21 % 10.32/2.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.32/2.21 % 10.32/2.21 % SZS output start Proof for theBenchmark % 10.32/2.21 Assumptions after simplification: % 10.32/2.21 --------------------------------- % 10.32/2.21 % 10.32/2.21 (definition_god) % 10.32/2.22 $i(god) & $i(none_greater) & is_the(god, none_greater) % 10.32/2.22 % 10.32/2.22 (definition_none_greater) % 10.32/2.22 $i(conceivable) & $i(none_greater) & $i(greater_than) & ! [v0: $i] : ! [v1: % 10.32/2.22 $i] : ( ~ $i(v1) | ~ $i(v0) | ~ exemplifies_relation(greater_than, v1, v0) % 10.32/2.22 | ~ exemplifies_property(conceivable, v1) | ~ % 10.32/2.22 exemplifies_property(none_greater, v0) | ~ object(v1) | ~ object(v0)) & ! % 10.32/2.22 [v0: $i] : ( ~ $i(v0) | ~ exemplifies_property(conceivable, v0) | ~ % 10.32/2.22 object(v0) | exemplifies_property(none_greater, v0) | ? [v1: $i] : ($i(v1) % 10.32/2.22 & exemplifies_relation(greater_than, v1, v0) & % 10.32/2.22 exemplifies_property(conceivable, v1) & object(v1))) & ! [v0: $i] : ( ~ % 10.32/2.22 $i(v0) | ~ exemplifies_property(none_greater, v0) | ~ object(v0) | % 10.32/2.22 exemplifies_property(conceivable, v0)) % 10.32/2.22 % 10.32/2.23 (description_axiom_identity_instance) % 10.32/2.23 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 10.32/2.23 ~ $i(v0) | ~ exemplifies_property(v0, v2) | ~ property(v0) | ~ object(v2) % 10.32/2.23 | ~ object(v1) | ? [v3: $i] : ( ~ (v3 = v2) & $i(v3) & % 10.32/2.23 exemplifies_property(v0, v3) & object(v3))) & ! [v0: $i] : ! [v1: $i] : % 10.32/2.23 ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ exemplifies_property(v0, % 10.32/2.23 v2) | ~ property(v0) | ~ object(v2) | ~ object(v1) | is_the(v1, v0) | % 10.32/2.23 ? [v3: $i] : ( ~ (v3 = v2) & $i(v3) & exemplifies_property(v0, v3) & % 10.32/2.23 object(v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 10.32/2.23 is_the(v1, v0) | ~ property(v0) | ~ object(v1) | (exemplifies_property(v0, % 10.32/2.23 v1) & ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ exemplifies_property(v0, % 10.32/2.23 v2) | ~ object(v2)))) % 10.32/2.23 % 10.32/2.23 (description_is_property_and_described_is_object) % 10.32/2.23 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v0, v1) | % 10.32/2.23 property(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 10.32/2.23 is_the(v0, v1) | object(v0)) % 10.32/2.23 % 10.32/2.23 (god_exists) % 10.32/2.24 $i(god) & $i(existence) & ~ exemplifies_property(existence, god) % 10.32/2.24 % 10.32/2.24 (premise_1) % 10.32/2.24 $i(none_greater) & ? [v0: $i] : ($i(v0) & exemplifies_property(none_greater, % 10.32/2.24 v0) & object(v0)) % 10.32/2.24 % 10.32/2.24 (premise_2) % 10.32/2.24 $i(existence) & $i(conceivable) & $i(none_greater) & $i(greater_than) & ! % 10.32/2.24 [v0: $i] : ( ~ $i(v0) | ~ is_the(v0, none_greater) | ~ object(v0) | % 10.32/2.24 exemplifies_property(existence, v0) | ? [v1: $i] : ($i(v1) & % 10.32/2.24 exemplifies_relation(greater_than, v1, v0) & % 10.32/2.24 exemplifies_property(conceivable, v1) & object(v1))) % 10.32/2.24 % 10.32/2.24 Further assumptions not needed in the proof: % 10.32/2.24 -------------------------------------------- % 10.32/2.24 connectedness_of_greater_than, description_axiom_schema_instance, % 10.32/2.24 exemplifier_is_object_and_exemplified_is_property, objects_are_not_properties % 10.32/2.24 % 10.32/2.24 Those formulas are unsatisfiable: % 10.32/2.24 --------------------------------- % 10.32/2.24 % 10.32/2.24 Begin of proof % 10.32/2.24 | % 10.32/2.24 | ALPHA: (god_exists) implies: % 10.32/2.24 | (1) ~ exemplifies_property(existence, god) % 10.32/2.24 | % 10.32/2.24 | ALPHA: (definition_god) implies: % 10.32/2.24 | (2) is_the(god, none_greater) % 10.32/2.24 | (3) $i(god) % 10.32/2.24 | % 10.32/2.24 | ALPHA: (premise_2) implies: % 10.32/2.24 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ is_the(v0, none_greater) | ~ object(v0) % 10.32/2.24 | | exemplifies_property(existence, v0) | ? [v1: $i] : ($i(v1) & % 10.32/2.24 | exemplifies_relation(greater_than, v1, v0) & % 10.32/2.24 | exemplifies_property(conceivable, v1) & object(v1))) % 10.32/2.24 | % 10.32/2.24 | ALPHA: (premise_1) implies: % 10.32/2.24 | (5) ? [v0: $i] : ($i(v0) & exemplifies_property(none_greater, v0) & % 10.32/2.24 | object(v0)) % 10.32/2.24 | % 10.32/2.24 | ALPHA: (definition_none_greater) implies: % 10.32/2.25 | (6) $i(none_greater) % 10.32/2.25 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 10.32/2.25 | exemplifies_relation(greater_than, v1, v0) | ~ % 10.32/2.25 | exemplifies_property(conceivable, v1) | ~ % 10.32/2.25 | exemplifies_property(none_greater, v0) | ~ object(v1) | ~ % 10.32/2.25 | object(v0)) % 10.32/2.25 | % 10.32/2.25 | ALPHA: (description_axiom_identity_instance) implies: % 10.32/2.25 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v1, v0) % 10.32/2.25 | | ~ property(v0) | ~ object(v1) | (exemplifies_property(v0, v1) & % 10.32/2.25 | ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ exemplifies_property(v0, v2) % 10.32/2.25 | | ~ object(v2)))) % 10.32/2.25 | % 10.32/2.25 | ALPHA: (description_is_property_and_described_is_object) implies: % 10.32/2.25 | (9) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v0, v1) % 10.32/2.25 | | object(v0)) % 10.32/2.25 | (10) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ is_the(v0, v1) % 10.32/2.25 | | property(v1)) % 10.83/2.25 | % 10.83/2.25 | DELTA: instantiating (5) with fresh symbol all_11_0 gives: % 10.83/2.25 | (11) $i(all_11_0) & exemplifies_property(none_greater, all_11_0) & % 10.83/2.25 | object(all_11_0) % 10.83/2.25 | % 10.83/2.25 | ALPHA: (11) implies: % 10.83/2.25 | (12) object(all_11_0) % 10.83/2.25 | (13) exemplifies_property(none_greater, all_11_0) % 10.83/2.25 | (14) $i(all_11_0) % 10.83/2.25 | % 10.83/2.25 | GROUND_INST: instantiating (10) with god, none_greater, simplifying with (2), % 10.83/2.25 | (3), (6) gives: % 10.83/2.25 | (15) property(none_greater) % 10.83/2.25 | % 10.83/2.25 | GROUND_INST: instantiating (9) with god, none_greater, simplifying with (2), % 10.83/2.25 | (3), (6) gives: % 10.83/2.25 | (16) object(god) % 10.83/2.25 | % 10.83/2.26 | GROUND_INST: instantiating (4) with god, simplifying with (1), (2), (3), (16) % 10.83/2.26 | gives: % 10.83/2.26 | (17) ? [v0: $i] : ($i(v0) & exemplifies_relation(greater_than, v0, god) & % 10.83/2.26 | exemplifies_property(conceivable, v0) & object(v0)) % 10.83/2.26 | % 10.83/2.26 | GROUND_INST: instantiating (8) with none_greater, god, simplifying with (2), % 10.83/2.26 | (3), (6), (15), (16) gives: % 10.83/2.26 | (18) exemplifies_property(none_greater, god) & ! [v0: $i] : (v0 = god | ~ % 10.83/2.26 | $i(v0) | ~ exemplifies_property(none_greater, v0) | ~ object(v0)) % 10.83/2.26 | % 10.83/2.26 | ALPHA: (18) implies: % 10.83/2.26 | (19) ! [v0: $i] : (v0 = god | ~ $i(v0) | ~ % 10.83/2.26 | exemplifies_property(none_greater, v0) | ~ object(v0)) % 10.83/2.26 | % 10.83/2.26 | GROUND_INST: instantiating (19) with all_11_0, simplifying with (12), (13), % 10.83/2.26 | (14) gives: % 10.83/2.26 | (20) all_11_0 = god % 10.83/2.26 | % 10.83/2.26 | DELTA: instantiating (17) with fresh symbol all_27_0 gives: % 10.83/2.26 | (21) $i(all_27_0) & exemplifies_relation(greater_than, all_27_0, god) & % 10.83/2.26 | exemplifies_property(conceivable, all_27_0) & object(all_27_0) % 10.83/2.26 | % 10.83/2.26 | ALPHA: (21) implies: % 10.83/2.26 | (22) object(all_27_0) % 10.83/2.26 | (23) exemplifies_property(conceivable, all_27_0) % 10.83/2.26 | (24) exemplifies_relation(greater_than, all_27_0, god) % 10.83/2.26 | (25) $i(all_27_0) % 10.83/2.26 | % 10.83/2.26 | REDUCE: (13), (20) imply: % 10.83/2.26 | (26) exemplifies_property(none_greater, god) % 10.83/2.26 | % 10.83/2.26 | GROUND_INST: instantiating (7) with god, all_27_0, simplifying with (3), (16), % 10.83/2.26 | (22), (23), (24), (25), (26) gives: % 10.83/2.26 | (27) $false % 10.83/2.26 | % 10.83/2.26 | CLOSE: (27) is inconsistent. % 10.83/2.26 | % 10.83/2.26 End of proof % 10.83/2.26 % SZS output end Proof for theBenchmark % 10.83/2.26 % 10.83/2.26 1639ms %------------------------------------------------------------------------------