%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC356+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:44:04 PM UTC 2026
% Result : Timeout 293.70s 37.80s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 84 ( 21 unt; 0 def)
% Number of atoms : 360 ( 113 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 464 ( 188 ~; 190 |; 40 &)
% ( 3 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 144 ( 0 sgn 70 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_14,plain,
! [X90,X91,X92] :
( X92 = X90
| app(X92,X91) != app(X90,X91)
| ~ ssList(X92)
| ~ ssList(X91)
| ~ ssList(X90) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_15,plain,
! [X96,X97,X98] :
( app(app(X96,X97),X98) = app(X96,app(X97,X98))
| ~ ssList(X98)
| ~ ssList(X97)
| ~ ssList(X96) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_16,plain,
! [X87,X88] :
( ssList(app(X87,X88))
| ~ ssList(X88)
| ~ ssList(X87) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_17,plain,
! [X89] :
( app(nil,X89) = X89
| ~ ssList(X89) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( app(X3,X2) != app(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_24,negated_conjecture,
! [X12] :
( ( ~ leq(X12,esk5_0)
| ~ memberP(esk4_0,X12)
| esk5_0 = X12
| ~ ssItem(X12)
| nil = esk3_0 )
& ( ~ leq(X12,esk5_0)
| ~ memberP(esk4_0,X12)
| esk5_0 = X12
| ~ ssItem(X12)
| nil = esk4_0 )
& ( memberP(esk4_0,esk5_0)
| nil = esk3_0 )
& ( memberP(esk4_0,esk5_0)
| nil = esk4_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 )
& ( ssItem(esk5_0)
| nil = esk3_0 )
& ( ssItem(esk5_0)
| nil = esk4_0 )
& ~ segmentP(esk2_0,esk1_0)
& neq(esk2_0,nil)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
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)],[c_0_18])])])])])]) ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,X4) != app(X2,app(X3,X4))
| X1 = app(X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_29,plain,
! [X99,X100] :
( ( ~ ssList(X99)
| ~ ssList(X100)
| nil = app(X99,X100)
| nil != X99
| nil != X100 )
& ( ~ ssList(X99)
| ~ ssList(X100)
| nil != app(X99,X100)
| nil = X99 )
& ( ~ ssList(X99)
| ~ ssList(X100)
| nil != app(X99,X100)
| nil = X100 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,X3) != app(X2,X3)
| X1 = app(nil,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X93,X94,X95] :
( X95 = X93
| app(X94,X95) != app(X94,X93)
| ~ ssList(X95)
| ~ ssList(X94)
| ~ ssList(X93) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_34,plain,
! [X101] :
( app(X101,nil) = X101
| ~ ssList(X101) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,plain,
! [X71,X72,X73,X74] :
( segmentP(app(app(X73,X71),X74),X72)
| ~ segmentP(X71,X72)
| ~ ssList(X74)
| ~ ssList(X73)
| ~ ssList(X72)
| ~ ssList(X71) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,esk4_0) != app(X2,esk4_0)
| X1 = app(nil,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_39,plain,
! [X57,X58] :
( cons(X58,X57) = app(cons(X58,nil),X57)
| ~ ssItem(X58)
| ~ ssList(X57) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_40,plain,
! [X59,X60,X63,X64] :
( ( ~ ssList(X59)
| ~ ssList(X60)
| segmentP(X59,X60)
| app(app(X63,X60),X64) != X59
| ~ ssList(X64)
| ~ ssList(X63) )
& ( ~ ssList(X59)
| ~ ssList(X60)
| ~ segmentP(X59,X60)
| app(app(esk12_2(X59,X60),X60),esk13_2(X59,X60)) = X59 )
& ( ~ ssList(X59)
| ~ ssList(X60)
| ~ segmentP(X59,X60)
| ssList(esk13_2(X59,X60)) )
& ( ~ ssList(X59)
| ~ ssList(X60)
| ~ segmentP(X59,X60)
| ssList(esk12_2(X59,X60)) ) ),
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])])])])])]) ).
cnf(c_0_41,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]),c_0_23])]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_21]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_46,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(X1)
| app(esk4_0,esk4_0) != app(X1,esk4_0)
| app(nil,X1) = esk4_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_31]) ).
cnf(c_0_48,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_50,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_51,plain,
! [X31,X32,X35,X36] :
( ( ~ ssList(X31)
| ~ ssItem(X32)
| memberP(X31,X32)
| app(X35,cons(X32,X36)) != X31
| ~ ssList(X36)
| ~ ssList(X35) )
& ( ~ ssList(X31)
| ~ ssItem(X32)
| ~ memberP(X31,X32)
| app(esk8_2(X31,X32),cons(X32,esk9_2(X31,X32))) = X31 )
& ( ~ ssList(X31)
| ~ ssItem(X32)
| ~ memberP(X31,X32)
| ssList(esk9_2(X31,X32)) )
& ( ~ ssList(X31)
| ~ ssItem(X32)
| ~ memberP(X31,X32)
| ssList(esk8_2(X31,X32)) ) ),
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_52,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_40]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| app(nil,X1) != nil
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_23])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_20]),c_0_23])]),c_0_21]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ssList(app(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_42]),c_0_23])]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(X1)
| app(esk3_0,esk4_0) != app(X1,esk4_0)
| app(nil,X1) = esk3_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_45]) ).
cnf(c_0_57,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_22]),c_0_23])]) ).
cnf(c_0_59,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_31])]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(X1)
| esk3_0 = nil
| cons(esk5_0,X1) = app(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk9_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| app(nil,X1) != nil
| app(X1,nil) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_23])]),c_0_55]) ).
cnf(c_0_64,negated_conjecture,
app(nil,esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_56]),c_0_45])]) ).
cnf(c_0_65,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_28]),c_0_36]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| segmentP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_31]),c_0_23])]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| esk3_0 = nil
| cons(esk5_0,esk9_2(X1,X2)) = app(esk3_0,esk9_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_22]),c_0_23])]),c_0_21]) ).
cnf(c_0_70,negated_conjecture,
( esk3_0 != nil
| app(esk3_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_45])]) ).
cnf(c_0_71,negated_conjecture,
~ segmentP(nil,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_45])]) ).
cnf(c_0_72,negated_conjecture,
( esk3_0 = nil
| cons(esk5_0,esk9_2(esk4_0,esk5_0)) = app(esk3_0,esk9_2(esk4_0,esk5_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_31])]),c_0_50]) ).
cnf(c_0_73,negated_conjecture,
esk3_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_45]),c_0_23])]),c_0_71]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_75,negated_conjecture,
cons(esk5_0,esk9_2(esk4_0,esk5_0)) = app(esk3_0,esk9_2(esk4_0,esk5_0)),
inference(sr,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_68,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_50,c_0_73]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(X1,app(X2,X3)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_20]),c_0_44]) ).
cnf(c_0_79,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),app(esk3_0,esk9_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_31]),c_0_77])]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(esk8_2(esk4_0,esk5_0))
| ~ ssList(esk9_2(esk4_0,esk5_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_45])]),c_0_65]) ).
cnf(c_0_81,negated_conjecture,
~ ssList(esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_61]),c_0_76]),c_0_31]),c_0_77])]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk8_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_76]),c_0_31]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC356+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:18:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.44 Running first-order theorem proving
% 0.10/0.44 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 293.70/37.80 % Version: 3.5.1
% 293.70/37.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 293.70/37.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 293.70/37.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 293.70/37.80 % Starting new_bool_3 with 300s (1) cores
% 293.70/37.80 % Starting new_bool_1 with 300s (1) cores
% 293.70/37.80 % Starting sh5l with 300s (1) cores
% 293.70/37.80 % new_bool_3 with pid 1440323 completed with status 0
% 293.70/37.80 % Result found by new_bool_3
% 293.70/37.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 293.70/37.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 293.70/37.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 293.70/37.80 % Starting new_bool_3 with 300s (1) cores
% 293.70/37.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 293.70/37.80 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 293.70/37.80 % Search class: FGHSF-FFMM21-MFFFFFNN
% 293.70/37.80 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 293.70/37.80 % Starting SubtermCWHack with 31s (1) cores
% 293.70/37.80 % SubtermCWHack with pid 1440328 completed with status 8
% 293.70/37.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 293.70/37.80 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1440339 completed with status 0
% 293.70/37.80 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 293.70/37.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 293.70/37.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 293.70/37.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 293.70/37.80 % Starting new_bool_3 with 300s (1) cores
% 293.70/37.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 293.70/37.80 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 293.70/37.80 % Search class: FGHSF-FFMM21-MFFFFFNN
% 293.70/37.80 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 293.70/37.80 % Starting SubtermCWHack with 31s (1) cores
% 293.70/37.80 % SubtermCWHack with pid 1440328 completed with status 8
% 293.70/37.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 293.70/37.80 % Preprocessing time : 0.003 s
% 293.70/37.80 % Presaturation interreduction done
% 293.70/37.80
% 293.70/37.80 % Proof found!
% 293.70/37.80 % SZS status Theorem
% 293.70/37.80 % SZS output start CNFRefutation
% See solution above
% 293.70/37.81 % Parsed axioms : 96
% 293.70/37.81 % Removed by relevancy pruning/SinE : 57
% 293.70/37.81 % Initial clauses : 76
% 293.70/37.81 % Removed in clause preprocessing : 0
% 293.70/37.81 % Initial clauses in saturation : 76
% 293.70/37.81 % Processed clauses : 11405
% 293.70/37.81 % ...of these trivial : 432
% 293.70/37.81 % ...subsumed : 7235
% 293.70/37.81 % ...remaining for further processing : 3738
% 293.70/37.81 % Other redundant clauses eliminated : 73
% 293.70/37.81 % Clauses deleted for lack of memory : 0
% 293.70/37.81 % Backward-subsumed : 404
% 293.70/37.81 % Backward-rewritten : 315
% 293.70/37.81 % Generated clauses : 178072
% 293.70/37.81 % ...of the previous two non-redundant : 175038
% 293.70/37.81 % ...aggressively subsumed : 0
% 293.70/37.81 % Contextual simplify-reflections : 892
% 293.70/37.81 % Paramodulations : 177651
% 293.70/37.81 % Factorizations : 0
% 293.70/37.81 % NegExts : 0
% 293.70/37.81 % Equation resolutions : 106
% 293.70/37.81 % Disequality decompositions : 0
% 293.70/37.81 % Total rewrite steps : 75043
% 293.70/37.81 % ...of those cached : 74698
% 293.70/37.81 % Propositional unsat checks : 0
% 293.70/37.81 % Propositional check models : 0
% 293.70/37.81 % Propositional check unsatisfiable : 0
% 293.70/37.81 % Propositional clauses : 0
% 293.70/37.81 % Propositional clauses after purity: 0
% 293.70/37.81 % Propositional unsat core size : 0
% 293.70/37.81 % Propositional preprocessing time : 0.000
% 293.70/37.81 % Propositional encoding time : 0.000
% 293.70/37.81 % Propositional solver time : 0.000
% 293.70/37.81 % Success case prop preproc time : 0.000
% 293.70/37.81 % Success case prop encoding time : 0.000
% 293.70/37.81 % Success case prop solver time : 0.000
% 293.70/37.81 % Current number of processed clauses : 2623
% 293.70/37.81 % Positive orientable unit clauses : 476
% 293.70/37.81 % Positive unorientable unit clauses: 0
% 293.70/37.81 % Negative unit clauses : 243
% 293.70/37.81 % Non-unit-clauses : 1904
% 293.70/37.81 % Current number of unprocessed clauses: 157507
% 293.70/37.81 % ...number of literals in the above : 622058
% 293.70/37.81 % Current number of archived formulas : 0
% 293.70/37.81 % Current number of archived clauses : 1107
% 293.70/37.81 % Clause-clause subsumption calls (NU) : 356301
% 293.70/37.81 % Rec. Clause-clause subsumption calls : 116464
% 293.70/37.81 % Non-unit clause-clause subsumptions : 6135
% 293.70/37.81 % Unit Clause-clause subsumption calls : 15896
% 293.70/37.81 % Rewrite failures with RHS unbound : 0
% 293.70/37.81 % BW rewrite match attempts : 4592
% 293.70/37.81 % BW rewrite match successes : 81
% 293.70/37.81 % Condensation attempts : 0
% 293.70/37.81 % Condensation successes : 0
% 293.70/37.81 % Termbank termtop insertions : 4510021
% 293.70/37.81 % Search garbage collected termcells : 2031
% 293.70/37.81
% 293.70/37.81 % -------------------------------------------------
% 293.70/37.81 % User time : 35.275 s
% 293.70/37.81 % System time : 1.411 s
% 293.70/37.81 % Total time : 36.687 s
% 293.70/37.81 % Maximum resident set size: 3716 pages
% 293.70/37.81
% 293.70/37.81 % -------------------------------------------------
% 293.70/37.81 % User time : 35.284 s
% 293.70/37.81 % System time : 1.418 s
% 293.70/37.81 % Total time : 36.703 s
% 293.70/37.81 % Maximum resident set size: 4864 pages
% 293.70/37.81 % E exiting
%------------------------------------------------------------------------------