%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PHI023+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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 : 600s
% DateTime : Mon Jul 18 16:45:32 EDT 2022
% Result : Theorem 0.19s 1.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 5 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 125 ( 49 ~; 47 |; 19 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 37 ( 6 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(essence_involves_existence_exists,axiom,
! [X1] :
( ( essenceInvExistence(X1)
& hasEssence(X1) )
=> exists(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',essence_involves_existence_exists) ).
fof(being_has_essense,axiom,
! [X1] :
( being(X1)
=> hasEssence(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',being_has_essense) ).
fof(god,axiom,
! [X1] :
( god(X1)
<=> ( being(X1)
& absolutelyInfinite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+0.ax',god) ).
fof(if_god_then_exists,conjecture,
! [X1] :
( god(X1)
=> exists(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',if_god_then_exists) ).
fof(self_caused,axiom,
! [X1] :
( selfCaused(X1)
<=> ( essenceInvExistence(X1)
& natureConcOnlyByExistence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+0.ax',self_caused) ).
fof(is_in_itself_is_self_caused,axiom,
! [X1] :
( inItself(X1)
=> selfCaused(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',is_in_itself_is_self_caused) ).
fof(substance,axiom,
! [X1] :
( substance(X1)
<=> ( inItself(X1)
& conceivedThruItself(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+0.ax',substance) ).
fof(absolutely_infinite,axiom,
! [X1,X2] :
( absolutelyInfinite(X1)
<=> ( substance(X1)
& constInInfAttributes(X1)
& ( attributeOf(X2,X1)
=> ( expressesEternalEssentiality(X2)
& expressesInfiniteEssentiality(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+0.ax',absolutely_infinite) ).
fof(c_0_8,plain,
! [X2] :
( ~ essenceInvExistence(X2)
| ~ hasEssence(X2)
| exists(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[essence_involves_existence_exists])]) ).
fof(c_0_9,plain,
! [X2] :
( ~ being(X2)
| hasEssence(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[being_has_essense])]) ).
cnf(c_0_10,plain,
( exists(X1)
| ~ hasEssence(X1)
| ~ essenceInvExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( hasEssence(X1)
| ~ being(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X2,X2] :
( ( being(X2)
| ~ god(X2) )
& ( absolutelyInfinite(X2)
| ~ god(X2) )
& ( ~ being(X2)
| ~ absolutelyInfinite(X2)
| god(X2) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[god])])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( god(X1)
=> exists(X1) ),
inference(assume_negation,[status(cth)],[if_god_then_exists]) ).
cnf(c_0_14,plain,
( exists(X1)
| ~ being(X1)
| ~ essenceInvExistence(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( being(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X2,X2] :
( ( essenceInvExistence(X2)
| ~ selfCaused(X2) )
& ( natureConcOnlyByExistence(X2)
| ~ selfCaused(X2) )
& ( ~ essenceInvExistence(X2)
| ~ natureConcOnlyByExistence(X2)
| selfCaused(X2) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[self_caused])])])])]) ).
fof(c_0_17,plain,
! [X2] :
( ~ inItself(X2)
| selfCaused(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[is_in_itself_is_self_caused])]) ).
fof(c_0_18,plain,
! [X2,X2] :
( ( inItself(X2)
| ~ substance(X2) )
& ( conceivedThruItself(X2)
| ~ substance(X2) )
& ( ~ inItself(X2)
| ~ conceivedThruItself(X2)
| substance(X2) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substance])])])])]) ).
fof(c_0_19,negated_conjecture,
( god(esk1_0)
& ~ exists(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_20,plain,
( exists(X1)
| ~ god(X1)
| ~ essenceInvExistence(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( inItself(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X3,X4,X3,X4,X4] :
( ( substance(X3)
| ~ absolutelyInfinite(X3) )
& ( constInInfAttributes(X3)
| ~ absolutelyInfinite(X3) )
& ( expressesEternalEssentiality(X4)
| ~ attributeOf(X4,X3)
| ~ absolutelyInfinite(X3) )
& ( expressesInfiniteEssentiality(X4)
| ~ attributeOf(X4,X3)
| ~ absolutelyInfinite(X3) )
& ( attributeOf(X4,X3)
| ~ substance(X3)
| ~ constInInfAttributes(X3)
| absolutelyInfinite(X3) )
& ( ~ expressesEternalEssentiality(X4)
| ~ expressesInfiniteEssentiality(X4)
| ~ substance(X3)
| ~ constInInfAttributes(X3)
| absolutelyInfinite(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[absolutely_infinite])])])])]) ).
cnf(c_0_25,plain,
( absolutelyInfinite(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
god(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( exists(X1)
| ~ god(X1)
| ~ selfCaused(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( selfCaused(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( substance(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
absolutelyInfinite(esk1_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( exists(X1)
| ~ god(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
substance(esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ exists(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PHI023+1 : TPTP v8.1.0. Released v7.4.0.
% 0.10/0.11 % Command : run_ET %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 2 01:13:45 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.19/1.37 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.19/1.37 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.19/1.37 # Preprocessing time : 0.012 s
% 0.19/1.37
% 0.19/1.37 # Failure: Out of unprocessed clauses!
% 0.19/1.37 # OLD status GaveUp
% 0.19/1.37 # Parsed axioms : 21
% 0.19/1.37 # Removed by relevancy pruning/SinE : 17
% 0.19/1.37 # Initial clauses : 7
% 0.19/1.37 # Removed in clause preprocessing : 0
% 0.19/1.37 # Initial clauses in saturation : 7
% 0.19/1.37 # Processed clauses : 7
% 0.19/1.37 # ...of these trivial : 0
% 0.19/1.37 # ...subsumed : 0
% 0.19/1.37 # ...remaining for further processing : 7
% 0.19/1.37 # Other redundant clauses eliminated : 0
% 0.19/1.37 # Clauses deleted for lack of memory : 0
% 0.19/1.37 # Backward-subsumed : 0
% 0.19/1.37 # Backward-rewritten : 0
% 0.19/1.37 # Generated clauses : 1
% 0.19/1.37 # ...of the previous two non-trivial : 0
% 0.19/1.37 # Contextual simplify-reflections : 0
% 0.19/1.37 # Paramodulations : 1
% 0.19/1.37 # Factorizations : 0
% 0.19/1.37 # Equation resolutions : 0
% 0.19/1.37 # Current number of processed clauses : 7
% 0.19/1.37 # Positive orientable unit clauses : 1
% 0.19/1.37 # Positive unorientable unit clauses: 0
% 0.19/1.37 # Negative unit clauses : 1
% 0.19/1.37 # Non-unit-clauses : 5
% 0.19/1.37 # Current number of unprocessed clauses: 0
% 0.19/1.37 # ...number of literals in the above : 0
% 0.19/1.37 # Current number of archived formulas : 0
% 0.19/1.37 # Current number of archived clauses : 0
% 0.19/1.37 # Clause-clause subsumption calls (NU) : 0
% 0.19/1.37 # Rec. Clause-clause subsumption calls : 0
% 0.19/1.37 # Non-unit clause-clause subsumptions : 0
% 0.19/1.37 # Unit Clause-clause subsumption calls : 0
% 0.19/1.37 # Rewrite failures with RHS unbound : 0
% 0.19/1.37 # BW rewrite match attempts : 0
% 0.19/1.37 # BW rewrite match successes : 0
% 0.19/1.37 # Condensation attempts : 0
% 0.19/1.37 # Condensation successes : 0
% 0.19/1.37 # Termbank termtop insertions : 512
% 0.19/1.37
% 0.19/1.37 # -------------------------------------------------
% 0.19/1.37 # User time : 0.011 s
% 0.19/1.37 # System time : 0.001 s
% 0.19/1.37 # Total time : 0.012 s
% 0.19/1.37 # Maximum resident set size: 2760 pages
% 0.19/1.37 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.19/1.37 # Preprocessing time : 0.014 s
% 0.19/1.37
% 0.19/1.37 # Proof found!
% 0.19/1.37 # SZS status Theorem
% 0.19/1.37 # SZS output start CNFRefutation
% See solution above
% 0.19/1.37 # Proof object total steps : 35
% 0.19/1.37 # Proof object clause steps : 18
% 0.19/1.37 # Proof object formula steps : 17
% 0.19/1.37 # Proof object conjectures : 8
% 0.19/1.37 # Proof object clause conjectures : 5
% 0.19/1.37 # Proof object formula conjectures : 3
% 0.19/1.37 # Proof object initial clauses used : 10
% 0.19/1.37 # Proof object initial formulas used : 8
% 0.19/1.37 # Proof object generating inferences : 8
% 0.19/1.37 # Proof object simplifying inferences : 3
% 0.19/1.37 # Training examples: 0 positive, 0 negative
% 0.19/1.37 # Parsed axioms : 21
% 0.19/1.37 # Removed by relevancy pruning/SinE : 0
% 0.19/1.37 # Initial clauses : 60
% 0.19/1.37 # Removed in clause preprocessing : 1
% 0.19/1.37 # Initial clauses in saturation : 59
% 0.19/1.37 # Processed clauses : 66
% 0.19/1.37 # ...of these trivial : 0
% 0.19/1.37 # ...subsumed : 0
% 0.19/1.37 # ...remaining for further processing : 66
% 0.19/1.37 # Other redundant clauses eliminated : 2
% 0.19/1.37 # Clauses deleted for lack of memory : 0
% 0.19/1.37 # Backward-subsumed : 0
% 0.19/1.37 # Backward-rewritten : 0
% 0.19/1.37 # Generated clauses : 26
% 0.19/1.37 # ...of the previous two non-trivial : 13
% 0.19/1.37 # Contextual simplify-reflections : 0
% 0.19/1.37 # Paramodulations : 22
% 0.19/1.37 # Factorizations : 2
% 0.19/1.37 # Equation resolutions : 2
% 0.19/1.37 # Current number of processed clauses : 64
% 0.19/1.37 # Positive orientable unit clauses : 3
% 0.19/1.37 # Positive unorientable unit clauses: 0
% 0.19/1.37 # Negative unit clauses : 1
% 0.19/1.37 # Non-unit-clauses : 60
% 0.19/1.37 # Current number of unprocessed clauses: 6
% 0.19/1.37 # ...number of literals in the above : 11
% 0.19/1.37 # Current number of archived formulas : 0
% 0.19/1.37 # Current number of archived clauses : 0
% 0.19/1.37 # Clause-clause subsumption calls (NU) : 1080
% 0.19/1.37 # Rec. Clause-clause subsumption calls : 755
% 0.19/1.37 # Non-unit clause-clause subsumptions : 0
% 0.19/1.37 # Unit Clause-clause subsumption calls : 2
% 0.19/1.37 # Rewrite failures with RHS unbound : 0
% 0.19/1.37 # BW rewrite match attempts : 0
% 0.19/1.37 # BW rewrite match successes : 0
% 0.19/1.37 # Condensation attempts : 0
% 0.19/1.37 # Condensation successes : 0
% 0.19/1.37 # Termbank termtop insertions : 3220
% 0.19/1.37
% 0.19/1.37 # -------------------------------------------------
% 0.19/1.37 # User time : 0.016 s
% 0.19/1.37 # System time : 0.000 s
% 0.19/1.37 # Total time : 0.016 s
% 0.19/1.37 # Maximum resident set size: 2972 pages
%------------------------------------------------------------------------------