%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU212+2 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 09:17:51 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 92 ( 21 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 112 ( 42 ~; 44 |; 15 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 5 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( in(X1,relation_dom(X3))
& X2 = apply(X3,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_funct_1) ).
fof(d4_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_funct_1) ).
fof(t20_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t20_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( in(X1,relation_dom(X3))
& X2 = apply(X3,X1) ) ) ),
inference(assume_negation,[status(cth)],[t8_funct_1]) ).
fof(c_0_4,plain,
! [X4,X5,X6,X6,X5,X6,X6] :
( ( X6 != apply(X4,X5)
| in(ordered_pair(X5,X6),X4)
| ~ in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) )
& ( ~ in(ordered_pair(X5,X6),X4)
| X6 = apply(X4,X5)
| ~ in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) )
& ( X6 != apply(X4,X5)
| X6 = empty_set
| in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) )
& ( X6 != empty_set
| X6 = apply(X4,X5)
| in(X5,relation_dom(X4))
| ~ relation(X4)
| ~ function(X4) ) ),
inference(distribute,[status(thm)],[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)],[inference(fof_simplification,[status(thm)],[d4_funct_1])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( relation(esk3_0)
& function(esk3_0)
& ( ~ in(ordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk1_0,relation_dom(esk3_0))
| esk2_0 != apply(esk3_0,esk1_0) )
& ( in(esk1_0,relation_dom(esk3_0))
| in(ordered_pair(esk1_0,esk2_0),esk3_0) )
& ( esk2_0 = apply(esk3_0,esk1_0)
| in(ordered_pair(esk1_0,esk2_0),esk3_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( in(ordered_pair(X2,X3),X1)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1))
| X3 != apply(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( in(ordered_pair(esk1_0,esk2_0),esk3_0)
| esk2_0 = apply(esk3_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( in(ordered_pair(esk1_0,esk2_0),esk3_0)
| in(esk1_0,relation_dom(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,lemma,
! [X4,X5,X6] :
( ( in(X4,relation_dom(X6))
| ~ in(ordered_pair(X4,X5),X6)
| ~ relation(X6) )
& ( in(X5,relation_rng(X6))
| ~ in(ordered_pair(X4,X5),X6)
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])]) ).
cnf(c_0_12,negated_conjecture,
( in(ordered_pair(esk1_0,esk2_0),esk3_0)
| in(ordered_pair(esk1_0,X1),esk3_0)
| X1 != esk2_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),c_0_10]) ).
cnf(c_0_13,plain,
( X3 = apply(X1,X2)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1))
| ~ in(ordered_pair(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,lemma,
( in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ in(ordered_pair(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( esk2_0 != apply(esk3_0,esk1_0)
| ~ in(esk1_0,relation_dom(esk3_0))
| ~ in(ordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
in(ordered_pair(esk1_0,esk2_0),esk3_0),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( X1 = apply(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ in(ordered_pair(X3,X1),X2) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( apply(esk3_0,esk1_0) != esk2_0
| ~ in(esk1_0,relation_dom(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
apply(esk3_0,esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_8]),c_0_9])]) ).
cnf(c_0_20,lemma,
in(esk1_0,relation_dom(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_8])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU212+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Mon Jun 20 03:34:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.023 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 22
% 0.23/1.42 # Proof object clause steps : 15
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 13
% 0.23/1.42 # Proof object clause conjectures : 10
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 8
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 4
% 0.23/1.42 # Proof object simplifying inferences : 16
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 215
% 0.23/1.42 # Removed by relevancy pruning/SinE : 162
% 0.23/1.42 # Initial clauses : 101
% 0.23/1.42 # Removed in clause preprocessing : 2
% 0.23/1.42 # Initial clauses in saturation : 99
% 0.23/1.42 # Processed clauses : 113
% 0.23/1.42 # ...of these trivial : 2
% 0.23/1.42 # ...subsumed : 3
% 0.23/1.42 # ...remaining for further processing : 107
% 0.23/1.42 # Other redundant clauses eliminated : 2
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 21
% 0.23/1.42 # Generated clauses : 239
% 0.23/1.42 # ...of the previous two non-trivial : 210
% 0.23/1.42 # Contextual simplify-reflections : 5
% 0.23/1.42 # Paramodulations : 229
% 0.23/1.42 # Factorizations : 2
% 0.23/1.42 # Equation resolutions : 8
% 0.23/1.42 # Current number of processed clauses : 84
% 0.23/1.42 # Positive orientable unit clauses : 20
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 6
% 0.23/1.42 # Non-unit-clauses : 58
% 0.23/1.42 # Current number of unprocessed clauses: 152
% 0.23/1.42 # ...number of literals in the above : 530
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 21
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 650
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 375
% 0.23/1.42 # Non-unit clause-clause subsumptions : 8
% 0.23/1.42 # Unit Clause-clause subsumption calls : 53
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 3
% 0.23/1.42 # BW rewrite match successes : 3
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 10180
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.032 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.033 s
% 0.23/1.42 # Maximum resident set size: 3652 pages
%------------------------------------------------------------------------------