TSTP Solution File: SWC078+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC078+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:27:28 EDT 2024
% Result : Theorem 16.76s 2.58s
% Output : CNFRefutation 16.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 22
% Syntax : Number of formulae : 130 ( 36 unt; 0 def)
% Number of atoms : 450 ( 123 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 537 ( 217 ~; 213 |; 40 &)
% ( 6 <=>; 61 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 183 ( 0 sgn 102 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
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] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax43,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X2)
=> frontsegP(app(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax43) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
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(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(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(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
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(c_0_22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_23,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_24,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( nil != esk2_0
| nil != esk1_0 )
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk5_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])])])])])]) ).
fof(c_0_25,plain,
! [X39,X40] :
( ~ ssList(X39)
| ~ ssItem(X40)
| cons(X40,X39) != X39 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
cnf(c_0_26,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_32,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
fof(c_0_34,plain,
! [X95,X96,X98] :
( ( ssList(esk14_2(X95,X96))
| ~ frontsegP(X95,X96)
| ~ ssList(X96)
| ~ ssList(X95) )
& ( app(X96,esk14_2(X95,X96)) = X95
| ~ frontsegP(X95,X96)
| ~ ssList(X96)
| ~ ssList(X95) )
& ( ~ ssList(X98)
| app(X96,X98) != X95
| frontsegP(X95,X96)
| ~ ssList(X96)
| ~ ssList(X95) ) ),
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_35,plain,
! [X84,X85] :
( ~ ssList(X84)
| ~ ssList(X85)
| ssList(app(X84,X85)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_36,plain,
! [X24,X25,X28,X29] :
( ( ssList(esk8_2(X24,X25))
| ~ memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(X24) )
& ( ssList(esk9_2(X24,X25))
| ~ memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(X24) )
& ( app(esk8_2(X24,X25),cons(X25,esk9_2(X24,X25))) = X24
| ~ memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(X24) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| app(X28,cons(X25,X29)) != X24
| memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(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)],[ax3])])])])])]) ).
cnf(c_0_37,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_41,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_46,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_47,plain,
( ssList(esk8_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_41]),c_0_42]) ).
cnf(c_0_49,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),cons(esk5_0,esk9_2(esk4_0,esk5_0))) = esk4_0,
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_46])]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_45]),c_0_46])]) ).
fof(c_0_51,plain,
! [X37,X38] :
( ~ ssList(X37)
| ~ ssItem(X38)
| ssList(cons(X38,X37)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_52,plain,
( ssList(esk9_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_53,plain,
! [X103,X104,X105] :
( ~ ssList(X103)
| ~ ssList(X104)
| ~ ssList(X105)
| ~ frontsegP(X103,X104)
| frontsegP(app(X103,X105),X104) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax43])])])]) ).
fof(c_0_54,plain,
! [X129] :
( ~ ssList(X129)
| frontsegP(X129,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_55,negated_conjecture,
( frontsegP(esk4_0,esk8_2(esk4_0,esk5_0))
| ~ ssList(cons(esk5_0,esk9_2(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_56,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk9_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_58,plain,
( frontsegP(app(X1,X3),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,plain,
( app(X1,esk14_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_61,negated_conjecture,
frontsegP(esk4_0,esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_46])]) ).
cnf(c_0_62,plain,
( ssList(esk14_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_63,plain,
( frontsegP(app(X1,X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_31])]) ).
cnf(c_0_64,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),esk14_2(esk4_0,esk8_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_45]),c_0_50])]) ).
cnf(c_0_65,negated_conjecture,
ssList(esk14_2(esk4_0,esk8_2(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_61]),c_0_50]),c_0_45])]) ).
fof(c_0_66,plain,
! [X18] :
( ~ ssList(X18)
| app(nil,X18) = X18 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_67,negated_conjecture,
frontsegP(esk4_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_50])]) ).
fof(c_0_68,plain,
! [X47,X48,X49] :
( ~ ssList(X47)
| ~ ssList(X48)
| ~ ssItem(X49)
| cons(X49,app(X48,X47)) = app(cons(X49,X48),X47) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_69,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_70,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_71,negated_conjecture,
app(nil,esk14_2(esk4_0,nil)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_67]),c_0_45]),c_0_31])]) ).
cnf(c_0_72,negated_conjecture,
ssList(esk14_2(esk4_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_67]),c_0_31]),c_0_45])]) ).
fof(c_0_73,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[ax86]) ).
cnf(c_0_74,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_75,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_69,c_0_38]) ).
cnf(c_0_76,negated_conjecture,
esk14_2(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]) ).
fof(c_0_77,plain,
! [X182,X183] :
( ~ ssList(X182)
| ~ ssItem(X183)
| tl(cons(X183,X182)) = X182 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
fof(c_0_78,plain,
! [X62,X63,X66,X67] :
( ( ssList(esk12_2(X62,X63))
| ~ segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( ssList(esk13_2(X62,X63))
| ~ segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( app(app(esk12_2(X62,X63),X63),esk13_2(X62,X63)) = X62
| ~ segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( ~ ssList(X66)
| ~ ssList(X67)
| app(app(X66,X63),X67) != X62
| segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) ) ),
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])])])])])]) ).
fof(c_0_79,plain,
! [X111,X112] :
( ~ ssList(X111)
| ~ ssList(X112)
| nil = X111
| tl(app(X111,X112)) = app(tl(X111),X112) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])])]) ).
fof(c_0_80,plain,
! [X23] :
( ~ ssList(X23)
| app(X23,nil) = X23 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_81,negated_conjecture,
( cons(esk5_0,app(nil,X1)) = app(esk3_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_31]),c_0_46])]) ).
cnf(c_0_82,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(rw,[status(thm)],[c_0_71,c_0_76]) ).
cnf(c_0_83,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_84,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_85,plain,
! [X21,X22] :
( ( nil = X22
| nil != app(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) )
& ( nil = X21
| nil != app(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) )
& ( nil != X22
| nil != X21
| nil = app(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) ) ),
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_86,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
fof(c_0_87,plain,
! [X19,X20] :
( ~ ssList(X19)
| ~ ssItem(X20)
| cons(X20,X19) = app(cons(X20,nil),X19) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_88,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_89,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_90,negated_conjecture,
app(esk3_0,esk4_0) = cons(esk5_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_45])]) ).
cnf(c_0_91,negated_conjecture,
tl(esk3_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_75]),c_0_31]),c_0_46])]) ).
cnf(c_0_92,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_84,c_0_27]) ).
cnf(c_0_93,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_94,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_86]) ).
cnf(c_0_95,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_96,plain,
( app(tl(X1),nil) = tl(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_31])]) ).
cnf(c_0_97,negated_conjecture,
tl(cons(esk5_0,esk4_0)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_90]),c_0_91]),c_0_82]),c_0_45]),c_0_92])]),c_0_38]) ).
cnf(c_0_98,negated_conjecture,
ssList(cons(esk5_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_90]),c_0_45]),c_0_92])]) ).
cnf(c_0_99,negated_conjecture,
cons(esk5_0,esk4_0) != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_90]),c_0_45]),c_0_92])]),c_0_38]) ).
fof(c_0_100,plain,
! [X74,X75,X76,X77] :
( ~ ssList(X74)
| ~ ssList(X75)
| ~ ssList(X76)
| ~ ssList(X77)
| ~ segmentP(X74,X75)
| segmentP(app(app(X76,X74),X77),X75) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_101,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_70]),c_0_31])]),c_0_42]) ).
cnf(c_0_102,negated_conjecture,
( app(esk3_0,X1) = cons(esk5_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_75]),c_0_46])]) ).
fof(c_0_103,plain,
! [X89,X90,X91] :
( ~ ssList(X89)
| ~ ssList(X90)
| ~ ssList(X91)
| app(X90,X91) != app(X90,X89)
| X91 = X89 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_104,negated_conjecture,
app(esk4_0,nil) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98])]),c_0_99]) ).
cnf(c_0_105,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_106,negated_conjecture,
( segmentP(cons(esk5_0,X1),esk3_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_92])]) ).
cnf(c_0_107,negated_conjecture,
( ssList(cons(esk5_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_102]),c_0_92])]) ).
fof(c_0_108,plain,
! [X128] :
( ~ ssList(X128)
| frontsegP(X128,X128) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
cnf(c_0_109,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_110,negated_conjecture,
frontsegP(esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_104]),c_0_45]),c_0_31])]) ).
cnf(c_0_111,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_112,plain,
! [X73] :
( ~ ssList(X73)
| segmentP(X73,X73) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_113,negated_conjecture,
( segmentP(app(app(X1,cons(esk5_0,X2)),X3),esk3_0)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_92])]),c_0_107]) ).
cnf(c_0_114,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_115,plain,
( X1 = nil
| app(X2,X1) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_89]),c_0_31])]) ).
cnf(c_0_116,negated_conjecture,
app(esk4_0,esk14_2(esk4_0,esk4_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_110]),c_0_45])]) ).
cnf(c_0_117,negated_conjecture,
ssList(esk14_2(esk4_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_110]),c_0_45])]) ).
cnf(c_0_118,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_27]),c_0_28]) ).
cnf(c_0_119,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_120,negated_conjecture,
( segmentP(app(esk4_0,X1),esk3_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_49]),c_0_50]),c_0_57])]) ).
cnf(c_0_121,plain,
( app(X1,esk14_2(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_114]) ).
cnf(c_0_122,negated_conjecture,
esk14_2(esk4_0,esk4_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_45]),c_0_117])]) ).
fof(c_0_123,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_124,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_92])]) ).
cnf(c_0_125,negated_conjecture,
segmentP(esk4_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_120,c_0_121]),c_0_122]),c_0_31]),c_0_45])]) ).
fof(c_0_126,plain,
! [X82,X83] :
( ( ~ neq(X82,X83)
| X82 != X83
| ~ ssList(X83)
| ~ ssList(X82) )
& ( X82 = X83
| neq(X82,X83)
| ~ ssList(X83)
| ~ ssList(X82) ) ),
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_123])])])])]) ).
cnf(c_0_127,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125])]) ).
cnf(c_0_128,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_129,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_31]),c_0_92])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC078+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:48:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.76/2.58 # Version: 3.1.0
% 16.76/2.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 16.76/2.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.76/2.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 16.76/2.58 # Starting new_bool_3 with 300s (1) cores
% 16.76/2.58 # Starting new_bool_1 with 300s (1) cores
% 16.76/2.58 # Starting sh5l with 300s (1) cores
% 16.76/2.58 # sh5l with pid 2778 completed with status 0
% 16.76/2.58 # Result found by sh5l
% 16.76/2.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 16.76/2.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.76/2.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 16.76/2.58 # Starting new_bool_3 with 300s (1) cores
% 16.76/2.58 # Starting new_bool_1 with 300s (1) cores
% 16.76/2.58 # Starting sh5l with 300s (1) cores
% 16.76/2.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 16.76/2.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 16.76/2.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 16.76/2.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 16.76/2.58 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 2791 completed with status 0
% 16.76/2.58 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 16.76/2.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 16.76/2.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.76/2.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 16.76/2.58 # Starting new_bool_3 with 300s (1) cores
% 16.76/2.58 # Starting new_bool_1 with 300s (1) cores
% 16.76/2.58 # Starting sh5l with 300s (1) cores
% 16.76/2.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 16.76/2.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 16.76/2.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 16.76/2.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 16.76/2.58 # Preprocessing time : 0.004 s
% 16.76/2.58 # Presaturation interreduction done
% 16.76/2.58
% 16.76/2.58 # Proof found!
% 16.76/2.58 # SZS status Theorem
% 16.76/2.58 # SZS output start CNFRefutation
% See solution above
% 16.76/2.58 # Parsed axioms : 96
% 16.76/2.58 # Removed by relevancy pruning/SinE : 8
% 16.76/2.58 # Initial clauses : 181
% 16.76/2.58 # Removed in clause preprocessing : 2
% 16.76/2.58 # Initial clauses in saturation : 179
% 16.76/2.58 # Processed clauses : 18225
% 16.76/2.58 # ...of these trivial : 209
% 16.76/2.58 # ...subsumed : 13725
% 16.76/2.58 # ...remaining for further processing : 4291
% 16.76/2.58 # Other redundant clauses eliminated : 504
% 16.76/2.58 # Clauses deleted for lack of memory : 0
% 16.76/2.58 # Backward-subsumed : 194
% 16.76/2.58 # Backward-rewritten : 494
% 16.76/2.58 # Generated clauses : 110615
% 16.76/2.58 # ...of the previous two non-redundant : 98713
% 16.76/2.58 # ...aggressively subsumed : 0
% 16.76/2.58 # Contextual simplify-reflections : 1375
% 16.76/2.58 # Paramodulations : 110082
% 16.76/2.58 # Factorizations : 4
% 16.76/2.58 # NegExts : 0
% 16.76/2.58 # Equation resolutions : 527
% 16.76/2.58 # Disequality decompositions : 0
% 16.76/2.58 # Total rewrite steps : 131222
% 16.76/2.58 # ...of those cached : 130674
% 16.76/2.58 # Propositional unsat checks : 0
% 16.76/2.58 # Propositional check models : 0
% 16.76/2.58 # Propositional check unsatisfiable : 0
% 16.76/2.58 # Propositional clauses : 0
% 16.76/2.58 # Propositional clauses after purity: 0
% 16.76/2.58 # Propositional unsat core size : 0
% 16.76/2.58 # Propositional preprocessing time : 0.000
% 16.76/2.58 # Propositional encoding time : 0.000
% 16.76/2.58 # Propositional solver time : 0.000
% 16.76/2.58 # Success case prop preproc time : 0.000
% 16.76/2.58 # Success case prop encoding time : 0.000
% 16.76/2.58 # Success case prop solver time : 0.000
% 16.76/2.58 # Current number of processed clauses : 3407
% 16.76/2.58 # Positive orientable unit clauses : 605
% 16.76/2.58 # Positive unorientable unit clauses: 0
% 16.76/2.58 # Negative unit clauses : 484
% 16.76/2.58 # Non-unit-clauses : 2318
% 16.76/2.58 # Current number of unprocessed clauses: 79874
% 16.76/2.58 # ...number of literals in the above : 495703
% 16.76/2.58 # Current number of archived formulas : 0
% 16.76/2.58 # Current number of archived clauses : 864
% 16.76/2.58 # Clause-clause subsumption calls (NU) : 1052650
% 16.76/2.58 # Rec. Clause-clause subsumption calls : 200510
% 16.76/2.58 # Non-unit clause-clause subsumptions : 8060
% 16.76/2.58 # Unit Clause-clause subsumption calls : 66276
% 16.76/2.58 # Rewrite failures with RHS unbound : 0
% 16.76/2.58 # BW rewrite match attempts : 1758
% 16.76/2.58 # BW rewrite match successes : 131
% 16.76/2.58 # Condensation attempts : 0
% 16.76/2.58 # Condensation successes : 0
% 16.76/2.58 # Termbank termtop insertions : 2892200
% 16.76/2.58 # Search garbage collected termcells : 3913
% 16.76/2.58
% 16.76/2.58 # -------------------------------------------------
% 16.76/2.58 # User time : 1.980 s
% 16.76/2.58 # System time : 0.053 s
% 16.76/2.58 # Total time : 2.033 s
% 16.76/2.58 # Maximum resident set size: 2428 pages
% 16.76/2.58
% 16.76/2.58 # -------------------------------------------------
% 16.76/2.58 # User time : 1.982 s
% 16.76/2.58 # System time : 0.056 s
% 16.76/2.58 # Total time : 2.038 s
% 16.76/2.58 # Maximum resident set size: 1824 pages
% 16.76/2.58 % E---3.1 exiting
%------------------------------------------------------------------------------