TSTP Solution File: KLE150+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:04:30 EDT 2023
% Result : Theorem 0.36s 0.54s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 71 ( 54 unt; 0 def)
% Number of atoms : 90 ( 54 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 18 ~; 15 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 106 ( 4 sgn; 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',star_induction2) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',additive_identity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',left_annihilation) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',multiplicative_right_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',idempotence) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',additive_commutativity) ).
fof(star_induction1,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X3),X2),X3)
=> leq(multiplication(star(X1),X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',star_induction1) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',order) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',star_unfold2) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',distributivity2) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',multiplicative_associativity) ).
fof(goals,conjecture,
! [X4] : strong_iteration(multiplication(X4,zero)) = addition(one,multiplication(X4,zero)),
file('/export/starexec/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p',goals) ).
fof(c_0_15,plain,
! [X24,X25,X26] :
( ~ leq(addition(multiplication(X26,X24),X25),X26)
| leq(multiplication(X25,star(X24)),X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
fof(c_0_16,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_17,plain,
! [X39] : multiplication(zero,X39) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_18,plain,
! [X37] : multiplication(X37,one) = X37,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_19,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_20,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_21,plain,
! [X27] : strong_iteration(X27) = addition(multiplication(X27,strong_iteration(X27)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_22,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_23,plain,
! [X21,X22,X23] :
( ~ leq(addition(multiplication(X21,X23),X22),X23)
| leq(multiplication(star(X21),X22),X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction1])]) ).
fof(c_0_24,plain,
! [X38] : multiplication(one,X38) = X38,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_25,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
( leq(zero,X1)
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
fof(c_0_36,plain,
! [X32,X33] :
( ( ~ leq(X32,X33)
| addition(X32,X33) = X33 )
& ( addition(X32,X33) != X33
| leq(X32,X33) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_37,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_38,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( leq(multiplication(star(one),X1),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( leq(zero,X1)
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_42,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_44,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( leq(multiplication(star(one),zero),X1)
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_46,plain,
leq(zero,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30])]) ).
cnf(c_0_47,plain,
( leq(star(one),strong_iteration(X1))
| ~ leq(strong_iteration(X1),strong_iteration(X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_34]) ).
fof(c_0_48,plain,
! [X20] : addition(one,multiplication(star(X20),X20)) = star(X20),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
fof(c_0_49,plain,
! [X16,X17,X18] : multiplication(addition(X16,X17),X18) = addition(multiplication(X16,X18),multiplication(X17,X18)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
cnf(c_0_50,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_51,plain,
leq(multiplication(star(one),zero),zero),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
leq(star(one),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_30])]) ).
cnf(c_0_53,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_27]),c_0_26]) ).
cnf(c_0_54,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
fof(c_0_55,plain,
! [X34,X35,X36] : multiplication(X34,multiplication(X35,X36)) = multiplication(multiplication(X34,X35),X36),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_56,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,plain,
multiplication(star(one),zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_26]) ).
cnf(c_0_58,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_59,plain,
leq(star(one),one),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_38,c_0_54]) ).
fof(c_0_61,negated_conjecture,
~ ! [X4] : strong_iteration(multiplication(X4,zero)) = addition(one,multiplication(X4,zero)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_62,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,plain,
multiplication(addition(star(one),X1),zero) = multiplication(X1,zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_64,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_59]),c_0_32]),c_0_60]) ).
fof(c_0_65,negated_conjecture,
strong_iteration(multiplication(esk1_0,zero)) != addition(one,multiplication(esk1_0,zero)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])]) ).
cnf(c_0_66,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_62]) ).
cnf(c_0_67,plain,
multiplication(addition(one,X1),zero) = multiplication(X1,zero),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
strong_iteration(multiplication(esk1_0,zero)) != addition(one,multiplication(esk1_0,zero)),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,plain,
strong_iteration(multiplication(X1,zero)) = addition(one,multiplication(X1,zero)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_63]),c_0_64]),c_0_27]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 04:57:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.elBi2VXwhN/E---3.1_14380.p
% 0.36/0.54 # Version: 3.1pre001
% 0.36/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.54 # Starting sh5l with 300s (1) cores
% 0.36/0.54 # sh5l with pid 14461 completed with status 0
% 0.36/0.54 # Result found by sh5l
% 0.36/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.54 # Starting sh5l with 300s (1) cores
% 0.36/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.54 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.36/0.54 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.54 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.36/0.54 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14469 completed with status 0
% 0.36/0.54 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.36/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.54 # Starting sh5l with 300s (1) cores
% 0.36/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.54 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.36/0.54 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.54 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.36/0.54 # Preprocessing time : 0.001 s
% 0.36/0.54 # Presaturation interreduction done
% 0.36/0.54
% 0.36/0.54 # Proof found!
% 0.36/0.54 # SZS status Theorem
% 0.36/0.54 # SZS output start CNFRefutation
% See solution above
% 0.36/0.54 # Parsed axioms : 19
% 0.36/0.54 # Removed by relevancy pruning/SinE : 0
% 0.36/0.54 # Initial clauses : 20
% 0.36/0.54 # Removed in clause preprocessing : 0
% 0.36/0.54 # Initial clauses in saturation : 20
% 0.36/0.54 # Processed clauses : 150
% 0.36/0.54 # ...of these trivial : 25
% 0.36/0.54 # ...subsumed : 20
% 0.36/0.54 # ...remaining for further processing : 105
% 0.36/0.54 # Other redundant clauses eliminated : 0
% 0.36/0.54 # Clauses deleted for lack of memory : 0
% 0.36/0.54 # Backward-subsumed : 0
% 0.36/0.54 # Backward-rewritten : 24
% 0.36/0.54 # Generated clauses : 1032
% 0.36/0.54 # ...of the previous two non-redundant : 641
% 0.36/0.54 # ...aggressively subsumed : 0
% 0.36/0.54 # Contextual simplify-reflections : 0
% 0.36/0.54 # Paramodulations : 1032
% 0.36/0.54 # Factorizations : 0
% 0.36/0.54 # NegExts : 0
% 0.36/0.54 # Equation resolutions : 0
% 0.36/0.54 # Total rewrite steps : 1063
% 0.36/0.54 # Propositional unsat checks : 0
% 0.36/0.54 # Propositional check models : 0
% 0.36/0.54 # Propositional check unsatisfiable : 0
% 0.36/0.54 # Propositional clauses : 0
% 0.36/0.54 # Propositional clauses after purity: 0
% 0.36/0.54 # Propositional unsat core size : 0
% 0.36/0.54 # Propositional preprocessing time : 0.000
% 0.36/0.54 # Propositional encoding time : 0.000
% 0.36/0.54 # Propositional solver time : 0.000
% 0.36/0.54 # Success case prop preproc time : 0.000
% 0.36/0.54 # Success case prop encoding time : 0.000
% 0.36/0.54 # Success case prop solver time : 0.000
% 0.36/0.54 # Current number of processed clauses : 61
% 0.36/0.54 # Positive orientable unit clauses : 46
% 0.36/0.54 # Positive unorientable unit clauses: 3
% 0.36/0.54 # Negative unit clauses : 0
% 0.36/0.54 # Non-unit-clauses : 12
% 0.36/0.54 # Current number of unprocessed clauses: 480
% 0.36/0.54 # ...number of literals in the above : 705
% 0.36/0.54 # Current number of archived formulas : 0
% 0.36/0.54 # Current number of archived clauses : 44
% 0.36/0.54 # Clause-clause subsumption calls (NU) : 52
% 0.36/0.54 # Rec. Clause-clause subsumption calls : 52
% 0.36/0.54 # Non-unit clause-clause subsumptions : 5
% 0.36/0.54 # Unit Clause-clause subsumption calls : 11
% 0.36/0.54 # Rewrite failures with RHS unbound : 0
% 0.36/0.54 # BW rewrite match attempts : 77
% 0.36/0.54 # BW rewrite match successes : 61
% 0.36/0.54 # Condensation attempts : 0
% 0.36/0.54 # Condensation successes : 0
% 0.36/0.54 # Termbank termtop insertions : 11088
% 0.36/0.54
% 0.36/0.54 # -------------------------------------------------
% 0.36/0.54 # User time : 0.016 s
% 0.36/0.54 # System time : 0.002 s
% 0.36/0.54 # Total time : 0.018 s
% 0.36/0.54 # Maximum resident set size: 1720 pages
% 0.36/0.54
% 0.36/0.54 # -------------------------------------------------
% 0.36/0.54 # User time : 0.017 s
% 0.36/0.54 # System time : 0.005 s
% 0.36/0.54 # Total time : 0.021 s
% 0.36/0.54 # Maximum resident set size: 1688 pages
% 0.36/0.54 % E---3.1 exiting
% 0.36/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------