TSTP Solution File: SEU212+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU212+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 09:17:51 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 101 ( 27 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 125 ( 46 ~; 51 |; 16 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 39 ( 7 sgn 26 !; 1 ?)
% 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(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_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,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5)
| X6 != relation_dom(X5)
| ~ relation(X5) )
& ( ~ in(ordered_pair(X7,X9),X5)
| in(X7,X6)
| X6 != relation_dom(X5)
| ~ relation(X5) )
& ( ~ in(esk5_2(X5,X6),X6)
| ~ in(ordered_pair(esk5_2(X5,X6),X11),X5)
| X6 = relation_dom(X5)
| ~ relation(X5) )
& ( in(esk5_2(X5,X6),X6)
| in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)
| X6 = relation_dom(X5)
| ~ relation(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)],[d4_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,
( in(X3,X2)
| ~ relation(X1)
| X2 != relation_dom(X1)
| ~ in(ordered_pair(X3,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
in(ordered_pair(esk1_0,esk2_0),esk3_0),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,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_16,negated_conjecture,
( in(esk1_0,X1)
| X1 != relation_dom(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_8])]) ).
cnf(c_0_17,negated_conjecture,
( apply(esk3_0,esk1_0) = esk2_0
| ~ in(esk1_0,relation_dom(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_8]),c_0_9])]) ).
cnf(c_0_18,negated_conjecture,
in(esk1_0,relation_dom(esk3_0)),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,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_20,negated_conjecture,
apply(esk3_0,esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14])]),c_0_20]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU212+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % 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 : Sun Jun 19 18:50:48 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.016 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 : 22
% 0.23/1.41 # Proof object clause steps : 15
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 15
% 0.23/1.41 # Proof object clause conjectures : 12
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 3
% 0.23/1.41 # Proof object generating inferences : 5
% 0.23/1.41 # Proof object simplifying inferences : 16
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 35
% 0.23/1.41 # Removed by relevancy pruning/SinE : 16
% 0.23/1.41 # Initial clauses : 34
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 34
% 0.23/1.41 # Processed clauses : 53
% 0.23/1.41 # ...of these trivial : 2
% 0.23/1.41 # ...subsumed : 2
% 0.23/1.41 # ...remaining for further processing : 48
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 12
% 0.23/1.41 # Generated clauses : 50
% 0.23/1.41 # ...of the previous two non-trivial : 51
% 0.23/1.41 # Contextual simplify-reflections : 2
% 0.23/1.41 # Paramodulations : 45
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 5
% 0.23/1.41 # Current number of processed clauses : 34
% 0.23/1.41 # Positive orientable unit clauses : 12
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 4
% 0.23/1.41 # Non-unit-clauses : 18
% 0.23/1.41 # Current number of unprocessed clauses: 22
% 0.23/1.41 # ...number of literals in the above : 76
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 14
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 161
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 76
% 0.23/1.41 # Non-unit clause-clause subsumptions : 3
% 0.23/1.41 # Unit Clause-clause subsumption calls : 46
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 4
% 0.23/1.41 # BW rewrite match successes : 4
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 2412
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.016 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.019 s
% 0.23/1.41 # Maximum resident set size: 2992 pages
%------------------------------------------------------------------------------