TSTP Solution File: SWV249-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV249-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 19:43:52 EDT 2023
% Result : Unsatisfiable 24.68s 3.51s
% Output : CNFRefutation 24.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 47 ( 29 unt; 0 nHn; 24 RR)
% Number of literals : 71 ( 15 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 110 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Oinsert__subset_2,axiom,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_Oinsert__subset_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_conjecture_0) ).
cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
cnf(clsarity_set_2,axiom,
class_Orderings_Oorder(tc_set(X1)),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',clsarity_set_2) ).
cnf(cls_Set_Oinsert__subset_1,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_Oinsert__subset_1) ).
cnf(cls_Set_OUn__subset__iff_1,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_OUn__subset__iff_1) ).
cnf(cls_Set_OUn__insert__left_0,axiom,
c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_OUn__insert__left_0) ).
cnf(cls_Set_OUn__insert__right_0,axiom,
c_union(X1,c_insert(X2,X3,X4),X4) = c_insert(X2,c_union(X1,X3,X4),X4),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_OUn__insert__right_0) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_Set_OUn__subset__iff_2,axiom,
( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_OUn__subset__iff_2) ).
cnf(cls_Set_OUn__subset__iff_0,axiom,
( c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Set_OUn__subset__iff_0) ).
cnf(cls_Message_Oanalz__synth__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(X1),tc_Message_Omsg),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Message_Oanalz__synth__Un_0) ).
cnf(cls_Message_Oanalz__analz__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Oanalz(X1),X2,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Message_Oanalz__analz__Un_0) ).
cnf(cls_Message_Oanalz__mono_0,axiom,
( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_Message_Oanalz__mono_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/tmp/tmp.jm79j65G0g/E---3.1_29685.p',cls_conjecture_1) ).
cnf(c_0_15,axiom,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
cls_Set_Oinsert__subset_2 ).
cnf(c_0_16,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_17,negated_conjecture,
( c_lessequals(c_insert(v_X,X1,tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
cls_Orderings_Oorder__class_Oaxioms__1_0 ).
cnf(c_0_19,axiom,
class_Orderings_Oorder(tc_set(X1)),
clsarity_set_2 ).
cnf(c_0_20,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
cls_Set_Oinsert__subset_1 ).
cnf(c_0_21,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
cls_Set_OUn__subset__iff_1 ).
cnf(c_0_22,axiom,
c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
cls_Set_OUn__insert__left_0 ).
cnf(c_0_23,axiom,
c_union(X1,c_insert(X2,X3,X4),X4) = c_insert(X2,c_union(X1,X3,X4),X4),
cls_Set_OUn__insert__right_0 ).
cnf(c_0_24,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
cls_Set_Osubset__antisym_0 ).
cnf(c_0_25,negated_conjecture,
c_lessequals(c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_26,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_19])]) ).
cnf(c_0_27,axiom,
( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
cls_Set_OUn__subset__iff_2 ).
cnf(c_0_28,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_19])]) ).
cnf(c_0_29,axiom,
( c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
cls_Set_OUn__subset__iff_0 ).
cnf(c_0_30,plain,
c_union(c_insert(X1,X2,X3),X4,X3) = c_union(X2,c_insert(X1,X4,X3),X3),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) = c_Message_Osynth(c_Message_Oanalz(v_G)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_32,plain,
( c_lessequals(c_union(X1,X2,X3),c_union(X4,X1,X3),tc_set(X3))
| ~ c_lessequals(X2,c_union(X4,X1,X3),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_19])]) ).
cnf(c_0_34,negated_conjecture,
c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_insert(v_X,X1,tc_Message_Omsg),tc_Message_Omsg) = c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
c_lessequals(c_union(X1,X2,X3),c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(X1),tc_Message_Omsg),
cls_Message_Oanalz__synth__Un_0 ).
cnf(c_0_37,axiom,
c_Message_Oanalz(c_union(c_Message_Oanalz(X1),X2,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),
cls_Message_Oanalz__analz__Un_0 ).
cnf(c_0_38,axiom,
( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
cls_Message_Oanalz__mono_0 ).
cnf(c_0_39,negated_conjecture,
c_lessequals(c_insert(v_X,X1,tc_Message_Omsg),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
cls_conjecture_1 ).
cnf(c_0_41,plain,
c_union(X1,X2,X3) = c_union(X2,X1,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_35]),c_0_35])]) ).
cnf(c_0_42,plain,
c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(X1)),X2,tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
c_lessequals(c_Message_Oanalz(c_insert(v_X,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
c_lessequals(c_Message_Oanalz(c_insert(v_X,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X1,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_43,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV249-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n031.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 03:54:28 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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/tmp/tmp.jm79j65G0g/E---3.1_29685.p
% 24.68/3.51 # Version: 3.1pre001
% 24.68/3.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 24.68/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.68/3.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.68/3.51 # Starting new_bool_3 with 300s (1) cores
% 24.68/3.51 # Starting new_bool_1 with 300s (1) cores
% 24.68/3.51 # Starting sh5l with 300s (1) cores
% 24.68/3.51 # sh5l with pid 29766 completed with status 0
% 24.68/3.51 # Result found by sh5l
% 24.68/3.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 24.68/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.68/3.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.68/3.51 # Starting new_bool_3 with 300s (1) cores
% 24.68/3.51 # Starting new_bool_1 with 300s (1) cores
% 24.68/3.51 # Starting sh5l with 300s (1) cores
% 24.68/3.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 24.68/3.51 # Search class: FHUSM-FFMF32-MFFFFFNN
% 24.68/3.51 # partial match(1): FHUPM-FFMF32-MFFFFFNN
% 24.68/3.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 24.68/3.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 100s (1) cores
% 24.68/3.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 29773 completed with status 0
% 24.68/3.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 24.68/3.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 24.68/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.68/3.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.68/3.51 # Starting new_bool_3 with 300s (1) cores
% 24.68/3.51 # Starting new_bool_1 with 300s (1) cores
% 24.68/3.51 # Starting sh5l with 300s (1) cores
% 24.68/3.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 24.68/3.51 # Search class: FHUSM-FFMF32-MFFFFFNN
% 24.68/3.51 # partial match(1): FHUPM-FFMF32-MFFFFFNN
% 24.68/3.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 24.68/3.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 100s (1) cores
% 24.68/3.51 # Preprocessing time : 0.001 s
% 24.68/3.51 # Presaturation interreduction done
% 24.68/3.51
% 24.68/3.51 # Proof found!
% 24.68/3.51 # SZS status Unsatisfiable
% 24.68/3.51 # SZS output start CNFRefutation
% See solution above
% 24.68/3.51 # Parsed axioms : 17
% 24.68/3.51 # Removed by relevancy pruning/SinE : 0
% 24.68/3.51 # Initial clauses : 17
% 24.68/3.51 # Removed in clause preprocessing : 0
% 24.68/3.51 # Initial clauses in saturation : 17
% 24.68/3.51 # Processed clauses : 6409
% 24.68/3.51 # ...of these trivial : 1096
% 24.68/3.51 # ...subsumed : 2858
% 24.68/3.51 # ...remaining for further processing : 2455
% 24.68/3.51 # Other redundant clauses eliminated : 0
% 24.68/3.51 # Clauses deleted for lack of memory : 0
% 24.68/3.51 # Backward-subsumed : 31
% 24.68/3.51 # Backward-rewritten : 347
% 24.68/3.51 # Generated clauses : 191418
% 24.68/3.51 # ...of the previous two non-redundant : 149520
% 24.68/3.51 # ...aggressively subsumed : 0
% 24.68/3.51 # Contextual simplify-reflections : 0
% 24.68/3.51 # Paramodulations : 191418
% 24.68/3.51 # Factorizations : 0
% 24.68/3.51 # NegExts : 0
% 24.68/3.51 # Equation resolutions : 0
% 24.68/3.51 # Total rewrite steps : 149528
% 24.68/3.51 # Propositional unsat checks : 0
% 24.68/3.51 # Propositional check models : 0
% 24.68/3.51 # Propositional check unsatisfiable : 0
% 24.68/3.51 # Propositional clauses : 0
% 24.68/3.51 # Propositional clauses after purity: 0
% 24.68/3.51 # Propositional unsat core size : 0
% 24.68/3.51 # Propositional preprocessing time : 0.000
% 24.68/3.51 # Propositional encoding time : 0.000
% 24.68/3.51 # Propositional solver time : 0.000
% 24.68/3.51 # Success case prop preproc time : 0.000
% 24.68/3.51 # Success case prop encoding time : 0.000
% 24.68/3.51 # Success case prop solver time : 0.000
% 24.68/3.51 # Current number of processed clauses : 2060
% 24.68/3.51 # Positive orientable unit clauses : 1413
% 24.68/3.51 # Positive unorientable unit clauses: 3
% 24.68/3.51 # Negative unit clauses : 0
% 24.68/3.51 # Non-unit-clauses : 644
% 24.68/3.51 # Current number of unprocessed clauses: 141787
% 24.68/3.51 # ...number of literals in the above : 183715
% 24.68/3.51 # Current number of archived formulas : 0
% 24.68/3.51 # Current number of archived clauses : 395
% 24.68/3.51 # Clause-clause subsumption calls (NU) : 66010
% 24.68/3.51 # Rec. Clause-clause subsumption calls : 64260
% 24.68/3.51 # Non-unit clause-clause subsumptions : 2861
% 24.68/3.51 # Unit Clause-clause subsumption calls : 332
% 24.68/3.51 # Rewrite failures with RHS unbound : 0
% 24.68/3.51 # BW rewrite match attempts : 92115
% 24.68/3.51 # BW rewrite match successes : 437
% 24.68/3.51 # Condensation attempts : 0
% 24.68/3.51 # Condensation successes : 0
% 24.68/3.51 # Termbank termtop insertions : 5019750
% 24.68/3.51
% 24.68/3.51 # -------------------------------------------------
% 24.68/3.51 # User time : 2.912 s
% 24.68/3.51 # System time : 0.137 s
% 24.68/3.51 # Total time : 3.050 s
% 24.68/3.51 # Maximum resident set size: 1624 pages
% 24.68/3.51
% 24.68/3.51 # -------------------------------------------------
% 24.68/3.51 # User time : 2.914 s
% 24.68/3.51 # System time : 0.138 s
% 24.68/3.51 # Total time : 3.052 s
% 24.68/3.51 # Maximum resident set size: 1684 pages
% 24.68/3.51 % E---3.1 exiting
% 24.68/3.51 % E---3.1 exiting
%------------------------------------------------------------------------------