%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC066+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:44:46 PM UTC 2026
% Result : Theorem 228.05s 33.65s
% Output : CNFRefutation 228.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 23
% Syntax : Number of formulae : 134 ( 19 unt; 0 def)
% Number of atoms : 514 ( 132 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 648 ( 268 ~; 261 |; 47 &)
% ( 4 <=>; 68 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 205 ( 0 sgn 101 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ segmentP(X4,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(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X2,X3)
& segmentP(X1,X2) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax53) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X2,X1)
& segmentP(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax54) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
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(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(c_0_23,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_25,negated_conjecture,
! [X11,X12] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( ~ totalorderedP(X11)
| ~ segmentP(X11,esk3_0)
| ~ segmentP(esk4_0,X11)
| ~ neq(esk3_0,X11)
| ~ ssList(X11) )
& totalorderedP(esk3_0)
& segmentP(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_24])])])])])]) ).
fof(c_0_26,plain,
! [X60,X61,X62] :
( X62 = X60
| app(X62,X61) != app(X60,X61)
| ~ ssList(X62)
| ~ ssList(X61)
| ~ ssList(X60) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_27,plain,
! [X68,X69,X70] :
( app(app(X68,X69),X70) = app(X68,app(X69,X70))
| ~ ssList(X70)
| ~ ssList(X69)
| ~ ssList(X68) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_28,plain,
! [X54,X55] :
( ssList(app(X54,X55))
| ~ ssList(X55)
| ~ ssList(X54) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_29,plain,
! [X59] :
( app(nil,X59) = X59
| ~ ssList(X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_30,plain,
! [X19,X20,X21] :
( segmentP(X19,X21)
| ~ segmentP(X20,X21)
| ~ segmentP(X19,X20)
| ~ ssList(X21)
| ~ ssList(X20)
| ~ ssList(X19) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_31,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_34,plain,
! [X13,X14,X17,X18] :
( ( ~ ssList(X13)
| ~ ssList(X14)
| segmentP(X13,X14)
| app(app(X17,X14),X18) != X13
| ~ ssList(X18)
| ~ ssList(X17) )
& ( ~ ssList(X13)
| ~ ssList(X14)
| ~ segmentP(X13,X14)
| app(app(esk5_2(X13,X14),X14),esk6_2(X13,X14)) = X13 )
& ( ~ ssList(X13)
| ~ ssList(X14)
| ~ segmentP(X13,X14)
| ssList(esk6_2(X13,X14)) )
& ( ~ ssList(X13)
| ~ ssList(X14)
| ~ segmentP(X13,X14)
| ssList(esk5_2(X13,X14)) ) ),
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_35,plain,
( app(X3,X2) != app(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_40,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_41,plain,
( ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,negated_conjecture,
segmentP(esk2_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_45,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_34]) ).
fof(c_0_46,plain,
! [X71,X72] :
( ( ~ ssList(X71)
| ~ ssList(X72)
| nil = app(X71,X72)
| nil != X71
| nil != X72 )
& ( ~ ssList(X71)
| ~ ssList(X72)
| nil != app(X71,X72)
| nil = X71 )
& ( ~ ssList(X71)
| ~ ssList(X72)
| nil != app(X71,X72)
| nil = X72 ) ),
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])])])])]) ).
cnf(c_0_47,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_35,c_0_36]),c_0_37]) ).
cnf(c_0_48,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_36,c_0_38]),c_0_39])]) ).
fof(c_0_49,plain,
! [X33,X34] :
( ( ~ ssList(X33)
| ~ ssList(X34)
| neq(X33,X34)
| X33 = X34 )
& ( ~ ssList(X33)
| ~ ssList(X34)
| X33 != X34
| ~ neq(X33,X34) ) ),
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_40])])])])]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,esk2_0)
| segmentP(X1,esk1_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_43]),c_0_44])]) ).
cnf(c_0_51,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_45]) ).
fof(c_0_52,plain,
! [X63,X64,X65] :
( X65 = X63
| app(X64,X65) != app(X64,X63)
| ~ ssList(X65)
| ~ ssList(X64)
| ~ ssList(X63) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_54,plain,
! [X73] :
( app(X73,nil) = X73
| ~ ssList(X73) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_55,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_47,c_0_48]),c_0_39])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,esk2_0)
| segmentP(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_50]),c_0_43])]) ).
cnf(c_0_58,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_51,c_0_38]),c_0_39])]),c_0_37]) ).
fof(c_0_59,plain,
! [X24] :
( segmentP(X24,X24)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_60,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_61,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_53])]),c_0_39])]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_37]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,esk2_0) != app(X2,esk2_0)
| X1 = app(nil,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_44]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| neq(X1,nil)
| X1 = nil ),
inference(spm,[status(thm)],[c_0_56,c_0_39]) ).
fof(c_0_66,plain,
! [X22,X23] :
( X22 = X23
| ~ segmentP(X23,X22)
| ~ segmentP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])])]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(esk2_0,X2))
| ~ segmentP(X1,app(esk2_0,X2))
| segmentP(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_44])]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| app(nil,X1) != nil
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_39])]) ).
cnf(c_0_70,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_62,c_0_36]),c_0_39])]),c_0_37]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ssList(app(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_61]),c_0_39])]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X1)
| app(esk2_0,esk2_0) != app(X1,esk2_0)
| app(nil,X1) = esk2_0 ),
inference(spm,[status(thm)],[c_0_64,c_0_44]) ).
cnf(c_0_73,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_74,negated_conjecture,
( neq(esk1_0,nil)
| esk1_0 = nil ),
inference(spm,[status(thm)],[c_0_65,c_0_43]) ).
cnf(c_0_75,plain,
( ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_76,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(esk2_0,X1))
| segmentP(app(esk2_0,X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_77,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_69,c_0_70]),c_0_39])]),c_0_71]) ).
cnf(c_0_78,negated_conjecture,
app(nil,esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_72]),c_0_44])]) ).
cnf(c_0_79,negated_conjecture,
( ~ segmentP(esk1_0,esk1_0)
| esk2_0 = nil
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_42]),c_0_43])]) ).
cnf(c_0_80,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_81,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_62]),c_0_39])]),c_0_37]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(esk2_0,X1))
| ~ segmentP(esk1_0,app(esk2_0,X1))
| app(esk2_0,X1) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_43])]) ).
cnf(c_0_84,negated_conjecture,
( esk2_0 != nil
| app(esk2_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_44])]) ).
cnf(c_0_85,negated_conjecture,
( esk1_0 = nil
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_68]),c_0_43])]) ).
fof(c_0_86,plain,
! [X29] :
( segmentP(X29,nil)
| ~ ssList(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_87,plain,
! [X76,X77] :
( ssList(cons(X77,X76))
| ~ ssItem(X77)
| ~ ssList(X76) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_88,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_89,plain,
! [X56,X57,X58] :
( cons(X58,app(X57,X56)) = app(cons(X58,X57),X56)
| ~ ssItem(X58)
| ~ ssList(X57)
| ~ ssList(X56) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_90,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_91,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| ~ segmentP(esk1_0,esk2_0)
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_44])]) ).
cnf(c_0_92,negated_conjecture,
segmentP(esk2_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_78]),c_0_44]),c_0_39])]) ).
cnf(c_0_93,negated_conjecture,
( ~ segmentP(esk1_0,nil)
| esk1_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_39])]),c_0_85]) ).
cnf(c_0_94,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
fof(c_0_95,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_96,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_97,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk3_0)
| ~ segmentP(esk4_0,X1)
| ~ neq(esk3_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_98,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
fof(c_0_99,plain,
! [X38,X39] :
( nil != cons(X39,X38)
| ~ ssItem(X39)
| ~ ssList(X38) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_88])])])]) ).
cnf(c_0_100,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
fof(c_0_101,plain,
! [X104] :
( cons(hd(X104),tl(X104)) = X104
| nil = X104
| ~ ssList(X104) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_90])])]) ).
cnf(c_0_102,negated_conjecture,
( ~ segmentP(esk1_0,esk2_0)
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_103,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_43])]) ).
fof(c_0_104,plain,
! [X113] :
( ssList(tl(X113))
| nil = X113
| ~ ssList(X113) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_95])])]) ).
fof(c_0_105,plain,
! [X97] :
( ssItem(hd(X97))
| nil = X97
| ~ ssList(X97) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_96])])]) ).
cnf(c_0_106,negated_conjecture,
( ~ neq(esk1_0,X1)
| ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(X1,esk1_0)
| ~ totalorderedP(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_33]),c_0_33]),c_0_32]) ).
cnf(c_0_107,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| neq(X1,cons(X2,X3))
| X1 = cons(X2,X3) ),
inference(spm,[status(thm)],[c_0_56,c_0_98]) ).
cnf(c_0_108,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
fof(c_0_109,plain,
! [X66,X67] :
( cons(X67,X66) = app(cons(X67,nil),X66)
| ~ ssItem(X67)
| ~ ssList(X66) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_110,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_100]),c_0_37]) ).
cnf(c_0_111,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_100,c_0_61]),c_0_39])]) ).
cnf(c_0_112,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_113,negated_conjecture,
~ segmentP(nil,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103]),c_0_103])]) ).
cnf(c_0_114,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_115,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_116,negated_conjecture,
( ~ neq(nil,X1)
| ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_103]),c_0_103]),c_0_94]) ).
cnf(c_0_117,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| neq(nil,cons(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_39]),c_0_108]) ).
fof(c_0_118,plain,
! [X51] :
( totalorderedP(cons(X51,nil))
| ~ ssItem(X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])])]) ).
cnf(c_0_119,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_120,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_39])]) ).
cnf(c_0_121,negated_conjecture,
( esk2_0 = nil
| cons(hd(esk2_0),tl(esk2_0)) = esk2_0 ),
inference(spm,[status(thm)],[c_0_112,c_0_44]) ).
cnf(c_0_122,negated_conjecture,
esk2_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_84]),c_0_44]),c_0_39])]),c_0_113]) ).
cnf(c_0_123,negated_conjecture,
( ssList(tl(esk2_0))
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_114,c_0_44]) ).
cnf(c_0_124,negated_conjecture,
( ssItem(hd(esk2_0))
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_115,c_0_44]) ).
cnf(c_0_125,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ segmentP(esk2_0,cons(X1,X2))
| ~ totalorderedP(cons(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_98]) ).
cnf(c_0_126,plain,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_127,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| segmentP(cons(X1,X2),cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_119]),c_0_120]) ).
cnf(c_0_128,negated_conjecture,
cons(hd(esk2_0),tl(esk2_0)) = esk2_0,
inference(sr,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_129,negated_conjecture,
ssList(tl(esk2_0)),
inference(sr,[status(thm)],[c_0_123,c_0_122]) ).
cnf(c_0_130,negated_conjecture,
ssItem(hd(esk2_0)),
inference(sr,[status(thm)],[c_0_124,c_0_122]) ).
cnf(c_0_131,negated_conjecture,
( ~ ssItem(X1)
| ~ segmentP(esk2_0,cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_39])]) ).
cnf(c_0_132,negated_conjecture,
segmentP(esk2_0,cons(hd(esk2_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]),c_0_130])]) ).
cnf(c_0_133,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_130])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC066+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.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 07:52:17 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 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
% 228.05/33.65 % Version: 3.5.1
% 228.05/33.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 228.05/33.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 228.05/33.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 228.05/33.65 % Starting new_bool_3 with 300s (1) cores
% 228.05/33.65 % Starting new_bool_1 with 300s (1) cores
% 228.05/33.65 % Starting sh5l with 300s (1) cores
% 228.05/33.65 % new_bool_3 with pid 2947672 completed with status 0
% 228.05/33.65 % Result found by new_bool_3
% 228.05/33.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 228.05/33.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 228.05/33.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 228.05/33.65 % Starting new_bool_3 with 300s (1) cores
% 228.05/33.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 228.05/33.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 228.05/33.65 % Search class: FGHSF-FFMM21-MFFFFFNN
% 228.05/33.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 228.05/33.65 % Starting SubtermCWHack with 31s (1) cores
% 228.05/33.65 % SubtermCWHack with pid 2947675 completed with status 8
% 228.05/33.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 228.05/33.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2948135 completed with status 0
% 228.05/33.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 228.05/33.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 228.05/33.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 228.05/33.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 228.05/33.65 % Starting new_bool_3 with 300s (1) cores
% 228.05/33.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 228.05/33.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 228.05/33.65 % Search class: FGHSF-FFMM21-MFFFFFNN
% 228.05/33.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 228.05/33.65 % Starting SubtermCWHack with 31s (1) cores
% 228.05/33.65 % SubtermCWHack with pid 2947675 completed with status 8
% 228.05/33.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 228.05/33.65 % Preprocessing time : 0.003 s
% 228.05/33.65 % Presaturation interreduction done
% 228.05/33.65
% 228.05/33.65 % Proof found!
% 228.05/33.65 % SZS status Theorem
% 228.05/33.65 % SZS output start CNFRefutation
% See solution above
% 228.05/33.65 % Parsed axioms : 96
% 228.05/33.65 % Removed by relevancy pruning/SinE : 47
% 228.05/33.65 % Initial clauses : 89
% 228.05/33.65 % Removed in clause preprocessing : 1
% 228.05/33.65 % Initial clauses in saturation : 88
% 228.05/33.65 % Processed clauses : 4825
% 228.05/33.65 % ...of these trivial : 93
% 228.05/33.65 % ...subsumed : 2646
% 228.05/33.65 % ...remaining for further processing : 2086
% 228.05/33.65 % Other redundant clauses eliminated : 81
% 228.05/33.65 % Clauses deleted for lack of memory : 0
% 228.05/33.65 % Backward-subsumed : 119
% 228.05/33.65 % Backward-rewritten : 566
% 228.05/33.65 % Generated clauses : 76519
% 228.05/33.65 % ...of the previous two non-redundant : 75655
% 228.05/33.65 % ...aggressively subsumed : 0
% 228.05/33.65 % Contextual simplify-reflections : 308
% 228.05/33.65 % Paramodulations : 76216
% 228.05/33.65 % Factorizations : 0
% 228.05/33.65 % NegExts : 0
% 228.05/33.65 % Equation resolutions : 117
% 228.05/33.65 % Disequality decompositions : 0
% 228.05/33.65 % Total rewrite steps : 15765
% 228.05/33.65 % ...of those cached : 15709
% 228.05/33.65 % Propositional unsat checks : 0
% 228.05/33.65 % Propositional check models : 0
% 228.05/33.65 % Propositional check unsatisfiable : 0
% 228.05/33.65 % Propositional clauses : 0
% 228.05/33.65 % Propositional clauses after purity: 0
% 228.05/33.65 % Propositional unsat core size : 0
% 228.05/33.65 % Propositional preprocessing time : 0.000
% 228.05/33.65 % Propositional encoding time : 0.000
% 228.05/33.65 % Propositional solver time : 0.000
% 228.05/33.65 % Success case prop preproc time : 0.000
% 228.05/33.65 % Success case prop encoding time : 0.000
% 228.05/33.65 % Success case prop solver time : 0.000
% 228.05/33.65 % Current number of processed clauses : 1123
% 228.05/33.65 % Positive orientable unit clauses : 67
% 228.05/33.65 % Positive unorientable unit clauses: 0
% 228.05/33.65 % Negative unit clauses : 15
% 228.05/33.65 % Non-unit-clauses : 1041
% 228.05/33.65 % Current number of unprocessed clauses: 69100
% 228.05/33.65 % ...number of literals in the above : 266674
% 228.05/33.65 % Current number of archived formulas : 0
% 228.05/33.65 % Current number of archived clauses : 955
% 228.05/33.65 % Clause-clause subsumption calls (NU) : 262325
% 228.05/33.65 % Rec. Clause-clause subsumption calls : 108968
% 228.05/33.65 % Non-unit clause-clause subsumptions : 2738
% 228.05/33.65 % Unit Clause-clause subsumption calls : 10296
% 228.05/33.65 % Rewrite failures with RHS unbound : 0
% 228.05/33.65 % BW rewrite match attempts : 69
% 228.05/33.65 % BW rewrite match successes : 19
% 228.05/33.65 % Condensation attempts : 0
% 228.05/33.65 % Condensation successes : 0
% 228.05/33.65 % Termbank termtop insertions : 1453715
% 228.05/33.65 % Search garbage collected termcells : 2235
% 228.05/33.65
% 228.05/33.65 % -------------------------------------------------
% 228.05/33.65 % User time : 31.000 s
% 228.05/33.65 % System time : 1.349 s
% 228.05/33.65 % Total time : 32.348 s
% 228.05/33.65 % Maximum resident set size: 3964 pages
% 228.05/33.65
% 228.05/33.65 % -------------------------------------------------
% 228.05/33.65 % User time : 31.004 s
% 228.05/33.65 % System time : 1.355 s
% 228.05/33.65 % Total time : 32.359 s
% 228.05/33.65 % Maximum resident set size: 4608 pages
% 228.05/33.65 % E exiting
%------------------------------------------------------------------------------