%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC329+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 : n005.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:57 PM UTC 2026
% Result : Theorem 261.27s 38.29s
% Output : CNFRefutation 261.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 17
% Syntax : Number of formulae : 122 ( 23 unt; 0 def)
% Number of atoms : 483 ( 136 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 624 ( 263 ~; 264 |; 44 &)
% ( 4 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 181 ( 0 sgn 81 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X5,X6)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax79) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X3,X1)
| memberP(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
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(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/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(c_0_17,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X5,X6)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_18,plain,
! [X90,X91,X92] :
( X92 = X90
| app(X92,X91) != app(X90,X91)
| ~ ssList(X92)
| ~ ssList(X91)
| ~ ssList(X90) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_19,plain,
! [X96,X97,X98] :
( app(app(X96,X97),X98) = app(X96,app(X97,X98))
| ~ ssList(X98)
| ~ ssList(X97)
| ~ ssList(X96) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_20,plain,
! [X87,X88] :
( ssList(app(X87,X88))
| ~ ssList(X88)
| ~ ssList(X87) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_21,plain,
! [X89] :
( app(nil,X89) = X89
| ~ ssList(X89) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X5,X6)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( app(X3,X2) != app(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,negated_conjecture,
! [X12] :
( ( ~ equalelemsP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ leq(esk5_0,X12)
| ~ memberP(esk4_0,X12)
| esk5_0 = X12
| ~ ssItem(X12)
| nil = esk3_0 )
& ( ~ leq(esk5_0,X12)
| ~ memberP(esk4_0,X12)
| esk5_0 = X12
| ~ ssItem(X12)
| nil = esk4_0 )
& ( memberP(esk4_0,esk5_0)
| nil = esk3_0 )
& ( memberP(esk4_0,esk5_0)
| nil = esk4_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 )
& ( ssItem(esk5_0)
| nil = esk3_0 )
& ( ssItem(esk5_0)
| nil = esk4_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_22])])])])])]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,X4) != app(X2,app(X3,X4))
| X1 = app(X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,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_24,c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,X3) != app(X2,X3)
| X1 = app(nil,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,esk4_0) != app(X2,esk4_0)
| X1 = app(nil,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_36,plain,
! [X99,X100] :
( ( ~ ssList(X99)
| ~ ssList(X100)
| nil = app(X99,X100)
| nil != X99
| nil != X100 )
& ( ~ ssList(X99)
| ~ ssList(X100)
| nil != app(X99,X100)
| nil = X99 )
& ( ~ ssList(X99)
| ~ ssList(X100)
| nil != app(X99,X100)
| nil = X100 ) ),
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_37,plain,
! [X23,X24,X27,X28] :
( ( ~ ssList(X23)
| ~ ssList(X24)
| segmentP(X23,X24)
| app(app(X27,X24),X28) != X23
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ~ ssList(X23)
| ~ ssList(X24)
| ~ segmentP(X23,X24)
| app(app(esk10_2(X23,X24),X24),esk11_2(X23,X24)) = X23 )
& ( ~ ssList(X23)
| ~ ssList(X24)
| ~ segmentP(X23,X24)
| ssList(esk11_2(X23,X24)) )
& ( ~ ssList(X23)
| ~ ssList(X24)
| ~ segmentP(X23,X24)
| ssList(esk10_2(X23,X24)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| app(esk4_0,esk4_0) != app(X1,esk4_0)
| app(nil,X1) = esk4_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(esk10_2(X1,X2),X2),esk11_2(X1,X2)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_25]) ).
cnf(c_0_42,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_34])]) ).
fof(c_0_43,plain,
! [X93,X94,X95] :
( X95 = X93
| app(X94,X95) != app(X94,X93)
| ~ ssList(X95)
| ~ ssList(X94)
| ~ ssList(X93) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
fof(c_0_44,plain,
! [X101] :
( app(X101,nil) = X101
| ~ ssList(X101) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ ssList(esk11_2(nil,X1))
| ~ ssList(app(esk10_2(nil,X1),X1))
| ~ segmentP(nil,X1)
| esk11_2(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40])]),c_0_27])]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,esk4_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_34]),c_0_27])]) ).
cnf(c_0_48,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_45])]),c_0_27])]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(esk10_2(nil,esk4_0))
| ~ ssList(esk11_2(nil,esk4_0))
| ~ segmentP(nil,esk4_0)
| esk11_2(nil,esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_34])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ssList(esk11_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(X1)
| app(nil,X1) != esk4_0
| X1 = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_42]),c_0_34]),c_0_27])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_24]),c_0_27])]),c_0_25]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ssList(app(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_50]),c_0_27])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ssList(esk10_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(esk10_2(nil,esk4_0))
| ~ segmentP(nil,esk4_0)
| esk11_2(nil,esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34]),c_0_27])]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(X1)
| app(nil,X1) != esk4_0
| app(X1,nil) = esk4_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_27])]),c_0_55]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(esk10_2(X1,X2),app(X2,esk11_2(X1,X2))) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_56]),c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( ~ segmentP(nil,esk4_0)
| esk11_2(nil,esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_56]),c_0_34]),c_0_27])]) ).
cnf(c_0_61,negated_conjecture,
app(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_42]),c_0_34])]) ).
fof(c_0_62,plain,
! [X35,X36,X37,X38] :
( segmentP(app(app(X37,X35),X38),X36)
| ~ segmentP(X35,X36)
| ~ ssList(X38)
| ~ ssList(X37)
| ~ ssList(X36)
| ~ ssList(X35) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_63,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_37]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| app(nil,X1) != nil
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_50]),c_0_27])]) ).
fof(c_0_65,plain,
! [X65,X66,X67] :
( ( ~ ssItem(X65)
| ~ ssList(X66)
| ~ ssList(X67)
| memberP(app(X66,X67),X65)
| ~ memberP(X67,X65) )
& ( ~ ssItem(X65)
| ~ ssList(X66)
| ~ ssList(X67)
| memberP(app(X66,X67),X65)
| ~ memberP(X66,X65) )
& ( ~ ssItem(X65)
| ~ ssList(X66)
| ~ ssList(X67)
| memberP(X67,X65)
| memberP(X66,X65)
| ~ memberP(app(X66,X67),X65) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_67,negated_conjecture,
( ~ segmentP(nil,esk4_0)
| app(esk10_2(nil,esk4_0),esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_34]),c_0_27])]) ).
fof(c_0_68,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_69,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_62]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| app(nil,X1) != nil
| app(X1,nil) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_54]),c_0_27])]),c_0_55]) ).
cnf(c_0_72,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(esk10_2(nil,esk4_0))
| ~ segmentP(nil,esk4_0)
| esk10_2(nil,esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_34])]) ).
fof(c_0_74,plain,
! [X71] :
( ~ memberP(nil,X71)
| ~ ssItem(X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])]) ).
cnf(c_0_75,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(app(nil,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_50]),c_0_27])]) ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_26]),c_0_27])]),c_0_25]) ).
cnf(c_0_77,negated_conjecture,
( esk4_0 != nil
| app(esk4_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_42]),c_0_34])]) ).
fof(c_0_78,plain,
! [X85,X86] :
( cons(X86,X85) = app(cons(X86,nil),X85)
| ~ ssItem(X86)
| ~ ssList(X85) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_79,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(app(esk10_2(X1,X3),X3))
| ~ memberP(app(esk10_2(X1,X3),X3),X2)
| ~ segmentP(X1,X3)
| memberP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_40]),c_0_52]) ).
cnf(c_0_80,negated_conjecture,
( ~ segmentP(nil,esk4_0)
| esk10_2(nil,esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_56]),c_0_34]),c_0_27])]) ).
cnf(c_0_81,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_75,c_0_26]) ).
cnf(c_0_83,negated_conjecture,
( esk4_0 != nil
| segmentP(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_34]),c_0_27])]) ).
cnf(c_0_84,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_85,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_86,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_87,plain,
! [X59,X60,X63,X64] :
( ( ~ ssList(X59)
| ~ ssItem(X60)
| memberP(X59,X60)
| app(X63,cons(X60,X64)) != X59
| ~ ssList(X64)
| ~ ssList(X63) )
& ( ~ ssList(X59)
| ~ ssItem(X60)
| ~ memberP(X59,X60)
| app(esk14_2(X59,X60),cons(X60,esk15_2(X59,X60))) = X59 )
& ( ~ ssList(X59)
| ~ ssItem(X60)
| ~ memberP(X59,X60)
| ssList(esk15_2(X59,X60)) )
& ( ~ ssList(X59)
| ~ ssItem(X60)
| ~ memberP(X59,X60)
| ssList(esk14_2(X59,X60)) ) ),
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_88,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| ~ segmentP(nil,esk4_0) ),
inference(csr,[status(thm)],[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(spm,[status(thm)],[c_0_79,c_0_80]),c_0_42]),c_0_42]),c_0_34]),c_0_34]),c_0_27])]),c_0_81]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssList(X1)
| esk4_0 != nil
| segmentP(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_34])]) ).
cnf(c_0_90,negated_conjecture,
( ~ ssList(X1)
| esk4_0 = nil
| cons(esk5_0,X1) = app(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]) ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk15_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_92,negated_conjecture,
( ~ equalelemsP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_93,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_94,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| esk4_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_27])]) ).
cnf(c_0_95,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_96,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_97,plain,
! [X22] :
( equalelemsP(cons(X22,nil))
| ~ ssItem(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
cnf(c_0_98,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| esk4_0 = nil
| cons(esk5_0,esk15_2(X1,X2)) = app(esk3_0,esk15_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_99,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_100,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ equalelemsP(esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93]),c_0_32]),c_0_93]) ).
cnf(c_0_101,negated_conjecture,
( esk4_0 != nil
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).
cnf(c_0_102,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_103,negated_conjecture,
segmentP(esk4_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_42]),c_0_27]),c_0_34])]) ).
cnf(c_0_104,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_105,negated_conjecture,
( esk4_0 = nil
| cons(esk5_0,esk15_2(esk4_0,esk5_0)) = app(esk3_0,esk15_2(esk4_0,esk5_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_34])]),c_0_86]) ).
cnf(c_0_106,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_103])]) ).
cnf(c_0_107,negated_conjecture,
( equalelemsP(esk3_0)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_85]),c_0_86]) ).
cnf(c_0_108,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(esk14_2(X1,X2),cons(X2,esk15_2(X1,X2))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_109,negated_conjecture,
cons(esk5_0,esk15_2(esk4_0,esk5_0)) = app(esk3_0,esk15_2(esk4_0,esk5_0)),
inference(sr,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_99,c_0_106]) ).
cnf(c_0_111,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_86,c_0_106]) ).
cnf(c_0_112,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_113,negated_conjecture,
equalelemsP(esk3_0),
inference(sr,[status(thm)],[c_0_107,c_0_106]) ).
cnf(c_0_114,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(X1,app(X2,X3)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_24]),c_0_41]) ).
cnf(c_0_115,negated_conjecture,
app(esk14_2(esk4_0,esk5_0),app(esk3_0,esk15_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]),c_0_34]),c_0_111])]) ).
cnf(c_0_116,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_112,c_0_93]) ).
cnf(c_0_117,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_113])]) ).
cnf(c_0_118,negated_conjecture,
( ~ ssList(esk14_2(esk4_0,esk5_0))
| ~ ssList(esk15_2(esk4_0,esk5_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116])]),c_0_117]) ).
cnf(c_0_119,negated_conjecture,
~ ssList(esk14_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_91]),c_0_110]),c_0_34]),c_0_111])]) ).
cnf(c_0_120,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk14_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_121,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_110]),c_0_34]),c_0_111])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC329+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 08:15:47 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 261.27/38.29 % Version: 3.5.1
% 261.27/38.29 % Preprocessing class: FSLSSMSSSSSNFFN.
% 261.27/38.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 261.27/38.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 261.27/38.29 % Starting new_bool_3 with 300s (1) cores
% 261.27/38.29 % Starting new_bool_1 with 300s (1) cores
% 261.27/38.29 % Starting sh5l with 300s (1) cores
% 261.27/38.29 % new_bool_3 with pid 2992764 completed with status 0
% 261.27/38.29 % Result found by new_bool_3
% 261.27/38.29 % Preprocessing class: FSLSSMSSSSSNFFN.
% 261.27/38.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 261.27/38.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 261.27/38.29 % Starting new_bool_3 with 300s (1) cores
% 261.27/38.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 261.27/38.29 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 261.27/38.29 % Search class: FGHSF-FFMM21-MFFFFFNN
% 261.27/38.29 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 261.27/38.29 % Starting SubtermCWHack with 31s (1) cores
% 261.27/38.29 % SubtermCWHack with pid 2992782 completed with status 8
% 261.27/38.29 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 261.27/38.29 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2993793 completed with status 0
% 261.27/38.29 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 261.27/38.29 % Preprocessing class: FSLSSMSSSSSNFFN.
% 261.27/38.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 261.27/38.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 261.27/38.29 % Starting new_bool_3 with 300s (1) cores
% 261.27/38.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 261.27/38.29 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 261.27/38.29 % Search class: FGHSF-FFMM21-MFFFFFNN
% 261.27/38.29 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 261.27/38.29 % Starting SubtermCWHack with 31s (1) cores
% 261.27/38.29 % SubtermCWHack with pid 2992782 completed with status 8
% 261.27/38.29 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 261.27/38.29 % Preprocessing time : 0.001 s
% 261.27/38.29 % Presaturation interreduction done
% 261.27/38.29
% 261.27/38.29 % Proof found!
% 261.27/38.29 % SZS status Theorem
% 261.27/38.29 % SZS output start CNFRefutation
% See solution above
% 261.27/38.29 % Parsed axioms : 96
% 261.27/38.29 % Removed by relevancy pruning/SinE : 56
% 261.27/38.29 % Initial clauses : 80
% 261.27/38.29 % Removed in clause preprocessing : 0
% 261.27/38.29 % Initial clauses in saturation : 80
% 261.27/38.29 % Processed clauses : 24797
% 261.27/38.29 % ...of these trivial : 1379
% 261.27/38.29 % ...subsumed : 17702
% 261.27/38.29 % ...remaining for further processing : 5716
% 261.27/38.29 % Other redundant clauses eliminated : 127
% 261.27/38.29 % Clauses deleted for lack of memory : 0
% 261.27/38.29 % Backward-subsumed : 950
% 261.27/38.29 % Backward-rewritten : 791
% 261.27/38.29 % Generated clauses : 501504
% 261.27/38.29 % ...of the previous two non-redundant : 495412
% 261.27/38.29 % ...aggressively subsumed : 0
% 261.27/38.29 % Contextual simplify-reflections : 1537
% 261.27/38.29 % Paramodulations : 500392
% 261.27/38.29 % Factorizations : 2
% 261.27/38.29 % NegExts : 0
% 261.27/38.29 % Equation resolutions : 170
% 261.27/38.29 % Disequality decompositions : 0
% 261.27/38.29 % Total rewrite steps : 176632
% 261.27/38.29 % ...of those cached : 176329
% 261.27/38.29 % Propositional unsat checks : 1
% 261.27/38.29 % Propositional check models : 0
% 261.27/38.29 % Propositional check unsatisfiable : 0
% 261.27/38.29 % Propositional clauses : 0
% 261.27/38.29 % Propositional clauses after purity: 0
% 261.27/38.29 % Propositional unsat core size : 0
% 261.27/38.29 % Propositional preprocessing time : 0.000
% 261.27/38.29 % Propositional encoding time : 0.387
% 261.27/38.29 % Propositional solver time : 0.305
% 261.27/38.29 % Success case prop preproc time : 0.000
% 261.27/38.29 % Success case prop encoding time : 0.000
% 261.27/38.29 % Success case prop solver time : 0.000
% 261.27/38.29 % Current number of processed clauses : 2951
% 261.27/38.29 % Positive orientable unit clauses : 350
% 261.27/38.29 % Positive unorientable unit clauses: 0
% 261.27/38.29 % Negative unit clauses : 299
% 261.27/38.29 % Non-unit-clauses : 2302
% 261.27/38.29 % Current number of unprocessed clauses: 459814
% 261.27/38.29 % ...number of literals in the above : 1996050
% 261.27/38.29 % Current number of archived formulas : 0
% 261.27/38.29 % Current number of archived clauses : 2758
% 261.27/38.29 % Clause-clause subsumption calls (NU) : 746436
% 261.27/38.29 % Rec. Clause-clause subsumption calls : 327924
% 261.27/38.29 % Non-unit clause-clause subsumptions : 16435
% 261.27/38.29 % Unit Clause-clause subsumption calls : 44727
% 261.27/38.29 % Rewrite failures with RHS unbound : 0
% 261.27/38.29 % BW rewrite match attempts : 3963
% 261.27/38.29 % BW rewrite match successes : 40
% 261.27/38.29 % Condensation attempts : 0
% 261.27/38.29 % Condensation successes : 0
% 261.27/38.29 % Termbank termtop insertions : 15710968
% 261.27/38.29 % Search garbage collected termcells : 2125
% 261.27/38.29
% 261.27/38.29 % -------------------------------------------------
% 261.27/38.29 % User time : 35.459 s
% 261.27/38.29 % System time : 1.550 s
% 261.27/38.29 % Total time : 37.008 s
% 261.27/38.29 % Maximum resident set size: 3760 pages
% 261.27/38.29
% 261.27/38.29 % -------------------------------------------------
% 261.27/38.29 % User time : 35.464 s
% 261.27/38.29 % System time : 1.555 s
% 261.27/38.29 % Total time : 37.019 s
% 261.27/38.29 % Maximum resident set size: 4864 pages
% 261.27/38.29 % E exiting
%------------------------------------------------------------------------------