%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN190-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 03:23:20 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 23
% Syntax : Number of clauses : 88 ( 33 unt; 0 nHn; 71 RR)
% Number of literals : 196 ( 0 equ; 112 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 142 ( 52 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_133,axiom,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_190,axiom,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_190) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
cnf(rule_260,axiom,
( ~ l2(c,X1)
| ~ s2(X2)
| r3(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_260) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_124,axiom,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(rule_110,axiom,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_110) ).
cnf(rule_225,axiom,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_225) ).
cnf(rule_272,axiom,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_272) ).
cnf(rule_188,axiom,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_188) ).
cnf(rule_129,axiom,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(rule_268,axiom,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_268) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(prove_this,negated_conjecture,
~ r3(a,X1,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_135,axiom,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_135) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(c_0_23,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_24,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_25,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_23 ).
cnf(c_0_26,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_27,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_24 ).
cnf(c_0_28,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_29,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_30,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
s1(b),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ m0(X4,X3,X1)
| ~ s1(X3)
| ~ p0(X2,X2)
| l2(X1,X1) ),
c_0_29 ).
cnf(c_0_33,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( ~ m0(X3,X4,X1)
| ~ p0(X2,X2)
| l2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_35,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_36,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_37,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_38,plain,
( ~ l2(c,X1)
| ~ s2(X2)
| r3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_260]) ).
cnf(c_0_39,plain,
( ~ p0(X2,X2)
| l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
c_0_36 ).
cnf(c_0_41,axiom,
s0(d),
axiom_1 ).
cnf(c_0_42,plain,
( ~ s1(X1)
| s1(a) ),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_43,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_44,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_45,plain,
( ~ l2(c,X1)
| ~ s2(X2)
| r3(X1,X2,X2) ),
c_0_38 ).
cnf(c_0_46,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_47,plain,
( ~ s1(a)
| s2(d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_48,plain,
s1(a),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_49,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_43 ).
cnf(c_0_50,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_44 ).
cnf(c_0_51,plain,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_225]) ).
cnf(c_0_52,plain,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_272]) ).
cnf(c_0_53,plain,
( ~ s2(X1)
| r3(c,X1,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_55,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
inference(fof_simplification,[status(thm)],[rule_188]) ).
cnf(c_0_56,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_41])]) ).
cnf(c_0_57,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
cnf(c_0_58,plain,
( ~ s2(X3)
| ~ m0(X1,X4,X4)
| ~ l2(X4,X1)
| ~ m0(X3,X3,X2)
| m3(X1,X2,X1) ),
c_0_51 ).
cnf(c_0_59,plain,
( ~ r3(X3,X1,X1)
| ~ r2(X3)
| ~ k2(X2,X3)
| r3(X1,X2,X3) ),
c_0_52 ).
cnf(c_0_60,plain,
r3(c,d,d),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
c_0_55 ).
cnf(c_0_62,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_26]),c_0_57])]) ).
cnf(c_0_63,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_64,plain,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_268]) ).
cnf(c_0_65,plain,
( ~ m0(X1,X3,X3)
| ~ l2(X3,X1)
| m3(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_35]),c_0_54])]) ).
cnf(c_0_66,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_67,plain,
( ~ k2(X1,c)
| ~ r2(c)
| r3(d,X1,c) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,plain,
( ~ l0(X1)
| r2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_69,axiom,
l0(c),
axiom_24 ).
cnf(c_0_70,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_63 ).
cnf(c_0_71,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_72,plain,
( ~ r3(X2,X4,X4)
| ~ m3(X3,b,X1)
| ~ m2(X2)
| r3(X1,X1,X2) ),
c_0_64 ).
cnf(c_0_73,plain,
m3(a,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_46])]) ).
cnf(c_0_74,plain,
( ~ k2(X1,c)
| r3(d,X1,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_75,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_70,c_0_57]) ).
cnf(c_0_76,negated_conjecture,
~ r3(a,X1,d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_77,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
inference(fof_simplification,[status(thm)],[rule_135]) ).
cnf(c_0_78,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_71 ).
cnf(c_0_79,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_80,plain,
( ~ m2(X1)
| ~ r3(X1,X2,X2)
| r3(a,a,X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_81,plain,
r3(d,c,c),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,negated_conjecture,
~ r3(a,X1,d),
c_0_76 ).
cnf(c_0_83,plain,
( ~ l1(X2,X3)
| ~ s0(X1)
| m2(X1) ),
c_0_77 ).
cnf(c_0_84,plain,
l1(c,c),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_85,plain,
~ m2(d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_86,plain,
( ~ s0(X1)
| m2(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN190-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 10:50:59 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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/benchmark/theBenchmark.p
% 0.14/0.49 % Version: 3.5.1
% 0.14/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 % Starting sh5l with 300s (1) cores
% 0.14/0.49 % new_bool_3 with pid 2930696 completed with status 0
% 0.14/0.49 % Result found by new_bool_3
% 0.14/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49 % SubtermCWHack with pid 2930703 completed with status 0
% 0.14/0.49 % Result found by SubtermCWHack
% 0.14/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49 % Preprocessing time : 0.003 s
% 0.14/0.49
% 0.14/0.49 % Proof found!
% 0.14/0.49 % SZS status Unsatisfiable
% 0.14/0.49 % SZS output start CNFRefutation
% See solution above
% 0.14/0.49 % Parsed axioms : 369
% 0.14/0.49 % Removed by relevancy pruning/SinE : 38
% 0.14/0.49 % Initial clauses : 331
% 0.14/0.49 % Removed in clause preprocessing : 5
% 0.14/0.49 % Initial clauses in saturation : 326
% 0.14/0.49 % Processed clauses : 1466
% 0.14/0.49 % ...of these trivial : 153
% 0.14/0.49 % ...subsumed : 242
% 0.14/0.49 % ...remaining for further processing : 1071
% 0.14/0.49 % Other redundant clauses eliminated : 0
% 0.14/0.49 % Clauses deleted for lack of memory : 0
% 0.14/0.49 % Backward-subsumed : 218
% 0.14/0.49 % Backward-rewritten : 315
% 0.14/0.49 % Generated clauses : 2068
% 0.14/0.49 % ...of the previous two non-redundant : 1566
% 0.14/0.49 % ...aggressively subsumed : 0
% 0.14/0.49 % Contextual simplify-reflections : 1
% 0.14/0.49 % Paramodulations : 2068
% 0.14/0.49 % Factorizations : 0
% 0.14/0.49 % NegExts : 0
% 0.14/0.49 % Equation resolutions : 0
% 0.14/0.49 % Disequality decompositions : 0
% 0.14/0.49 % Total rewrite steps : 1498
% 0.14/0.49 % ...of those cached : 1027
% 0.14/0.49 % Propositional unsat checks : 0
% 0.14/0.49 % Propositional check models : 0
% 0.14/0.49 % Propositional check unsatisfiable : 0
% 0.14/0.49 % Propositional clauses : 0
% 0.14/0.49 % Propositional clauses after purity: 0
% 0.14/0.49 % Propositional unsat core size : 0
% 0.14/0.49 % Propositional preprocessing time : 0.000
% 0.14/0.49 % Propositional encoding time : 0.000
% 0.14/0.49 % Propositional solver time : 0.000
% 0.14/0.49 % Success case prop preproc time : 0.000
% 0.14/0.49 % Success case prop encoding time : 0.000
% 0.14/0.49 % Success case prop solver time : 0.000
% 0.14/0.49 % Current number of processed clauses : 538
% 0.14/0.49 % Positive orientable unit clauses : 234
% 0.14/0.49 % Positive unorientable unit clauses: 0
% 0.14/0.49 % Negative unit clauses : 3
% 0.14/0.49 % Non-unit-clauses : 301
% 0.14/0.49 % Current number of unprocessed clauses: 146
% 0.14/0.49 % ...number of literals in the above : 554
% 0.14/0.49 % Current number of archived formulas : 0
% 0.14/0.49 % Current number of archived clauses : 533
% 0.14/0.49 % Clause-clause subsumption calls (NU) : 37145
% 0.14/0.49 % Rec. Clause-clause subsumption calls : 30673
% 0.14/0.49 % Non-unit clause-clause subsumptions : 382
% 0.14/0.49 % Unit Clause-clause subsumption calls : 3196
% 0.14/0.49 % Rewrite failures with RHS unbound : 0
% 0.14/0.49 % BW rewrite match attempts : 687
% 0.14/0.49 % BW rewrite match successes : 268
% 0.14/0.49 % Condensation attempts : 0
% 0.14/0.49 % Condensation successes : 0
% 0.14/0.49 % Termbank termtop insertions : 33701
% 0.14/0.49 % Search garbage collected termcells : 1515
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.057 s
% 0.14/0.49 % System time : 0.005 s
% 0.14/0.49 % Total time : 0.062 s
% 0.14/0.49 % Maximum resident set size: 4472 pages
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.063 s
% 0.14/0.49 % System time : 0.010 s
% 0.14/0.49 % Total time : 0.073 s
% 0.14/0.49 % Maximum resident set size: 5120 pages
% 0.14/0.49 % E exiting
%------------------------------------------------------------------------------