%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC240+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 : n015.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:45:31 PM UTC 2026
% Result : Theorem 0.42s 0.79s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 64 ( 11 unt; 0 def)
% Number of atoms : 317 ( 85 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 416 ( 163 ~; 164 |; 44 &)
% ( 4 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 133 ( 0 sgn 66 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
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(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X9] :
( ssItem(X9)
=> ? [X10] :
( memberP(X3,X10)
& X9 != X10
& ssItem(X10) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( memberP(X3,X1)
| X1 = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
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(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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
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(c_0_12,plain,
! [X72,X73] :
( ( ~ ssList(X72)
| ~ ssList(X73)
| nil = app(X72,X73)
| nil != X72
| nil != X73 )
& ( ~ ssList(X72)
| ~ ssList(X73)
| nil != app(X72,X73)
| nil = X72 )
& ( ~ ssList(X72)
| ~ ssList(X73)
| nil != app(X72,X73)
| nil = X73 ) ),
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])])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X9] :
( ssItem(X9)
=> ? [X10] :
( memberP(X3,X10)
& X9 != X10
& ssItem(X10) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_14,plain,
! [X75,X76] :
( ssList(cons(X76,X75))
| ~ ssItem(X76)
| ~ ssList(X75) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_15,plain,
! [X57,X58,X59] :
( cons(X59,app(X58,X57)) = app(cons(X59,X58),X57)
| ~ ssItem(X59)
| ~ ssList(X58)
| ~ ssList(X57) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_16,plain,
! [X55,X56] :
( ssList(app(X55,X56))
| ~ ssList(X56)
| ~ ssList(X55) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_17,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X9] :
( ssItem(X9)
=> ? [X10] :
( memberP(X3,X10)
& X9 != X10
& ssItem(X10) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X30,X31,X32] :
( ( ~ ssItem(X30)
| ~ ssItem(X31)
| ~ ssList(X32)
| memberP(cons(X31,X32),X30)
| ~ memberP(X32,X30) )
& ( ~ ssItem(X30)
| ~ ssItem(X31)
| ~ ssList(X32)
| memberP(cons(X31,X32),X30)
| X30 != X31 )
& ( ~ ssItem(X30)
| ~ ssItem(X31)
| ~ ssList(X32)
| memberP(X32,X30)
| X30 = X31
| ~ memberP(cons(X31,X32),X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
fof(c_0_21,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_22,plain,
! [X69,X70,X71] :
( app(app(X69,X70),X71) = app(X69,app(X70,X71))
| ~ ssList(X71)
| ~ ssList(X70)
| ~ ssList(X69) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_23,plain,
! [X60] :
( app(nil,X60) = X60
| ~ ssList(X60) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_24,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])]),c_0_18])]) ).
fof(c_0_28,negated_conjecture,
! [X15,X16,X17,X20] :
( ( ~ memberP(esk3_0,X20)
| esk6_0 = X20
| ~ ssItem(X20) )
& ssItem(esk6_0)
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| ~ leq(X15,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| lt(X15,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| memberP(X17,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| memberP(X16,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| ssItem(esk5_3(X15,X16,X17)) )
& nil != esk1_0
& 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_19])])])])])]) ).
cnf(c_0_29,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_30,plain,
! [X83] :
( ( ~ ssList(X83)
| nil = X83
| cons(esk12_1(X83),esk11_1(X83)) = X83 )
& ( ~ ssList(X83)
| nil = X83
| ssItem(esk12_1(X83)) )
& ( ~ ssList(X83)
| nil = X83
| ssList(esk11_1(X83)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
fof(c_0_31,plain,
! [X47,X48] :
( ( ~ ssItem(X47)
| ~ ssItem(X48)
| lt(X47,X48)
| ~ leq(X47,X48)
| X47 = X48 )
& ( ~ ssItem(X47)
| ~ ssItem(X48)
| ~ lt(X47,X48)
| leq(X47,X48) )
& ( ~ ssItem(X47)
| ~ ssItem(X48)
| ~ lt(X47,X48)
| X47 != X48 ) ),
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_21])])])])]) ).
cnf(c_0_32,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_34,plain,
! [X67,X68] :
( cons(X68,X67) = app(cons(X68,nil),X67)
| ~ ssItem(X68)
| ~ ssList(X67) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_35,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_36,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_18])]) ).
cnf(c_0_37,negated_conjecture,
( ~ memberP(esk3_0,X1)
| ~ ssItem(X1)
| esk6_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk12_1(X1),esk11_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk12_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| ~ leq(X1,esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| ssItem(esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| lt(X1,esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_47,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_32,c_0_33]),c_0_18])]) ).
cnf(c_0_48,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_49,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_18])]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk1_0,X1)
| esk6_0 = X1 ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| memberP(X1,esk12_1(X1))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_53,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,cons(X2,nil)),X3) != esk1_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_55,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(nil,cons(X1,X2)) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssItem(esk12_1(esk1_0))
| esk12_1(esk1_0) = esk6_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_18])]) ).
cnf(c_0_58,negated_conjecture,
esk12_1(esk1_0) = esk6_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_41]),c_0_52])]),c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk1_0 ),
inference(spm,[status(thm)],[c_0_57,c_0_48]) ).
cnf(c_0_60,negated_conjecture,
cons(esk6_0,esk11_1(esk1_0)) = esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_58]),c_0_52])]),c_0_53]) ).
cnf(c_0_61,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_62,negated_conjecture,
~ ssList(esk11_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_42]),c_0_52])]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC240+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.45 % Computer : n015.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.45 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 08:10:51 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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.42/0.79 % Version: 3.5.1
% 0.42/0.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.42/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.42/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.42/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.42/0.79 % Starting sh5l with 300s (1) cores
% 0.42/0.79 % new_bool_1 with pid 1003481 completed with status 0
% 0.42/0.79 % Result found by new_bool_1
% 0.42/0.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.42/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.42/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.42/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.42/0.79 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.42/0.79 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.79 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.42/0.79 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.79 % Starting SubtermCWHack with 31s (1) cores
% 0.42/0.79 % SubtermCWHack with pid 1003483 completed with status 0
% 0.42/0.79 % Result found by SubtermCWHack
% 0.42/0.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.42/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.42/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.42/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.42/0.79 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.42/0.79 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.79 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.42/0.79 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.79 % Starting SubtermCWHack with 31s (1) cores
% 0.42/0.79 % Preprocessing time : 0.003 s
% 0.42/0.79
% 0.42/0.79 % Proof found!
% 0.42/0.79 % SZS status Theorem
% 0.42/0.79 % SZS output start CNFRefutation
% See solution above
% 0.42/0.79 % Parsed axioms : 96
% 0.42/0.79 % Removed by relevancy pruning/SinE : 66
% 0.42/0.79 % Initial clauses : 59
% 0.42/0.79 % Removed in clause preprocessing : 0
% 0.42/0.79 % Initial clauses in saturation : 59
% 0.42/0.79 % Processed clauses : 2109
% 0.42/0.79 % ...of these trivial : 9
% 0.42/0.79 % ...subsumed : 1628
% 0.42/0.79 % ...remaining for further processing : 472
% 0.42/0.79 % Other redundant clauses eliminated : 96
% 0.42/0.79 % Clauses deleted for lack of memory : 0
% 0.42/0.79 % Backward-subsumed : 48
% 0.42/0.79 % Backward-rewritten : 16
% 0.42/0.79 % Generated clauses : 9939
% 0.42/0.79 % ...of the previous two non-redundant : 8296
% 0.42/0.79 % ...aggressively subsumed : 0
% 0.42/0.79 % Contextual simplify-reflections : 172
% 0.42/0.79 % Paramodulations : 9823
% 0.42/0.79 % Factorizations : 0
% 0.42/0.79 % NegExts : 0
% 0.42/0.79 % Equation resolutions : 117
% 0.42/0.79 % Disequality decompositions : 0
% 0.42/0.79 % Total rewrite steps : 9175
% 0.42/0.79 % ...of those cached : 9150
% 0.42/0.79 % Propositional unsat checks : 0
% 0.42/0.79 % Propositional check models : 0
% 0.42/0.79 % Propositional check unsatisfiable : 0
% 0.42/0.79 % Propositional clauses : 0
% 0.42/0.79 % Propositional clauses after purity: 0
% 0.42/0.79 % Propositional unsat core size : 0
% 0.42/0.79 % Propositional preprocessing time : 0.000
% 0.42/0.79 % Propositional encoding time : 0.000
% 0.42/0.79 % Propositional solver time : 0.000
% 0.42/0.79 % Success case prop preproc time : 0.000
% 0.42/0.79 % Success case prop encoding time : 0.000
% 0.42/0.79 % Success case prop solver time : 0.000
% 0.42/0.79 % Current number of processed clauses : 404
% 0.42/0.79 % Positive orientable unit clauses : 30
% 0.42/0.79 % Positive unorientable unit clauses: 0
% 0.42/0.79 % Negative unit clauses : 16
% 0.42/0.79 % Non-unit-clauses : 358
% 0.42/0.79 % Current number of unprocessed clauses: 6227
% 0.42/0.79 % ...number of literals in the above : 33234
% 0.42/0.79 % Current number of archived formulas : 0
% 0.42/0.79 % Current number of archived clauses : 64
% 0.42/0.79 % Clause-clause subsumption calls (NU) : 32284
% 0.42/0.79 % Rec. Clause-clause subsumption calls : 15167
% 0.42/0.79 % Non-unit clause-clause subsumptions : 1570
% 0.42/0.79 % Unit Clause-clause subsumption calls : 155
% 0.42/0.79 % Rewrite failures with RHS unbound : 0
% 0.42/0.79 % BW rewrite match attempts : 52
% 0.42/0.79 % BW rewrite match successes : 11
% 0.42/0.79 % Condensation attempts : 0
% 0.42/0.79 % Condensation successes : 0
% 0.42/0.79 % Termbank termtop insertions : 179254
% 0.42/0.79 % Search garbage collected termcells : 1831
% 0.42/0.79
% 0.42/0.79 % -------------------------------------------------
% 0.42/0.79 % User time : 0.174 s
% 0.42/0.79 % System time : 0.015 s
% 0.42/0.79 % Total time : 0.189 s
% 0.42/0.79 % Maximum resident set size: 4020 pages
% 0.42/0.79
% 0.42/0.79 % -------------------------------------------------
% 0.42/0.79 % User time : 0.180 s
% 0.42/0.79 % System time : 0.021 s
% 0.42/0.79 % Total time : 0.201 s
% 0.42/0.79 % Maximum resident set size: 4864 pages
% 0.42/0.79 % E exiting
%------------------------------------------------------------------------------