TSTP Solution File: LAT286+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT286+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:24:17 EDT 2024
% Result : Theorem 4.40s 1.35s
% Output : CNFRefutation 4.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 16 unt; 0 def)
% Number of atoms : 127 ( 10 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 135 ( 54 ~; 39 |; 26 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 41 ( 1 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> k2_pre_topc(X1) = u1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',d3_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',dt_l1_pre_topc) ).
fof(t15_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_lopclset) ).
fof(t13_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_lopclset) ).
fof(t8_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_lopclset) ).
fof(dt_k1_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_lopclset) ).
fof(redefinition_m2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',redefinition_m2_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',fc1_subset_1) ).
fof(fc1_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ~ v1_xboole_0(k1_lopclset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_lopclset) ).
fof(c_0_9,plain,
! [X28] :
( ~ l1_struct_0(X28)
| k2_pre_topc(X28) = u1_struct_0(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
fof(c_0_10,plain,
! [X444] :
( ~ l1_pre_topc(X444)
| l1_struct_0(X444) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t15_lopclset])]) ).
cnf(c_0_12,plain,
( k2_pre_topc(X1) = u1_struct_0(X1)
| ~ l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( l1_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_15,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
inference(fof_simplification,[status(thm)],[t13_lopclset]) ).
fof(c_0_16,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t8_lopclset]) ).
fof(c_0_17,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
inference(fof_simplification,[status(thm)],[dt_k1_lopclset]) ).
cnf(c_0_18,plain,
( k2_pre_topc(X1) = u1_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X24] :
( v3_struct_0(X24)
| ~ v2_pre_topc(X24)
| ~ l1_pre_topc(X24)
| u1_struct_0(k6_lopclset(X24)) = k1_lopclset(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_21,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_subset_1]) ).
fof(c_0_22,plain,
! [X120] :
( v3_struct_0(X120)
| ~ v2_pre_topc(X120)
| ~ l1_pre_topc(X120)
| m2_subset_1(k2_pre_topc(X120),k1_zfmisc_1(u1_struct_0(X120)),k1_lopclset(X120)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_23,plain,
! [X112] :
( v3_struct_0(X112)
| ~ l1_pre_topc(X112)
| m1_subset_1(k1_lopclset(X112),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X112)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_24,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
k2_pre_topc(esk1_0) = u1_struct_0(esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( v3_struct_0(X1)
| u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_29,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_30,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ~ v1_xboole_0(k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_lopclset]) ).
fof(c_0_31,plain,
! [X1186,X1187,X1188] :
( ( ~ m2_subset_1(X1188,X1186,X1187)
| m1_subset_1(X1188,X1187)
| v1_xboole_0(X1186)
| v1_xboole_0(X1187)
| ~ m1_subset_1(X1187,k1_zfmisc_1(X1186)) )
& ( ~ m1_subset_1(X1188,X1187)
| m2_subset_1(X1188,X1186,X1187)
| v1_xboole_0(X1186)
| v1_xboole_0(X1187)
| ~ m1_subset_1(X1187,k1_zfmisc_1(X1186)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])]) ).
cnf(c_0_32,plain,
( v3_struct_0(X1)
| m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( v3_struct_0(X1)
| m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
~ m1_subset_1(u1_struct_0(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
u1_struct_0(k6_lopclset(esk1_0)) = k1_lopclset(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]),c_0_28]) ).
fof(c_0_36,plain,
! [X564] : ~ v1_xboole_0(k1_zfmisc_1(X564)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_29])]) ).
fof(c_0_37,plain,
! [X113] :
( v3_struct_0(X113)
| ~ v2_pre_topc(X113)
| ~ l1_pre_topc(X113)
| ~ v1_xboole_0(k1_lopclset(X113)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
cnf(c_0_38,plain,
( m1_subset_1(X1,X3)
| v1_xboole_0(X2)
| v1_xboole_0(X3)
| ~ m2_subset_1(X1,X2,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
m2_subset_1(u1_struct_0(esk1_0),k1_zfmisc_1(u1_struct_0(esk1_0)),k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_27]),c_0_19])]),c_0_28]) ).
cnf(c_0_40,negated_conjecture,
m1_subset_1(k1_lopclset(esk1_0),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(esk1_0)))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_19]),c_0_28]) ).
cnf(c_0_41,negated_conjecture,
~ m1_subset_1(u1_struct_0(esk1_0),k1_lopclset(esk1_0)),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( v3_struct_0(X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ v1_xboole_0(k1_lopclset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
v1_xboole_0(k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_27]),c_0_19])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT286+2 : TPTP v8.2.0. Released v3.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 19:44:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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
% 4.40/1.35 # Version: 3.1.0
% 4.40/1.35 # Preprocessing class: FMLLSMLLSSSNFFN.
% 4.40/1.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.40/1.35 # Starting new_bool_3 with 900s (3) cores
% 4.40/1.35 # Starting new_bool_1 with 900s (3) cores
% 4.40/1.35 # Starting sh5l with 300s (1) cores
% 4.40/1.35 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 4.40/1.35 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 14493 completed with status 0
% 4.40/1.35 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 4.40/1.35 # Preprocessing class: FMLLSMLLSSSNFFN.
% 4.40/1.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.40/1.35 # Starting new_bool_3 with 900s (3) cores
% 4.40/1.35 # Starting new_bool_1 with 900s (3) cores
% 4.40/1.35 # Starting sh5l with 300s (1) cores
% 4.40/1.35 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 4.40/1.35 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 4.40/1.35 # Search class: FGHSM-FMLM32-MFFFFFNN
% 4.40/1.35 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 4.40/1.35 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.40/1.35 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 23s (1) cores
% 4.40/1.35 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 14494 completed with status 0
% 4.40/1.35 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 4.40/1.35 # Preprocessing class: FMLLSMLLSSSNFFN.
% 4.40/1.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.40/1.35 # Starting new_bool_3 with 900s (3) cores
% 4.40/1.35 # Starting new_bool_1 with 900s (3) cores
% 4.40/1.35 # Starting sh5l with 300s (1) cores
% 4.40/1.35 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 4.40/1.35 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 4.40/1.35 # Search class: FGHSM-FMLM32-MFFFFFNN
% 4.40/1.35 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 4.40/1.35 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.40/1.35 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 23s (1) cores
% 4.40/1.35 # Preprocessing time : 0.022 s
% 4.40/1.35 # Presaturation interreduction done
% 4.40/1.35
% 4.40/1.35 # Proof found!
% 4.40/1.35 # SZS status Theorem
% 4.40/1.35 # SZS output start CNFRefutation
% See solution above
% 4.40/1.35 # Parsed axioms : 6427
% 4.40/1.35 # Removed by relevancy pruning/SinE : 5926
% 4.40/1.35 # Initial clauses : 1007
% 4.40/1.35 # Removed in clause preprocessing : 26
% 4.40/1.35 # Initial clauses in saturation : 981
% 4.40/1.35 # Processed clauses : 4572
% 4.40/1.35 # ...of these trivial : 40
% 4.40/1.35 # ...subsumed : 2005
% 4.40/1.35 # ...remaining for further processing : 2527
% 4.40/1.35 # Other redundant clauses eliminated : 110
% 4.40/1.35 # Clauses deleted for lack of memory : 0
% 4.40/1.35 # Backward-subsumed : 21
% 4.40/1.35 # Backward-rewritten : 109
% 4.40/1.35 # Generated clauses : 10555
% 4.40/1.35 # ...of the previous two non-redundant : 9253
% 4.40/1.35 # ...aggressively subsumed : 0
% 4.40/1.35 # Contextual simplify-reflections : 76
% 4.40/1.35 # Paramodulations : 10457
% 4.40/1.35 # Factorizations : 0
% 4.40/1.35 # NegExts : 0
% 4.40/1.35 # Equation resolutions : 113
% 4.40/1.35 # Disequality decompositions : 0
% 4.40/1.35 # Total rewrite steps : 4363
% 4.40/1.35 # ...of those cached : 3294
% 4.40/1.35 # Propositional unsat checks : 0
% 4.40/1.35 # Propositional check models : 0
% 4.40/1.35 # Propositional check unsatisfiable : 0
% 4.40/1.35 # Propositional clauses : 0
% 4.40/1.35 # Propositional clauses after purity: 0
% 4.40/1.35 # Propositional unsat core size : 0
% 4.40/1.35 # Propositional preprocessing time : 0.000
% 4.40/1.35 # Propositional encoding time : 0.000
% 4.40/1.35 # Propositional solver time : 0.000
% 4.40/1.35 # Success case prop preproc time : 0.000
% 4.40/1.35 # Success case prop encoding time : 0.000
% 4.40/1.35 # Success case prop solver time : 0.000
% 4.40/1.35 # Current number of processed clauses : 1412
% 4.40/1.35 # Positive orientable unit clauses : 319
% 4.40/1.35 # Positive unorientable unit clauses: 3
% 4.40/1.35 # Negative unit clauses : 337
% 4.40/1.35 # Non-unit-clauses : 753
% 4.40/1.35 # Current number of unprocessed clauses: 6425
% 4.40/1.35 # ...number of literals in the above : 13754
% 4.40/1.35 # Current number of archived formulas : 0
% 4.40/1.35 # Current number of archived clauses : 1038
% 4.40/1.35 # Clause-clause subsumption calls (NU) : 405209
% 4.40/1.35 # Rec. Clause-clause subsumption calls : 93764
% 4.40/1.35 # Non-unit clause-clause subsumptions : 272
% 4.40/1.35 # Unit Clause-clause subsumption calls : 40611
% 4.40/1.35 # Rewrite failures with RHS unbound : 0
% 4.40/1.35 # BW rewrite match attempts : 354
% 4.40/1.35 # BW rewrite match successes : 204
% 4.40/1.35 # Condensation attempts : 0
% 4.40/1.35 # Condensation successes : 0
% 4.40/1.35 # Termbank termtop insertions : 351524
% 4.40/1.35 # Search garbage collected termcells : 66355
% 4.40/1.35
% 4.40/1.35 # -------------------------------------------------
% 4.40/1.35 # User time : 0.598 s
% 4.40/1.35 # System time : 0.038 s
% 4.40/1.35 # Total time : 0.636 s
% 4.40/1.35 # Maximum resident set size: 13992 pages
% 4.40/1.35
% 4.40/1.35 # -------------------------------------------------
% 4.40/1.35 # User time : 0.814 s
% 4.40/1.35 # System time : 0.053 s
% 4.40/1.35 # Total time : 0.867 s
% 4.40/1.35 # Maximum resident set size: 9948 pages
% 4.40/1.35 % E---3.1 exiting
% 4.40/1.35 % E exiting
%------------------------------------------------------------------------------