%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL429-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:12:43 PM UTC 2026
% Result : Unsatisfiable 208.37s 30.92s
% Output : CNFRefutation 208.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 16 unt; 0 nHn; 16 RR)
% Number of literals : 49 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 82 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_ODiff__weaken__left_0,axiom,
( ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4)))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_ODiff__weaken__left_0) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_PropLog_Oweaken__left_0,axiom,
( ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3)))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left_0) ).
cnf(cls_PropLog_Ohyps__Diff_0,axiom,
c_lessequals(c_PropLog_Ohyps(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X3,X4),c_PropLog_Opl_Ofalse,X4),c_minus(c_PropLog_Ohyps(X1,X2,X4),c_insert(c_PropLog_Opl_Ovar(X3,X4),c_emptyset,tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Ohyps__Diff_0) ).
cnf(cls_PropLog_Othms__excluded__middle__rule_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms__excluded__middle__rule_0) ).
cnf(cls_PropLog_Oinsert__Diff__subset2_0,axiom,
c_lessequals(c_minus(c_insert(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),X5,tc_set(X4)),c_insert(X1,c_minus(X2,c_insert(X3,X5,X4),tc_set(X4)),X4),tc_set(X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oinsert__Diff__subset2_0) ).
cnf(cls_PropLog_Oinsert__Diff__same_0,axiom,
c_lessequals(c_minus(X1,X2,tc_set(X3)),c_insert(X4,c_minus(X1,c_insert(X4,X2,X3),tc_set(X3)),X3),tc_set(X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oinsert__Diff__same_0) ).
cnf(cls_conjecture_5,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4)))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_ODiff__weaken__left_0]) ).
cnf(c_0_9,plain,
( ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4)))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4)) ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_3 ).
cnf(c_0_11,plain,
( ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3)))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left_0]) ).
cnf(c_0_12,negated_conjecture,
( ~ c_lessequals(c_PropLog_Ohyps(v_p,X2,t_a),X1,tc_set(tc_PropLog_Opl(t_a)))
| c_in(v_p,c_PropLog_Othms(c_minus(X1,v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
c_lessequals(c_PropLog_Ohyps(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X3,X4),c_PropLog_Opl_Ofalse,X4),c_minus(c_PropLog_Ohyps(X1,X2,X4),c_insert(c_PropLog_Opl_Ovar(X3,X4),c_emptyset,tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),
cls_PropLog_Ohyps__Diff_0 ).
cnf(c_0_14,plain,
( ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3)))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(c_PropLog_Opl_Ovar(X1,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms__excluded__middle__rule_0]) ).
cnf(c_0_17,negated_conjecture,
( ~ c_lessequals(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X2,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X3,t_a),c_insert(c_PropLog_Opl_Ovar(X2,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),X1,tc_set(tc_PropLog_Opl(t_a)))
| c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
c_lessequals(c_minus(c_insert(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),X5,tc_set(X4)),c_insert(X1,c_minus(X2,c_insert(X3,X5,X4),tc_set(X4)),X4),tc_set(X4)),
cls_PropLog_Oinsert__Diff__subset2_0 ).
cnf(c_0_19,negated_conjecture,
( ~ c_lessequals(c_minus(c_PropLog_Ohyps(v_p,X2,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),X1,tc_set(tc_PropLog_Opl(t_a)))
| c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_20,axiom,
c_lessequals(c_minus(X1,X2,tc_set(X3)),c_insert(X4,c_minus(X1,c_insert(X4,X2,X3),tc_set(X3)),X3),tc_set(X3)),
cls_PropLog_Oinsert__Diff__same_0 ).
cnf(c_0_21,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_22,plain,
( ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(c_PropLog_Opl_Ovar(X1,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_insert(X1,c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(X1,v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X2,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL429-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 00:35:06 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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/benchmark/theBenchmark.p
% 208.37/30.92 % Version: 3.5.1
% 208.37/30.92 % Preprocessing class: FMLMSMSMSSSNFFN.
% 208.37/30.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 208.37/30.92 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 208.37/30.92 % Starting new_bool_3 with 300s (1) cores
% 208.37/30.92 % Starting new_bool_1 with 300s (1) cores
% 208.37/30.92 % Starting sh5l with 300s (1) cores
% 208.37/30.92 % sh5l with pid 173536 completed with status 0
% 208.37/30.92 % Result found by sh5l
% 208.37/30.92 % Preprocessing class: FMLMSMSMSSSNFFN.
% 208.37/30.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 208.37/30.92 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 208.37/30.92 % Starting new_bool_3 with 300s (1) cores
% 208.37/30.92 % Starting new_bool_1 with 300s (1) cores
% 208.37/30.92 % Starting sh5l with 300s (1) cores
% 208.37/30.92 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 208.37/30.92 % SinE strategy is gf500_gu_R04_F100_L20000
% 208.37/30.92 % Search class: FGHSM-SSLM32-MFFFFFNN
% 208.37/30.92 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 208.37/30.92 % Starting SubtermCWHack with 28s (1) cores
% 208.37/30.92 % SubtermCWHack with pid 173543 completed with status 8
% 208.37/30.92 % Starting sh5l with 31s (1) cores
% 208.37/30.92 % sh5l with pid 174155 completed with status 0
% 208.37/30.92 % Result found by sh5l
% 208.37/30.92 % Preprocessing class: FMLMSMSMSSSNFFN.
% 208.37/30.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 208.37/30.92 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 208.37/30.92 % Starting new_bool_3 with 300s (1) cores
% 208.37/30.92 % Starting new_bool_1 with 300s (1) cores
% 208.37/30.92 % Starting sh5l with 300s (1) cores
% 208.37/30.92 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 208.37/30.92 % SinE strategy is gf500_gu_R04_F100_L20000
% 208.37/30.92 % Search class: FGHSM-SSLM32-MFFFFFNN
% 208.37/30.92 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 208.37/30.92 % Starting SubtermCWHack with 28s (1) cores
% 208.37/30.92 % SubtermCWHack with pid 173543 completed with status 8
% 208.37/30.92 % Starting sh5l with 31s (1) cores
% 208.37/30.92 % Preprocessing time : 0.010 s
% 208.37/30.92 % Presaturation interreduction done
% 208.37/30.92
% 208.37/30.92 % Proof found!
% 208.37/30.92 % SZS status Unsatisfiable
% 208.37/30.92 % SZS output start CNFRefutation
% See solution above
% 208.37/30.92 % Parsed axioms : 1382
% 208.37/30.92 % Removed by relevancy pruning/SinE : 140
% 208.37/30.92 % Initial clauses : 1242
% 208.37/30.92 % Removed in clause preprocessing : 1
% 208.37/30.92 % Initial clauses in saturation : 1241
% 208.37/30.92 % Processed clauses : 7397
% 208.37/30.92 % ...of these trivial : 23
% 208.37/30.92 % ...subsumed : 2918
% 208.37/30.92 % ...remaining for further processing : 4456
% 208.37/30.92 % Other redundant clauses eliminated : 4
% 208.37/30.92 % Clauses deleted for lack of memory : 0
% 208.37/30.92 % Backward-subsumed : 174
% 208.37/30.92 % Backward-rewritten : 20
% 208.37/30.92 % Generated clauses : 13103
% 208.37/30.92 % ...of the previous two non-redundant : 11978
% 208.37/30.92 % ...aggressively subsumed : 0
% 208.37/30.92 % Contextual simplify-reflections : 0
% 208.37/30.92 % Paramodulations : 13078
% 208.37/30.92 % Factorizations : 0
% 208.37/30.92 % NegExts : 0
% 208.37/30.92 % Equation resolutions : 25
% 208.37/30.92 % Disequality decompositions : 0
% 208.37/30.92 % Total rewrite steps : 1144
% 208.37/30.92 % ...of those cached : 947
% 208.37/30.92 % Propositional unsat checks : 0
% 208.37/30.92 % Propositional check models : 0
% 208.37/30.92 % Propositional check unsatisfiable : 0
% 208.37/30.92 % Propositional clauses : 0
% 208.37/30.92 % Propositional clauses after purity: 0
% 208.37/30.92 % Propositional unsat core size : 0
% 208.37/30.92 % Propositional preprocessing time : 0.000
% 208.37/30.92 % Propositional encoding time : 0.000
% 208.37/30.92 % Propositional solver time : 0.000
% 208.37/30.92 % Success case prop preproc time : 0.000
% 208.37/30.92 % Success case prop encoding time : 0.000
% 208.37/30.92 % Success case prop solver time : 0.000
% 208.37/30.92 % Current number of processed clauses : 3050
% 208.37/30.92 % Positive orientable unit clauses : 202
% 208.37/30.92 % Positive unorientable unit clauses: 0
% 208.37/30.92 % Negative unit clauses : 29
% 208.37/30.92 % Non-unit-clauses : 2819
% 208.37/30.92 % Current number of unprocessed clauses: 5484
% 208.37/30.92 % ...number of literals in the above : 18736
% 208.37/30.92 % Current number of archived formulas : 0
% 208.37/30.92 % Current number of archived clauses : 1406
% 208.37/30.92 % Clause-clause subsumption calls (NU) : 3828011
% 208.37/30.92 % Rec. Clause-clause subsumption calls : 3233660
% 208.37/30.92 % Non-unit clause-clause subsumptions : 3051
% 208.37/30.92 % Unit Clause-clause subsumption calls : 4668
% 208.37/30.92 % Rewrite failures with RHS unbound : 0
% 208.37/30.92 % BW rewrite match attempts : 173
% 208.37/30.92 % BW rewrite match successes : 22
% 208.37/30.92 % Condensation attempts : 7397
% 208.37/30.92 % Condensation successes : 6
% 208.37/30.92 % Termbank termtop insertions : 312500
% 208.37/30.92 % Search garbage collected termcells : 1985
% 208.37/30.92
% 208.37/30.92 % -------------------------------------------------
% 208.37/30.92 % User time : 27.995 s
% 208.37/30.92 % System time : 1.093 s
% 208.37/30.92 % Total time : 29.088 s
% 208.37/30.92 % Maximum resident set size: 5856 pages
% 208.37/30.92
% 208.37/30.92 % -------------------------------------------------
% 208.37/30.92 % User time : 28.018 s
% 208.37/30.92 % System time : 1.099 s
% 208.37/30.92 % Total time : 29.117 s
% 208.37/30.92 % Maximum resident set size: 5632 pages
% 208.37/30.92 % E exiting
%------------------------------------------------------------------------------