%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL309-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:24 PM UTC 2026
% Result : Unsatisfiable 33.66s 5.56s
% Output : CNFRefutation 33.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of clauses : 68 ( 31 unt; 0 nHn; 34 RR)
% Number of literals : 118 ( 7 equ; 58 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 143 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(or(implies(p,q),implies(p,r)),implies(p,or(q,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_19,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_22,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_23,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_25,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_26,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_27,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_28,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_29,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_30,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_31,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_32,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_33,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_34,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_35,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
~ theorem(equivalent(or(implies(p,q),implies(p,r)),implies(p,or(q,r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_37,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_38,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_39,plain,
( ~ theorem(X2)
| theorem(or(not(or(X1,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_41,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_42,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
cnf(c_0_43,plain,
( ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_44,negated_conjecture,
~ theorem(equivalent(or(implies(p,q),implies(p,r)),implies(p,or(q,r)))),
c_0_36 ).
cnf(c_0_45,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_13]),c_0_13]),c_0_38]) ).
cnf(c_0_46,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,not(X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_39]) ).
cnf(c_0_47,plain,
( ~ theorem(or(not(X4),X3))
| ~ theorem(or(X1,or(X2,X4)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_40,c_0_34]) ).
cnf(c_0_48,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(or(not(or(X1,X2)),X3),X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_50,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_51,negated_conjecture,
~ theorem(not(or(not(or(not(or(or(not(p),q),or(not(p),r))),or(not(p),or(q,r)))),not(or(not(or(not(p),or(q,r))),or(or(not(p),q),or(not(p),r))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_13]),c_0_13]),c_0_13]),c_0_45]) ).
cnf(c_0_52,plain,
( ~ theorem(X2)
| ~ theorem(X1)
| theorem(not(or(not(X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_46,c_0_39]) ).
cnf(c_0_53,plain,
( ~ theorem(or(not(X3),X4))
| ~ theorem(or(not(X2),X5))
| theorem(or(or(not(or(or(X1,X2),X3)),X4),or(X1,X5))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_33]) ).
cnf(c_0_55,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_23,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( ~ theorem(or(not(or(not(p),or(q,r))),or(or(not(p),q),or(not(p),r))))
| ~ theorem(or(not(or(or(not(p),q),or(not(p),r))),or(not(p),or(q,r)))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
( ~ theorem(or(not(X2),X4))
| ~ theorem(or(not(X3),or(X1,X4)))
| theorem(or(not(or(or(X1,X2),X3)),or(X1,X4))) ),
inference(spm,[status(thm)],[c_0_35,c_0_53]) ).
cnf(c_0_58,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_41,c_0_31]) ).
cnf(c_0_60,negated_conjecture,
( ~ theorem(or(not(or(not(p),r)),or(not(p),or(q,r))))
| ~ theorem(or(not(or(not(p),or(q,r))),or(or(not(p),q),or(not(p),r)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_61,plain,
( ~ theorem(or(or(X1,X4),X3))
| theorem(or(X1,or(or(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_23,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( ~ theorem(or(not(or(not(p),r)),or(not(p),or(q,r))))
| ~ theorem(or(or(not(or(not(p),or(q,r))),or(not(p),r)),q)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,plain,
( ~ axiom(or(X1,or(X3,X2)))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_41,c_0_27]) ).
cnf(c_0_64,plain,
( ~ theorem(or(X1,or(X3,or(X2,X4))))
| theorem(or(X1,or(X2,or(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_49,c_0_20]) ).
cnf(c_0_65,negated_conjecture,
~ theorem(or(not(or(not(p),r)),or(not(p),or(q,r)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_20])]) ).
cnf(c_0_66,plain,
( ~ axiom(or(X1,or(X3,or(X2,X4))))
| theorem(or(X1,or(X2,or(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_64,c_0_16]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL309-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n019.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Mon Sep 21 00:20:20 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.56 Running first-order theorem proving
% 0.25/0.56 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
% 33.66/5.56 % Version: 3.5.1
% 33.66/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 33.66/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.66/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 33.66/5.56 % Starting new_bool_3 with 300s (1) cores
% 33.66/5.56 % Starting new_bool_1 with 300s (1) cores
% 33.66/5.56 % Starting sh5l with 300s (1) cores
% 33.66/5.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1296134 completed with status 0
% 33.66/5.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 33.66/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 33.66/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.66/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 33.66/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.66/5.56 % No SInE strategy applied
% 33.66/5.56 % Search class: FHUNM-FFSF21-DFFFFFNN
% 33.66/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 33.66/5.56 % Starting SubtermCWHack with 136s (1) cores
% 33.66/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 33.66/5.56 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 33.66/5.56 % Starting new_bool_3 with 296s (1) cores
% 33.66/5.56 % Starting new_bool_1 with 291s (1) cores
% 33.66/5.56 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1296143 completed with status 0
% 33.66/5.56 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 33.66/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 33.66/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.66/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 33.66/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.66/5.56 % No SInE strategy applied
% 33.66/5.56 % Search class: FHUNM-FFSF21-DFFFFFNN
% 33.66/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 33.66/5.56 % Starting SubtermCWHack with 136s (1) cores
% 33.66/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 33.66/5.56 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 33.66/5.56 % Preprocessing time : 0.089 s
% 33.66/5.56
% 33.66/5.56 % Proof found!
% 33.66/5.56 % SZS status Unsatisfiable
% 33.66/5.56 % SZS output start CNFRefutation
% See solution above
% 33.66/5.56 % Parsed axioms : 11
% 33.66/5.56 % Removed by relevancy pruning/SinE : 0
% 33.66/5.56 % Initial clauses : 11
% 33.66/5.56 % Removed in clause preprocessing : 3
% 33.66/5.56 % Initial clauses in saturation : 8
% 33.66/5.56 % Processed clauses : 6219
% 33.66/5.56 % ...of these trivial : 17
% 33.66/5.56 % ...subsumed : 3294
% 33.66/5.56 % ...remaining for further processing : 2908
% 33.66/5.56 % Other redundant clauses eliminated : 0
% 33.66/5.56 % Clauses deleted for lack of memory : 0
% 33.66/5.56 % Backward-subsumed : 1027
% 33.66/5.56 % Backward-rewritten : 12
% 33.66/5.56 % Generated clauses : 89063
% 33.66/5.56 % ...of the previous two non-redundant : 88536
% 33.66/5.56 % ...aggressively subsumed : 0
% 33.66/5.56 % Contextual simplify-reflections : 21
% 33.66/5.56 % Paramodulations : 89063
% 33.66/5.56 % Factorizations : 0
% 33.66/5.56 % NegExts : 0
% 33.66/5.56 % Equation resolutions : 0
% 33.66/5.56 % Disequality decompositions : 0
% 33.66/5.56 % Total rewrite steps : 590
% 33.66/5.56 % ...of those cached : 491
% 33.66/5.56 % Propositional unsat checks : 0
% 33.66/5.56 % Propositional check models : 0
% 33.66/5.56 % Propositional check unsatisfiable : 0
% 33.66/5.56 % Propositional clauses : 0
% 33.66/5.56 % Propositional clauses after purity: 0
% 33.66/5.56 % Propositional unsat core size : 0
% 33.66/5.56 % Propositional preprocessing time : 0.000
% 33.66/5.56 % Propositional encoding time : 0.000
% 33.66/5.56 % Propositional solver time : 0.000
% 33.66/5.56 % Success case prop preproc time : 0.000
% 33.66/5.56 % Success case prop encoding time : 0.000
% 33.66/5.56 % Success case prop solver time : 0.000
% 33.66/5.56 % Current number of processed clauses : 1869
% 33.66/5.56 % Positive orientable unit clauses : 30
% 33.66/5.56 % Positive unorientable unit clauses: 0
% 33.66/5.56 % Negative unit clauses : 147
% 33.66/5.56 % Non-unit-clauses : 1692
% 33.66/5.56 % Current number of unprocessed clauses: 80854
% 33.66/5.56 % ...number of literals in the above : 321511
% 33.66/5.56 % Current number of archived formulas : 0
% 33.66/5.56 % Current number of archived clauses : 1042
% 33.66/5.56 % Clause-clause subsumption calls (NU) : 805774
% 33.66/5.56 % Rec. Clause-clause subsumption calls : 568280
% 33.66/5.56 % Non-unit clause-clause subsumptions : 1892
% 33.66/5.56 % Unit Clause-clause subsumption calls : 55223
% 33.66/5.56 % Rewrite failures with RHS unbound : 0
% 33.66/5.56 % BW rewrite match attempts : 2301
% 33.66/5.56 % BW rewrite match successes : 11
% 33.66/5.56 % Condensation attempts : 0
% 33.66/5.56 % Condensation successes : 0
% 33.66/5.56 % Termbank termtop insertions : 1918507
% 33.66/5.56 % Search garbage collected termcells : 11
% 33.66/5.56
% 33.66/5.56 % -------------------------------------------------
% 33.66/5.56 % User time : 4.592 s
% 33.66/5.56 % System time : 0.145 s
% 33.66/5.56 % Total time : 4.737 s
% 33.66/5.56 % Maximum resident set size: 3388 pages
% 33.66/5.56
% 33.66/5.56 % -------------------------------------------------
% 33.66/5.56 % User time : 22.851 s
% 33.66/5.56 % System time : 0.888 s
% 33.66/5.56 % Total time : 23.738 s
% 33.66/5.56 % Maximum resident set size: 4864 pages
% 33.66/5.56 % E exiting
%------------------------------------------------------------------------------