%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC363+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 : n012.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:05 PM UTC 2026
% Result : Theorem 34.45s 5.31s
% Output : CNFRefutation 34.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 94 ( 28 unt; 0 def)
% Number of atoms : 349 ( 68 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 432 ( 177 ~; 172 |; 33 &)
% ( 4 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 143 ( 0 sgn 77 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| ( nil = X4
& nil != X3 )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax50,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( rearsegP(X1,X2)
=> rearsegP(app(X3,X1),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax51) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( app(X3,X2) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
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(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(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
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(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(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| ( nil = X4
& nil != X3 )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| ( nil = X4
& nil != X3 )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_18,negated_conjecture,
( ( ~ neq(esk51_0,nil)
| memberP(esk51_0,esk52_0) )
& ( ~ neq(esk51_0,nil)
| cons(esk52_0,nil) = esk50_0 )
& ( ~ neq(esk51_0,nil)
| ssItem(esk52_0) )
& ( nil != esk51_0
| nil = esk50_0 )
& ~ segmentP(esk49_0,esk48_0)
& 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_17])])])])]) ).
cnf(c_0_19,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_20,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X179,X180,X181] :
( rearsegP(app(X181,X179),X180)
| ~ rearsegP(X179,X180)
| ~ ssList(X181)
| ~ ssList(X180)
| ~ ssList(X179) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])])]) ).
fof(c_0_22,plain,
! [X182] :
( rearsegP(X182,nil)
| ~ ssList(X182) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
fof(c_0_23,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_24,negated_conjecture,
( ~ neq(esk51_0,nil)
| memberP(esk51_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( ~ neq(esk51_0,nil)
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(app(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,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_23]) ).
cnf(c_0_32,negated_conjecture,
memberP(esk51_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_25])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(app(X1,X2),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
app(esk3_2(esk51_0,esk52_0),cons(esk52_0,esk4_2(esk51_0,esk52_0))) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk3_2(esk51_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_33]),c_0_34])]) ).
fof(c_0_39,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_40,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_41,plain,
! [X24,X25,X27] :
( ( ~ ssList(X24)
| ~ ssList(X25)
| rearsegP(X24,X25)
| app(X27,X25) != X24
| ~ ssList(X27) )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| app(esk7_2(X24,X25),X25) = X24 )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| ssList(esk7_2(X24,X25)) ) ),
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)],[ax6])])])])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(cons(esk52_0,esk4_2(esk51_0,esk52_0)))
| rearsegP(esk51_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk4_2(esk51_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_32]),c_0_33]),c_0_34])]) ).
fof(c_0_45,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_46,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_47,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_48,negated_conjecture,
( ~ neq(esk51_0,nil)
| cons(esk52_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_49,plain,
! [X227] :
( app(X227,nil) = X227
| ~ ssList(X227) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(esk7_2(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_51,negated_conjecture,
rearsegP(esk51_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_34])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssList(esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_53,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_45]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
cons(esk52_0,nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_25])]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_58,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_59,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_60,plain,
! [X20,X21,X23] :
( ( ~ ssList(X20)
| ~ ssList(X21)
| frontsegP(X20,X21)
| app(X21,X23) != X20
| ~ ssList(X23) )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| app(X21,esk6_2(X20,X21)) = X20 )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| ssList(esk6_2(X20,X21)) ) ),
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)],[ax5])])])])])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_62,negated_conjecture,
app(esk7_2(esk51_0,nil),nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_30]),c_0_33])]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk7_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_30]),c_0_33])]) ).
cnf(c_0_64,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_53,c_0_54]),c_0_30])]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(X1)
| app(esk50_0,X1) = cons(esk52_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_34])]) ).
cnf(c_0_66,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_68,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X2,X1) != X3
| ~ ssList(X1)
| frontsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_69,negated_conjecture,
esk7_2(esk51_0,nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
fof(c_0_70,plain,
! [X190,X191,X192,X193] :
( segmentP(app(app(X192,X190),X193),X191)
| ~ segmentP(X190,X191)
| ~ ssList(X193)
| ~ ssList(X192)
| ~ ssList(X191)
| ~ ssList(X190) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| cons(esk52_0,X2) != X1
| segmentP(X1,esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X1)
| ssList(cons(esk52_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_65]),c_0_66])]) ).
fof(c_0_73,plain,
! [X217,X218,X219] :
( X219 = X217
| app(X218,X219) != app(X218,X217)
| ~ ssList(X219)
| ~ ssList(X218)
| ~ ssList(X217) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_68]),c_0_67]) ).
cnf(c_0_75,negated_conjecture,
app(esk51_0,nil) = esk51_0,
inference(rw,[status(thm)],[c_0_62,c_0_69]) ).
cnf(c_0_76,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_70]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X1)
| segmentP(cons(esk52_0,X1),esk50_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_71]),c_0_72]) ).
fof(c_0_78,plain,
! [X163] :
( frontsegP(X163,X163)
| ~ ssList(X163) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
cnf(c_0_79,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_80,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_81,negated_conjecture,
frontsegP(esk51_0,esk51_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_33]),c_0_30])]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(app(app(X1,cons(esk52_0,X2)),X3),esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_66])]),c_0_72]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_85,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X1) != X2
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_61]),c_0_30])]) ).
cnf(c_0_86,negated_conjecture,
app(esk51_0,esk6_2(esk51_0,esk51_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_33])]) ).
cnf(c_0_87,negated_conjecture,
ssList(esk6_2(esk51_0,esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_81]),c_0_33])]) ).
cnf(c_0_88,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssList(X1)
| segmentP(app(esk51_0,X1),esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_37]),c_0_38]),c_0_44])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| app(X1,esk6_2(X1,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_80,c_0_84]) ).
cnf(c_0_91,negated_conjecture,
esk6_2(esk51_0,esk51_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_33]),c_0_87])]) ).
cnf(c_0_92,negated_conjecture,
~ segmentP(esk51_0,esk50_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_20]),c_0_58]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_30]),c_0_33])]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC363+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Mon Sep 21 08:18:37 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/0.32 Running first-order theorem proving
% 0.02/0.32 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
% 34.45/5.31 % Version: 3.5.1
% 34.45/5.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 34.45/5.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.45/5.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 34.45/5.31 % Starting new_bool_3 with 300s (1) cores
% 34.45/5.31 % Starting new_bool_1 with 300s (1) cores
% 34.45/5.31 % Starting sh5l with 300s (1) cores
% 34.45/5.31 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1968504 completed with status 0
% 34.45/5.31 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 34.45/5.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 34.45/5.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.45/5.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 34.45/5.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.45/5.31 % No SInE strategy applied
% 34.45/5.31 % Search class: FGHSF-FSLM21-MFFFFFNN
% 34.45/5.31 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 34.45/5.31 % Starting SubtermCWHack with 136s (1) cores
% 34.45/5.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 34.45/5.31 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 34.45/5.31 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 34.45/5.31 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 34.45/5.31 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 1968512 completed with status 0
% 34.45/5.31 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 34.45/5.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 34.45/5.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.45/5.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 34.45/5.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.45/5.31 % No SInE strategy applied
% 34.45/5.31 % Search class: FGHSF-FSLM21-MFFFFFNN
% 34.45/5.31 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 34.45/5.31 % Starting SubtermCWHack with 136s (1) cores
% 34.45/5.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 34.45/5.31 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 34.45/5.31 % Preprocessing time : 0.002 s
% 34.45/5.31
% 34.45/5.31 % Proof found!
% 34.45/5.31 % SZS status Theorem
% 34.45/5.31 % SZS output start CNFRefutation
% See solution above
% 34.45/5.31 % Parsed axioms : 96
% 34.45/5.31 % Removed by relevancy pruning/SinE : 0
% 34.45/5.31 % Initial clauses : 202
% 34.45/5.31 % Removed in clause preprocessing : 2
% 34.45/5.31 % Initial clauses in saturation : 200
% 34.45/5.31 % Processed clauses : 26013
% 34.45/5.31 % ...of these trivial : 309
% 34.45/5.31 % ...subsumed : 17489
% 34.45/5.31 % ...remaining for further processing : 8215
% 34.45/5.31 % Other redundant clauses eliminated : 889
% 34.45/5.31 % Clauses deleted for lack of memory : 0
% 34.45/5.31 % Backward-subsumed : 775
% 34.45/5.31 % Backward-rewritten : 886
% 34.45/5.31 % Generated clauses : 183465
% 34.45/5.31 % ...of the previous two non-redundant : 167948
% 34.45/5.31 % ...aggressively subsumed : 0
% 34.45/5.31 % Contextual simplify-reflections : 3024
% 34.45/5.31 % Paramodulations : 181931
% 34.45/5.31 % Factorizations : 1
% 34.45/5.31 % NegExts : 0
% 34.45/5.31 % Equation resolutions : 1486
% 34.45/5.31 % Disequality decompositions : 0
% 34.45/5.31 % Total rewrite steps : 229031
% 34.45/5.31 % ...of those cached : 228099
% 34.45/5.31 % Propositional unsat checks : 0
% 34.45/5.31 % Propositional check models : 0
% 34.45/5.31 % Propositional check unsatisfiable : 0
% 34.45/5.31 % Propositional clauses : 0
% 34.45/5.31 % Propositional clauses after purity: 0
% 34.45/5.31 % Propositional unsat core size : 0
% 34.45/5.31 % Propositional preprocessing time : 0.000
% 34.45/5.31 % Propositional encoding time : 0.000
% 34.45/5.31 % Propositional solver time : 0.000
% 34.45/5.31 % Success case prop preproc time : 0.000
% 34.45/5.31 % Success case prop encoding time : 0.000
% 34.45/5.31 % Success case prop solver time : 0.000
% 34.45/5.31 % Current number of processed clauses : 6501
% 34.45/5.31 % Positive orientable unit clauses : 1107
% 34.45/5.31 % Positive unorientable unit clauses: 0
% 34.45/5.31 % Negative unit clauses : 258
% 34.45/5.31 % Non-unit-clauses : 5136
% 34.45/5.31 % Current number of unprocessed clauses: 139457
% 34.45/5.31 % ...number of literals in the above : 906431
% 34.45/5.31 % Current number of archived formulas : 0
% 34.45/5.31 % Current number of archived clauses : 1708
% 34.45/5.31 % Clause-clause subsumption calls (NU) : 3244784
% 34.45/5.31 % Rec. Clause-clause subsumption calls : 1444554
% 34.45/5.31 % Non-unit clause-clause subsumptions : 16002
% 34.45/5.31 % Unit Clause-clause subsumption calls : 42827
% 34.45/5.31 % Rewrite failures with RHS unbound : 0
% 34.45/5.31 % BW rewrite match attempts : 13749
% 34.45/5.31 % BW rewrite match successes : 345
% 34.45/5.31 % Condensation attempts : 0
% 34.45/5.31 % Condensation successes : 0
% 34.45/5.31 % Termbank termtop insertions : 5635523
% 34.45/5.31 % Search garbage collected termcells : 4277
% 34.45/5.31
% 34.45/5.31 % -------------------------------------------------
% 34.45/5.31 % User time : 4.784 s
% 34.45/5.31 % System time : 0.093 s
% 34.45/5.31 % Total time : 4.877 s
% 34.45/5.31 % Maximum resident set size: 4272 pages
% 34.45/5.31
% 34.45/5.31 % -------------------------------------------------
% 34.45/5.31 % User time : 23.794 s
% 34.45/5.31 % System time : 0.699 s
% 34.45/5.31 % Total time : 24.493 s
% 34.45/5.31 % Maximum resident set size: 4864 pages
% 34.45/5.31 % E exiting
%------------------------------------------------------------------------------