%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC126+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:43:07 PM UTC 2026
% Result : Theorem 90.07s 13.58s
% Output : CNFRefutation 90.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 18 unt; 0 def)
% Number of atoms : 286 ( 50 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 361 ( 146 ~; 139 |; 33 &)
% ( 4 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 61 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(X3,cons(X2,X4)) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X2,X3)
& segmentP(X1,X2) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_14,negated_conjecture,
( ( ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil) )
& ( ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil)
| neq(esk49_0,nil) )
& ( memberP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) )
& ( memberP(esk51_0,esk52_0)
| neq(esk49_0,nil) )
& ( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) )
& ( cons(esk52_0,nil) = esk50_0
| neq(esk49_0,nil) )
& ( ssItem(esk52_0)
| ~ neq(esk51_0,nil) )
& ( ssItem(esk52_0)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ neq(esk51_0,nil) )
& ( neq(esk49_0,nil)
| neq(esk49_0,nil) )
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
cnf(c_0_15,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_16,plain,
! [X28,X29,X32,X33] :
( ( ~ ssList(X28)
| ~ ssList(X29)
| segmentP(X28,X29)
| app(app(X32,X29),X33) != X28
| ~ ssList(X33)
| ~ ssList(X32) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28 )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk9_2(X28,X29)) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk8_2(X28,X29)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])]) ).
fof(c_0_17,plain,
! [X135] :
( app(nil,X135) = X135
| ~ ssList(X135) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_18,plain,
! [X220,X221] :
( cons(X221,X220) = app(cons(X221,nil),X220)
| ~ ssItem(X221)
| ~ ssList(X220) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(esk51_0,nil)
| cons(esk52_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(esk51_0,nil)
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X227] :
( app(X227,nil) = X227
| ~ ssList(X227) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_25,plain,
! [X130,X131] :
( ssList(app(X130,X131))
| ~ ssList(X131)
| ~ ssList(X130) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_26,plain,
! [X11,X12,X15,X16] :
( ( ~ ssList(X11)
| ~ ssItem(X12)
| memberP(X11,X12)
| app(X15,cons(X12,X16)) != X11
| ~ ssList(X16)
| ~ ssList(X15) )
& ( ~ ssList(X11)
| ~ ssItem(X12)
| ~ memberP(X11,X12)
| app(esk3_2(X11,X12),cons(X12,esk4_2(X11,X12))) = X11 )
& ( ~ ssList(X11)
| ~ ssItem(X12)
| ~ memberP(X11,X12)
| ssList(esk4_2(X11,X12)) )
& ( ~ ssList(X11)
| ~ ssItem(X12)
| ~ memberP(X11,X12)
| ssList(esk3_2(X11,X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ neq(esk51_0,nil)
| memberP(esk51_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,negated_conjecture,
cons(esk52_0,nil) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_21]),c_0_22])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(esk3_2(X1,X2),cons(X2,esk4_2(X1,X2))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,negated_conjecture,
memberP(esk49_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_21]),c_0_21]),c_0_22])]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(X1)
| app(esk48_0,X1) = cons(esk52_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X3,X2) != X1
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_34]),c_0_30])]),c_0_35]) ).
cnf(c_0_44,negated_conjecture,
app(esk3_2(esk49_0,esk52_0),cons(esk52_0,esk4_2(esk49_0,esk52_0))) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_33])]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk3_2(esk49_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_37]),c_0_38]),c_0_33])]) ).
fof(c_0_46,plain,
! [X184,X185,X186] :
( segmentP(X184,X186)
| ~ segmentP(X185,X186)
| ~ segmentP(X184,X185)
| ~ ssList(X186)
| ~ ssList(X185)
| ~ ssList(X184) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| cons(esk52_0,X2) != X1
| segmentP(X1,esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X1)
| ssList(cons(esk52_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_41]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(esk52_0,esk4_2(esk49_0,esk52_0)))
| esk49_0 != X1
| segmentP(X1,cons(esk52_0,esk4_2(esk49_0,esk52_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
fof(c_0_50,plain,
! [X111,X112] :
( ssList(cons(X112,X111))
| ~ ssItem(X112)
| ~ ssList(X111) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_52,plain,
( ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(X1)
| segmentP(cons(esk52_0,X1),esk48_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(cons(esk52_0,esk4_2(esk49_0,esk52_0)))
| segmentP(esk49_0,cons(esk52_0,esk4_2(esk49_0,esk52_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_38])]) ).
cnf(c_0_55,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk4_2(esk49_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_37]),c_0_38]),c_0_33])]) ).
fof(c_0_57,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_58,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X1,cons(esk52_0,X2))
| segmentP(X1,esk48_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_42])]),c_0_48]) ).
cnf(c_0_60,negated_conjecture,
segmentP(esk49_0,cons(esk52_0,esk4_2(esk49_0,esk52_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_33])]) ).
fof(c_0_61,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_62,plain,
! [X122,X123] :
( nil != cons(X123,X122)
| ~ ssItem(X123)
| ~ ssList(X122) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])])])]) ).
cnf(c_0_63,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_21]),c_0_22])]) ).
cnf(c_0_64,negated_conjecture,
segmentP(esk49_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_38]),c_0_56])]) ).
fof(c_0_65,plain,
! [X109,X110] :
( ( ~ ssList(X109)
| ~ ssList(X110)
| neq(X109,X110)
| X109 = X110 )
& ( ~ ssList(X109)
| ~ ssList(X110)
| X109 != X110
| ~ neq(X109,X110) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])])]) ).
cnf(c_0_66,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_67,negated_conjecture,
~ neq(esk48_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,negated_conjecture,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_32]),c_0_30]),c_0_33])]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_30]),c_0_42])]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC126+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n002.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 08:00:16 UTC 2026
% 0.18/0.47 % CPUTime :
% 0.18/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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/benchmark/theBenchmark.p
% 90.07/13.58 % Version: 3.5.1
% 90.07/13.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 90.07/13.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 90.07/13.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 90.07/13.58 % Starting new_bool_3 with 300s (1) cores
% 90.07/13.58 % Starting new_bool_1 with 300s (1) cores
% 90.07/13.58 % Starting sh5l with 300s (1) cores
% 90.07/13.58 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2819675 completed with status 0
% 90.07/13.58 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 90.07/13.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 90.07/13.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 90.07/13.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 90.07/13.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 90.07/13.58 % No SInE strategy applied
% 90.07/13.58 % Search class: FGHSF-FSLM21-MFFFFFNN
% 90.07/13.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 90.07/13.58 % Starting SubtermCWHack with 136s (1) cores
% 90.07/13.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 90.07/13.58 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 90.07/13.58 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 90.07/13.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 90.07/13.58 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 2819682 completed with status 0
% 90.07/13.58 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 90.07/13.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 90.07/13.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 90.07/13.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 90.07/13.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 90.07/13.58 % No SInE strategy applied
% 90.07/13.58 % Search class: FGHSF-FSLM21-MFFFFFNN
% 90.07/13.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 90.07/13.58 % Starting SubtermCWHack with 136s (1) cores
% 90.07/13.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 90.07/13.58 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 90.07/13.58 % Preprocessing time : 0.006 s
% 90.07/13.58
% 90.07/13.58 % Proof found!
% 90.07/13.58 % SZS status Theorem
% 90.07/13.58 % SZS output start CNFRefutation
% See solution above
% 90.07/13.58 % Parsed axioms : 96
% 90.07/13.58 % Removed by relevancy pruning/SinE : 0
% 90.07/13.58 % Initial clauses : 206
% 90.07/13.58 % Removed in clause preprocessing : 2
% 90.07/13.58 % Initial clauses in saturation : 204
% 90.07/13.58 % Processed clauses : 27645
% 90.07/13.58 % ...of these trivial : 436
% 90.07/13.58 % ...subsumed : 18828
% 90.07/13.58 % ...remaining for further processing : 8381
% 90.07/13.58 % Other redundant clauses eliminated : 1091
% 90.07/13.58 % Clauses deleted for lack of memory : 0
% 90.07/13.58 % Backward-subsumed : 775
% 90.07/13.58 % Backward-rewritten : 934
% 90.07/13.58 % Generated clauses : 208652
% 90.07/13.58 % ...of the previous two non-redundant : 190876
% 90.07/13.58 % ...aggressively subsumed : 0
% 90.07/13.58 % Contextual simplify-reflections : 3114
% 90.07/13.58 % Paramodulations : 206912
% 90.07/13.58 % Factorizations : 2
% 90.07/13.58 % NegExts : 0
% 90.07/13.58 % Equation resolutions : 1705
% 90.07/13.58 % Disequality decompositions : 0
% 90.07/13.58 % Total rewrite steps : 261585
% 90.07/13.58 % ...of those cached : 260642
% 90.07/13.58 % Propositional unsat checks : 0
% 90.07/13.58 % Propositional check models : 0
% 90.07/13.58 % Propositional check unsatisfiable : 0
% 90.07/13.58 % Propositional clauses : 0
% 90.07/13.58 % Propositional clauses after purity: 0
% 90.07/13.58 % Propositional unsat core size : 0
% 90.07/13.58 % Propositional preprocessing time : 0.000
% 90.07/13.58 % Propositional encoding time : 0.000
% 90.07/13.58 % Propositional solver time : 0.000
% 90.07/13.58 % Success case prop preproc time : 0.000
% 90.07/13.58 % Success case prop encoding time : 0.000
% 90.07/13.58 % Success case prop solver time : 0.000
% 90.07/13.58 % Current number of processed clauses : 6633
% 90.07/13.58 % Positive orientable unit clauses : 1095
% 90.07/13.58 % Positive unorientable unit clauses: 0
% 90.07/13.58 % Negative unit clauses : 266
% 90.07/13.58 % Non-unit-clauses : 5272
% 90.07/13.58 % Current number of unprocessed clauses: 160409
% 90.07/13.58 % ...number of literals in the above : 1065901
% 90.07/13.58 % Current number of archived formulas : 0
% 90.07/13.58 % Current number of archived clauses : 1742
% 90.07/13.58 % Clause-clause subsumption calls (NU) : 2685318
% 90.07/13.58 % Rec. Clause-clause subsumption calls : 1092952
% 90.07/13.58 % Non-unit clause-clause subsumptions : 16772
% 90.07/13.58 % Unit Clause-clause subsumption calls : 44670
% 90.07/13.58 % Rewrite failures with RHS unbound : 0
% 90.07/13.58 % BW rewrite match attempts : 13856
% 90.07/13.58 % BW rewrite match successes : 337
% 90.07/13.58 % Condensation attempts : 0
% 90.07/13.58 % Condensation successes : 0
% 90.07/13.58 % Termbank termtop insertions : 6474735
% 90.07/13.58 % Search garbage collected termcells : 4286
% 90.07/13.58
% 90.07/13.58 % -------------------------------------------------
% 90.07/13.58 % User time : 12.540 s
% 90.07/13.58 % System time : 0.236 s
% 90.07/13.58 % Total time : 12.776 s
% 90.07/13.58 % Maximum resident set size: 4220 pages
% 90.07/13.58
% 90.07/13.58 % -------------------------------------------------
% 90.07/13.58 % User time : 62.433 s
% 90.07/13.58 % System time : 1.592 s
% 90.07/13.58 % Total time : 64.025 s
% 90.07/13.58 % Maximum resident set size: 4864 pages
% 90.07/13.58 % E exiting
%------------------------------------------------------------------------------