%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL433-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 : n006.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:44 PM UTC 2026
% Result : Unsatisfiable 34.10s 5.41s
% Output : CNFRefutation 34.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 41 ( 8 unt; 0 nHn; 32 RR)
% Number of literals : 84 ( 0 equ; 46 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 122 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms__H__MP_0,axiom,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X2,tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms__H__MP_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
cnf(cls_PropLog_Othms_OH_0,axiom,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL005-0.ax',cls_PropLog_Othms_OH_0) ).
cnf(cls_PropLog_Othms_OMP_0,axiom,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).
cnf(cls_PropLog_Odeduction_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Odeduction_0) ).
cnf(cls_Set_OinsertCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_0) ).
cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( ~ c_PropLog_Osat(v_F,X1,t_a)
| c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_PropLog_Osat__imp_0,axiom,
( ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3)
| c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Osat__imp_0) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_2,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_11,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X2,tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms__H__MP_0]) ).
cnf(c_0_12,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X2,tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_11 ).
cnf(c_0_13,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_14,plain,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OH_0]) ).
cnf(c_0_15,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OMP_0]) ).
cnf(c_0_16,plain,
( ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Odeduction_0]) ).
cnf(c_0_17,plain,
( ~ c_in(X2,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertCI_0]) ).
cnf(c_0_20,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ c_in(X2,c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ c_in(X2,X4,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left__insert_0]) ).
cnf(c_0_27,negated_conjecture,
( ~ c_PropLog_Osat(v_F,X1,t_a)
| c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_28,plain,
( ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3)
| c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Osat__imp_0]) ).
cnf(c_0_29,plain,
( ~ c_in(X4,X2,tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
( ~ c_PropLog_Osat(v_F,X1,t_a)
| c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
c_0_27 ).
cnf(c_0_32,plain,
( ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3)
| c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3) ),
c_0_28 ).
cnf(c_0_33,plain,
( ~ c_in(X5,c_insert(X2,X3,tc_PropLog_Opl(X4)),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( ~ c_PropLog_Osat(c_insert(X1,v_F,tc_PropLog_Opl(t_a)),X2,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,t_a),c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( ~ c_in(X3,c_insert(X2,v_F,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(c_insert(X3,v_F,tc_PropLog_Opl(t_a)),X1,t_a)
| c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_37,negated_conjecture,
( ~ c_PropLog_Osat(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),X1,t_a)
| c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_38,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
cls_conjecture_2 ).
cnf(c_0_39,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
c_0_36 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL433-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n006.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 00:31:43 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 34.10/5.41 % Version: 3.5.1
% 34.10/5.41 % Preprocessing class: FMLMSMSMSSSNFFN.
% 34.10/5.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.10/5.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.10/5.41 % Starting new_bool_3 with 300s (1) cores
% 34.10/5.41 % Starting new_bool_1 with 300s (1) cores
% 34.10/5.41 % Starting sh5l with 300s (1) cores
% 34.10/5.41 % new_bool_3 with pid 1632811 completed with status 0
% 34.10/5.41 % Result found by new_bool_3
% 34.10/5.41 % Preprocessing class: FMLMSMSMSSSNFFN.
% 34.10/5.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.10/5.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.10/5.41 % Starting new_bool_3 with 300s (1) cores
% 34.10/5.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 34.10/5.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 34.10/5.41 % Search class: FGHSM-FFMS32-MFFFFFNN
% 34.10/5.41 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 34.10/5.41 % Starting SubtermCWHack with 31s (1) cores
% 34.10/5.41 % SubtermCWHack with pid 1632817 completed with status 0
% 34.10/5.41 % Result found by SubtermCWHack
% 34.10/5.41 % Preprocessing class: FMLMSMSMSSSNFFN.
% 34.10/5.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.10/5.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.10/5.41 % Starting new_bool_3 with 300s (1) cores
% 34.10/5.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 34.10/5.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 34.10/5.41 % Search class: FGHSM-FFMS32-MFFFFFNN
% 34.10/5.41 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 34.10/5.41 % Starting SubtermCWHack with 31s (1) cores
% 34.10/5.41 % Preprocessing time : 0.002 s
% 34.10/5.41
% 34.10/5.41 % Proof found!
% 34.10/5.41 % SZS status Unsatisfiable
% 34.10/5.41 % SZS output start CNFRefutation
% See solution above
% 34.10/5.41 % Parsed axioms : 1378
% 34.10/5.41 % Removed by relevancy pruning/SinE : 1312
% 34.10/5.41 % Initial clauses : 66
% 34.10/5.41 % Removed in clause preprocessing : 0
% 34.10/5.41 % Initial clauses in saturation : 66
% 34.10/5.41 % Processed clauses : 12783
% 34.10/5.41 % ...of these trivial : 1257
% 34.10/5.41 % ...subsumed : 9414
% 34.10/5.41 % ...remaining for further processing : 2112
% 34.10/5.41 % Other redundant clauses eliminated : 0
% 34.10/5.41 % Clauses deleted for lack of memory : 0
% 34.10/5.41 % Backward-subsumed : 140
% 34.10/5.41 % Backward-rewritten : 65
% 34.10/5.41 % Generated clauses : 329457
% 34.10/5.41 % ...of the previous two non-redundant : 298719
% 34.10/5.41 % ...aggressively subsumed : 0
% 34.10/5.41 % Contextual simplify-reflections : 2
% 34.10/5.41 % Paramodulations : 329439
% 34.10/5.41 % Factorizations : 0
% 34.10/5.41 % NegExts : 0
% 34.10/5.41 % Equation resolutions : 18
% 34.10/5.41 % Disequality decompositions : 0
% 34.10/5.41 % Total rewrite steps : 33305
% 34.10/5.41 % ...of those cached : 26905
% 34.10/5.41 % Propositional unsat checks : 0
% 34.10/5.41 % Propositional check models : 0
% 34.10/5.41 % Propositional check unsatisfiable : 0
% 34.10/5.41 % Propositional clauses : 0
% 34.10/5.41 % Propositional clauses after purity: 0
% 34.10/5.41 % Propositional unsat core size : 0
% 34.10/5.41 % Propositional preprocessing time : 0.000
% 34.10/5.41 % Propositional encoding time : 0.000
% 34.10/5.41 % Propositional solver time : 0.000
% 34.10/5.41 % Success case prop preproc time : 0.000
% 34.10/5.41 % Success case prop encoding time : 0.000
% 34.10/5.41 % Success case prop solver time : 0.000
% 34.10/5.41 % Current number of processed clauses : 1907
% 34.10/5.41 % Positive orientable unit clauses : 333
% 34.10/5.41 % Positive unorientable unit clauses: 0
% 34.10/5.41 % Negative unit clauses : 15
% 34.10/5.41 % Non-unit-clauses : 1559
% 34.10/5.41 % Current number of unprocessed clauses: 284335
% 34.10/5.41 % ...number of literals in the above : 690790
% 34.10/5.41 % Current number of archived formulas : 0
% 34.10/5.41 % Current number of archived clauses : 205
% 34.10/5.41 % Clause-clause subsumption calls (NU) : 616715
% 34.10/5.41 % Rec. Clause-clause subsumption calls : 587665
% 34.10/5.41 % Non-unit clause-clause subsumptions : 9344
% 34.10/5.41 % Unit Clause-clause subsumption calls : 13777
% 34.10/5.41 % Rewrite failures with RHS unbound : 0
% 34.10/5.41 % BW rewrite match attempts : 54559
% 34.10/5.41 % BW rewrite match successes : 65
% 34.10/5.41 % Condensation attempts : 0
% 34.10/5.41 % Condensation successes : 0
% 34.10/5.41 % Termbank termtop insertions : 8375857
% 34.10/5.41 % Search garbage collected termcells : 2649
% 34.10/5.41
% 34.10/5.41 % -------------------------------------------------
% 34.10/5.41 % User time : 4.642 s
% 34.10/5.41 % System time : 0.146 s
% 34.10/5.41 % Total time : 4.789 s
% 34.10/5.41 % Maximum resident set size: 4620 pages
% 34.10/5.41
% 34.10/5.41 % -------------------------------------------------
% 34.10/5.41 % User time : 4.662 s
% 34.10/5.41 % System time : 0.153 s
% 34.10/5.41 % Total time : 4.815 s
% 34.10/5.41 % Maximum resident set size: 5376 pages
% 34.10/5.41 % E exiting
%------------------------------------------------------------------------------