%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC183+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 : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:45:17 PM UTC 2026
% Result : Theorem 1.40s 0.68s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 21
% Syntax : Number of formulae : 132 ( 22 unt; 0 def)
% Number of atoms : 513 ( 167 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 638 ( 257 ~; 265 |; 44 &)
% ( 4 <=>; 68 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 176 ( 0 sgn 106 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X8] :
( ? [X9] :
( leq(X8,X9)
& memberP(X4,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X4,X8)
| cons(X8,nil) != X3
| ~ ssItem(X8) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ( ~ memberP(X7,X5)
& ~ memberP(X6,X5) )
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
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(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( memberP(X3,X1)
| X1 = X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
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(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax41,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X2,X1)
& frontsegP(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax41) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X8] :
( ? [X9] :
( leq(X8,X9)
& memberP(X4,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X4,X8)
| cons(X8,nil) != X3
| ~ ssItem(X8) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ( ~ memberP(X7,X5)
& ~ memberP(X6,X5) )
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X8] :
( ? [X9] :
( leq(X8,X9)
& memberP(X4,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X4,X8)
| cons(X8,nil) != X3
| ~ ssItem(X8) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ( ~ memberP(X7,X5)
& ~ memberP(X6,X5) )
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_23,negated_conjecture,
! [X18] :
( ( ~ leq(esk8_0,X18)
| ~ memberP(esk4_0,X18)
| esk8_0 = X18
| ~ ssItem(X18)
| nil = esk3_0 )
& ( ~ leq(esk8_0,X18)
| ~ memberP(esk4_0,X18)
| esk8_0 = X18
| ~ ssItem(X18)
| nil = esk4_0 )
& ( memberP(esk4_0,esk8_0)
| nil = esk3_0 )
& ( memberP(esk4_0,esk8_0)
| nil = esk4_0 )
& ( cons(esk8_0,nil) = esk3_0
| nil = esk3_0 )
& ( cons(esk8_0,nil) = esk3_0
| nil = esk4_0 )
& ( ssItem(esk8_0)
| nil = esk3_0 )
& ( ssItem(esk8_0)
| nil = esk4_0 )
& ( memberP(esk7_0,esk5_0)
| memberP(esk6_0,esk5_0) )
& app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0
& ssList(esk7_0)
& ssList(esk6_0)
& ssItem(esk5_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_24,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_25,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X144,X145,X146] :
( app(app(X144,X145),X146) = app(X144,app(X145,X146))
| ~ ssList(X146)
| ~ ssList(X145)
| ~ ssList(X144) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_27,plain,
! [X27,X28] :
( ( ~ ssList(X27)
| ~ ssList(X28)
| nil = app(X27,X28)
| nil != X27
| nil != X28 )
& ( ~ ssList(X27)
| ~ ssList(X28)
| nil != app(X27,X28)
| nil = X27 )
& ( ~ ssList(X27)
| ~ ssList(X28)
| nil != app(X27,X28)
| nil = X28 ) ),
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_28,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk3_0,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_32,plain,
! [X25,X26] :
( cons(X26,X25) = app(cons(X26,nil),X25)
| ~ ssItem(X26)
| ~ ssList(X25) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_34,plain,
! [X126,X127] :
( ssList(app(X126,X127))
| ~ ssList(X127)
| ~ ssList(X126) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| app(esk6_0,app(cons(esk5_0,nil),esk7_0)) = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(app(esk6_0,cons(esk5_0,nil)))
| esk3_0 != nil
| esk7_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_30])]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,plain,
! [X95,X96] :
( ssList(cons(X96,X95))
| ~ ssItem(X96)
| ~ ssList(X95) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| app(esk6_0,cons(esk5_0,esk7_0)) = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_30]),c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| esk3_0 != nil
| esk7_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_31])]) ).
cnf(c_0_44,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk7_0))
| esk3_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_31])]) ).
cnf(c_0_47,negated_conjecture,
( esk3_0 != nil
| esk7_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_37])]) ).
fof(c_0_48,plain,
! [X112,X113,X115] :
( ( ~ ssList(X112)
| ~ ssList(X113)
| frontsegP(X112,X113)
| app(X113,X115) != X112
| ~ ssList(X115) )
& ( ~ ssList(X112)
| ~ ssList(X113)
| ~ frontsegP(X112,X113)
| app(X113,esk30_2(X112,X113)) = X112 )
& ( ~ ssList(X112)
| ~ ssList(X113)
| ~ frontsegP(X112,X113)
| ssList(esk30_2(X112,X113)) ) ),
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_49,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_50,negated_conjecture,
( memberP(esk7_0,esk5_0)
| memberP(esk6_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| esk3_0 != nil
| esk6_0 = nil ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X2,X1) != X3
| ~ ssList(X1)
| frontsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
fof(c_0_53,plain,
! [X86,X87,X88] :
( ( ~ ssItem(X86)
| ~ ssList(X87)
| ~ ssList(X88)
| memberP(app(X87,X88),X86)
| ~ memberP(X88,X86) )
& ( ~ ssItem(X86)
| ~ ssList(X87)
| ~ ssList(X88)
| memberP(app(X87,X88),X86)
| ~ memberP(X87,X86) )
& ( ~ ssItem(X86)
| ~ ssList(X87)
| ~ ssList(X88)
| memberP(X88,X86)
| memberP(X87,X86)
| ~ memberP(app(X87,X88),X86) ) ),
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])])])])]) ).
fof(c_0_54,plain,
! [X92] :
( ~ memberP(nil,X92)
| ~ ssItem(X92) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])]) ).
cnf(c_0_55,negated_conjecture,
( esk3_0 != nil
| memberP(nil,esk5_0)
| memberP(esk6_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( esk3_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_44]),c_0_45]),c_0_37])]) ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_52]),c_0_39]) ).
cnf(c_0_58,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( esk3_0 != nil
| memberP(nil,esk5_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk30_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk30_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| ~ ssList(app(cons(esk5_0,nil),esk7_0))
| frontsegP(esk3_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_35]),c_0_31])]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(app(esk6_0,cons(esk5_0,nil)))
| ~ memberP(esk7_0,X1)
| memberP(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_28]),c_0_30])]) ).
fof(c_0_66,plain,
! [X89,X90,X91] :
( ( ~ ssItem(X89)
| ~ ssItem(X90)
| ~ ssList(X91)
| memberP(cons(X90,X91),X89)
| ~ memberP(X91,X89) )
& ( ~ ssItem(X89)
| ~ ssItem(X90)
| ~ ssList(X91)
| memberP(cons(X90,X91),X89)
| X89 != X90 )
& ( ~ ssItem(X89)
| ~ ssItem(X90)
| ~ ssList(X91)
| memberP(X91,X89)
| X89 = X90
| ~ memberP(cons(X90,X91),X89) ) ),
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])])])])]) ).
cnf(c_0_67,negated_conjecture,
( cons(esk8_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_68,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_37])]) ).
cnf(c_0_69,negated_conjecture,
( ssItem(esk8_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_70,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X3,X2)
| ~ frontsegP(X1,X3)
| memberP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| frontsegP(esk3_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_39]),c_0_30])]) ).
cnf(c_0_72,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(cons(esk5_0,nil))
| ~ memberP(esk7_0,X1)
| memberP(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_39]),c_0_31])]) ).
cnf(c_0_74,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| memberP(X2,X3)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_75,negated_conjecture,
cons(esk8_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,negated_conjecture,
ssItem(esk8_0),
inference(sr,[status(thm)],[c_0_69,c_0_68]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(cons(esk5_0,nil))
| ~ memberP(esk6_0,X1)
| memberP(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_31]),c_0_72])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| memberP(esk3_0,esk5_0)
| memberP(esk6_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_50]),c_0_37])]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| esk8_0 = X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_45]),c_0_76])]),c_0_59]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| memberP(esk3_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_37])]) ).
fof(c_0_81,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
fof(c_0_82,plain,
! [X106,X107] :
( hd(cons(X107,X106)) = X107
| ~ ssItem(X107)
| ~ ssList(X106) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
fof(c_0_83,plain,
! [X141,X142,X143] :
( X143 = X141
| app(X142,X143) != app(X142,X141)
| ~ ssList(X143)
| ~ ssList(X142)
| ~ ssList(X141) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
fof(c_0_84,plain,
! [X29] :
( app(X29,nil) = X29
| ~ ssList(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_85,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| esk5_0 = esk8_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_37])]) ).
fof(c_0_86,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_87,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
fof(c_0_88,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_89,plain,
! [X147,X148] :
( hd(app(X147,X148)) = hd(X147)
| nil = X147
| ~ ssList(X148)
| ~ ssList(X147) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_81])])])]) ).
cnf(c_0_90,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| hd(cons(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_91,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_92,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_93,negated_conjecture,
esk5_0 = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_44]),c_0_45]),c_0_37])]) ).
fof(c_0_94,plain,
! [X167] :
( cons(hd(X167),tl(X167)) = X167
| nil = X167
| ~ ssList(X167) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_86])])]) ).
fof(c_0_95,plain,
! [X160] :
( ssItem(hd(X160))
| nil = X160
| ~ ssList(X160) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_87])])]) ).
fof(c_0_96,plain,
! [X222] :
( ssList(tl(X222))
| nil = X222
| ~ ssList(X222) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_88])])]) ).
cnf(c_0_97,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X1,X2)) = hd(X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_98,negated_conjecture,
( esk3_0 = nil
| hd(esk3_0) = esk8_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_67]),c_0_45])]),c_0_69]) ).
cnf(c_0_99,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X1) != X2
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_45])]) ).
cnf(c_0_100,negated_conjecture,
app(esk6_0,app(esk3_0,esk7_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_93]),c_0_75]),c_0_75]),c_0_72])]) ).
fof(c_0_101,plain,
! [X103,X104,X105] :
( cons(X105,app(X104,X103)) = app(cons(X105,X104),X103)
| ~ ssItem(X105)
| ~ ssList(X104)
| ~ ssList(X103) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_102,plain,
! [X201,X202] :
( X201 = X202
| ~ frontsegP(X202,X201)
| ~ frontsegP(X201,X202)
| ~ ssList(X202)
| ~ ssList(X201) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax41])])])]) ).
cnf(c_0_103,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| frontsegP(cons(X1,X2),cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_57,c_0_36]) ).
cnf(c_0_104,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_106,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| nil = X2
| hd(X1) = hd(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_62]),c_0_63]) ).
cnf(c_0_108,negated_conjecture,
hd(esk3_0) = esk8_0,
inference(sr,[status(thm)],[c_0_98,c_0_68]) ).
cnf(c_0_109,negated_conjecture,
( ~ ssList(app(esk3_0,esk7_0))
| esk6_0 != esk3_0
| app(esk3_0,esk7_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_31])]) ).
fof(c_0_110,plain,
! [X24] :
( app(nil,X24) = X24
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_111,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_112,negated_conjecture,
( ~ ssList(app(esk6_0,cons(esk5_0,nil)))
| app(esk6_0,cons(esk5_0,nil)) != esk3_0
| esk7_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_28]),c_0_30])]) ).
cnf(c_0_113,plain,
( ~ frontsegP(X2,X1)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_114,plain,
( ~ ssList(X1)
| ~ ssList(cons(hd(X1),nil))
| frontsegP(X1,cons(hd(X1),nil))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]),c_0_106]) ).
cnf(c_0_115,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| esk6_0 = nil
| hd(esk6_0) = esk8_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_71]),c_0_108]),c_0_31]),c_0_72])]) ).
cnf(c_0_116,negated_conjecture,
( esk6_0 != esk3_0
| app(esk3_0,esk7_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_39]),c_0_30]),c_0_72])]) ).
cnf(c_0_117,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_118,negated_conjecture,
( ~ ssList(X1)
| cons(esk8_0,app(nil,X1)) = app(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_75]),c_0_45]),c_0_76])]) ).
cnf(c_0_119,negated_conjecture,
( ~ ssList(app(esk6_0,esk3_0))
| app(esk6_0,esk3_0) != esk3_0
| esk7_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_93]),c_0_75]),c_0_75]) ).
cnf(c_0_120,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| ~ frontsegP(esk6_0,esk3_0)
| esk6_0 = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_71]),c_0_72]),c_0_31])]) ).
cnf(c_0_121,negated_conjecture,
( frontsegP(esk6_0,esk3_0)
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_75]),c_0_75]),c_0_72]),c_0_31]),c_0_93]),c_0_75]),c_0_72])]) ).
cnf(c_0_122,negated_conjecture,
esk6_0 != esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_116]),c_0_30]),c_0_72])]),c_0_68]) ).
cnf(c_0_123,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_29,c_0_117]),c_0_45])]) ).
cnf(c_0_124,negated_conjecture,
app(esk3_0,nil) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_92]),c_0_75]),c_0_45])]) ).
cnf(c_0_125,negated_conjecture,
( app(esk6_0,esk3_0) != esk3_0
| esk7_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_39]),c_0_72]),c_0_31])]) ).
cnf(c_0_126,negated_conjecture,
esk6_0 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_93]),c_0_75]),c_0_72])]),c_0_122]) ).
cnf(c_0_127,negated_conjecture,
app(nil,esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_45]),c_0_72])]) ).
cnf(c_0_128,negated_conjecture,
( memberP(esk7_0,esk8_0)
| memberP(esk6_0,esk8_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_93]),c_0_93]) ).
cnf(c_0_129,negated_conjecture,
esk7_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_126]),c_0_127])]) ).
cnf(c_0_130,negated_conjecture,
memberP(nil,esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_126]),c_0_129])]) ).
cnf(c_0_131,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_130]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC183+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n002.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 08:05:05 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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
% 1.40/0.68 % Version: 3.5.1
% 1.40/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.40/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.40/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.40/0.68 % Starting new_bool_1 with 300s (1) cores
% 1.40/0.68 % Starting sh5l with 300s (1) cores
% 1.40/0.68 % sh5l with pid 2826595 completed with status 0
% 1.40/0.68 % Result found by sh5l
% 1.40/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.40/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.40/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.40/0.68 % Starting new_bool_1 with 300s (1) cores
% 1.40/0.68 % Starting sh5l with 300s (1) cores
% 1.40/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.40/0.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.40/0.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 1.40/0.68 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.40/0.68 % Starting SubtermCWHack with 28s (1) cores
% 1.40/0.68 % SubtermCWHack with pid 2826602 completed with status 0
% 1.40/0.68 % Result found by SubtermCWHack
% 1.40/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.40/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.40/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.40/0.68 % Starting new_bool_1 with 300s (1) cores
% 1.40/0.68 % Starting sh5l with 300s (1) cores
% 1.40/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.40/0.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.40/0.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 1.40/0.68 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.40/0.68 % Starting SubtermCWHack with 28s (1) cores
% 1.40/0.68 % Preprocessing time : 0.003 s
% 1.40/0.68
% 1.40/0.68 % Proof found!
% 1.40/0.68 % SZS status Theorem
% 1.40/0.68 % SZS output start CNFRefutation
% See solution above
% 1.40/0.68 % Parsed axioms : 96
% 1.40/0.68 % Removed by relevancy pruning/SinE : 10
% 1.40/0.68 % Initial clauses : 182
% 1.40/0.68 % Removed in clause preprocessing : 2
% 1.40/0.68 % Initial clauses in saturation : 180
% 1.40/0.68 % Processed clauses : 2183
% 1.40/0.68 % ...of these trivial : 23
% 1.40/0.68 % ...subsumed : 1281
% 1.40/0.68 % ...remaining for further processing : 879
% 1.40/0.68 % Other redundant clauses eliminated : 129
% 1.40/0.68 % Clauses deleted for lack of memory : 0
% 1.40/0.68 % Backward-subsumed : 94
% 1.40/0.68 % Backward-rewritten : 130
% 1.40/0.68 % Generated clauses : 9204
% 1.40/0.68 % ...of the previous two non-redundant : 7574
% 1.40/0.68 % ...aggressively subsumed : 0
% 1.40/0.68 % Contextual simplify-reflections : 200
% 1.40/0.68 % Paramodulations : 9054
% 1.40/0.68 % Factorizations : 0
% 1.40/0.68 % NegExts : 0
% 1.40/0.68 % Equation resolutions : 135
% 1.40/0.68 % Disequality decompositions : 0
% 1.40/0.68 % Total rewrite steps : 10245
% 1.40/0.68 % ...of those cached : 10151
% 1.40/0.68 % Propositional unsat checks : 0
% 1.40/0.68 % Propositional check models : 0
% 1.40/0.68 % Propositional check unsatisfiable : 0
% 1.40/0.68 % Propositional clauses : 0
% 1.40/0.68 % Propositional clauses after purity: 0
% 1.40/0.68 % Propositional unsat core size : 0
% 1.40/0.68 % Propositional preprocessing time : 0.000
% 1.40/0.68 % Propositional encoding time : 0.000
% 1.40/0.68 % Propositional solver time : 0.000
% 1.40/0.68 % Success case prop preproc time : 0.000
% 1.40/0.68 % Success case prop encoding time : 0.000
% 1.40/0.68 % Success case prop solver time : 0.000
% 1.40/0.68 % Current number of processed clauses : 621
% 1.40/0.68 % Positive orientable unit clauses : 93
% 1.40/0.68 % Positive unorientable unit clauses: 0
% 1.40/0.68 % Negative unit clauses : 31
% 1.40/0.68 % Non-unit-clauses : 497
% 1.40/0.68 % Current number of unprocessed clauses: 5350
% 1.40/0.68 % ...number of literals in the above : 27946
% 1.40/0.68 % Current number of archived formulas : 0
% 1.40/0.68 % Current number of archived clauses : 240
% 1.40/0.68 % Clause-clause subsumption calls (NU) : 55869
% 1.40/0.68 % Rec. Clause-clause subsumption calls : 19385
% 1.40/0.68 % Non-unit clause-clause subsumptions : 1180
% 1.40/0.68 % Unit Clause-clause subsumption calls : 3346
% 1.40/0.68 % Rewrite failures with RHS unbound : 0
% 1.40/0.68 % BW rewrite match attempts : 46
% 1.40/0.68 % BW rewrite match successes : 35
% 1.40/0.68 % Condensation attempts : 0
% 1.40/0.68 % Condensation successes : 0
% 1.40/0.68 % Termbank termtop insertions : 178069
% 1.40/0.68 % Search garbage collected termcells : 3885
% 1.40/0.68
% 1.40/0.68 % -------------------------------------------------
% 1.40/0.68 % User time : 0.221 s
% 1.40/0.68 % System time : 0.009 s
% 1.40/0.68 % Total time : 0.230 s
% 1.40/0.68 % Maximum resident set size: 4276 pages
% 1.40/0.68
% 1.40/0.68 % -------------------------------------------------
% 1.40/0.68 % User time : 0.227 s
% 1.40/0.68 % System time : 0.012 s
% 1.40/0.68 % Total time : 0.238 s
% 1.40/0.68 % Maximum resident set size: 4864 pages
% 1.40/0.68 % E exiting
%------------------------------------------------------------------------------