%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC087+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 : n003.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:42:56 PM UTC 2026
% Result : Theorem 0.13s 32.60s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 83 ( 11 unt; 0 def)
% Number of atoms : 371 ( 103 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 466 ( 178 ~; 187 |; 59 &)
% ( 3 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn 56 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X6] :
( ? [X7] :
( ? [X8] :
( neq(nil,X4)
& ? [X9] :
( neq(nil,X4)
& hd(X4) = X9
& cons(X9,nil) = X8
& ssItem(X9) )
& app(X7,X8) = X6
& tl(X4) = X7
& ssList(X8) )
& ssList(X7) )
& X3 != X6
& ssList(X6) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X6] :
( ? [X7] :
( ? [X8] :
( neq(nil,X4)
& ? [X9] :
( neq(nil,X4)
& hd(X4) = X9
& cons(X9,nil) = X8
& ssItem(X9) )
& app(X7,X8) = X6
& tl(X4) = X7
& ssList(X8) )
& ssList(X7) )
& X3 != X6
& ssList(X6) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X6] :
( ? [X7] :
( ? [X8] :
( neq(nil,X4)
& ? [X9] :
( neq(nil,X4)
& hd(X4) = X9
& cons(X9,nil) = X8
& ssItem(X9) )
& app(X7,X8) = X6
& tl(X4) = X7
& ssList(X8) )
& ssList(X7) )
& X3 != X6
& ssList(X6) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_15,negated_conjecture,
! [X14,X15,X16,X17,X18] :
( ( ~ neq(nil,esk4_0)
| ~ neq(nil,esk4_0)
| hd(esk4_0) != X18
| cons(X18,nil) != X17
| ~ ssItem(X18)
| app(X16,X17) != X15
| tl(esk4_0) != X16
| ~ ssList(X17)
| ~ ssList(X16)
| esk3_0 = X15
| ~ ssList(X15)
| ~ neq(esk4_0,nil) )
& ( ~ neq(nil,esk4_0)
| ~ neq(nil,esk4_0)
| hd(esk4_0) != X18
| cons(X18,nil) != X17
| ~ ssItem(X18)
| app(X16,X17) != X15
| tl(esk4_0) != X16
| ~ ssList(X17)
| ~ ssList(X16)
| esk3_0 = X15
| ~ ssList(X15)
| neq(esk2_0,nil) )
& ( ~ segmentP(esk1_0,X14)
| ~ segmentP(esk2_0,X14)
| ~ neq(X14,nil)
| ~ ssList(X14)
| ~ neq(esk4_0,nil) )
& ( ~ segmentP(esk1_0,X14)
| ~ segmentP(esk2_0,X14)
| ~ neq(X14,nil)
| ~ ssList(X14)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| 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_14])])])])])]) ).
fof(c_0_16,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_17,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_18,plain,
! [X75,X76,X79,X80] :
( ( ~ ssList(X75)
| ~ ssList(X76)
| segmentP(X75,X76)
| app(app(X79,X76),X80) != X75
| ~ ssList(X80)
| ~ ssList(X79) )
& ( ~ ssList(X75)
| ~ ssList(X76)
| ~ segmentP(X75,X76)
| app(app(esk11_2(X75,X76),X76),esk12_2(X75,X76)) = X75 )
& ( ~ ssList(X75)
| ~ ssList(X76)
| ~ segmentP(X75,X76)
| ssList(esk12_2(X75,X76)) )
& ( ~ ssList(X75)
| ~ ssList(X76)
| ~ segmentP(X75,X76)
| ssList(esk11_2(X75,X76)) ) ),
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_19,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X21,X22] :
( ( ~ ssList(X21)
| ~ ssList(X22)
| neq(X21,X22)
| X21 = X22 )
& ( ~ ssList(X21)
| ~ ssList(X22)
| X21 != X22
| ~ neq(X21,X22) ) ),
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_16])])])])]) ).
fof(c_0_21,plain,
! [X68] :
( ssList(tl(X68))
| nil = X68
| ~ ssList(X68) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,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_18]) ).
fof(c_0_25,plain,
! [X55] :
( app(nil,X55) = X55
| ~ ssList(X55) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_26,plain,
! [X53,X54] :
( ssList(app(X53,X54))
| ~ ssList(X54)
| ~ ssList(X53) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ neq(nil,esk4_0)
| hd(esk4_0) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(esk4_0) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(esk4_0,nil)
| esk3_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_19]) ).
fof(c_0_29,plain,
! [X67] :
( app(X67,nil) = X67
| ~ ssList(X67) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_30,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_31,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_36,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_24]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ neq(nil,esk4_0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| tl(esk4_0) != X2
| hd(esk4_0) != X4
| esk3_0 = X1 ),
inference(cn,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_41,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_43,plain,
! [X49,X50] :
( cons(X50,X49) = app(cons(X50,nil),X49)
| ~ ssItem(X50)
| ~ ssList(X49) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_44,plain,
! [X35] :
( cons(hd(X35),tl(X35)) = X35
| nil = X35
| ~ ssList(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
fof(c_0_45,plain,
! [X28] :
( ssItem(hd(X28))
| nil = X28
| ~ ssList(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| neq(X1,nil)
| X1 = nil ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_48,negated_conjecture,
( ssList(tl(esk4_0))
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_49,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_36,c_0_37]),c_0_33])]),c_0_38]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssItem(hd(esk4_0))
| ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| ~ ssList(cons(hd(esk4_0),nil))
| app(tl(esk4_0),cons(hd(esk4_0),nil)) = esk1_0 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41])])])])])]),c_0_38]) ).
fof(c_0_51,plain,
! [X38,X39] :
( ssList(cons(X39,X38))
| ~ ssItem(X39)
| ~ ssList(X38) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_42]),c_0_33])]),c_0_38]) ).
cnf(c_0_53,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_23]),c_0_41])]) ).
cnf(c_0_57,negated_conjecture,
( neq(tl(esk4_0),nil)
| esk4_0 = nil
| tl(esk4_0) = nil ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssItem(hd(esk4_0))
| ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| ~ ssList(cons(hd(esk4_0),nil))
| segmentP(esk1_0,tl(esk4_0)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_59,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(X1)
| neq(X1,esk4_0)
| X1 = esk4_0 ),
inference(spm,[status(thm)],[c_0_32,c_0_35]) ).
cnf(c_0_61,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| segmentP(cons(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,negated_conjecture,
( esk4_0 = nil
| cons(hd(esk4_0),tl(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_54,c_0_35]) ).
cnf(c_0_63,negated_conjecture,
( ssItem(hd(esk4_0))
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_55,c_0_35]) ).
cnf(c_0_64,negated_conjecture,
( ~ segmentP(esk4_0,tl(esk4_0))
| ~ segmentP(esk1_0,tl(esk4_0))
| esk4_0 = nil
| tl(esk4_0) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_48]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssItem(hd(esk4_0))
| ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| segmentP(esk1_0,tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_33])]) ).
cnf(c_0_66,negated_conjecture,
( neq(nil,esk4_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_60,c_0_33]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(cons(hd(esk4_0),nil))
| segmentP(esk4_0,tl(esk4_0))
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_48]) ).
cnf(c_0_68,negated_conjecture,
( ~ segmentP(esk4_0,tl(esk4_0))
| esk4_0 = nil
| tl(esk4_0) = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_63]),c_0_66]),c_0_48]) ).
cnf(c_0_69,negated_conjecture,
( segmentP(esk4_0,tl(esk4_0))
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_59]),c_0_33])]),c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( esk4_0 = nil
| tl(esk4_0) = nil ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssItem(hd(esk4_0))
| ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| ~ ssList(cons(hd(esk4_0),nil))
| segmentP(esk1_0,cons(hd(esk4_0),nil)) ),
inference(spm,[status(thm)],[c_0_52,c_0_50]) ).
cnf(c_0_72,negated_conjecture,
( esk4_0 = nil
| cons(hd(esk4_0),nil) = esk4_0 ),
inference(spm,[status(thm)],[c_0_62,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| ~ segmentP(esk1_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_41]),c_0_35])]) ).
cnf(c_0_74,negated_conjecture,
( segmentP(esk1_0,esk4_0)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_35])]),c_0_63]),c_0_66]),c_0_48]) ).
fof(c_0_75,plain,
! [X86] :
( segmentP(X86,X86)
| ~ ssList(X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_76,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_79,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_35])]) ).
cnf(c_0_80,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_78]) ).
cnf(c_0_81,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_41,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC087+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.09/0.35 % Computer : n003.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 07:56:15 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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
% 0.13/32.60 % Version: 3.5.1
% 0.13/32.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/32.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/32.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/32.60 % Starting new_bool_3 with 300s (1) cores
% 0.13/32.60 % Starting new_bool_1 with 300s (1) cores
% 0.13/32.60 % Starting sh5l with 300s (1) cores
% 0.13/32.60 % new_bool_3 with pid 3799819 completed with status 0
% 0.13/32.60 % Result found by new_bool_3
% 0.13/32.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/32.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/32.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/32.60 % Starting new_bool_3 with 300s (1) cores
% 0.13/32.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/32.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/32.60 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/32.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/32.60 % Starting SubtermCWHack with 31s (1) cores
% 0.13/32.60 % SubtermCWHack with pid 3799822 completed with status 8
% 0.13/32.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.13/32.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3800630 completed with status 0
% 0.13/32.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/32.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/32.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/32.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/32.60 % Starting new_bool_3 with 300s (1) cores
% 0.13/32.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/32.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/32.60 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/32.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/32.60 % Starting SubtermCWHack with 31s (1) cores
% 0.13/32.60 % SubtermCWHack with pid 3799822 completed with status 8
% 0.13/32.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.13/32.60 % Preprocessing time : 0.003 s
% 0.13/32.60 % Presaturation interreduction done
% 0.13/32.60
% 0.13/32.60 % Proof found!
% 0.13/32.60 % SZS status Theorem
% 0.13/32.60 % SZS output start CNFRefutation
% See solution above
% 0.13/32.61 % Parsed axioms : 96
% 0.13/32.61 % Removed by relevancy pruning/SinE : 60
% 0.13/32.61 % Initial clauses : 62
% 0.13/32.61 % Removed in clause preprocessing : 0
% 0.13/32.61 % Initial clauses in saturation : 62
% 0.13/32.61 % Processed clauses : 744
% 0.13/32.61 % ...of these trivial : 5
% 0.13/32.61 % ...subsumed : 277
% 0.13/32.61 % ...remaining for further processing : 462
% 0.13/32.61 % Other redundant clauses eliminated : 16
% 0.13/32.61 % Clauses deleted for lack of memory : 0
% 0.13/32.61 % Backward-subsumed : 74
% 0.13/32.61 % Backward-rewritten : 116
% 0.13/32.61 % Generated clauses : 2525
% 0.13/32.61 % ...of the previous two non-redundant : 2429
% 0.13/32.61 % ...aggressively subsumed : 0
% 0.13/32.61 % Contextual simplify-reflections : 165
% 0.13/32.61 % Paramodulations : 2508
% 0.13/32.61 % Factorizations : 0
% 0.13/32.61 % NegExts : 0
% 0.13/32.61 % Equation resolutions : 21
% 0.13/32.61 % Disequality decompositions : 0
% 0.13/32.61 % Total rewrite steps : 689
% 0.13/32.61 % ...of those cached : 680
% 0.13/32.61 % Propositional unsat checks : 0
% 0.13/32.61 % Propositional check models : 0
% 0.13/32.61 % Propositional check unsatisfiable : 0
% 0.13/32.61 % Propositional clauses : 0
% 0.13/32.61 % Propositional clauses after purity: 0
% 0.13/32.61 % Propositional unsat core size : 0
% 0.13/32.61 % Propositional preprocessing time : 0.000
% 0.13/32.61 % Propositional encoding time : 0.000
% 0.13/32.61 % Propositional solver time : 0.000
% 0.13/32.61 % Success case prop preproc time : 0.000
% 0.13/32.61 % Success case prop encoding time : 0.000
% 0.13/32.61 % Success case prop solver time : 0.000
% 0.13/32.61 % Current number of processed clauses : 209
% 0.13/32.61 % Positive orientable unit clauses : 12
% 0.13/32.61 % Positive unorientable unit clauses: 0
% 0.13/32.61 % Negative unit clauses : 1
% 0.13/32.61 % Non-unit-clauses : 196
% 0.13/32.61 % Current number of unprocessed clauses: 1798
% 0.13/32.61 % ...number of literals in the above : 9157
% 0.13/32.61 % Current number of archived formulas : 0
% 0.13/32.61 % Current number of archived clauses : 247
% 0.13/32.61 % Clause-clause subsumption calls (NU) : 24536
% 0.13/32.61 % Rec. Clause-clause subsumption calls : 6466
% 0.13/32.61 % Non-unit clause-clause subsumptions : 516
% 0.13/32.61 % Unit Clause-clause subsumption calls : 409
% 0.13/32.61 % Rewrite failures with RHS unbound : 0
% 0.13/32.61 % BW rewrite match attempts : 1
% 0.13/32.61 % BW rewrite match successes : 1
% 0.13/32.61 % Condensation attempts : 0
% 0.13/32.61 % Condensation successes : 0
% 0.13/32.61 % Termbank termtop insertions : 47979
% 0.13/32.61 % Search garbage collected termcells : 1820
% 0.13/32.61
% 0.13/32.61 % -------------------------------------------------
% 0.13/32.61 % User time : 30.143 s
% 0.13/32.61 % System time : 1.255 s
% 0.13/32.61 % Total time : 31.398 s
% 0.13/32.61 % Maximum resident set size: 3764 pages
% 0.13/32.61
% 0.13/32.61 % -------------------------------------------------
% 0.13/32.61 % User time : 30.151 s
% 0.13/32.61 % System time : 1.258 s
% 0.13/32.61 % Total time : 31.409 s
% 0.13/32.61 % Maximum resident set size: 4608 pages
% 0.13/32.61 % E exiting
%------------------------------------------------------------------------------