TSTP Solution File: SEU282+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU282+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:25:38 EDT 2023
% Result : Theorem 9.74s 1.68s
% Output : CNFRefutation 9.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 8 unt; 0 def)
% Number of atoms : 270 ( 91 equ)
% Maximal formula atoms : 50 ( 4 avg)
% Number of connectives : 316 ( 108 ~; 132 |; 58 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 1 con; 0-3 aty)
% Number of variables : 186 ( 22 sgn; 73 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_xboole_0__e16_22__wellord2__1,axiom,
! [X1,X2] :
? [X3] :
! [X4] :
( in(X4,X3)
<=> ( in(X4,cartesian_product2(X1,X2))
& ? [X5,X6] :
( ordered_pair(X5,X6) = X4
& in(X5,X1)
& X6 = singleton(X5) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p',s1_xboole_0__e16_22__wellord2__1) ).
fof(t33_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p',t33_zfmisc_1) ).
fof(d1_funct_1,axiom,
! [X1] :
( function(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X2,X4),X1) )
=> X3 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p',d1_funct_1) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p',d1_relat_1) ).
fof(s1_funct_1__e16_22__wellord2__1,conjecture,
! [X1] :
( ! [X2,X3,X4] :
( ( in(X2,X1)
& X3 = singleton(X2)
& in(X2,X1)
& X4 = singleton(X2) )
=> X3 = X4 )
=> ? [X2] :
( relation(X2)
& function(X2)
& ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X3,X1)
& in(X3,X1)
& X4 = singleton(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p',s1_funct_1__e16_22__wellord2__1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p',t106_zfmisc_1) ).
fof(s1_tarski__e16_22__wellord2__1,axiom,
! [X1] :
( ! [X2,X3,X4] :
( ( in(X2,X1)
& X3 = singleton(X2)
& in(X2,X1)
& X4 = singleton(X2) )
=> X3 = X4 )
=> ? [X2] :
! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& in(X4,X1)
& X3 = singleton(X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p',s1_tarski__e16_22__wellord2__1) ).
fof(c_0_7,plain,
! [X23,X24,X26,X29,X30,X31] :
( ( in(X26,cartesian_product2(X23,X24))
| ~ in(X26,esk9_2(X23,X24)) )
& ( ordered_pair(esk10_3(X23,X24,X26),esk11_3(X23,X24,X26)) = X26
| ~ in(X26,esk9_2(X23,X24)) )
& ( in(esk10_3(X23,X24,X26),X23)
| ~ in(X26,esk9_2(X23,X24)) )
& ( esk11_3(X23,X24,X26) = singleton(esk10_3(X23,X24,X26))
| ~ in(X26,esk9_2(X23,X24)) )
& ( ~ in(X29,cartesian_product2(X23,X24))
| ordered_pair(X30,X31) != X29
| ~ in(X30,X23)
| X31 != singleton(X30)
| in(X29,esk9_2(X23,X24)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[s1_xboole_0__e16_22__wellord2__1])])])])])]) ).
fof(c_0_8,plain,
! [X65,X66,X67,X68] :
( ( X65 = X67
| ordered_pair(X65,X66) != ordered_pair(X67,X68) )
& ( X66 = X68
| ordered_pair(X65,X66) != ordered_pair(X67,X68) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])]) ).
cnf(c_0_9,plain,
( ordered_pair(esk10_3(X1,X2,X3),esk11_3(X1,X2,X3)) = X3
| ~ in(X3,esk9_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( esk11_3(X1,X2,X3) = singleton(esk10_3(X1,X2,X3))
| ~ in(X3,esk9_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| ordered_pair(X3,X1) != ordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ordered_pair(esk10_3(X1,X2,X3),singleton(esk10_3(X1,X2,X3))) = X3
| ~ in(X3,esk9_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( X1 = X2
| ordered_pair(X1,X3) != ordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( singleton(esk10_3(X1,X2,ordered_pair(X3,X4))) = X4
| ~ in(ordered_pair(X3,X4),esk9_2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_15,plain,
( esk10_3(X1,X2,ordered_pair(X3,X4)) = X3
| ~ in(ordered_pair(X3,X4),esk9_2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9])]) ).
fof(c_0_16,plain,
! [X37,X38,X39,X40,X41] :
( ( ~ function(X37)
| ~ in(ordered_pair(X38,X39),X37)
| ~ in(ordered_pair(X38,X40),X37)
| X39 = X40 )
& ( in(ordered_pair(esk12_1(X41),esk13_1(X41)),X41)
| function(X41) )
& ( in(ordered_pair(esk12_1(X41),esk14_1(X41)),X41)
| function(X41) )
& ( esk13_1(X41) != esk14_1(X41)
| function(X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_1])])])])])]) ).
fof(c_0_17,plain,
! [X45,X46,X49,X51,X52] :
( ( ~ relation(X45)
| ~ in(X46,X45)
| X46 = ordered_pair(esk15_2(X45,X46),esk16_2(X45,X46)) )
& ( in(esk17_1(X49),X49)
| relation(X49) )
& ( esk17_1(X49) != ordered_pair(X51,X52)
| relation(X49) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_relat_1])])])])])]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4] :
( ( in(X2,X1)
& X3 = singleton(X2)
& in(X2,X1)
& X4 = singleton(X2) )
=> X3 = X4 )
=> ? [X2] :
( relation(X2)
& function(X2)
& ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X3,X1)
& X4 = singleton(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[s1_funct_1__e16_22__wellord2__1])]) ).
cnf(c_0_19,plain,
( singleton(X1) = X2
| ~ in(ordered_pair(X1,X2),esk9_2(X3,X4)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( in(ordered_pair(esk12_1(X1),esk14_1(X1)),X1)
| function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( in(ordered_pair(esk12_1(X1),esk13_1(X1)),X1)
| function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( relation(X1)
| esk17_1(X1) != ordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,negated_conjecture,
! [X8,X9,X10,X11] :
( ( ~ in(X8,esk1_0)
| X9 != singleton(X8)
| ~ in(X8,esk1_0)
| X10 != singleton(X8)
| X9 = X10 )
& ( ~ in(ordered_pair(esk2_1(X11),esk3_1(X11)),X11)
| ~ in(esk2_1(X11),esk1_0)
| esk3_1(X11) != singleton(esk2_1(X11))
| ~ relation(X11)
| ~ function(X11) )
& ( in(esk2_1(X11),esk1_0)
| in(ordered_pair(esk2_1(X11),esk3_1(X11)),X11)
| ~ relation(X11)
| ~ function(X11) )
& ( esk3_1(X11) = singleton(esk2_1(X11))
| in(ordered_pair(esk2_1(X11),esk3_1(X11)),X11)
| ~ relation(X11)
| ~ function(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
cnf(c_0_24,plain,
( singleton(esk12_1(esk9_2(X1,X2))) = esk14_1(esk9_2(X1,X2))
| function(esk9_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( singleton(esk12_1(esk9_2(X1,X2))) = esk13_1(esk9_2(X1,X2))
| function(esk9_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_26,plain,
( function(X1)
| esk13_1(X1) != esk14_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( relation(X1)
| ~ in(esk17_1(X1),esk9_2(X2,X3)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_9])]) ).
cnf(c_0_28,plain,
( in(esk17_1(X1),X1)
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
( esk3_1(X1) = singleton(esk2_1(X1))
| in(ordered_pair(esk2_1(X1),esk3_1(X1)),X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
function(esk9_2(X1,X2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
relation(esk9_2(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X53,X54,X55,X56] :
( ( in(X53,X55)
| ~ in(ordered_pair(X53,X54),cartesian_product2(X55,X56)) )
& ( in(X54,X56)
| ~ in(ordered_pair(X53,X54),cartesian_product2(X55,X56)) )
& ( ~ in(X53,X55)
| ~ in(X54,X56)
| in(ordered_pair(X53,X54),cartesian_product2(X55,X56)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])]) ).
fof(c_0_33,plain,
! [X1] :
( ! [X2,X3,X4] :
( ( in(X2,X1)
& X3 = singleton(X2)
& in(X2,X1)
& X4 = singleton(X2) )
=> X3 = X4 )
=> ? [X2] :
! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& X3 = singleton(X4) ) ) ),
inference(fof_simplification,[status(thm)],[s1_tarski__e16_22__wellord2__1]) ).
cnf(c_0_34,plain,
( in(esk10_3(X1,X2,X3),X1)
| ~ in(X3,esk9_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
( in(esk2_1(X1),esk1_0)
| in(ordered_pair(esk2_1(X1),esk3_1(X1)),X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,negated_conjecture,
esk3_1(esk9_2(X1,X2)) = singleton(esk2_1(esk9_2(X1,X2))),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_19]) ).
cnf(c_0_37,negated_conjecture,
( ~ in(ordered_pair(esk2_1(X1),esk3_1(X1)),X1)
| ~ in(esk2_1(X1),esk1_0)
| esk3_1(X1) != singleton(esk2_1(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( in(X1,esk9_2(X2,X3))
| ~ in(X1,cartesian_product2(X2,X3))
| ordered_pair(X4,X5) != X1
| ~ in(X4,X2)
| X5 != singleton(X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_39,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_40,plain,
! [X14,X19,X21,X22] :
( ( in(esk8_2(X14,X19),X14)
| ~ in(X19,esk7_1(X14))
| in(esk4_1(X14),X14) )
& ( X19 = singleton(esk8_2(X14,X19))
| ~ in(X19,esk7_1(X14))
| in(esk4_1(X14),X14) )
& ( ~ in(X22,X14)
| X21 != singleton(X22)
| in(X21,esk7_1(X14))
| in(esk4_1(X14),X14) )
& ( in(esk8_2(X14,X19),X14)
| ~ in(X19,esk7_1(X14))
| esk5_1(X14) = singleton(esk4_1(X14)) )
& ( X19 = singleton(esk8_2(X14,X19))
| ~ in(X19,esk7_1(X14))
| esk5_1(X14) = singleton(esk4_1(X14)) )
& ( ~ in(X22,X14)
| X21 != singleton(X22)
| in(X21,esk7_1(X14))
| esk5_1(X14) = singleton(esk4_1(X14)) )
& ( in(esk8_2(X14,X19),X14)
| ~ in(X19,esk7_1(X14))
| in(esk4_1(X14),X14) )
& ( X19 = singleton(esk8_2(X14,X19))
| ~ in(X19,esk7_1(X14))
| in(esk4_1(X14),X14) )
& ( ~ in(X22,X14)
| X21 != singleton(X22)
| in(X21,esk7_1(X14))
| in(esk4_1(X14),X14) )
& ( in(esk8_2(X14,X19),X14)
| ~ in(X19,esk7_1(X14))
| esk6_1(X14) = singleton(esk4_1(X14)) )
& ( X19 = singleton(esk8_2(X14,X19))
| ~ in(X19,esk7_1(X14))
| esk6_1(X14) = singleton(esk4_1(X14)) )
& ( ~ in(X22,X14)
| X21 != singleton(X22)
| in(X21,esk7_1(X14))
| esk6_1(X14) = singleton(esk4_1(X14)) )
& ( in(esk8_2(X14,X19),X14)
| ~ in(X19,esk7_1(X14))
| esk5_1(X14) != esk6_1(X14) )
& ( X19 = singleton(esk8_2(X14,X19))
| ~ in(X19,esk7_1(X14))
| esk5_1(X14) != esk6_1(X14) )
& ( ~ in(X22,X14)
| X21 != singleton(X22)
| in(X21,esk7_1(X14))
| esk5_1(X14) != esk6_1(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])])])]) ).
cnf(c_0_41,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),esk9_2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_34,c_0_15]) ).
cnf(c_0_42,negated_conjecture,
( in(ordered_pair(esk2_1(esk9_2(X1,X2)),singleton(esk2_1(esk9_2(X1,X2)))),esk9_2(X1,X2))
| in(esk2_1(esk9_2(X1,X2)),esk1_0) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_31])]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( ~ in(ordered_pair(esk2_1(esk9_2(X1,X2)),singleton(esk2_1(esk9_2(X1,X2)))),esk9_2(X1,X2))
| ~ in(esk2_1(esk9_2(X1,X2)),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_30]),c_0_31])]) ).
cnf(c_0_44,plain,
( in(ordered_pair(X1,singleton(X1)),esk9_2(X2,X3))
| ~ in(ordered_pair(X1,singleton(X1)),cartesian_product2(X2,X3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_38])]),c_0_39]) ).
cnf(c_0_45,plain,
( in(X3,esk7_1(X2))
| esk6_1(X2) = singleton(esk4_1(X2))
| ~ in(X1,X2)
| X3 != singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( in(esk2_1(esk9_2(X1,X2)),esk1_0)
| in(esk2_1(esk9_2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( in(X3,esk7_1(X2))
| esk5_1(X2) = singleton(esk4_1(X2))
| ~ in(X1,X2)
| X3 != singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( ~ in(ordered_pair(esk2_1(esk9_2(X1,X2)),singleton(esk2_1(esk9_2(X1,X2)))),cartesian_product2(X1,X2))
| ~ in(esk2_1(esk9_2(X1,X2)),esk1_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| ~ in(X1,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_50,plain,
( esk6_1(X1) = singleton(esk4_1(X1))
| in(singleton(X2),esk7_1(X1))
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
in(esk2_1(esk9_2(esk1_0,X1)),esk1_0),
inference(ef,[status(thm)],[c_0_46]) ).
cnf(c_0_52,plain,
( esk5_1(X1) = singleton(esk4_1(X1))
| in(singleton(X2),esk7_1(X1))
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_53,plain,
( in(X3,esk7_1(X2))
| ~ in(X1,X2)
| X3 != singleton(X1)
| esk5_1(X2) != esk6_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_54,negated_conjecture,
( ~ in(singleton(esk2_1(esk9_2(X1,X2))),X2)
| ~ in(esk2_1(esk9_2(X1,X2)),esk1_0)
| ~ in(esk2_1(esk9_2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( esk6_1(esk1_0) = singleton(esk4_1(esk1_0))
| in(singleton(esk2_1(esk9_2(esk1_0,X1))),esk7_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( esk5_1(esk1_0) = singleton(esk4_1(esk1_0))
| in(singleton(esk2_1(esk9_2(esk1_0,X1))),esk7_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_57,plain,
( in(singleton(X1),esk7_1(X2))
| esk6_1(X2) != esk5_1(X2)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_58,negated_conjecture,
esk6_1(esk1_0) = singleton(esk4_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_51])]) ).
cnf(c_0_59,negated_conjecture,
esk5_1(esk1_0) = singleton(esk4_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_56]),c_0_51])]) ).
cnf(c_0_60,negated_conjecture,
in(singleton(esk2_1(esk9_2(esk1_0,X1))),esk7_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_51]),c_0_58]),c_0_59])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_60]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU282+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n023.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.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 08:47:07 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.xT3DmT69b9/E---3.1_29736.p
% 9.74/1.68 # Version: 3.1pre001
% 9.74/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 9.74/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.74/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.74/1.68 # Starting new_bool_3 with 300s (1) cores
% 9.74/1.68 # Starting new_bool_1 with 300s (1) cores
% 9.74/1.68 # Starting sh5l with 300s (1) cores
% 9.74/1.68 # sh5l with pid 29817 completed with status 0
% 9.74/1.68 # Result found by sh5l
% 9.74/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 9.74/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.74/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.74/1.68 # Starting new_bool_3 with 300s (1) cores
% 9.74/1.68 # Starting new_bool_1 with 300s (1) cores
% 9.74/1.68 # Starting sh5l with 300s (1) cores
% 9.74/1.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 9.74/1.68 # Search class: FGHSS-FFMM31-SFFFFFNN
% 9.74/1.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 9.74/1.68 # Starting U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 9.74/1.68 # U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 29818 completed with status 0
% 9.74/1.68 # Result found by U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 9.74/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 9.74/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.74/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.74/1.68 # Starting new_bool_3 with 300s (1) cores
% 9.74/1.68 # Starting new_bool_1 with 300s (1) cores
% 9.74/1.68 # Starting sh5l with 300s (1) cores
% 9.74/1.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 9.74/1.68 # Search class: FGHSS-FFMM31-SFFFFFNN
% 9.74/1.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 9.74/1.68 # Starting U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 9.74/1.68 # Preprocessing time : 0.002 s
% 9.74/1.68 # Presaturation interreduction done
% 9.74/1.68
% 9.74/1.68 # Proof found!
% 9.74/1.68 # SZS status Theorem
% 9.74/1.68 # SZS output start CNFRefutation
% See solution above
% 9.74/1.68 # Parsed axioms : 46
% 9.74/1.68 # Removed by relevancy pruning/SinE : 6
% 9.74/1.68 # Initial clauses : 96
% 9.74/1.68 # Removed in clause preprocessing : 3
% 9.74/1.68 # Initial clauses in saturation : 93
% 9.74/1.68 # Processed clauses : 6073
% 9.74/1.68 # ...of these trivial : 119
% 9.74/1.68 # ...subsumed : 4446
% 9.74/1.68 # ...remaining for further processing : 1508
% 9.74/1.68 # Other redundant clauses eliminated : 31
% 9.74/1.68 # Clauses deleted for lack of memory : 0
% 9.74/1.68 # Backward-subsumed : 141
% 9.74/1.68 # Backward-rewritten : 268
% 9.74/1.68 # Generated clauses : 97498
% 9.74/1.68 # ...of the previous two non-redundant : 86321
% 9.74/1.68 # ...aggressively subsumed : 0
% 9.74/1.68 # Contextual simplify-reflections : 30
% 9.74/1.68 # Paramodulations : 97459
% 9.74/1.68 # Factorizations : 4
% 9.74/1.68 # NegExts : 0
% 9.74/1.68 # Equation resolutions : 36
% 9.74/1.68 # Total rewrite steps : 22681
% 9.74/1.68 # Propositional unsat checks : 0
% 9.74/1.68 # Propositional check models : 0
% 9.74/1.68 # Propositional check unsatisfiable : 0
% 9.74/1.68 # Propositional clauses : 0
% 9.74/1.68 # Propositional clauses after purity: 0
% 9.74/1.68 # Propositional unsat core size : 0
% 9.74/1.68 # Propositional preprocessing time : 0.000
% 9.74/1.68 # Propositional encoding time : 0.000
% 9.74/1.68 # Propositional solver time : 0.000
% 9.74/1.68 # Success case prop preproc time : 0.000
% 9.74/1.68 # Success case prop encoding time : 0.000
% 9.74/1.68 # Success case prop solver time : 0.000
% 9.74/1.68 # Current number of processed clauses : 1006
% 9.74/1.68 # Positive orientable unit clauses : 131
% 9.74/1.68 # Positive unorientable unit clauses: 1
% 9.74/1.68 # Negative unit clauses : 25
% 9.74/1.68 # Non-unit-clauses : 849
% 9.74/1.68 # Current number of unprocessed clauses: 79545
% 9.74/1.68 # ...number of literals in the above : 280102
% 9.74/1.68 # Current number of archived formulas : 0
% 9.74/1.68 # Current number of archived clauses : 496
% 9.74/1.68 # Clause-clause subsumption calls (NU) : 191254
% 9.74/1.68 # Rec. Clause-clause subsumption calls : 121200
% 9.74/1.68 # Non-unit clause-clause subsumptions : 3402
% 9.74/1.68 # Unit Clause-clause subsumption calls : 5218
% 9.74/1.68 # Rewrite failures with RHS unbound : 0
% 9.74/1.68 # BW rewrite match attempts : 783
% 9.74/1.68 # BW rewrite match successes : 35
% 9.74/1.68 # Condensation attempts : 0
% 9.74/1.68 # Condensation successes : 0
% 9.74/1.68 # Termbank termtop insertions : 3928387
% 9.74/1.68
% 9.74/1.68 # -------------------------------------------------
% 9.74/1.68 # User time : 1.139 s
% 9.74/1.68 # System time : 0.046 s
% 9.74/1.68 # Total time : 1.185 s
% 9.74/1.68 # Maximum resident set size: 1892 pages
% 9.74/1.68
% 9.74/1.68 # -------------------------------------------------
% 9.74/1.68 # User time : 1.141 s
% 9.74/1.68 # System time : 0.048 s
% 9.74/1.68 # Total time : 1.188 s
% 9.74/1.68 # Maximum resident set size: 1732 pages
% 9.74/1.68 % E---3.1 exiting
% 9.74/1.68 % E---3.1 exiting
%------------------------------------------------------------------------------