%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC303+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 : 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:51 PM UTC 2026
% Result : Theorem 0.30s 0.50s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 24 unt; 0 def)
% Number of atoms : 288 ( 62 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 358 ( 130 ~; 125 |; 50 &)
% ( 3 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 80 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ~ lt(X11,X10)
| app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ ssList(X14) ) ) ) ) )
| ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X3)
| app(X3,X5) != X4
| ~ ssList(X5) )
| X3 != X1
| X4 != X2
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax29,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax29) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ~ lt(X11,X10)
| app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ ssList(X14) ) ) ) ) )
| ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X3)
| app(X3,X5) != X4
| ~ ssList(X5) )
| X3 != X1
| X4 != X2
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ~ lt(X11,X10)
| app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ ssList(X14) ) ) ) ) )
| ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X3)
| app(X3,X5) != X4
| ~ ssList(X5) )
| X3 != X1
| X4 != X2
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,negated_conjecture,
! [X264,X265,X266,X267] :
( ( nil != esk50_0
| nil = esk51_0 )
& lt(esk54_0,esk53_0)
& app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0
& ssList(esk57_0)
& ssList(esk56_0)
& ssList(esk55_0)
& ssItem(esk54_0)
& ssItem(esk53_0)
& ( ~ leq(X266,X264)
| app(X267,cons(X266,nil)) != esk50_0
| ~ ssList(X267)
| ~ ssItem(X266)
| app(cons(X264,nil),X265) != esk52_0
| ~ ssList(X265)
| ~ ssItem(X264) )
& totalorderedP(esk50_0)
& app(esk50_0,esk52_0) = esk51_0
& ssList(esk52_0)
& esk50_0 = esk48_0
& esk51_0 = esk49_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
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_11])])])])]) ).
cnf(c_0_13,negated_conjecture,
app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_14,negated_conjecture,
esk50_0 = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X230,X231,X232] :
( app(app(X230,X231),X232) = app(X230,app(X231,X232))
| ~ ssList(X232)
| ~ ssList(X231)
| ~ ssList(X230) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_16,negated_conjecture,
app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,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_18,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X119,X120] :
( ssList(cons(X120,X119))
| ~ ssItem(X120)
| ~ ssList(X119) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X228,X229] :
( cons(X229,X228) = app(cons(X229,nil),X228)
| ~ ssItem(X229)
| ~ ssList(X228) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_26,negated_conjecture,
app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk57_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(cons(esk54_0,nil))
| ~ ssList(app(esk55_0,cons(esk53_0,esk56_0)))
| app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_29])]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_32,plain,
! [X138,X139] :
( ssList(app(X138,X139))
| ~ ssList(X139)
| ~ ssList(X138) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_33,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(app(esk55_0,cons(esk53_0,esk56_0)))
| app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_22]),c_0_23]),c_0_31])]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_36,plain,
! [X252,X253] :
( ( ~ ssItem(X252)
| ~ ssItem(X253)
| lt(X252,X253)
| ~ leq(X252,X253)
| X252 = X253 )
& ( ~ ssItem(X252)
| ~ ssItem(X253)
| ~ lt(X252,X253)
| leq(X252,X253) )
& ( ~ ssItem(X252)
| ~ ssItem(X253)
| ~ lt(X252,X253)
| X252 != X253 ) ),
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_33])])])])]) ).
fof(c_0_37,plain,
! [X75,X76,X77,X78,X79,X80] :
( ( ~ ssList(X75)
| totalorderedP(X75)
| ~ leq(esk25_1(X75),esk26_1(X75)) )
& ( ~ ssList(X75)
| totalorderedP(X75)
| app(app(esk27_1(X75),cons(esk25_1(X75),esk28_1(X75))),cons(esk26_1(X75),esk29_1(X75))) = X75 )
& ( ~ ssList(X75)
| totalorderedP(X75)
| ssList(esk29_1(X75)) )
& ( ~ ssList(X75)
| totalorderedP(X75)
| ssList(esk28_1(X75)) )
& ( ~ ssList(X75)
| totalorderedP(X75)
| ssList(esk27_1(X75)) )
& ( ~ ssList(X75)
| totalorderedP(X75)
| ssItem(esk26_1(X75)) )
& ( ~ ssList(X75)
| totalorderedP(X75)
| ssItem(esk25_1(X75)) )
& ( ~ ssList(X75)
| leq(X76,X77)
| app(app(X78,cons(X76,X79)),cons(X77,X80)) != X75
| ~ ssList(X80)
| ~ ssList(X79)
| ~ ssList(X78)
| ~ ssItem(X77)
| ~ ssItem(X76)
| ~ totalorderedP(X75) ) ),
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)],[ax11])])])])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(cons(esk53_0,esk56_0))
| app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19])]) ).
fof(c_0_39,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_40,plain,
! [X144,X145] :
( X144 = X145
| ~ leq(X145,X144)
| ~ leq(X144,X145)
| ~ ssItem(X145)
| ~ ssItem(X144) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])])])]) ).
cnf(c_0_41,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
lt(esk54_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ totalorderedP(X1)
| leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_22]),c_0_18]),c_0_24])]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_46,plain,
! [X152,X153] :
( ~ lt(X153,X152)
| ~ lt(X152,X153)
| ~ ssItem(X153)
| ~ ssItem(X152) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])]) ).
cnf(c_0_47,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,negated_conjecture,
leq(esk54_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_24]),c_0_31])]) ).
cnf(c_0_49,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| leq(X1,X2) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_50,negated_conjecture,
app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_29]),c_0_31])]) ).
cnf(c_0_51,negated_conjecture,
totalorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_45,c_0_14]) ).
cnf(c_0_53,plain,
( ~ lt(X2,X1)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( ~ leq(esk53_0,esk54_0)
| esk54_0 = esk53_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_31]),c_0_24])]) ).
cnf(c_0_55,negated_conjecture,
leq(esk53_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_29]),c_0_18]),c_0_19]),c_0_31]),c_0_24])]) ).
cnf(c_0_56,negated_conjecture,
~ lt(esk53_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_31]),c_0_24])]) ).
cnf(c_0_57,negated_conjecture,
esk54_0 = esk53_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
~ lt(esk53_0,esk53_0),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC303+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n002.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:16:47 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.30/0.50 % Version: 3.5.1
% 0.30/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.30/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.30/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.50 % Starting sh5l with 300s (1) cores
% 0.30/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2846713 completed with status 0
% 0.30/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.30/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.30/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.30/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.50 % No SInE strategy applied
% 0.30/0.50 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.30/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.30/0.50 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.30/0.50 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.30/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.30/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2846722 completed with status 0
% 0.30/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.30/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.30/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.30/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.50 % No SInE strategy applied
% 0.30/0.50 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.30/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.30/0.50 % Preprocessing time : 0.002 s
% 0.30/0.50 % Presaturation interreduction done
% 0.30/0.50
% 0.30/0.50 % Proof found!
% 0.30/0.50 % SZS status Theorem
% 0.30/0.50 % SZS output start CNFRefutation
% See solution above
% 0.30/0.50 % Parsed axioms : 96
% 0.30/0.50 % Removed by relevancy pruning/SinE : 0
% 0.30/0.50 % Initial clauses : 208
% 0.30/0.50 % Removed in clause preprocessing : 2
% 0.30/0.50 % Initial clauses in saturation : 206
% 0.30/0.50 % Processed clauses : 663
% 0.30/0.50 % ...of these trivial : 4
% 0.30/0.50 % ...subsumed : 79
% 0.30/0.50 % ...remaining for further processing : 579
% 0.30/0.50 % Other redundant clauses eliminated : 65
% 0.30/0.50 % Clauses deleted for lack of memory : 0
% 0.30/0.50 % Backward-subsumed : 9
% 0.30/0.50 % Backward-rewritten : 30
% 0.30/0.50 % Generated clauses : 1341
% 0.30/0.50 % ...of the previous two non-redundant : 1208
% 0.30/0.50 % ...aggressively subsumed : 0
% 0.30/0.50 % Contextual simplify-reflections : 38
% 0.30/0.50 % Paramodulations : 1273
% 0.30/0.50 % Factorizations : 0
% 0.30/0.50 % NegExts : 0
% 0.30/0.50 % Equation resolutions : 70
% 0.30/0.50 % Disequality decompositions : 0
% 0.30/0.50 % Total rewrite steps : 1062
% 0.30/0.50 % ...of those cached : 1013
% 0.30/0.50 % Propositional unsat checks : 0
% 0.30/0.50 % Propositional check models : 0
% 0.30/0.50 % Propositional check unsatisfiable : 0
% 0.30/0.50 % Propositional clauses : 0
% 0.30/0.50 % Propositional clauses after purity: 0
% 0.30/0.50 % Propositional unsat core size : 0
% 0.30/0.50 % Propositional preprocessing time : 0.000
% 0.30/0.50 % Propositional encoding time : 0.000
% 0.30/0.50 % Propositional solver time : 0.000
% 0.30/0.50 % Success case prop preproc time : 0.000
% 0.30/0.50 % Success case prop encoding time : 0.000
% 0.30/0.50 % Success case prop solver time : 0.000
% 0.30/0.50 % Current number of processed clauses : 317
% 0.30/0.50 % Positive orientable unit clauses : 59
% 0.30/0.50 % Positive unorientable unit clauses: 0
% 0.30/0.50 % Negative unit clauses : 6
% 0.30/0.50 % Non-unit-clauses : 252
% 0.30/0.50 % Current number of unprocessed clauses: 944
% 0.30/0.50 % ...number of literals in the above : 5155
% 0.30/0.50 % Current number of archived formulas : 0
% 0.30/0.50 % Current number of archived clauses : 239
% 0.30/0.50 % Clause-clause subsumption calls (NU) : 23259
% 0.30/0.50 % Rec. Clause-clause subsumption calls : 6360
% 0.30/0.50 % Non-unit clause-clause subsumptions : 98
% 0.30/0.50 % Unit Clause-clause subsumption calls : 1579
% 0.30/0.50 % Rewrite failures with RHS unbound : 0
% 0.30/0.50 % BW rewrite match attempts : 33
% 0.30/0.50 % BW rewrite match successes : 14
% 0.30/0.50 % Condensation attempts : 0
% 0.30/0.50 % Condensation successes : 0
% 0.30/0.50 % Termbank termtop insertions : 48513
% 0.30/0.50 % Search garbage collected termcells : 4413
% 0.30/0.50
% 0.30/0.50 % -------------------------------------------------
% 0.30/0.50 % User time : 0.051 s
% 0.30/0.50 % System time : 0.005 s
% 0.30/0.50 % Total time : 0.056 s
% 0.30/0.50 % Maximum resident set size: 4280 pages
% 0.30/0.50
% 0.30/0.50 % -------------------------------------------------
% 0.30/0.50 % User time : 0.163 s
% 0.30/0.50 % System time : 0.029 s
% 0.30/0.50 % Total time : 0.192 s
% 0.30/0.50 % Maximum resident set size: 4864 pages
% 0.30/0.50 % E exiting
%------------------------------------------------------------------------------