%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PHI010+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : 5
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 137 ( 28 equ)
% Maximal formula atoms : 74 ( 7 avg)
% Number of connectives : 199 ( 81 ~; 81 |; 28 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 36 ( 2 sgn 19 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_axiom_identity_instance,axiom,
! [X2,X1,X3] :
( ( property(X2)
& object(X1)
& object(X3) )
=> ( ( is_the(X1,X2)
& X1 = X3 )
<=> ? [X4] :
( object(X4)
& exemplifies_property(X2,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X2,X5)
=> X5 = X4 ) )
& X4 = X3 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_axiom_identity_instance) ).
fof(description_is_property_and_described_is_object,axiom,
! [X1,X2] :
( is_the(X1,X2)
=> ( property(X2)
& object(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_is_property_and_described_is_object) ).
fof(lemma_1,conjecture,
! [X1,X2,X4] :
( ( object(X1)
& property(X2)
& object(X4) )
=> ( ( is_the(X1,X2)
& X1 = X4 )
=> exemplifies_property(X2,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lemma_1) ).
fof(c_0_3,plain,
! [X6,X7,X8,X10,X11] :
( ( object(esk4_3(X6,X7,X8))
| ~ is_the(X7,X6)
| X7 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( exemplifies_property(X6,esk4_3(X6,X7,X8))
| ~ is_the(X7,X6)
| X7 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( ~ object(X10)
| ~ exemplifies_property(X6,X10)
| X10 = esk4_3(X6,X7,X8)
| ~ is_the(X7,X6)
| X7 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( esk4_3(X6,X7,X8) = X8
| ~ is_the(X7,X6)
| X7 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( is_the(X7,X6)
| object(esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| X11 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( X7 = X8
| object(esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| X11 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( is_the(X7,X6)
| exemplifies_property(X6,esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| X11 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( X7 = X8
| exemplifies_property(X6,esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| X11 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( is_the(X7,X6)
| esk5_4(X6,X7,X8,X11) != X11
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| X11 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( X7 = X8
| esk5_4(X6,X7,X8,X11) != X11
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| X11 != X8
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) ) ),
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])])])])])])]) ).
fof(c_0_4,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_5,negated_conjecture,
~ ! [X1,X2,X4] :
( ( object(X1)
& property(X2)
& object(X4) )
=> ( ( is_the(X1,X2)
& X1 = X4 )
=> exemplifies_property(X2,X4) ) ),
inference(assume_negation,[status(cth)],[lemma_1]) ).
cnf(c_0_6,plain,
( exemplifies_property(X3,esk4_3(X3,X2,X1))
| ~ object(X1)
| ~ object(X2)
| ~ property(X3)
| X2 != X1
| ~ is_the(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( property(X2)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( esk4_3(X3,X2,X1) = X1
| ~ object(X1)
| ~ object(X2)
| ~ property(X3)
| X2 != X1
| ~ is_the(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_10,negated_conjecture,
( object(esk1_0)
& property(esk2_0)
& object(esk3_0)
& is_the(esk1_0,esk2_0)
& esk1_0 = esk3_0
& ~ exemplifies_property(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_11,plain,
( exemplifies_property(X1,esk4_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_6,c_0_7]),c_0_8])]),c_0_8]) ).
cnf(c_0_12,plain,
( esk4_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_9,c_0_7]),c_0_8])]),c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ exemplifies_property(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
is_the(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ exemplifies_property(esk2_0,esk1_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PHI010+1 : TPTP v8.1.0. Released v7.2.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n021.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 00:52:46 EDT 2022
% 0.12/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 : 19
% 0.23/1.41 # Proof object clause steps : 12
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 8
% 0.23/1.41 # Proof object clause conjectures : 5
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 7
% 0.23/1.41 # Proof object initial formulas used : 3
% 0.23/1.41 # Proof object generating inferences : 2
% 0.23/1.41 # Proof object simplifying inferences : 10
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 5
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 21
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 21
% 0.23/1.41 # Processed clauses : 31
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 2
% 0.23/1.41 # ...remaining for further processing : 28
% 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 : 1
% 0.23/1.41 # Generated clauses : 18
% 0.23/1.41 # ...of the previous two non-trivial : 16
% 0.23/1.41 # Contextual simplify-reflections : 26
% 0.23/1.41 # Paramodulations : 8
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 10
% 0.23/1.41 # Current number of processed clauses : 17
% 0.23/1.41 # Positive orientable unit clauses : 4
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 11
% 0.23/1.41 # Current number of unprocessed clauses: 6
% 0.23/1.41 # ...number of literals in the above : 26
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 161
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 75
% 0.23/1.41 # Non-unit clause-clause subsumptions : 28
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1204
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.013 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.016 s
% 0.23/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------