%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC031+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:42:41 PM UTC 2026
% Result : Theorem 0.07s 0.82s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 73 ( 12 unt; 0 def)
% Number of atoms : 300 ( 94 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 375 ( 148 ~; 146 |; 39 &)
% ( 5 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn 60 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil = X2
| nil != X1 )
& ( nil = X1
| nil != X2 ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil = X2
| nil != X1 )
& ( nil = X1
| nil != X2 ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil = X2
| nil != X1 )
& ( nil = X1
| nil != X2 ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_16,negated_conjecture,
! [X11] :
( ( nil != esk1_0
| nil != esk2_0 )
& ( nil != esk1_0
| nil = esk1_0 )
& ( nil = esk2_0
| nil != esk2_0 )
& ( nil = esk2_0
| nil = esk1_0 )
& ( ~ totalorderedP(X11)
| ~ segmentP(X11,esk3_0)
| ~ frontsegP(esk4_0,X11)
| ~ neq(esk3_0,X11)
| ~ ssList(X11) )
& totalorderedP(esk3_0)
& frontsegP(esk4_0,esk3_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_15])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk2_0
| nil = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X67] :
( ( ~ ssList(X67)
| frontsegP(nil,X67)
| nil != X67 )
& ( ~ ssList(X67)
| nil = X67
| ~ frontsegP(nil,X67) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
cnf(c_0_21,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( esk3_0 = nil
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( frontsegP(nil,esk3_0)
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_26,plain,
! [X47] :
( segmentP(X47,nil)
| ~ ssList(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_27,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_28,plain,
! [X49,X50,X52] :
( ( ~ ssList(X49)
| ~ ssList(X50)
| frontsegP(X49,X50)
| app(X50,X52) != X49
| ~ ssList(X52) )
& ( ~ ssList(X49)
| ~ ssList(X50)
| ~ frontsegP(X49,X50)
| app(X50,esk14_2(X49,X50)) = X49 )
& ( ~ ssList(X49)
| ~ ssList(X50)
| ~ frontsegP(X49,X50)
| ssList(esk14_2(X49,X50)) ) ),
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])])])])])]) ).
fof(c_0_29,plain,
! [X100,X101] :
( ssList(app(X100,X101))
| ~ ssList(X101)
| ~ ssList(X100) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_30,plain,
! [X112,X113] :
( ( ~ ssList(X112)
| ~ ssList(X113)
| nil = app(X112,X113)
| nil != X112
| nil != X113 )
& ( ~ ssList(X112)
| ~ ssList(X113)
| nil != app(X112,X113)
| nil = X112 )
& ( ~ ssList(X112)
| ~ ssList(X113)
| nil != app(X112,X113)
| nil = X113 ) ),
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_31,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_32,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk3_0)
| ~ frontsegP(esk4_0,X1)
| ~ neq(esk3_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_35,plain,
! [X70,X71] :
( ( ~ ssList(X70)
| ~ ssList(X71)
| neq(X70,X71)
| X70 = X71 )
& ( ~ ssList(X70)
| ~ ssList(X71)
| X70 != X71
| ~ neq(X70,X71) ) ),
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_27])])])])]) ).
cnf(c_0_36,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X2,X1) != X3
| ~ ssList(X1)
| frontsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_38,plain,
! [X83,X84] :
( cons(X84,X83) = app(cons(X84,nil),X83)
| ~ ssItem(X84)
| ~ ssList(X83) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_39,plain,
! [X72,X73] :
( ssList(cons(X73,X72))
| ~ ssItem(X73)
| ~ ssList(X72) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_40,plain,
! [X80,X81,X82] :
( cons(X82,app(X81,X80)) = app(cons(X82,X81),X80)
| ~ ssItem(X82)
| ~ ssList(X81)
| ~ ssList(X80) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_43,plain,
! [X15,X16] :
( nil != cons(X16,X15)
| ~ ssItem(X16)
| ~ ssList(X15) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])]) ).
cnf(c_0_44,negated_conjecture,
( ~ neq(nil,X1)
| ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33]),c_0_34]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_46,plain,
! [X28] :
( totalorderedP(cons(X28,nil))
| ~ ssItem(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])])]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_37]) ).
cnf(c_0_48,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_49,plain,
! [X12] :
( ( ~ ssList(X12)
| nil = X12
| cons(esk6_1(X12),esk5_1(X12)) = X12 )
& ( ~ ssList(X12)
| nil = X12
| ssItem(esk6_1(X12)) )
& ( ~ ssList(X12)
| nil = X12
| ssList(esk5_1(X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_50,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_51,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_52,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_53,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_41])]),c_0_42])]) ).
cnf(c_0_54,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ totalorderedP(X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42])]) ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| frontsegP(cons(X1,X2),cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk6_1(X1),esk5_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_61,negated_conjecture,
( esk4_0 != nil
| esk3_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_18]),c_0_19]) ).
cnf(c_0_62,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_37]) ).
cnf(c_0_63,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_52,c_0_53]),c_0_42])]) ).
cnf(c_0_64,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| app(cons(X1,X2),X3) != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_52]),c_0_37]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ frontsegP(esk4_0,cons(X1,nil))
| cons(X1,nil) = nil ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ ssList(cons(esk6_1(X1),nil))
| frontsegP(X1,cons(esk6_1(X1),nil))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]) ).
cnf(c_0_67,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_68,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_33])]) ).
cnf(c_0_69,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_42])]) ).
cnf(c_0_70,plain,
( ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_63]),c_0_42])]) ).
cnf(c_0_71,negated_conjecture,
~ ssItem(esk6_1(esk4_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]),c_0_68]),c_0_69]),c_0_70]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_59]),c_0_67])]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC031+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.72 % Computer : n012.cluster.edu
% 0.04/0.72 % Model : x86_64 x86_64
% 0.04/0.72 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.72 % Memory : 8046.5625MB
% 0.04/0.72 % OS : Linux 6.8.0-71-generic
% 0.04/0.72 % CPULimit : 300
% 0.04/0.72 % WCLimit : 300
% 0.04/0.72 % DateTime : Mon Sep 21 07:49:55 UTC 2026
% 0.04/0.72 % CPUTime :
% 0.04/0.72 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.75 Running first-order theorem proving
% 0.04/0.75 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.07/0.82 % Version: 3.5.1
% 0.07/0.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.82 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.82 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.82 % Starting sh5l with 300s (1) cores
% 0.07/0.82 % new_bool_1 with pid 1922466 completed with status 0
% 0.07/0.82 % Result found by new_bool_1
% 0.07/0.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.82 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.82 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.82 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.07/0.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.82 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.82 % SubtermCWHack with pid 1922481 completed with status 0
% 0.07/0.82 % Result found by SubtermCWHack
% 0.07/0.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.82 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.82 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.82 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.07/0.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.82 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.82 % Preprocessing time : 0.002 s
% 0.07/0.82
% 0.07/0.82 % Proof found!
% 0.07/0.82 % SZS status Theorem
% 0.07/0.82 % SZS output start CNFRefutation
% See solution above
% 0.07/0.82 % Parsed axioms : 96
% 0.07/0.82 % Removed by relevancy pruning/SinE : 39
% 0.07/0.82 % Initial clauses : 102
% 0.07/0.82 % Removed in clause preprocessing : 3
% 0.07/0.82 % Initial clauses in saturation : 99
% 0.07/0.82 % Processed clauses : 963
% 0.07/0.82 % ...of these trivial : 0
% 0.07/0.82 % ...subsumed : 675
% 0.07/0.82 % ...remaining for further processing : 288
% 0.07/0.82 % Other redundant clauses eliminated : 73
% 0.07/0.82 % Clauses deleted for lack of memory : 0
% 0.07/0.82 % Backward-subsumed : 13
% 0.07/0.82 % Backward-rewritten : 10
% 0.07/0.82 % Generated clauses : 3568
% 0.07/0.82 % ...of the previous two non-redundant : 3056
% 0.07/0.82 % ...aggressively subsumed : 0
% 0.07/0.82 % Contextual simplify-reflections : 98
% 0.07/0.82 % Paramodulations : 3483
% 0.07/0.82 % Factorizations : 0
% 0.07/0.82 % NegExts : 0
% 0.07/0.82 % Equation resolutions : 86
% 0.07/0.82 % Disequality decompositions : 0
% 0.07/0.82 % Total rewrite steps : 2029
% 0.07/0.82 % ...of those cached : 2019
% 0.07/0.82 % Propositional unsat checks : 0
% 0.07/0.82 % Propositional check models : 0
% 0.07/0.82 % Propositional check unsatisfiable : 0
% 0.07/0.82 % Propositional clauses : 0
% 0.07/0.82 % Propositional clauses after purity: 0
% 0.07/0.82 % Propositional unsat core size : 0
% 0.07/0.82 % Propositional preprocessing time : 0.000
% 0.07/0.82 % Propositional encoding time : 0.000
% 0.07/0.82 % Propositional solver time : 0.000
% 0.07/0.82 % Success case prop preproc time : 0.000
% 0.07/0.82 % Success case prop encoding time : 0.000
% 0.07/0.82 % Success case prop solver time : 0.000
% 0.07/0.82 % Current number of processed clauses : 254
% 0.07/0.82 % Positive orientable unit clauses : 13
% 0.07/0.82 % Positive unorientable unit clauses: 0
% 0.07/0.82 % Negative unit clauses : 4
% 0.07/0.82 % Non-unit-clauses : 237
% 0.07/0.82 % Current number of unprocessed clauses: 2136
% 0.07/0.82 % ...number of literals in the above : 11997
% 0.07/0.82 % Current number of archived formulas : 0
% 0.07/0.82 % Current number of archived clauses : 23
% 0.07/0.82 % Clause-clause subsumption calls (NU) : 16106
% 0.07/0.82 % Rec. Clause-clause subsumption calls : 7730
% 0.07/0.82 % Non-unit clause-clause subsumptions : 786
% 0.07/0.82 % Unit Clause-clause subsumption calls : 32
% 0.07/0.82 % Rewrite failures with RHS unbound : 0
% 0.07/0.82 % BW rewrite match attempts : 4
% 0.07/0.82 % BW rewrite match successes : 4
% 0.07/0.82 % Condensation attempts : 0
% 0.07/0.82 % Condensation successes : 0
% 0.07/0.82 % Termbank termtop insertions : 68049
% 0.07/0.82 % Search garbage collected termcells : 2444
% 0.07/0.82
% 0.07/0.82 % -------------------------------------------------
% 0.07/0.82 % User time : 0.050 s
% 0.07/0.82 % System time : 0.004 s
% 0.07/0.82 % Total time : 0.055 s
% 0.07/0.82 % Maximum resident set size: 4016 pages
% 0.07/0.82
% 0.07/0.82 % -------------------------------------------------
% 0.07/0.82 % User time : 0.051 s
% 0.07/0.82 % System time : 0.008 s
% 0.07/0.82 % Total time : 0.060 s
% 0.07/0.82 % Maximum resident set size: 4864 pages
% 0.07/0.82 % E exiting
%------------------------------------------------------------------------------