TSTP Solution File: SEU280+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU280+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:18:34 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 46 ( 6 unt; 0 def)
% Number of atoms : 205 ( 62 equ)
% Maximal formula atoms : 70 ( 4 avg)
% Number of connectives : 241 ( 82 ~; 126 |; 28 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 74 ( 5 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_tarski__e6_22__wellord2__1,axiom,
! [X1] :
( ! [X2,X3,X4] :
( ( X2 = X3
& ordinal(X3)
& X2 = X4
& ordinal(X4) )
=> X3 = X4 )
=> ? [X2] :
! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& X4 = X3
& ordinal(X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_tarski__e6_22__wellord2__1) ).
fof(s1_xboole_0__e6_22__wellord2,conjecture,
! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& ordinal(X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_xboole_0__e6_22__wellord2) ).
fof(c_0_2,plain,
! [X5,X10,X10,X12] :
( ( in(esk7_2(X5,X10),X5)
| ~ in(X10,esk6_1(X5))
| esk3_0 = esk4_0 )
& ( esk7_2(X5,X10) = X10
| ~ in(X10,esk6_1(X5))
| esk3_0 = esk4_0 )
& ( ordinal(X10)
| ~ in(X10,esk6_1(X5))
| esk3_0 = esk4_0 )
& ( ~ in(X12,X5)
| X12 != X10
| ~ ordinal(X10)
| in(X10,esk6_1(X5))
| esk3_0 = esk4_0 )
& ( in(esk7_2(X5,X10),X5)
| ~ in(X10,esk6_1(X5))
| ordinal(esk4_0) )
& ( esk7_2(X5,X10) = X10
| ~ in(X10,esk6_1(X5))
| ordinal(esk4_0) )
& ( ordinal(X10)
| ~ in(X10,esk6_1(X5))
| ordinal(esk4_0) )
& ( ~ in(X12,X5)
| X12 != X10
| ~ ordinal(X10)
| in(X10,esk6_1(X5))
| ordinal(esk4_0) )
& ( in(esk7_2(X5,X10),X5)
| ~ in(X10,esk6_1(X5))
| esk3_0 = esk5_0 )
& ( esk7_2(X5,X10) = X10
| ~ in(X10,esk6_1(X5))
| esk3_0 = esk5_0 )
& ( ordinal(X10)
| ~ in(X10,esk6_1(X5))
| esk3_0 = esk5_0 )
& ( ~ in(X12,X5)
| X12 != X10
| ~ ordinal(X10)
| in(X10,esk6_1(X5))
| esk3_0 = esk5_0 )
& ( in(esk7_2(X5,X10),X5)
| ~ in(X10,esk6_1(X5))
| ordinal(esk5_0) )
& ( esk7_2(X5,X10) = X10
| ~ in(X10,esk6_1(X5))
| ordinal(esk5_0) )
& ( ordinal(X10)
| ~ in(X10,esk6_1(X5))
| ordinal(esk5_0) )
& ( ~ in(X12,X5)
| X12 != X10
| ~ ordinal(X10)
| in(X10,esk6_1(X5))
| ordinal(esk5_0) )
& ( in(esk7_2(X5,X10),X5)
| ~ in(X10,esk6_1(X5))
| esk4_0 != esk5_0 )
& ( esk7_2(X5,X10) = X10
| ~ in(X10,esk6_1(X5))
| esk4_0 != esk5_0 )
& ( ordinal(X10)
| ~ in(X10,esk6_1(X5))
| esk4_0 != esk5_0 )
& ( ~ in(X12,X5)
| X12 != X10
| ~ ordinal(X10)
| in(X10,esk6_1(X5))
| esk4_0 != esk5_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)],[s1_tarski__e6_22__wellord2__1])])])])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& ordinal(X3) ) ),
inference(assume_negation,[status(cth)],[s1_xboole_0__e6_22__wellord2]) ).
cnf(c_0_4,plain,
( esk3_0 = esk4_0
| in(X1,esk6_1(X2))
| ~ ordinal(X1)
| X3 != X1
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
! [X5] :
( ( ~ in(esk2_1(X5),X5)
| ~ in(esk2_1(X5),esk1_0)
| ~ ordinal(esk2_1(X5)) )
& ( in(esk2_1(X5),esk1_0)
| in(esk2_1(X5),X5) )
& ( ordinal(esk2_1(X5))
| in(esk2_1(X5),X5) ) ),
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,
( esk4_0 = esk3_0
| in(X1,esk6_1(X2))
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( in(esk2_1(X1),X1)
| ordinal(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( esk4_0 = esk3_0
| in(esk2_1(X1),esk6_1(X2))
| in(esk2_1(X1),X1)
| ~ in(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( in(esk2_1(X1),X1)
| in(esk2_1(X1),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( esk4_0 = esk3_0
| in(esk2_1(X1),esk6_1(esk1_0))
| in(esk2_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( esk3_0 = esk4_0
| in(esk7_2(X2,X1),X2)
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,plain,
( esk3_0 = esk4_0
| esk7_2(X2,X1) = X1
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,plain,
( in(esk7_2(X2,X1),X2)
| esk4_0 != esk5_0
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,plain,
( esk7_2(X2,X1) = X1
| esk4_0 != esk5_0
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,plain,
( esk3_0 = esk4_0
| ordinal(X1)
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( esk4_0 = esk3_0
| in(esk2_1(esk6_1(esk1_0)),esk6_1(esk1_0)) ),
inference(ef,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( esk4_0 = esk3_0
| in(X1,X2)
| ~ in(X1,esk6_1(X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( in(X1,X2)
| esk5_0 != esk4_0
| ~ in(X1,esk6_1(X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ ordinal(esk2_1(X1))
| ~ in(esk2_1(X1),esk1_0)
| ~ in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( esk4_0 = esk3_0
| ordinal(esk2_1(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( esk4_0 = esk3_0
| in(esk2_1(esk6_1(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,plain,
( esk3_0 = esk5_0
| in(esk7_2(X2,X1),X2)
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_23,plain,
( esk3_0 = esk5_0
| esk7_2(X2,X1) = X1
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_24,negated_conjecture,
( in(esk2_1(esk6_1(X1)),esk1_0)
| in(esk2_1(esk6_1(X1)),X1)
| esk5_0 != esk4_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_25,negated_conjecture,
esk4_0 = esk3_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_21]) ).
cnf(c_0_26,plain,
( esk3_0 = esk5_0
| in(X1,esk6_1(X2))
| ~ ordinal(X1)
| X3 != X1
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_27,plain,
( esk5_0 = esk3_0
| in(X1,X2)
| ~ in(X1,esk6_1(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( in(esk2_1(esk6_1(X1)),esk1_0)
| in(esk2_1(esk6_1(X1)),X1)
| esk5_0 != esk3_0 ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( esk5_0 = esk3_0
| in(X1,esk6_1(X2))
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( in(esk2_1(esk6_1(X1)),esk1_0)
| in(esk2_1(esk6_1(X1)),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_9]),c_0_28]) ).
cnf(c_0_31,plain,
( ordinal(X1)
| esk4_0 != esk5_0
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_32,plain,
( esk3_0 = esk5_0
| ordinal(X1)
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_33,negated_conjecture,
( esk5_0 = esk3_0
| in(esk2_1(X1),esk6_1(X2))
| in(esk2_1(X1),X1)
| ~ in(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_7]) ).
cnf(c_0_34,negated_conjecture,
in(esk2_1(esk6_1(esk1_0)),esk1_0),
inference(ef,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( ordinal(X1)
| ~ in(X1,esk6_1(X2)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_25]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( esk5_0 = esk3_0
| in(esk2_1(esk6_1(esk1_0)),esk6_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( in(X1,esk6_1(X2))
| esk4_0 != esk5_0
| ~ ordinal(X1)
| X3 != X1
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_38,negated_conjecture,
( esk5_0 = esk3_0
| ordinal(esk2_1(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( in(X1,esk6_1(X2))
| esk5_0 != esk4_0
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
esk5_0 = esk3_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_38]),c_0_34])]),c_0_36]) ).
cnf(c_0_41,plain,
( in(X1,esk6_1(X2))
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_25]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
( in(esk2_1(X1),esk6_1(X2))
| in(esk2_1(X1),X1)
| ~ in(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_7]) ).
cnf(c_0_43,negated_conjecture,
in(esk2_1(esk6_1(esk1_0)),esk6_1(esk1_0)),
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
ordinal(esk2_1(esk6_1(esk1_0))),
inference(spm,[status(thm)],[c_0_35,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_44]),c_0_34]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU280+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n005.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 : Mon Jun 20 01:25:53 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.014 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 : 46
% 0.23/1.41 # Proof object clause steps : 41
% 0.23/1.41 # Proof object formula steps : 5
% 0.23/1.41 # Proof object conjectures : 24
% 0.23/1.41 # Proof object clause conjectures : 21
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 15
% 0.23/1.41 # Proof object initial formulas used : 2
% 0.23/1.41 # Proof object generating inferences : 20
% 0.23/1.41 # Proof object simplifying inferences : 18
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 6
% 0.23/1.41 # Removed by relevancy pruning/SinE : 3
% 0.23/1.41 # Initial clauses : 24
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 24
% 0.23/1.41 # Processed clauses : 298
% 0.23/1.41 # ...of these trivial : 2
% 0.23/1.41 # ...subsumed : 160
% 0.23/1.41 # ...remaining for further processing : 136
% 0.23/1.41 # Other redundant clauses eliminated : 5
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 16
% 0.23/1.41 # Backward-rewritten : 80
% 0.23/1.41 # Generated clauses : 702
% 0.23/1.41 # ...of the previous two non-trivial : 731
% 0.23/1.41 # Contextual simplify-reflections : 164
% 0.23/1.41 # Paramodulations : 691
% 0.23/1.41 # Factorizations : 6
% 0.23/1.41 # Equation resolutions : 5
% 0.23/1.41 # Current number of processed clauses : 35
% 0.23/1.41 # Positive orientable unit clauses : 6
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 27
% 0.23/1.41 # Current number of unprocessed clauses: 65
% 0.23/1.41 # ...number of literals in the above : 159
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 96
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 2441
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 2005
% 0.23/1.41 # Non-unit clause-clause subsumptions : 339
% 0.23/1.41 # Unit Clause-clause subsumption calls : 9
% 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 : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 11772
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.039 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.040 s
% 0.23/1.41 # Maximum resident set size: 3036 pages
%------------------------------------------------------------------------------