TSTP Solution File: PHI014+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:31 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 141 ( 56 ~; 61 |; 15 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 37 ( 3 sgn 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_theorem_2,axiom,
! [X1] :
( property(X1)
=> ( ? [X2] :
( object(X2)
& is_the(X2,X1) )
=> ! [X3] :
( object(X3)
=> ( is_the(X3,X1)
=> exemplifies_property(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_theorem_2) ).
fof(description_is_property_and_described_is_object,axiom,
! [X4,X1] :
( is_the(X4,X1)
=> ( property(X1)
& object(X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_is_property_and_described_is_object) ).
fof(premise_2,axiom,
! [X4] :
( object(X4)
=> ( ( is_the(X4,none_greater)
& ~ exemplifies_property(existence,X4) )
=> ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X4)
& exemplifies_property(conceivable,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',premise_2) ).
fof(definition_none_greater,axiom,
! [X4] :
( object(X4)
=> ( exemplifies_property(none_greater,X4)
<=> ( exemplifies_property(conceivable,X4)
& ~ ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X4)
& exemplifies_property(conceivable,X2) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',definition_none_greater) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',definition_god) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',god_exists) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ~ property(X4)
| ~ object(X5)
| ~ is_the(X5,X4)
| ~ object(X6)
| ~ is_the(X6,X4)
| exemplifies_property(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_theorem_2])])])])]) ).
fof(c_0_7,plain,
! [X5,X6] :
( ( property(X6)
| ~ is_the(X5,X6) )
& ( object(X5)
| ~ is_the(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])]) ).
fof(c_0_8,plain,
! [X5] :
( ( object(esk2_1(X5))
| ~ is_the(X5,none_greater)
| exemplifies_property(existence,X5)
| ~ object(X5) )
& ( exemplifies_relation(greater_than,esk2_1(X5),X5)
| ~ is_the(X5,none_greater)
| exemplifies_property(existence,X5)
| ~ object(X5) )
& ( exemplifies_property(conceivable,esk2_1(X5))
| ~ is_the(X5,none_greater)
| exemplifies_property(existence,X5)
| ~ object(X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[premise_2])])])])])])]) ).
cnf(c_0_9,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1)
| ~ object(X2)
| ~ is_the(X3,X1)
| ~ object(X3)
| ~ property(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( property(X2)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X5,X6] :
( ( exemplifies_property(conceivable,X5)
| ~ exemplifies_property(none_greater,X5)
| ~ object(X5) )
& ( ~ object(X6)
| ~ exemplifies_relation(greater_than,X6,X5)
| ~ exemplifies_property(conceivable,X6)
| ~ exemplifies_property(none_greater,X5)
| ~ object(X5) )
& ( object(esk1_1(X5))
| ~ exemplifies_property(conceivable,X5)
| exemplifies_property(none_greater,X5)
| ~ object(X5) )
& ( exemplifies_relation(greater_than,esk1_1(X5),X5)
| ~ exemplifies_property(conceivable,X5)
| exemplifies_property(none_greater,X5)
| ~ object(X5) )
& ( exemplifies_property(conceivable,esk1_1(X5))
| ~ exemplifies_property(conceivable,X5)
| exemplifies_property(none_greater,X5)
| ~ object(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_none_greater])])])])])])]) ).
cnf(c_0_13,plain,
( exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk2_1(X1),X1)
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( exemplifies_property(existence,X1)
| object(esk2_1(X1))
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk2_1(X1))
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X3,X1)
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_11]) ).
cnf(c_0_17,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
fof(c_0_18,negated_conjecture,
~ exemplifies_property(existence,god),
inference(assume_negation,[status(cth)],[god_exists]) ).
cnf(c_0_19,plain,
( ~ object(X1)
| ~ exemplifies_property(none_greater,X1)
| ~ exemplifies_property(conceivable,X2)
| ~ exemplifies_relation(greater_than,X2,X1)
| ~ object(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( exemplifies_relation(greater_than,esk2_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_21,plain,
( exemplifies_property(existence,X1)
| object(esk2_1(X1))
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_22,plain,
( exemplifies_property(conceivable,esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_23,plain,
( exemplifies_property(none_greater,X1)
| ~ is_the(X1,none_greater) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_24,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]),c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 2 01:19:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.014 s
% 0.25/1.42
% 0.25/1.42 # Failure: Out of unprocessed clauses!
% 0.25/1.42 # OLD status GaveUp
% 0.25/1.42 # Parsed axioms : 6
% 0.25/1.42 # Removed by relevancy pruning/SinE : 2
% 0.25/1.42 # Initial clauses : 10
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 10
% 0.25/1.42 # Processed clauses : 14
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 2
% 0.25/1.42 # ...remaining for further processing : 12
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 5
% 0.25/1.42 # ...of the previous two non-trivial : 4
% 0.25/1.42 # Contextual simplify-reflections : 4
% 0.25/1.42 # Paramodulations : 5
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 12
% 0.25/1.42 # Positive orientable unit clauses : 1
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 1
% 0.25/1.42 # Non-unit-clauses : 10
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 0
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 21
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 13
% 0.25/1.42 # Non-unit clause-clause subsumptions : 6
% 0.25/1.42 # Unit Clause-clause subsumption calls : 0
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 0
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 841
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.013 s
% 0.25/1.42 # System time : 0.002 s
% 0.25/1.42 # Total time : 0.014 s
% 0.25/1.42 # Maximum resident set size: 2772 pages
% 0.25/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.42 # Preprocessing time : 0.016 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 28
% 0.25/1.42 # Proof object clause steps : 16
% 0.25/1.42 # Proof object formula steps : 12
% 0.25/1.42 # Proof object conjectures : 4
% 0.25/1.42 # Proof object clause conjectures : 1
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 9
% 0.25/1.42 # Proof object initial formulas used : 6
% 0.25/1.42 # Proof object generating inferences : 3
% 0.25/1.42 # Proof object simplifying inferences : 11
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 6
% 0.25/1.42 # Removed by relevancy pruning/SinE : 0
% 0.25/1.42 # Initial clauses : 13
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 13
% 0.25/1.42 # Processed clauses : 20
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 0
% 0.25/1.42 # ...remaining for further processing : 20
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 3
% 0.25/1.42 # Backward-rewritten : 1
% 0.25/1.42 # Generated clauses : 10
% 0.25/1.42 # ...of the previous two non-trivial : 9
% 0.25/1.42 # Contextual simplify-reflections : 10
% 0.25/1.42 # Paramodulations : 10
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 16
% 0.25/1.42 # Positive orientable unit clauses : 5
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 1
% 0.25/1.42 # Non-unit-clauses : 10
% 0.25/1.42 # Current number of unprocessed clauses: 1
% 0.25/1.42 # ...number of literals in the above : 5
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 4
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 26
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 24
% 0.25/1.42 # Non-unit clause-clause subsumptions : 13
% 0.25/1.42 # Unit Clause-clause subsumption calls : 14
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 1
% 0.25/1.42 # BW rewrite match successes : 1
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 1062
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.016 s
% 0.25/1.42 # System time : 0.001 s
% 0.25/1.42 # Total time : 0.017 s
% 0.25/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------