TSTP Solution File: PHI022+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : PHI022+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 : n025.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.42s 1.68s
% Output : Proof 9.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI022+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun Aug 27 09:07:53 EDT 2023
% 0.14/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/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.61 Running up to 7 provers in parallel.
% 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.72/1.10 Prover 1: Preprocessing ...
% 2.72/1.11 Prover 4: Preprocessing ...
% 2.72/1.14 Prover 0: Preprocessing ...
% 2.72/1.14 Prover 3: Preprocessing ...
% 2.72/1.14 Prover 5: Preprocessing ...
% 2.72/1.14 Prover 6: Preprocessing ...
% 2.72/1.14 Prover 2: Preprocessing ...
% 5.38/1.52 Prover 5: Proving ...
% 5.38/1.52 Prover 2: Proving ...
% 6.42/1.66 Prover 6: Constructing countermodel ...
% 6.42/1.68 Prover 2: proved (1065ms)
% 6.42/1.68
% 6.42/1.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.42/1.68
% 6.42/1.69 Prover 5: proved (1067ms)
% 6.42/1.69
% 6.42/1.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.42/1.69
% 6.42/1.69 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.42/1.69 Prover 6: stopped
% 6.42/1.70 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.42/1.71 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.42/1.72 Prover 3: Constructing countermodel ...
% 6.42/1.72 Prover 1: Constructing countermodel ...
% 6.42/1.73 Prover 3: stopped
% 6.42/1.73 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 7.17/1.74 Prover 8: Preprocessing ...
% 7.17/1.77 Prover 10: Preprocessing ...
% 7.17/1.78 Prover 7: Preprocessing ...
% 7.64/1.81 Prover 11: Preprocessing ...
% 7.64/1.82 Prover 1: gave up
% 7.64/1.83 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 8.07/1.86 Prover 7: Warning: ignoring some quantifiers
% 8.07/1.87 Prover 10: Warning: ignoring some quantifiers
% 8.07/1.87 Prover 13: Preprocessing ...
% 8.07/1.89 Prover 7: Constructing countermodel ...
% 8.07/1.89 Prover 10: Constructing countermodel ...
% 8.07/1.89 Prover 4: Constructing countermodel ...
% 8.07/1.92 Prover 0: Proving ...
% 8.07/1.94 Prover 0: stopped
% 8.07/1.94 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 8.07/1.95 Prover 13: Warning: ignoring some quantifiers
% 8.83/1.97 Prover 13: Constructing countermodel ...
% 8.83/1.98 Prover 16: Preprocessing ...
% 8.83/1.98 Prover 7: Found proof (size 11)
% 8.83/1.98 Prover 7: proved (291ms)
% 8.83/1.98 Prover 4: stopped
% 8.83/1.98 Prover 10: stopped
% 8.83/1.99 Prover 13: stopped
% 9.11/2.00 Prover 16: stopped
% 9.11/2.01 Prover 8: Warning: ignoring some quantifiers
% 9.11/2.02 Prover 8: Constructing countermodel ...
% 9.11/2.02 Prover 8: stopped
% 9.34/2.09 Prover 11: Constructing countermodel ...
% 9.34/2.10 Prover 11: stopped
% 9.34/2.10
% 9.34/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.34/2.10
% 9.34/2.10 % SZS output start Proof for theBenchmark
% 9.34/2.11 Assumptions after simplification:
% 9.34/2.11 ---------------------------------
% 9.34/2.11
% 9.34/2.11 (being_has_essense)
% 9.34/2.11 ! [v0: $i] : ( ~ $i(v0) | ~ being(v0) | hasEssence(v0))
% 9.34/2.11
% 9.34/2.11 (essence_involves_existence_exists)
% 9.34/2.11 ! [v0: $i] : ( ~ $i(v0) | ~ hasEssence(v0) | ~ essenceInvExistence(v0) |
% 9.34/2.11 exists(v0))
% 9.34/2.11
% 9.34/2.11 (has_substance_being)
% 9.34/2.11 ! [v0: $i] : ( ~ $i(v0) | ~ substance(v0) | being(v0))
% 9.34/2.11
% 9.34/2.11 (has_substance_exists)
% 9.34/2.11 ? [v0: $i] : ($i(v0) & substance(v0) & ~ exists(v0))
% 9.34/2.11
% 9.34/2.11 (is_in_itself_is_self_caused)
% 9.34/2.11 ! [v0: $i] : ( ~ $i(v0) | ~ inItself(v0) | selfCaused(v0))
% 9.34/2.11
% 9.34/2.11 (self_caused)
% 9.34/2.12 ! [v0: $i] : ( ~ $i(v0) | ~ natureConcOnlyByExistence(v0) | ~
% 9.34/2.12 essenceInvExistence(v0) | selfCaused(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~
% 9.34/2.12 selfCaused(v0) | natureConcOnlyByExistence(v0)) & ! [v0: $i] : ( ~ $i(v0) |
% 9.34/2.12 ~ selfCaused(v0) | essenceInvExistence(v0))
% 9.34/2.12
% 9.34/2.12 (substance)
% 9.34/2.12 ! [v0: $i] : ( ~ $i(v0) | ~ conceivedThruItself(v0) | ~ inItself(v0) |
% 9.34/2.12 substance(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ substance(v0) |
% 9.34/2.12 conceivedThruItself(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ substance(v0) |
% 9.34/2.12 inItself(v0))
% 9.34/2.12
% 9.34/2.12 Further assumptions not needed in the proof:
% 9.34/2.12 --------------------------------------------
% 9.34/2.12 absolutely_infinite, attribute, can_be_conceived_as_non_existing,
% 9.34/2.12 conceived_through, definite_cause, eternity, exists, finite_after_its_kind,
% 9.34/2.12 free, god, have_nothing_in_common, knowledge_of_effect, mode, necessary,
% 9.34/2.12 true_idea
% 9.34/2.12
% 9.34/2.12 Those formulas are unsatisfiable:
% 9.34/2.12 ---------------------------------
% 9.34/2.12
% 9.34/2.12 Begin of proof
% 9.34/2.12 |
% 9.34/2.12 | ALPHA: (substance) implies:
% 9.34/2.12 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ substance(v0) | inItself(v0))
% 9.34/2.12 |
% 9.34/2.12 | ALPHA: (self_caused) implies:
% 9.34/2.12 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ selfCaused(v0) | essenceInvExistence(v0))
% 9.34/2.12 |
% 9.34/2.12 | DELTA: instantiating (has_substance_exists) with fresh symbol all_21_0 gives:
% 9.34/2.12 | (3) $i(all_21_0) & substance(all_21_0) & ~ exists(all_21_0)
% 9.34/2.12 |
% 9.34/2.12 | ALPHA: (3) implies:
% 9.34/2.13 | (4) ~ exists(all_21_0)
% 9.34/2.13 | (5) substance(all_21_0)
% 9.34/2.13 | (6) $i(all_21_0)
% 9.34/2.13 |
% 9.34/2.13 | GROUND_INST: instantiating (has_substance_being) with all_21_0, simplifying
% 9.34/2.13 | with (5), (6) gives:
% 9.34/2.13 | (7) being(all_21_0)
% 9.34/2.13 |
% 9.34/2.13 | GROUND_INST: instantiating (1) with all_21_0, simplifying with (5), (6) gives:
% 9.34/2.13 | (8) inItself(all_21_0)
% 9.34/2.13 |
% 9.34/2.13 | GROUND_INST: instantiating (is_in_itself_is_self_caused) with all_21_0,
% 9.34/2.13 | simplifying with (6), (8) gives:
% 9.34/2.13 | (9) selfCaused(all_21_0)
% 9.34/2.13 |
% 9.34/2.13 | GROUND_INST: instantiating (being_has_essense) with all_21_0, simplifying with
% 9.34/2.13 | (6), (7) gives:
% 9.34/2.13 | (10) hasEssence(all_21_0)
% 9.34/2.13 |
% 9.34/2.13 | GROUND_INST: instantiating (2) with all_21_0, simplifying with (6), (9) gives:
% 9.34/2.13 | (11) essenceInvExistence(all_21_0)
% 9.34/2.13 |
% 9.34/2.13 | GROUND_INST: instantiating (essence_involves_existence_exists) with all_21_0,
% 9.34/2.13 | simplifying with (4), (6), (10), (11) gives:
% 9.34/2.13 | (12) $false
% 9.34/2.13 |
% 9.34/2.13 | CLOSE: (12) is inconsistent.
% 9.34/2.13 |
% 9.34/2.13 End of proof
% 9.34/2.13 % SZS output end Proof for theBenchmark
% 9.34/2.13
% 9.34/2.13 1532ms
%------------------------------------------------------------------------------