TSTP Solution File: LAT222-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT222-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:10:07 EDT 2023
% Result : Unsatisfiable 70.35s 9.32s
% Output : CNFRefutation 70.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 78 ( 75 unt; 0 nHn; 17 RR)
% Number of literals : 83 ( 82 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 111 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',prove_distributivity_hypothesis) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',complement_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',idempotence_of_join) ).
cnf(equation_H6,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(meet(X1,join(X2,meet(X1,X3))),meet(X3,join(X1,X2)))),
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',equation_H6) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',commutativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',idempotence_of_meet) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',complement_meet) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p',prove_distributivity) ).
cnf(c_0_14,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_17,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_20,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_21,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_22,hypothesis,
join(b,a) = b,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_24,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,hypothesis,
join(b,join(a,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_27,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(meet(X1,join(X2,meet(X1,X3))),meet(X3,join(X1,X2)))),
equation_H6 ).
cnf(c_0_29,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_30,hypothesis,
join(b,complement(a)) = join(b,one),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_31,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_32,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_33,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_34,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_35,plain,
meet(X1,join(meet(X2,join(X1,X3)),meet(X1,join(X3,meet(X1,X2))))) = meet(X1,join(X3,meet(X1,X2))),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_21]) ).
cnf(c_0_39,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_34]) ).
cnf(c_0_40,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_41,hypothesis,
meet(b,join(X1,meet(b,join(complement(a),meet(b,X1))))) = meet(b,join(complement(a),meet(b,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24]) ).
cnf(c_0_42,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_37,c_0_15]) ).
cnf(c_0_43,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_27]),c_0_21]),c_0_19]) ).
cnf(c_0_44,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_31]),c_0_21]) ).
cnf(c_0_45,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X3,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_46,hypothesis,
meet(X1,meet(b,join(complement(a),meet(X1,b)))) = meet(X1,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,hypothesis,
meet(join(a,X1),join(b,X1)) = join(a,X1),
inference(spm,[status(thm)],[c_0_43,c_0_25]) ).
cnf(c_0_48,plain,
join(X1,complement(meet(X2,X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_17]),c_0_29]) ).
cnf(c_0_49,hypothesis,
meet(b,meet(X1,join(complement(a),meet(X1,b)))) = meet(X1,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_15]) ).
cnf(c_0_50,hypothesis,
meet(join(a,X1),join(X1,b)) = join(a,X1),
inference(spm,[status(thm)],[c_0_47,c_0_29]) ).
cnf(c_0_51,hypothesis,
join(complement(meet(X1,b)),meet(X1,join(complement(a),meet(X1,b)))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_29]) ).
cnf(c_0_52,plain,
join(X1,complement(meet(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_14]),c_0_29]) ).
cnf(c_0_53,hypothesis,
meet(join(X1,b),join(a,X1)) = join(a,X1),
inference(spm,[status(thm)],[c_0_15,c_0_50]) ).
cnf(c_0_54,hypothesis,
join(complement(meet(b,X1)),meet(X1,join(complement(a),meet(b,X1)))) = one,
inference(spm,[status(thm)],[c_0_51,c_0_15]) ).
cnf(c_0_55,plain,
join(X1,meet(X2,meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_45]) ).
cnf(c_0_56,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_57,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_58,hypothesis,
join(X1,join(b,complement(join(a,X1)))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_21]) ).
cnf(c_0_59,hypothesis,
join(meet(X1,complement(a)),complement(meet(b,meet(complement(a),X1)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_32]),c_0_42]),c_0_29]) ).
cnf(c_0_60,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_56]),c_0_32]),c_0_42]),c_0_45]) ).
cnf(c_0_61,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_57]) ).
cnf(c_0_62,hypothesis,
join(b,join(complement(a),X1)) = join(b,one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_30]),c_0_21]),c_0_34]) ).
cnf(c_0_63,hypothesis,
meet(X1,join(X2,meet(X1,join(b,join(complement(join(a,X1)),meet(X1,X2)))))) = meet(X1,join(b,join(complement(join(a,X1)),meet(X1,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_58]),c_0_24]),c_0_21]),c_0_21]) ).
cnf(c_0_64,hypothesis,
join(complement(meet(b,complement(a))),meet(complement(a),join(b,X1))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_15]),c_0_29]) ).
cnf(c_0_65,plain,
complement(one) = zero,
inference(spm,[status(thm)],[c_0_57,c_0_27]) ).
cnf(c_0_66,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_29]) ).
cnf(c_0_67,hypothesis,
join(b,join(complement(a),X1)) = one,
inference(rw,[status(thm)],[c_0_62,c_0_31]) ).
cnf(c_0_68,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_69,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_57,c_0_32]) ).
cnf(c_0_70,hypothesis,
meet(complement(a),join(b,meet(complement(a),complement(meet(b,complement(a)))))) = complement(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_24]),c_0_20]),c_0_65]),c_0_66]) ).
cnf(c_0_71,hypothesis,
join(b,join(X1,complement(a))) = one,
inference(spm,[status(thm)],[c_0_67,c_0_29]) ).
cnf(c_0_72,plain,
( meet(X1,complement(meet(X2,X1))) = complement(X2)
| join(X2,meet(X1,complement(meet(X2,X1)))) != one ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,hypothesis,
join(b,meet(complement(a),complement(meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_70]),c_0_21]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_75,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_74,c_0_29]) ).
cnf(c_0_77,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_75]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LAT222-1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 10:43:30 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.PXlTIrTlYL/E---3.1_9704.p
% 70.35/9.32 # Version: 3.1pre001
% 70.35/9.32 # Preprocessing class: FSSSSMSSSSSNFFN.
% 70.35/9.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.35/9.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 70.35/9.32 # Starting new_bool_3 with 300s (1) cores
% 70.35/9.32 # Starting new_bool_1 with 300s (1) cores
% 70.35/9.32 # Starting sh5l with 300s (1) cores
% 70.35/9.32 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9782 completed with status 0
% 70.35/9.32 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 70.35/9.32 # Preprocessing class: FSSSSMSSSSSNFFN.
% 70.35/9.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.35/9.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 70.35/9.32 # No SInE strategy applied
% 70.35/9.32 # Search class: FHUPM-FFSF21-MFFFFFNN
% 70.35/9.32 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 70.35/9.32 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 70.35/9.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 70.35/9.32 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 70.35/9.32 # Starting new_bool_3 with 136s (1) cores
% 70.35/9.32 # Starting new_bool_1 with 136s (1) cores
% 70.35/9.32 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 9790 completed with status 0
% 70.35/9.32 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 70.35/9.32 # Preprocessing class: FSSSSMSSSSSNFFN.
% 70.35/9.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.35/9.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 70.35/9.32 # No SInE strategy applied
% 70.35/9.32 # Search class: FHUPM-FFSF21-MFFFFFNN
% 70.35/9.32 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 70.35/9.32 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 70.35/9.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 70.35/9.32 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 70.35/9.32 # Preprocessing time : 0.001 s
% 70.35/9.32 # Presaturation interreduction done
% 70.35/9.32
% 70.35/9.32 # Proof found!
% 70.35/9.32 # SZS status Unsatisfiable
% 70.35/9.32 # SZS output start CNFRefutation
% See solution above
% 70.35/9.32 # Parsed axioms : 14
% 70.35/9.32 # Removed by relevancy pruning/SinE : 0
% 70.35/9.32 # Initial clauses : 14
% 70.35/9.32 # Removed in clause preprocessing : 0
% 70.35/9.32 # Initial clauses in saturation : 14
% 70.35/9.32 # Processed clauses : 20416
% 70.35/9.32 # ...of these trivial : 10262
% 70.35/9.32 # ...subsumed : 8750
% 70.35/9.32 # ...remaining for further processing : 1404
% 70.35/9.32 # Other redundant clauses eliminated : 0
% 70.35/9.32 # Clauses deleted for lack of memory : 0
% 70.35/9.32 # Backward-subsumed : 24
% 70.35/9.32 # Backward-rewritten : 213
% 70.35/9.32 # Generated clauses : 647506
% 70.35/9.32 # ...of the previous two non-redundant : 293428
% 70.35/9.32 # ...aggressively subsumed : 0
% 70.35/9.32 # Contextual simplify-reflections : 0
% 70.35/9.32 # Paramodulations : 647493
% 70.35/9.32 # Factorizations : 0
% 70.35/9.32 # NegExts : 0
% 70.35/9.32 # Equation resolutions : 13
% 70.35/9.32 # Total rewrite steps : 1979210
% 70.35/9.32 # Propositional unsat checks : 0
% 70.35/9.32 # Propositional check models : 0
% 70.35/9.32 # Propositional check unsatisfiable : 0
% 70.35/9.32 # Propositional clauses : 0
% 70.35/9.32 # Propositional clauses after purity: 0
% 70.35/9.32 # Propositional unsat core size : 0
% 70.35/9.32 # Propositional preprocessing time : 0.000
% 70.35/9.32 # Propositional encoding time : 0.000
% 70.35/9.32 # Propositional solver time : 0.000
% 70.35/9.32 # Success case prop preproc time : 0.000
% 70.35/9.32 # Success case prop encoding time : 0.000
% 70.35/9.32 # Success case prop solver time : 0.000
% 70.35/9.32 # Current number of processed clauses : 1153
% 70.35/9.32 # Positive orientable unit clauses : 1031
% 70.35/9.32 # Positive unorientable unit clauses: 10
% 70.35/9.32 # Negative unit clauses : 1
% 70.35/9.32 # Non-unit-clauses : 111
% 70.35/9.32 # Current number of unprocessed clauses: 272446
% 70.35/9.32 # ...number of literals in the above : 291765
% 70.35/9.32 # Current number of archived formulas : 0
% 70.35/9.32 # Current number of archived clauses : 251
% 70.35/9.32 # Clause-clause subsumption calls (NU) : 9894
% 70.35/9.32 # Rec. Clause-clause subsumption calls : 9894
% 70.35/9.32 # Non-unit clause-clause subsumptions : 4280
% 70.35/9.32 # Unit Clause-clause subsumption calls : 919
% 70.35/9.32 # Rewrite failures with RHS unbound : 0
% 70.35/9.32 # BW rewrite match attempts : 20069
% 70.35/9.32 # BW rewrite match successes : 2666
% 70.35/9.32 # Condensation attempts : 0
% 70.35/9.32 # Condensation successes : 0
% 70.35/9.32 # Termbank termtop insertions : 12019243
% 70.35/9.32
% 70.35/9.32 # -------------------------------------------------
% 70.35/9.32 # User time : 8.500 s
% 70.35/9.32 # System time : 0.239 s
% 70.35/9.32 # Total time : 8.740 s
% 70.35/9.32 # Maximum resident set size: 1592 pages
% 70.35/9.32
% 70.35/9.32 # -------------------------------------------------
% 70.35/9.32 # User time : 42.705 s
% 70.35/9.32 # System time : 0.844 s
% 70.35/9.32 # Total time : 43.549 s
% 70.35/9.32 # Maximum resident set size: 1676 pages
% 70.35/9.32 % E---3.1 exiting
%------------------------------------------------------------------------------