TSTP Solution File: SWC066+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC066+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:23 EDT 2024
% Result : Theorem 11.75s 1.96s
% Output : CNFRefutation 11.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 23
% Syntax : Number of formulae : 133 ( 19 unt; 0 def)
% Number of atoms : 494 ( 128 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 622 ( 261 ~; 254 |; 39 &)
% ( 4 <=>; 64 =>; 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 : 199 ( 0 sgn 97 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ) ),
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(X1,X2)
& segmentP(X2,X3) )
=> 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] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
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 = X2
& nil = X1 ) ) ) ),
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(X1,X2)
& segmentP(X2,X1) )
=> 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)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_24,negated_conjecture,
! [X11,X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& totalorderedP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(esk3_0,X11)
| ~ segmentP(esk4_0,X11)
| ~ segmentP(X11,esk3_0)
| ~ totalorderedP(X11) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12)
| nil != 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_23])])])])])]) ).
fof(c_0_25,plain,
! [X60,X61,X62] :
( ~ ssList(X60)
| ~ ssList(X61)
| ~ ssList(X62)
| app(X62,X61) != app(X60,X61)
| X62 = 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_26,plain,
! [X68,X69,X70] :
( ~ ssList(X68)
| ~ ssList(X69)
| ~ ssList(X70)
| app(app(X68,X69),X70) = app(X68,app(X69,X70)) ),
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,
! [X54,X55] :
( ~ ssList(X54)
| ~ ssList(X55)
| ssList(app(X54,X55)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_28,plain,
! [X59] :
( ~ ssList(X59)
| app(nil,X59) = X59 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_29,plain,
! [X19,X20,X21] :
( ~ ssList(X19)
| ~ ssList(X20)
| ~ ssList(X21)
| ~ segmentP(X19,X20)
| ~ segmentP(X20,X21)
| segmentP(X19,X21) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_30,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
! [X13,X14,X17,X18] :
( ( ssList(esk5_2(X13,X14))
| ~ segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) )
& ( ssList(esk6_2(X13,X14))
| ~ segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) )
& ( app(app(esk5_2(X13,X14),X14),esk6_2(X13,X14)) = X13
| ~ segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) )
& ( ~ ssList(X17)
| ~ ssList(X18)
| app(app(X17,X14),X18) != X13
| segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) ) ),
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_34,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X3,X2) != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_39,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_40,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,negated_conjecture,
segmentP(esk2_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_44,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_33]) ).
fof(c_0_45,plain,
! [X71,X72] :
( ( nil = X72
| nil != app(X71,X72)
| ~ ssList(X72)
| ~ ssList(X71) )
& ( nil = X71
| nil != app(X71,X72)
| ~ ssList(X72)
| ~ ssList(X71) )
& ( nil != X72
| nil != X71
| nil = app(X71,X72)
| ~ ssList(X72)
| ~ ssList(X71) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_46,plain,
( X1 = app(X2,X3)
| app(X1,X4) != app(X2,app(X3,X4))
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_47,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_37]),c_0_38])]) ).
fof(c_0_48,plain,
! [X33,X34] :
( ( ~ neq(X33,X34)
| X33 != X34
| ~ ssList(X34)
| ~ ssList(X33) )
& ( X33 = X34
| neq(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) ) ),
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_39])])])])]) ).
cnf(c_0_49,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ segmentP(X1,esk2_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_50,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_44]) ).
fof(c_0_51,plain,
! [X63,X64,X65] :
( ~ ssList(X63)
| ~ ssList(X64)
| ~ ssList(X65)
| app(X64,X65) != app(X64,X63)
| X65 = 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_52,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_53,plain,
! [X73] :
( ~ ssList(X73)
| app(X73,nil) = X73 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_54,plain,
( X1 = app(nil,X2)
| app(X1,X3) != app(X2,X3)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_38])]) ).
cnf(c_0_55,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ segmentP(X2,esk2_0)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_49]),c_0_42])]) ).
cnf(c_0_57,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_50,c_0_37]),c_0_38])]),c_0_36]) ).
fof(c_0_58,plain,
! [X24] :
( ~ ssList(X24)
| segmentP(X24,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_59,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_52])]),c_0_38])]) ).
cnf(c_0_61,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_36]) ).
cnf(c_0_63,negated_conjecture,
( X1 = app(nil,X2)
| app(X1,esk2_0) != app(X2,esk2_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_43]) ).
cnf(c_0_64,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_38]) ).
fof(c_0_65,plain,
! [X22,X23] :
( ~ ssList(X22)
| ~ ssList(X23)
| ~ segmentP(X22,X23)
| ~ segmentP(X23,X22)
| X22 = X23 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])])]) ).
cnf(c_0_66,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ segmentP(X1,app(esk2_0,X2))
| ~ ssList(app(esk2_0,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_43])]) ).
cnf(c_0_67,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_68,plain,
( X1 = nil
| app(nil,X1) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_38])]) ).
cnf(c_0_69,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_35]),c_0_38])]),c_0_36]) ).
cnf(c_0_70,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_60]),c_0_38])]) ).
cnf(c_0_71,negated_conjecture,
( app(nil,X1) = esk2_0
| app(esk2_0,esk2_0) != app(X1,esk2_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_43]) ).
cnf(c_0_72,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_73,negated_conjecture,
( esk1_0 = nil
| neq(esk1_0,nil) ),
inference(spm,[status(thm)],[c_0_64,c_0_42]) ).
cnf(c_0_74,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_75,negated_conjecture,
( segmentP(app(esk2_0,X1),esk1_0)
| ~ ssList(app(esk2_0,X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_76,plain,
( app(X1,nil) = nil
| app(nil,X1) != nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_38])]),c_0_70]) ).
cnf(c_0_77,negated_conjecture,
app(nil,esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_71]),c_0_43])]) ).
cnf(c_0_78,negated_conjecture,
( esk1_0 = nil
| esk2_0 = nil
| ~ segmentP(esk1_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_41]),c_0_42])]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_80,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_81,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_61]),c_0_38])]),c_0_36]) ).
cnf(c_0_82,negated_conjecture,
( app(esk2_0,X1) = esk1_0
| ~ segmentP(esk1_0,app(esk2_0,X1))
| ~ ssList(app(esk2_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_42])]) ).
cnf(c_0_83,negated_conjecture,
( app(esk2_0,nil) = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_43])]) ).
cnf(c_0_84,negated_conjecture,
( esk2_0 = nil
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_67]),c_0_42])]) ).
fof(c_0_85,plain,
! [X29] :
( ~ ssList(X29)
| segmentP(X29,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_86,plain,
! [X76,X77] :
( ~ ssList(X76)
| ~ ssItem(X77)
| ssList(cons(X77,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_87,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_88,plain,
! [X56,X57,X58] :
( ~ ssList(X56)
| ~ ssList(X57)
| ~ ssItem(X58)
| cons(X58,app(X57,X56)) = app(cons(X58,X57),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_89,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_90,negated_conjecture,
( esk1_0 != nil
| ~ segmentP(esk1_0,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_43])]) ).
cnf(c_0_91,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_81,c_0_77]),c_0_43]),c_0_38])]) ).
cnf(c_0_92,negated_conjecture,
( esk1_0 = nil
| ~ segmentP(esk1_0,nil) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_38])]),c_0_84]) ).
cnf(c_0_93,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
fof(c_0_94,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_95,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_96,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(X1,esk3_0)
| ~ totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_97,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
fof(c_0_98,plain,
! [X38,X39] :
( ~ ssList(X38)
| ~ ssItem(X39)
| nil != cons(X39,X38) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_87])])])]) ).
cnf(c_0_99,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
fof(c_0_100,plain,
! [X104] :
( ~ ssList(X104)
| nil = X104
| cons(hd(X104),tl(X104)) = X104 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_89])])]) ).
cnf(c_0_101,negated_conjecture,
( esk1_0 != nil
| ~ segmentP(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).
cnf(c_0_102,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_42])]) ).
fof(c_0_103,plain,
! [X113] :
( ~ ssList(X113)
| nil = X113
| ssList(tl(X113)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_94])])]) ).
fof(c_0_104,plain,
! [X97] :
( ~ ssList(X97)
| nil = X97
| ssItem(hd(X97)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_95])])]) ).
cnf(c_0_105,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk1_0)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(esk1_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_32]),c_0_32]),c_0_31]) ).
cnf(c_0_106,plain,
( X1 = cons(X2,X3)
| neq(X1,cons(X2,X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_97]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
fof(c_0_108,plain,
! [X66,X67] :
( ~ ssList(X66)
| ~ ssItem(X67)
| cons(X67,X66) = app(cons(X67,nil),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_109,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_99]),c_0_36]) ).
cnf(c_0_110,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_60]),c_0_38])]) ).
cnf(c_0_111,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_112,negated_conjecture,
~ segmentP(nil,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102]),c_0_102])]) ).
cnf(c_0_113,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_114,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_115,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_102]),c_0_102]),c_0_93]) ).
cnf(c_0_116,plain,
( neq(nil,cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_38]),c_0_107]) ).
fof(c_0_117,plain,
! [X51] :
( ~ ssItem(X51)
| totalorderedP(cons(X51,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])])]) ).
cnf(c_0_118,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_119,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_38])]) ).
cnf(c_0_120,negated_conjecture,
( cons(hd(esk2_0),tl(esk2_0)) = esk2_0
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_111,c_0_43]) ).
cnf(c_0_121,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_57,c_0_83]),c_0_43]),c_0_38])]),c_0_112]) ).
cnf(c_0_122,negated_conjecture,
( esk2_0 = nil
| ssList(tl(esk2_0)) ),
inference(spm,[status(thm)],[c_0_113,c_0_43]) ).
cnf(c_0_123,negated_conjecture,
( esk2_0 = nil
| ssItem(hd(esk2_0)) ),
inference(spm,[status(thm)],[c_0_114,c_0_43]) ).
cnf(c_0_124,negated_conjecture,
( ~ totalorderedP(cons(X1,X2))
| ~ segmentP(esk2_0,cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_97]) ).
cnf(c_0_125,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_126,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_118]),c_0_119]) ).
cnf(c_0_127,negated_conjecture,
cons(hd(esk2_0),tl(esk2_0)) = esk2_0,
inference(sr,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_128,negated_conjecture,
ssList(tl(esk2_0)),
inference(sr,[status(thm)],[c_0_122,c_0_121]) ).
cnf(c_0_129,negated_conjecture,
ssItem(hd(esk2_0)),
inference(sr,[status(thm)],[c_0_123,c_0_121]) ).
cnf(c_0_130,negated_conjecture,
( ~ segmentP(esk2_0,cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_38])]) ).
cnf(c_0_131,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_126,c_0_127]),c_0_128]),c_0_129])]) ).
cnf(c_0_132,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_129])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWC066+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 03:36:37 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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
% 11.75/1.96 # Version: 3.1.0
% 11.75/1.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.75/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.75/1.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.75/1.96 # Starting new_bool_3 with 300s (1) cores
% 11.75/1.96 # Starting new_bool_1 with 300s (1) cores
% 11.75/1.96 # Starting sh5l with 300s (1) cores
% 11.75/1.96 # new_bool_3 with pid 28192 completed with status 0
% 11.75/1.96 # Result found by new_bool_3
% 11.75/1.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.75/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.75/1.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.75/1.96 # Starting new_bool_3 with 300s (1) cores
% 11.75/1.96 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.75/1.96 # Search class: FGHSF-FFMM21-MFFFFFNN
% 11.75/1.96 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.75/1.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 11.75/1.96 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28196 completed with status 0
% 11.75/1.96 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.75/1.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.75/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.75/1.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.75/1.96 # Starting new_bool_3 with 300s (1) cores
% 11.75/1.96 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.75/1.96 # Search class: FGHSF-FFMM21-MFFFFFNN
% 11.75/1.96 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.75/1.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 11.75/1.96 # Preprocessing time : 0.002 s
% 11.75/1.96 # Presaturation interreduction done
% 11.75/1.96
% 11.75/1.96 # Proof found!
% 11.75/1.96 # SZS status Theorem
% 11.75/1.96 # SZS output start CNFRefutation
% See solution above
% 11.75/1.96 # Parsed axioms : 96
% 11.75/1.96 # Removed by relevancy pruning/SinE : 47
% 11.75/1.96 # Initial clauses : 89
% 11.75/1.96 # Removed in clause preprocessing : 1
% 11.75/1.96 # Initial clauses in saturation : 88
% 11.75/1.96 # Processed clauses : 4808
% 11.75/1.96 # ...of these trivial : 92
% 11.75/1.96 # ...subsumed : 2631
% 11.75/1.96 # ...remaining for further processing : 2085
% 11.75/1.96 # Other redundant clauses eliminated : 81
% 11.75/1.96 # Clauses deleted for lack of memory : 0
% 11.75/1.96 # Backward-subsumed : 121
% 11.75/1.96 # Backward-rewritten : 562
% 11.75/1.96 # Generated clauses : 76685
% 11.75/1.96 # ...of the previous two non-redundant : 75815
% 11.75/1.96 # ...aggressively subsumed : 0
% 11.75/1.96 # Contextual simplify-reflections : 303
% 11.75/1.96 # Paramodulations : 76382
% 11.75/1.96 # Factorizations : 0
% 11.75/1.96 # NegExts : 0
% 11.75/1.96 # Equation resolutions : 117
% 11.75/1.96 # Disequality decompositions : 0
% 11.75/1.96 # Total rewrite steps : 15854
% 11.75/1.96 # ...of those cached : 15798
% 11.75/1.96 # Propositional unsat checks : 0
% 11.75/1.96 # Propositional check models : 0
% 11.75/1.96 # Propositional check unsatisfiable : 0
% 11.75/1.96 # Propositional clauses : 0
% 11.75/1.96 # Propositional clauses after purity: 0
% 11.75/1.96 # Propositional unsat core size : 0
% 11.75/1.96 # Propositional preprocessing time : 0.000
% 11.75/1.96 # Propositional encoding time : 0.000
% 11.75/1.96 # Propositional solver time : 0.000
% 11.75/1.96 # Success case prop preproc time : 0.000
% 11.75/1.96 # Success case prop encoding time : 0.000
% 11.75/1.96 # Success case prop solver time : 0.000
% 11.75/1.96 # Current number of processed clauses : 1124
% 11.75/1.96 # Positive orientable unit clauses : 69
% 11.75/1.96 # Positive unorientable unit clauses: 0
% 11.75/1.96 # Negative unit clauses : 15
% 11.75/1.96 # Non-unit-clauses : 1040
% 11.75/1.96 # Current number of unprocessed clauses: 69280
% 11.75/1.96 # ...number of literals in the above : 267238
% 11.75/1.96 # Current number of archived formulas : 0
% 11.75/1.96 # Current number of archived clauses : 953
% 11.75/1.96 # Clause-clause subsumption calls (NU) : 282072
% 11.75/1.96 # Rec. Clause-clause subsumption calls : 121930
% 11.75/1.96 # Non-unit clause-clause subsumptions : 2721
% 11.75/1.96 # Unit Clause-clause subsumption calls : 10021
% 11.75/1.96 # Rewrite failures with RHS unbound : 0
% 11.75/1.96 # BW rewrite match attempts : 69
% 11.75/1.96 # BW rewrite match successes : 19
% 11.75/1.96 # Condensation attempts : 0
% 11.75/1.96 # Condensation successes : 0
% 11.75/1.96 # Termbank termtop insertions : 1457557
% 11.75/1.96 # Search garbage collected termcells : 2236
% 11.75/1.96
% 11.75/1.96 # -------------------------------------------------
% 11.75/1.96 # User time : 1.396 s
% 11.75/1.96 # System time : 0.051 s
% 11.75/1.96 # Total time : 1.447 s
% 11.75/1.96 # Maximum resident set size: 2068 pages
% 11.75/1.96
% 11.75/1.96 # -------------------------------------------------
% 11.75/1.96 # User time : 1.399 s
% 11.75/1.96 # System time : 0.054 s
% 11.75/1.96 # Total time : 1.452 s
% 11.75/1.96 # Maximum resident set size: 1820 pages
% 11.75/1.96 % E---3.1 exiting
%------------------------------------------------------------------------------