%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PHI023+1 : TPTP v8.1.2. Released v7.4.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:42 EDT 2023 % Result : Theorem 6.90s 1.75s % Output : Proof 9.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : PHI023+1 : TPTP v8.1.2. Released v7.4.0. % 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n005.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 08:50:08 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.67 ________ _____ % 0.20/0.67 ___ __ \_________(_)________________________________ % 0.20/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.67 % 0.20/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.68 (2023-06-19) % 0.20/0.68 % 0.20/0.68 (c) Philipp Rümmer, 2009-2023 % 0.20/0.68 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.68 Amanda Stjerna. % 0.20/0.68 Free software under BSD-3-Clause. % 0.20/0.68 % 0.20/0.68 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.68 % 0.20/0.68 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.70 Running up to 7 provers in parallel. % 0.81/0.71 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.81/0.71 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.81/0.71 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.81/0.71 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.81/0.71 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.81/0.71 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.81/0.71 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.57/1.12 Prover 1: Preprocessing ... % 2.57/1.12 Prover 4: Preprocessing ... % 2.57/1.16 Prover 3: Preprocessing ... % 2.57/1.16 Prover 6: Preprocessing ... % 2.57/1.16 Prover 5: Preprocessing ... % 2.57/1.16 Prover 0: Preprocessing ... % 2.57/1.16 Prover 2: Preprocessing ... % 4.63/1.47 Prover 5: Proving ... % 5.26/1.51 Prover 2: Proving ... % 6.26/1.65 Prover 6: Constructing countermodel ... % 6.26/1.67 Prover 1: Constructing countermodel ... % 6.26/1.68 Prover 3: Constructing countermodel ... % 6.90/1.75 Prover 2: proved (1039ms) % 6.90/1.75 % 6.90/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.90/1.75 % 6.90/1.75 Prover 6: gave up % 6.90/1.75 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.90/1.76 Prover 3: gave up % 6.90/1.76 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.90/1.76 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.90/1.76 Prover 5: stopped % 6.90/1.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.52/1.80 Prover 7: Preprocessing ... % 7.52/1.80 Prover 1: gave up % 7.52/1.84 Prover 8: Preprocessing ... % 7.52/1.84 Prover 10: Preprocessing ... % 7.52/1.84 Prover 4: Constructing countermodel ... % 7.52/1.84 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.52/1.86 Prover 11: Preprocessing ... % 7.52/1.87 Prover 13: Preprocessing ... % 8.22/1.89 Prover 7: Warning: ignoring some quantifiers % 8.22/1.90 Prover 7: Constructing countermodel ... % 8.22/1.91 Prover 10: Warning: ignoring some quantifiers % 8.22/1.91 Prover 0: Proving ... % 8.22/1.92 Prover 0: stopped % 8.22/1.93 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.22/1.95 Prover 10: Constructing countermodel ... % 8.22/1.96 Prover 13: Warning: ignoring some quantifiers % 8.22/1.97 Prover 16: Preprocessing ... % 8.22/1.98 Prover 13: Constructing countermodel ... % 8.68/2.00 Prover 7: Found proof (size 15) % 8.68/2.00 Prover 7: proved (248ms) % 8.68/2.00 Prover 4: stopped % 9.10/2.00 Prover 13: stopped % 9.10/2.00 Prover 11: stopped % 9.10/2.01 Prover 10: stopped % 9.12/2.03 Prover 16: Warning: ignoring some quantifiers % 9.12/2.04 Prover 16: Constructing countermodel ... % 9.12/2.05 Prover 16: stopped % 9.12/2.05 Prover 8: Warning: ignoring some quantifiers % 9.12/2.06 Prover 8: Constructing countermodel ... % 9.12/2.06 Prover 8: stopped % 9.12/2.06 % 9.12/2.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.12/2.06 % 9.12/2.07 % SZS output start Proof for theBenchmark % 9.12/2.07 Assumptions after simplification: % 9.12/2.07 --------------------------------- % 9.12/2.07 % 9.12/2.07 (absolutely_infinite) % 9.12/2.08 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 9.12/2.08 expressesInfiniteEssentiality(v1) | ~ expressesEternalEssentiality(v1) | ~ % 9.12/2.08 constInInfAttributes(v0) | ~ substance(v0) | absolutelyInfinite(v0)) & ! % 9.12/2.08 [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ attributeOf(v1, v0) | ~ % 9.12/2.08 absolutelyInfinite(v0) | expressesInfiniteEssentiality(v1)) & ! [v0: $i] : % 9.12/2.08 ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ attributeOf(v1, v0) | ~ % 9.12/2.08 absolutelyInfinite(v0) | expressesEternalEssentiality(v1)) & ? [v0: $i] : % 9.12/2.08 ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ constInInfAttributes(v1) | ~ % 9.12/2.08 substance(v1) | attributeOf(v0, v1) | absolutelyInfinite(v1)) & ! [v0: $i] % 9.12/2.08 : ( ~ $i(v0) | ~ absolutelyInfinite(v0) | constInInfAttributes(v0)) & ! [v0: % 9.12/2.08 $i] : ( ~ $i(v0) | ~ absolutelyInfinite(v0) | substance(v0)) % 9.12/2.08 % 9.12/2.08 (being_has_essense) % 9.12/2.08 ! [v0: $i] : ( ~ $i(v0) | ~ being(v0) | hasEssence(v0)) % 9.12/2.08 % 9.12/2.08 (essence_involves_existence_exists) % 9.12/2.08 ! [v0: $i] : ( ~ $i(v0) | ~ hasEssence(v0) | ~ essenceInvExistence(v0) | % 9.12/2.08 exists(v0)) % 9.12/2.08 % 9.12/2.08 (god) % 9.12/2.08 ! [v0: $i] : ( ~ $i(v0) | ~ absolutelyInfinite(v0) | ~ being(v0) | god(v0)) % 9.12/2.08 & ! [v0: $i] : ( ~ $i(v0) | ~ god(v0) | absolutelyInfinite(v0)) & ! [v0: % 9.12/2.08 $i] : ( ~ $i(v0) | ~ god(v0) | being(v0)) % 9.12/2.08 % 9.12/2.08 (if_god_then_exists) % 9.12/2.09 ? [v0: $i] : ($i(v0) & god(v0) & ~ exists(v0)) % 9.12/2.09 % 9.12/2.09 (is_in_itself_is_self_caused) % 9.12/2.09 ! [v0: $i] : ( ~ $i(v0) | ~ inItself(v0) | selfCaused(v0)) % 9.12/2.09 % 9.12/2.09 (self_caused) % 9.12/2.09 ! [v0: $i] : ( ~ $i(v0) | ~ natureConcOnlyByExistence(v0) | ~ % 9.12/2.09 essenceInvExistence(v0) | selfCaused(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 9.12/2.09 selfCaused(v0) | natureConcOnlyByExistence(v0)) & ! [v0: $i] : ( ~ $i(v0) | % 9.12/2.09 ~ selfCaused(v0) | essenceInvExistence(v0)) % 9.12/2.09 % 9.12/2.09 (substance) % 9.12/2.09 ! [v0: $i] : ( ~ $i(v0) | ~ conceivedThruItself(v0) | ~ inItself(v0) | % 9.12/2.09 substance(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ substance(v0) | % 9.12/2.09 conceivedThruItself(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ substance(v0) | % 9.12/2.09 inItself(v0)) % 9.12/2.09 % 9.12/2.09 Further assumptions not needed in the proof: % 9.12/2.09 -------------------------------------------- % 9.12/2.09 attribute, can_be_conceived_as_non_existing, conceived_through, definite_cause, % 9.12/2.09 eternity, exists, finite_after_its_kind, free, have_nothing_in_common, % 9.12/2.09 knowledge_of_effect, mode, necessary, true_idea % 9.12/2.09 % 9.12/2.09 Those formulas are unsatisfiable: % 9.12/2.09 --------------------------------- % 9.12/2.09 % 9.12/2.09 Begin of proof % 9.12/2.09 | % 9.12/2.09 | ALPHA: (absolutely_infinite) implies: % 9.12/2.09 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ absolutelyInfinite(v0) | substance(v0)) % 9.12/2.09 | % 9.12/2.09 | ALPHA: (god) implies: % 9.12/2.09 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ god(v0) | being(v0)) % 9.12/2.09 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ god(v0) | absolutelyInfinite(v0)) % 9.12/2.09 | % 9.12/2.09 | ALPHA: (substance) implies: % 9.12/2.09 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ substance(v0) | inItself(v0)) % 9.12/2.09 | % 9.12/2.09 | ALPHA: (self_caused) implies: % 9.12/2.09 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ selfCaused(v0) | essenceInvExistence(v0)) % 9.12/2.09 | % 9.12/2.10 | DELTA: instantiating (if_god_then_exists) with fresh symbol all_20_0 gives: % 9.12/2.10 | (6) $i(all_20_0) & god(all_20_0) & ~ exists(all_20_0) % 9.12/2.10 | % 9.12/2.10 | ALPHA: (6) implies: % 9.12/2.10 | (7) ~ exists(all_20_0) % 9.12/2.10 | (8) god(all_20_0) % 9.12/2.10 | (9) $i(all_20_0) % 9.12/2.10 | % 9.12/2.10 | GROUND_INST: instantiating (3) with all_20_0, simplifying with (8), (9) gives: % 9.12/2.10 | (10) absolutelyInfinite(all_20_0) % 9.12/2.10 | % 9.12/2.10 | GROUND_INST: instantiating (2) with all_20_0, simplifying with (8), (9) gives: % 9.12/2.10 | (11) being(all_20_0) % 9.12/2.10 | % 9.12/2.10 | GROUND_INST: instantiating (being_has_essense) with all_20_0, simplifying with % 9.12/2.10 | (9), (11) gives: % 9.12/2.10 | (12) hasEssence(all_20_0) % 9.12/2.10 | % 9.12/2.10 | GROUND_INST: instantiating (1) with all_20_0, simplifying with (9), (10) % 9.12/2.10 | gives: % 9.12/2.10 | (13) substance(all_20_0) % 9.12/2.10 | % 9.12/2.10 | GROUND_INST: instantiating (4) with all_20_0, simplifying with (9), (13) % 9.12/2.10 | gives: % 9.12/2.10 | (14) inItself(all_20_0) % 9.12/2.10 | % 9.12/2.10 | GROUND_INST: instantiating (is_in_itself_is_self_caused) with all_20_0, % 9.12/2.10 | simplifying with (9), (14) gives: % 9.12/2.10 | (15) selfCaused(all_20_0) % 9.12/2.10 | % 9.12/2.10 | GROUND_INST: instantiating (5) with all_20_0, simplifying with (9), (15) % 9.12/2.10 | gives: % 9.12/2.10 | (16) essenceInvExistence(all_20_0) % 9.12/2.10 | % 9.62/2.10 | GROUND_INST: instantiating (essence_involves_existence_exists) with all_20_0, % 9.62/2.10 | simplifying with (7), (9), (12), (16) gives: % 9.62/2.10 | (17) $false % 9.62/2.10 | % 9.62/2.10 | CLOSE: (17) is inconsistent. % 9.62/2.10 | % 9.62/2.10 End of proof % 9.62/2.10 % SZS output end Proof for theBenchmark % 9.62/2.10 % 9.62/2.10 1424ms %------------------------------------------------------------------------------