TSTP Solution File: KLE043+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE043+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:47 EDT 2023
% Result : Theorem 2.65s 0.76s
% Output : CNFRefutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 37 unt; 0 def)
% Number of atoms : 71 ( 43 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 13 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( leq(multiplication(star(X4),X5),addition(X5,multiplication(multiplication(X4,star(X4)),X5)))
& leq(addition(X5,multiplication(multiplication(X4,star(X4)),X5)),multiplication(star(X4),X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',multiplicative_associativity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',additive_associativity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',additive_idempotence) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',star_unfold_right) ).
fof(star_induction_left,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X2)
=> leq(multiplication(star(X1),X3),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',star_induction_left) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p',right_distributivity) ).
fof(c_0_11,negated_conjecture,
~ ! [X4,X5] :
( leq(multiplication(star(X4),X5),addition(X5,multiplication(multiplication(X4,star(X4)),X5)))
& leq(addition(X5,multiplication(multiplication(X4,star(X4)),X5)),multiplication(star(X4),X5)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)))
| ~ leq(addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)),multiplication(star(esk1_0),esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X18,X19,X20] : multiplication(X18,multiplication(X19,X20)) = multiplication(multiplication(X18,X19),X20),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_14,plain,
! [X31,X32] : addition(X31,X32) = addition(X32,X31),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_15,plain,
! [X33,X34,X35] : addition(X35,addition(X34,X33)) = addition(addition(X35,X34),X33),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_16,plain,
! [X26,X27,X28] : multiplication(addition(X26,X27),X28) = addition(multiplication(X26,X28),multiplication(X27,X28)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_17,plain,
! [X22] : multiplication(one,X22) = X22,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_18,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)))
| ~ leq(addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)),multiplication(star(esk1_0),esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X8,X9] :
( ( ~ leq(X8,X9)
| addition(X8,X9) = X9 )
& ( addition(X8,X9) != X9
| leq(X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_21,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X37] : addition(X37,X37) = X37,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_24,plain,
! [X10] : leq(addition(one,multiplication(X10,star(X10))),star(X10)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_25,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))
| ~ leq(addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))),multiplication(star(esk1_0),esk2_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_28,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_29,plain,
! [X12,X13,X14] :
( ~ leq(addition(multiplication(X12,X13),X14),X13)
| leq(multiplication(star(X12),X14),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])]) ).
fof(c_0_30,plain,
! [X23,X24,X25] : multiplication(X23,addition(X24,X25)) = addition(multiplication(X23,X24),multiplication(X23,X25)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_31,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_34,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21]) ).
cnf(c_0_36,negated_conjecture,
( addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) != multiplication(star(esk1_0),esk2_0)
| ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_21]) ).
cnf(c_0_37,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
addition(one,multiplication(addition(X1,one),star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_22]),c_0_21]),c_0_35]) ).
cnf(c_0_41,plain,
addition(multiplication(addition(X1,X2),X3),X4) = addition(multiplication(X1,X3),addition(multiplication(X2,X3),X4)),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_42,negated_conjecture,
( addition(esk2_0,multiplication(addition(one,esk1_0),multiplication(star(esk1_0),esk2_0))) != multiplication(star(esk1_0),esk2_0)
| ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_35]),c_0_21]) ).
cnf(c_0_43,plain,
( leq(multiplication(star(X1),X2),X3)
| addition(X3,addition(multiplication(X1,X3),X2)) != X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_28]),c_0_22]),c_0_31]) ).
cnf(c_0_44,plain,
addition(multiplication(X1,addition(X2,X3)),X4) = addition(multiplication(X1,X2),addition(multiplication(X1,X3),X4)),
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_45,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_22]) ).
cnf(c_0_46,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_47,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_26]),c_0_32]),c_0_21]),c_0_35]) ).
cnf(c_0_48,negated_conjecture,
( addition(esk2_0,multiplication(esk1_0,addition(esk2_0,multiplication(addition(one,esk1_0),multiplication(star(esk1_0),esk2_0))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))
| addition(esk2_0,multiplication(addition(one,esk1_0),multiplication(star(esk1_0),esk2_0))) != multiplication(star(esk1_0),esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_22]),c_0_21]),c_0_45]),c_0_38]),c_0_45]),c_0_38]),c_0_45]),c_0_35]),c_0_21]),c_0_46]) ).
cnf(c_0_49,plain,
addition(X1,multiplication(X2,multiplication(X3,X1))) = multiplication(addition(one,multiplication(X2,X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_19]),c_0_21]) ).
cnf(c_0_50,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_47,c_0_21]) ).
cnf(c_0_51,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_46,c_0_40]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]),c_0_49]),c_0_49]),c_0_49]),c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KLE043+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:42:35 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.On9lY3PaG1/E---3.1_1306.p
% 2.65/0.76 # Version: 3.1pre001
% 2.65/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.65/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.65/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.65/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.65/0.76 # Starting sh5l with 300s (1) cores
% 2.65/0.76 # sh5l with pid 1387 completed with status 0
% 2.65/0.76 # Result found by sh5l
% 2.65/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.65/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.65/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.65/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.65/0.76 # Starting sh5l with 300s (1) cores
% 2.65/0.76 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.65/0.76 # Search class: FHHSM-FFSF21-MFFFFFNN
% 2.65/0.76 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.65/0.76 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 163s (1) cores
% 2.65/0.76 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 1395 completed with status 0
% 2.65/0.76 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 2.65/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.65/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.65/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.65/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.65/0.76 # Starting sh5l with 300s (1) cores
% 2.65/0.76 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.65/0.76 # Search class: FHHSM-FFSF21-MFFFFFNN
% 2.65/0.76 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.65/0.76 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 163s (1) cores
% 2.65/0.76 # Preprocessing time : 0.001 s
% 2.65/0.76 # Presaturation interreduction done
% 2.65/0.76
% 2.65/0.76 # Proof found!
% 2.65/0.76 # SZS status Theorem
% 2.65/0.76 # SZS output start CNFRefutation
% See solution above
% 2.65/0.76 # Parsed axioms : 17
% 2.65/0.76 # Removed by relevancy pruning/SinE : 0
% 2.65/0.76 # Initial clauses : 18
% 2.65/0.76 # Removed in clause preprocessing : 0
% 2.65/0.76 # Initial clauses in saturation : 18
% 2.65/0.76 # Processed clauses : 1971
% 2.65/0.76 # ...of these trivial : 139
% 2.65/0.76 # ...subsumed : 1467
% 2.65/0.76 # ...remaining for further processing : 365
% 2.65/0.76 # Other redundant clauses eliminated : 46
% 2.65/0.76 # Clauses deleted for lack of memory : 0
% 2.65/0.76 # Backward-subsumed : 15
% 2.65/0.76 # Backward-rewritten : 52
% 2.65/0.76 # Generated clauses : 22661
% 2.65/0.76 # ...of the previous two non-redundant : 19441
% 2.65/0.76 # ...aggressively subsumed : 0
% 2.65/0.76 # Contextual simplify-reflections : 1
% 2.65/0.76 # Paramodulations : 22615
% 2.65/0.76 # Factorizations : 0
% 2.65/0.76 # NegExts : 0
% 2.65/0.76 # Equation resolutions : 46
% 2.65/0.76 # Total rewrite steps : 32047
% 2.65/0.76 # Propositional unsat checks : 0
% 2.65/0.76 # Propositional check models : 0
% 2.65/0.76 # Propositional check unsatisfiable : 0
% 2.65/0.76 # Propositional clauses : 0
% 2.65/0.76 # Propositional clauses after purity: 0
% 2.65/0.76 # Propositional unsat core size : 0
% 2.65/0.76 # Propositional preprocessing time : 0.000
% 2.65/0.76 # Propositional encoding time : 0.000
% 2.65/0.76 # Propositional solver time : 0.000
% 2.65/0.76 # Success case prop preproc time : 0.000
% 2.65/0.76 # Success case prop encoding time : 0.000
% 2.65/0.76 # Success case prop solver time : 0.000
% 2.65/0.76 # Current number of processed clauses : 280
% 2.65/0.76 # Positive orientable unit clauses : 62
% 2.65/0.76 # Positive unorientable unit clauses: 33
% 2.65/0.76 # Negative unit clauses : 1
% 2.65/0.76 # Non-unit-clauses : 184
% 2.65/0.76 # Current number of unprocessed clauses: 17364
% 2.65/0.76 # ...number of literals in the above : 26825
% 2.65/0.76 # Current number of archived formulas : 0
% 2.65/0.76 # Current number of archived clauses : 85
% 2.65/0.76 # Clause-clause subsumption calls (NU) : 8504
% 2.65/0.76 # Rec. Clause-clause subsumption calls : 8462
% 2.65/0.76 # Non-unit clause-clause subsumptions : 1322
% 2.65/0.76 # Unit Clause-clause subsumption calls : 176
% 2.65/0.76 # Rewrite failures with RHS unbound : 0
% 2.65/0.76 # BW rewrite match attempts : 460
% 2.65/0.76 # BW rewrite match successes : 136
% 2.65/0.76 # Condensation attempts : 0
% 2.65/0.76 # Condensation successes : 0
% 2.65/0.76 # Termbank termtop insertions : 318866
% 2.65/0.76
% 2.65/0.76 # -------------------------------------------------
% 2.65/0.76 # User time : 0.321 s
% 2.65/0.76 # System time : 0.019 s
% 2.65/0.76 # Total time : 0.340 s
% 2.65/0.76 # Maximum resident set size: 1764 pages
% 2.65/0.76
% 2.65/0.76 # -------------------------------------------------
% 2.65/0.76 # User time : 0.322 s
% 2.65/0.76 # System time : 0.020 s
% 2.65/0.76 # Total time : 0.343 s
% 2.65/0.76 # Maximum resident set size: 1688 pages
% 2.65/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------