TSTP Solution File: SEU203+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU203+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:46 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 133 ( 25 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 177 ( 73 ~; 77 |; 17 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-4 aty)
% Number of variables : 68 ( 6 sgn 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t143_relat_1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_image(X3,X2))
<=> ? [X4] :
( in(X4,relation_dom(X3))
& in(ordered_pair(X4,X1),X3)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t143_relat_1) ).
fof(d13_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( X3 = relation_image(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5] :
( in(ordered_pair(X5,X4),X1)
& in(X5,X2) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d13_relat_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)
=> ( in(X1,relation_image(X3,X2))
<=> ? [X4] :
( in(X4,relation_dom(X3))
& in(ordered_pair(X4,X1),X3)
& in(X4,X2) ) ) ),
inference(assume_negation,[status(cth)],[t143_relat_1]) ).
fof(c_0_4,negated_conjecture,
! [X8] :
( relation(esk3_0)
& ( ~ in(esk1_0,relation_image(esk3_0,esk2_0))
| ~ in(X8,relation_dom(esk3_0))
| ~ in(ordered_pair(X8,esk1_0),esk3_0)
| ~ in(X8,esk2_0) )
& ( in(esk4_0,relation_dom(esk3_0))
| in(esk1_0,relation_image(esk3_0,esk2_0)) )
& ( in(ordered_pair(esk4_0,esk1_0),esk3_0)
| in(esk1_0,relation_image(esk3_0,esk2_0)) )
& ( in(esk4_0,esk2_0)
| in(esk1_0,relation_image(esk3_0,esk2_0)) ) ),
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)],[c_0_3])])])])])])]) ).
fof(c_0_5,plain,
! [X6,X7,X8,X9,X9,X11,X7,X8,X13] :
( ( in(ordered_pair(esk8_4(X6,X7,X8,X9),X9),X6)
| ~ in(X9,X8)
| X8 != relation_image(X6,X7)
| ~ relation(X6) )
& ( in(esk8_4(X6,X7,X8,X9),X7)
| ~ in(X9,X8)
| X8 != relation_image(X6,X7)
| ~ relation(X6) )
& ( ~ in(ordered_pair(X11,X9),X6)
| ~ in(X11,X7)
| in(X9,X8)
| X8 != relation_image(X6,X7)
| ~ relation(X6) )
& ( ~ in(esk9_3(X6,X7,X8),X8)
| ~ in(ordered_pair(X13,esk9_3(X6,X7,X8)),X6)
| ~ in(X13,X7)
| X8 = relation_image(X6,X7)
| ~ relation(X6) )
& ( in(ordered_pair(esk10_3(X6,X7,X8),esk9_3(X6,X7,X8)),X6)
| in(esk9_3(X6,X7,X8),X8)
| X8 = relation_image(X6,X7)
| ~ relation(X6) )
& ( in(esk10_3(X6,X7,X8),X7)
| in(esk9_3(X6,X7,X8),X8)
| X8 = relation_image(X6,X7)
| ~ relation(X6) ) ),
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)],[d13_relat_1])])])])])])]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(X7,esk5_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(esk6_2(X5,X6),X6)
| ~ in(ordered_pair(esk6_2(X5,X6),X11),X5)
| X6 = relation_dom(X5)
| ~ relation(X5) )
& ( in(esk6_2(X5,X6),X6)
| in(ordered_pair(esk6_2(X5,X6),esk7_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_7,negated_conjecture,
( ~ in(X1,esk2_0)
| ~ in(ordered_pair(X1,esk1_0),esk3_0)
| ~ in(X1,relation_dom(esk3_0))
| ~ in(esk1_0,relation_image(esk3_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(ordered_pair(esk8_4(X1,X3,X2,X4),X4),X1)
| ~ relation(X1)
| X2 != relation_image(X1,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( in(X3,X2)
| ~ relation(X1)
| X2 != relation_dom(X1)
| ~ in(ordered_pair(X3,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( X1 != relation_image(esk3_0,X2)
| ~ in(esk8_4(esk3_0,X2,X1,esk1_0),relation_dom(esk3_0))
| ~ in(esk8_4(esk3_0,X2,X1,esk1_0),esk2_0)
| ~ in(esk1_0,relation_image(esk3_0,esk2_0))
| ~ in(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,plain,
( in(esk8_4(X1,X2,X3,X4),X5)
| X3 != relation_image(X1,X2)
| X5 != relation_dom(X1)
| ~ relation(X1)
| ~ in(X4,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( X1 != relation_image(esk3_0,X2)
| ~ in(esk8_4(esk3_0,X2,X1,esk1_0),esk2_0)
| ~ in(esk1_0,relation_image(esk3_0,esk2_0))
| ~ in(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_9])]) ).
cnf(c_0_14,plain,
( in(esk8_4(X1,X3,X2,X4),X3)
| ~ relation(X1)
| X2 != relation_image(X1,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( X1 != relation_image(esk3_0,esk2_0)
| ~ in(esk1_0,relation_image(esk3_0,esk2_0))
| ~ in(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9])]) ).
cnf(c_0_16,negated_conjecture,
( in(esk1_0,relation_image(esk3_0,esk2_0))
| in(ordered_pair(esk4_0,esk1_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( in(ordered_pair(esk4_0,esk1_0),esk3_0)
| X1 != relation_image(esk3_0,esk2_0)
| ~ in(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( in(esk1_0,relation_image(esk3_0,esk2_0))
| in(esk4_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
in(ordered_pair(esk4_0,esk1_0),esk3_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( in(esk4_0,esk2_0)
| X1 != relation_image(esk3_0,esk2_0)
| ~ in(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( in(esk4_0,X1)
| X1 != relation_dom(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_9])]) ).
cnf(c_0_22,plain,
( in(X4,X2)
| ~ relation(X1)
| X2 != relation_image(X1,X3)
| ~ in(X5,X3)
| ~ in(ordered_pair(X5,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
in(esk4_0,esk2_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
in(esk4_0,relation_dom(esk3_0)),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( in(esk1_0,X1)
| X1 != relation_image(esk3_0,X2)
| ~ in(esk4_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_9])]) ).
cnf(c_0_26,negated_conjecture,
~ in(esk1_0,relation_image(esk3_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_23])]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( in(esk1_0,relation_image(esk3_0,X1))
| ~ in(esk4_0,X1) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU203+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 20:41:53 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.017 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 29
% 0.26/1.44 # Proof object clause steps : 22
% 0.26/1.44 # Proof object formula steps : 7
% 0.26/1.44 # Proof object conjectures : 20
% 0.26/1.44 # Proof object clause conjectures : 17
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 8
% 0.26/1.44 # Proof object initial formulas used : 3
% 0.26/1.44 # Proof object generating inferences : 14
% 0.26/1.44 # Proof object simplifying inferences : 18
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 31
% 0.26/1.44 # Removed by relevancy pruning/SinE : 17
% 0.26/1.44 # Initial clauses : 29
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 29
% 0.26/1.44 # Processed clauses : 1108
% 0.26/1.44 # ...of these trivial : 2
% 0.26/1.44 # ...subsumed : 824
% 0.26/1.44 # ...remaining for further processing : 282
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 39
% 0.26/1.44 # Backward-rewritten : 35
% 0.26/1.44 # Generated clauses : 4892
% 0.26/1.44 # ...of the previous two non-trivial : 4693
% 0.26/1.44 # Contextual simplify-reflections : 1130
% 0.26/1.44 # Paramodulations : 4840
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 52
% 0.26/1.44 # Current number of processed clauses : 208
% 0.26/1.44 # Positive orientable unit clauses : 10
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 12
% 0.26/1.44 # Non-unit-clauses : 186
% 0.26/1.44 # Current number of unprocessed clauses: 2988
% 0.26/1.44 # ...number of literals in the above : 15864
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 74
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 35869
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 14909
% 0.26/1.44 # Non-unit clause-clause subsumptions : 1705
% 0.26/1.44 # Unit Clause-clause subsumption calls : 548
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 8
% 0.26/1.44 # BW rewrite match successes : 8
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 57338
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.164 s
% 0.26/1.44 # System time : 0.004 s
% 0.26/1.44 # Total time : 0.168 s
% 0.26/1.44 # Maximum resident set size: 5908 pages
%------------------------------------------------------------------------------