TSTP Solution File: PHI015+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PHI015+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Mon Jul 18 16:45:31 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 200 ( 24 equ)
% Maximal formula atoms : 74 ( 6 avg)
% Number of connectives : 288 ( 121 ~; 126 |; 31 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 52 ( 3 sgn 22 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(definition_none_greater,axiom,
! [X1] :
( object(X1)
=> ( exemplifies_property(none_greater,X1)
<=> ( exemplifies_property(conceivable,X1)
& ~ ? [X4] :
( object(X4)
& exemplifies_relation(greater_than,X4,X1)
& exemplifies_property(conceivable,X4) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',definition_none_greater) ).
fof(exemplifier_is_object_and_exemplified_is_property,axiom,
! [X1,X2] :
( exemplifies_property(X2,X1)
=> ( property(X2)
& object(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',exemplifier_is_object_and_exemplified_is_property) ).
fof(premise_2,axiom,
! [X1] :
( object(X1)
=> ( ( is_the(X1,none_greater)
& ~ exemplifies_property(existence,X1) )
=> ? [X4] :
( object(X4)
& exemplifies_relation(greater_than,X4,X1)
& exemplifies_property(conceivable,X4) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',premise_2) ).
fof(description_is_property_and_described_is_object,axiom,
! [X1,X2] :
( is_the(X1,X2)
=> ( property(X2)
& object(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_is_property_and_described_is_object) ).
fof(description_axiom_identity_instance,axiom,
! [X2,X1,X6] :
( ( property(X2)
& object(X1)
& object(X6) )
=> ( ( is_the(X1,X2)
& X1 = X6 )
<=> ? [X4] :
( object(X4)
& exemplifies_property(X2,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X2,X5)
=> X5 = X4 ) )
& X4 = X6 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_axiom_identity_instance) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',god_exists) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',definition_god) ).
fof(c_0_7,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(esk7_1(X5))
| ~ exemplifies_property(conceivable,X5)
| exemplifies_property(none_greater,X5)
| ~ object(X5) )
& ( exemplifies_relation(greater_than,esk7_1(X5),X5)
| ~ exemplifies_property(conceivable,X5)
| exemplifies_property(none_greater,X5)
| ~ object(X5) )
& ( exemplifies_property(conceivable,esk7_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])])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ( property(X4)
| ~ exemplifies_property(X4,X3) )
& ( object(X3)
| ~ exemplifies_property(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[exemplifier_is_object_and_exemplified_is_property])])]) ).
fof(c_0_9,plain,
! [X5] :
( ( object(esk5_1(X5))
| ~ is_the(X5,none_greater)
| exemplifies_property(existence,X5)
| ~ object(X5) )
& ( exemplifies_relation(greater_than,esk5_1(X5),X5)
| ~ is_the(X5,none_greater)
| exemplifies_property(existence,X5)
| ~ object(X5) )
& ( exemplifies_property(conceivable,esk5_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])])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ( property(X4)
| ~ is_the(X3,X4) )
& ( object(X3)
| ~ is_the(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])]) ).
fof(c_0_11,plain,
! [X7,X8,X9,X11,X12] :
( ( object(esk3_3(X7,X8,X9))
| ~ is_the(X8,X7)
| X8 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( exemplifies_property(X7,esk3_3(X7,X8,X9))
| ~ is_the(X8,X7)
| X8 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( ~ object(X11)
| ~ exemplifies_property(X7,X11)
| X11 = esk3_3(X7,X8,X9)
| ~ is_the(X8,X7)
| X8 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( esk3_3(X7,X8,X9) = X9
| ~ is_the(X8,X7)
| X8 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( is_the(X8,X7)
| object(esk4_4(X7,X8,X9,X12))
| ~ object(X12)
| ~ exemplifies_property(X7,X12)
| X12 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( X8 = X9
| object(esk4_4(X7,X8,X9,X12))
| ~ object(X12)
| ~ exemplifies_property(X7,X12)
| X12 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( is_the(X8,X7)
| exemplifies_property(X7,esk4_4(X7,X8,X9,X12))
| ~ object(X12)
| ~ exemplifies_property(X7,X12)
| X12 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( X8 = X9
| exemplifies_property(X7,esk4_4(X7,X8,X9,X12))
| ~ object(X12)
| ~ exemplifies_property(X7,X12)
| X12 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( is_the(X8,X7)
| esk4_4(X7,X8,X9,X12) != X12
| ~ object(X12)
| ~ exemplifies_property(X7,X12)
| X12 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) )
& ( X8 = X9
| esk4_4(X7,X8,X9,X12) != X12
| ~ object(X12)
| ~ exemplifies_property(X7,X12)
| X12 != X9
| ~ property(X7)
| ~ object(X8)
| ~ object(X9) ) ),
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)],[description_axiom_identity_instance])])])])])])]) ).
cnf(c_0_12,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_7]) ).
cnf(c_0_13,plain,
( object(X2)
| ~ exemplifies_property(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk5_1(X1),X1)
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk5_1(X1))
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,negated_conjecture,
~ exemplifies_property(existence,god),
inference(assume_negation,[status(cth)],[god_exists]) ).
cnf(c_0_18,plain,
( exemplifies_property(X3,esk3_3(X3,X2,X1))
| ~ object(X1)
| ~ object(X2)
| ~ property(X3)
| X2 != X1
| ~ is_the(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( property(X2)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( esk3_3(X3,X2,X1) = X1
| ~ object(X1)
| ~ object(X2)
| ~ property(X3)
| X2 != X1
| ~ is_the(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ~ exemplifies_relation(greater_than,X1,X2)
| ~ exemplifies_property(none_greater,X2)
| ~ exemplifies_property(conceivable,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_22,plain,
( exemplifies_relation(greater_than,esk5_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( exemplifies_property(conceivable,esk5_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_24,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( exemplifies_property(X1,esk3_3(X1,X2,X2))
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_18,c_0_19]),c_0_15])]),c_0_15]) ).
cnf(c_0_26,plain,
( esk3_3(X1,X2,X2) = X2
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_19]),c_0_15])]),c_0_15]) ).
cnf(c_0_27,plain,
( exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ exemplifies_property(none_greater,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
cnf(c_0_29,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
~ exemplifies_property(none_greater,god),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PHI015+1 : TPTP v8.1.0. Released v7.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 01:19:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 33
% 0.23/1.41 # Proof object clause steps : 19
% 0.23/1.41 # Proof object formula steps : 14
% 0.23/1.41 # Proof object conjectures : 4
% 0.23/1.41 # Proof object clause conjectures : 1
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 10
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 4
% 0.23/1.41 # Proof object simplifying inferences : 15
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 11
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 38
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 38
% 0.23/1.41 # Processed clauses : 68
% 0.23/1.41 # ...of these trivial : 3
% 0.23/1.41 # ...subsumed : 7
% 0.23/1.41 # ...remaining for further processing : 58
% 0.23/1.41 # Other redundant clauses eliminated : 10
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 87
% 0.23/1.41 # ...of the previous two non-trivial : 82
% 0.23/1.41 # Contextual simplify-reflections : 66
% 0.23/1.41 # Paramodulations : 77
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 10
% 0.23/1.41 # Current number of processed clauses : 48
% 0.23/1.41 # Positive orientable unit clauses : 7
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 4
% 0.23/1.41 # Non-unit-clauses : 37
% 0.23/1.41 # Current number of unprocessed clauses: 52
% 0.23/1.41 # ...number of literals in the above : 277
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 498
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 217
% 0.23/1.41 # Non-unit clause-clause subsumptions : 73
% 0.23/1.41 # Unit Clause-clause subsumption calls : 51
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 3781
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.018 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.019 s
% 0.23/1.41 # Maximum resident set size: 3012 pages
%------------------------------------------------------------------------------