%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PHI011+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 3 unt; 0 def)
% Number of atoms : 52 ( 3 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 56 ( 18 ~; 15 |; 12 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 25 ( 2 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_theorem_2,conjecture,
! [X2] :
( property(X2)
=> ( ? [X3] :
( object(X3)
& is_the(X3,X2) )
=> ! [X4] :
( object(X4)
=> ( is_the(X4,X2)
=> exemplifies_property(X2,X4) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_theorem_2) ).
fof(lemma_1,axiom,
! [X1,X2,X3] :
( ( object(X1)
& property(X2)
& object(X3) )
=> ( ( is_the(X1,X2)
& X1 = X3 )
=> exemplifies_property(X2,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lemma_1) ).
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(c_0_3,negated_conjecture,
~ ! [X2] :
( property(X2)
=> ( ? [X3] :
( object(X3)
& is_the(X3,X2) )
=> ! [X4] :
( object(X4)
=> ( is_the(X4,X2)
=> exemplifies_property(X2,X4) ) ) ) ),
inference(assume_negation,[status(cth)],[description_theorem_2]) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( ~ object(X4)
| ~ property(X5)
| ~ object(X6)
| ~ is_the(X4,X5)
| X4 != X6
| exemplifies_property(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lemma_1])]) ).
fof(c_0_5,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_6,negated_conjecture,
( property(esk1_0)
& object(esk2_0)
& is_the(esk2_0,esk1_0)
& object(esk3_0)
& is_the(esk3_0,esk1_0)
& ~ exemplifies_property(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_7,plain,
( exemplifies_property(X1,X2)
| X3 != X2
| ~ is_the(X3,X1)
| ~ object(X2)
| ~ property(X1)
| ~ object(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( property(X2)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
~ exemplifies_property(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
is_the(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PHI011+1 : TPTP v8.1.0. Released v7.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n017.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 00:16:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.014 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 14
% 0.24/1.42 # Proof object clause steps : 7
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 6
% 0.24/1.42 # Proof object clause conjectures : 3
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 5
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 1
% 0.24/1.42 # Proof object simplifying inferences : 6
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 5
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 12
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 12
% 0.24/1.42 # Processed clauses : 14
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 14
% 0.24/1.42 # Other redundant clauses eliminated : 1
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 9
% 0.24/1.42 # ...of the previous two non-trivial : 2
% 0.24/1.42 # Contextual simplify-reflections : 3
% 0.24/1.42 # Paramodulations : 8
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 1
% 0.24/1.42 # Current number of processed clauses : 13
% 0.24/1.42 # Positive orientable unit clauses : 5
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 6
% 0.24/1.42 # Current number of unprocessed clauses: 0
% 0.24/1.42 # ...number of literals in the above : 0
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 10
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 6
% 0.24/1.42 # Non-unit clause-clause subsumptions : 3
% 0.24/1.42 # Unit Clause-clause subsumption calls : 0
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 596
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.014 s
% 0.24/1.42 # System time : 0.001 s
% 0.24/1.42 # Total time : 0.015 s
% 0.24/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------