TSTP Solution File: SWC112+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC112+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:23:29 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 15 unt; 0 def)
% Number of atoms : 228 ( 77 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 293 ( 108 ~; 104 |; 55 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 40 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_7,negated_conjecture,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X21)
| ~ ssList(X22)
| app(X22,cons(X21,nil)) != esk5_0
| ~ ssItem(X23)
| ~ ssList(X24)
| app(cons(X23,nil),X24) != esk3_0
| ~ lt(X21,X23) )
& ( ~ ssItem(X25)
| ~ ssList(X26)
| app(cons(X25,nil),X26) != esk6_0
| ~ ssItem(X27)
| ~ ssList(X28)
| app(X28,cons(X27,nil)) != esk3_0
| ~ lt(X27,X25) )
& ( nil = esk4_0
| nil != esk3_0 )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| 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_6])])])])])]) ).
fof(c_0_8,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_9,plain,
! [X86,X87] :
( ( nil = X87
| nil != app(X86,X87)
| ~ ssList(X87)
| ~ ssList(X86) )
& ( nil = X86
| nil != app(X86,X87)
| ~ ssList(X87)
| ~ ssList(X86) )
& ( nil != X87
| nil != X86
| nil = app(X86,X87)
| ~ ssList(X87)
| ~ ssList(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)],[ax83])])])])]) ).
cnf(c_0_10,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X49,X50] :
( ( ~ neq(X49,X50)
| X49 != X50
| ~ ssList(X50)
| ~ ssList(X49) )
& ( X49 = X50
| neq(X49,X50)
| ~ ssList(X50)
| ~ ssList(X49) ) ),
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_8])])])])]) ).
cnf(c_0_14,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X29,X30,X33,X34] :
( ( ssList(esk7_2(X29,X30))
| ~ segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( ssList(esk8_2(X29,X30))
| ~ segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( app(app(esk7_2(X29,X30),X30),esk8_2(X29,X30)) = X29
| ~ segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( ~ ssList(X33)
| ~ ssList(X34)
| app(app(X33,X30),X34) != X29
| segmentP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) ) ),
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_16,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
app(app(esk5_0,esk1_0),esk6_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X69,X70] :
( ~ ssList(X69)
| ~ ssList(X70)
| ssList(app(X69,X70)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_20,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( esk2_0 = nil
| esk1_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_11]) ).
cnf(c_0_23,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_15]) ).
cnf(c_0_24,negated_conjecture,
( app(esk5_0,esk1_0) = nil
| esk2_0 != nil
| ~ ssList(app(esk5_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( neq(nil,nil)
| esk1_0 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,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_23]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( app(esk5_0,esk1_0) = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_36,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,negated_conjecture,
( nil = esk2_0
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_38,negated_conjecture,
segmentP(esk2_0,esk1_0),
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_31,c_0_17]),c_0_32]),c_0_26]),c_0_18]),c_0_27])]) ).
cnf(c_0_39,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_33,c_0_34]),c_0_27]),c_0_26])]),c_0_35]) ).
cnf(c_0_40,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
~ neq(esk1_0,nil),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_35]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC112+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % 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:33:07 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_3 with pid 17062 completed with status 0
% 0.19/0.51 # Result found by new_bool_3
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17066 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.51 # Preprocessing time : 0.003 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 96
% 0.19/0.51 # Removed by relevancy pruning/SinE : 47
% 0.19/0.51 # Initial clauses : 93
% 0.19/0.51 # Removed in clause preprocessing : 1
% 0.19/0.51 # Initial clauses in saturation : 92
% 0.19/0.51 # Processed clauses : 274
% 0.19/0.51 # ...of these trivial : 3
% 0.19/0.51 # ...subsumed : 13
% 0.19/0.51 # ...remaining for further processing : 258
% 0.19/0.51 # Other redundant clauses eliminated : 15
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 7
% 0.19/0.51 # Backward-rewritten : 3
% 0.19/0.51 # Generated clauses : 885
% 0.19/0.51 # ...of the previous two non-redundant : 835
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 864
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 19
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 136
% 0.19/0.51 # ...of those cached : 117
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 150
% 0.19/0.51 # Positive orientable unit clauses : 33
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 4
% 0.19/0.51 # Non-unit-clauses : 113
% 0.19/0.51 # Current number of unprocessed clauses: 719
% 0.19/0.51 # ...number of literals in the above : 2628
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 100
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 3033
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 922
% 0.19/0.51 # Non-unit clause-clause subsumptions : 12
% 0.19/0.51 # Unit Clause-clause subsumption calls : 99
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 3
% 0.19/0.51 # BW rewrite match successes : 3
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 20459
% 0.19/0.51 # Search garbage collected termcells : 2419
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.029 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.034 s
% 0.19/0.51 # Maximum resident set size: 2072 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.032 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.040 s
% 0.19/0.51 # Maximum resident set size: 1828 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------