TSTP Solution File: SWC237+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC237+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 20:27:32 EDT 2022
% Result : Theorem 0.28s 5.47s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 74 ( 19 unt; 0 def)
% Number of atoms : 296 ( 102 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 371 ( 149 ~; 148 |; 41 &)
% ( 1 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 122 ( 0 sgn 61 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| lt(X5,X8) ) ) ) )
| ! [X9] :
( ~ ssList(X9)
| app(X3,X9) != X4
| ~ strictorderedP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X3
& lt(X12,X10) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| lt(X5,X8) ) ) ) )
| ! [X9] :
( ~ ssList(X9)
| app(X3,X9) != X4
| ~ strictorderedP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X3
& lt(X12,X10) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_16,negated_conjecture,
! [X18,X19,X20,X23,X24,X25,X26] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssItem(esk5_3(X18,X19,X20))
| ~ ssList(X20)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X19)
| ~ ssItem(X18) )
& ( memberP(X19,esk5_3(X18,X19,X20))
| ~ ssList(X20)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X19)
| ~ ssItem(X18) )
& ( memberP(X20,esk5_3(X18,X19,X20))
| ~ ssList(X20)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X19)
| ~ ssItem(X18) )
& ( leq(X18,esk5_3(X18,X19,X20))
| ~ ssList(X20)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X19)
| ~ ssItem(X18) )
& ( ~ lt(X18,esk5_3(X18,X19,X20))
| ~ ssList(X20)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X19)
| ~ ssItem(X18) )
& ssList(esk6_0)
& app(esk3_0,esk6_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X23)
| ~ ssList(X24)
| app(cons(X23,nil),X24) != esk6_0
| ~ ssItem(X25)
| ~ ssList(X26)
| app(X26,cons(X25,nil)) != esk3_0
| ~ lt(X25,X23) )
& ( nil = esk4_0
| nil != esk3_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)],[inference(fof_simplification,[status(thm)],[c_0_15])])])])])])])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(X3) ),
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)],[ax85])])])])]) ).
cnf(c_0_18,negated_conjecture,
app(esk3_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ),
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)],[ax27])])])])]) ).
fof(c_0_24,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_25,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_26,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
app(esk3_0,esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
nil != esk3_0,
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
fof(c_0_31,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_32,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_35,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
hd(esk3_0) = hd(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_37,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_38,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_39,negated_conjecture,
( memberP(X2,esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_40,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
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)],[ax16])])])])]) ).
fof(c_0_41,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
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)],[ax81])])])])]) ).
cnf(c_0_42,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_43,negated_conjecture,
cons(hd(esk2_0),tl(esk3_0)) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]),c_0_30]) ).
cnf(c_0_44,negated_conjecture,
ssItem(hd(esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_29])]),c_0_30]) ).
fof(c_0_45,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_46,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,negated_conjecture,
( memberP(X1,esk5_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_39,c_0_21]) ).
cnf(c_0_48,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_49,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_51,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| tl(app(X3,X4)) = app(tl(X3),X4) ),
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)],[ax86])])])])]) ).
fof(c_0_52,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
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)],[ax26])])])])]) ).
fof(c_0_53,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
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)],[ax83])])])])])]) ).
cnf(c_0_54,negated_conjecture,
( app(esk3_0,nil) = esk3_0
| ~ ssList(tl(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_55,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk3_0
| ~ ssList(X2)
| ~ ssItem(esk5_3(X1,nil,X2))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_34])]) ).
cnf(c_0_57,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_48,c_0_21]) ).
fof(c_0_58,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_59,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
( tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,negated_conjecture,
app(esk3_0,nil) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_29])]),c_0_30]) ).
cnf(c_0_64,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk3_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_34])]) ).
cnf(c_0_65,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_66,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_42]),c_0_34])]) ).
cnf(c_0_67,plain,
( app(cons(hd(X1),nil),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_50]),c_0_37]),c_0_55]) ).
cnf(c_0_68,plain,
( nil = X1
| ssList(app(tl(X1),X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_60]),c_0_61]),c_0_62]) ).
cnf(c_0_69,negated_conjecture,
app(tl(esk3_0),nil) = tl(esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_63]),c_0_34]),c_0_29])]),c_0_30]) ).
cnf(c_0_70,negated_conjecture,
( app(cons(X1,nil),X2) != esk3_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_71,negated_conjecture,
app(cons(hd(esk2_0),nil),tl(esk3_0)) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_36]),c_0_29])]),c_0_30]) ).
cnf(c_0_72,negated_conjecture,
ssList(tl(esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_34]),c_0_29])]),c_0_30]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC237+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.14 % Command : run_ET %s %d
% 0.13/0.36 % Computer : n017.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Sat Jun 11 20:14:51 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.28/5.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/5.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/5.47 # Preprocessing time : 0.025 s
% 0.28/5.47
% 0.28/5.47 # Proof found!
% 0.28/5.47 # SZS status Theorem
% 0.28/5.47 # SZS output start CNFRefutation
% See solution above
% 0.28/5.47 # Proof object total steps : 74
% 0.28/5.47 # Proof object clause steps : 44
% 0.28/5.47 # Proof object formula steps : 30
% 0.28/5.47 # Proof object conjectures : 28
% 0.28/5.47 # Proof object clause conjectures : 25
% 0.28/5.47 # Proof object formula conjectures : 3
% 0.28/5.47 # Proof object initial clauses used : 22
% 0.28/5.47 # Proof object initial formulas used : 15
% 0.28/5.47 # Proof object generating inferences : 17
% 0.28/5.47 # Proof object simplifying inferences : 47
% 0.28/5.47 # Training examples: 0 positive, 0 negative
% 0.28/5.47 # Parsed axioms : 96
% 0.28/5.47 # Removed by relevancy pruning/SinE : 52
% 0.28/5.47 # Initial clauses : 89
% 0.28/5.47 # Removed in clause preprocessing : 1
% 0.28/5.47 # Initial clauses in saturation : 88
% 0.28/5.47 # Processed clauses : 27783
% 0.28/5.47 # ...of these trivial : 791
% 0.28/5.47 # ...subsumed : 24523
% 0.28/5.47 # ...remaining for further processing : 2469
% 0.28/5.47 # Other redundant clauses eliminated : 45
% 0.28/5.47 # Clauses deleted for lack of memory : 0
% 0.28/5.47 # Backward-subsumed : 368
% 0.28/5.47 # Backward-rewritten : 10
% 0.28/5.47 # Generated clauses : 98892
% 0.28/5.47 # ...of the previous two non-trivial : 90468
% 0.28/5.47 # Contextual simplify-reflections : 21478
% 0.28/5.47 # Paramodulations : 98803
% 0.28/5.47 # Factorizations : 0
% 0.28/5.47 # Equation resolutions : 88
% 0.28/5.47 # Current number of processed clauses : 2088
% 0.28/5.47 # Positive orientable unit clauses : 31
% 0.28/5.47 # Positive unorientable unit clauses: 0
% 0.28/5.47 # Negative unit clauses : 7
% 0.28/5.47 # Non-unit-clauses : 2050
% 0.28/5.47 # Current number of unprocessed clauses: 60801
% 0.28/5.47 # ...number of literals in the above : 271845
% 0.28/5.47 # Current number of archived formulas : 0
% 0.28/5.47 # Current number of archived clauses : 379
% 0.28/5.47 # Clause-clause subsumption calls (NU) : 5884360
% 0.28/5.47 # Rec. Clause-clause subsumption calls : 3339247
% 0.28/5.47 # Non-unit clause-clause subsumptions : 41574
% 0.28/5.47 # Unit Clause-clause subsumption calls : 559
% 0.28/5.47 # Rewrite failures with RHS unbound : 0
% 0.28/5.47 # BW rewrite match attempts : 7
% 0.28/5.47 # BW rewrite match successes : 7
% 0.28/5.47 # Condensation attempts : 0
% 0.28/5.47 # Condensation successes : 0
% 0.28/5.47 # Termbank termtop insertions : 1464525
% 0.28/5.47
% 0.28/5.47 # -------------------------------------------------
% 0.28/5.47 # User time : 4.057 s
% 0.28/5.47 # System time : 0.037 s
% 0.28/5.47 # Total time : 4.094 s
% 0.28/5.47 # Maximum resident set size: 50744 pages
% 0.28/23.44 eprover: CPU time limit exceeded, terminating
% 0.28/23.44 eprover: CPU time limit exceeded, terminating
% 0.28/23.45 eprover: CPU time limit exceeded, terminating
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51 eprover: No such file or directory
% 0.28/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51 eprover: No such file or directory
% 0.28/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------