TSTP Solution File: LCL903+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL903+1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:34:09 EDT 2023
% Result : Theorem 0.96s 0.58s
% Output : CNFRefutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 12
% Syntax : Number of formulae : 78 ( 57 unt; 0 def)
% Number of atoms : 104 ( 39 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 22 ~; 19 |; 2 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 129 ( 16 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_12,axiom,
! [X1] : '+'(X1,'1') = '1',
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_12) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_02) ).
fof(sos_07,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_07) ).
fof(sos_06,axiom,
! [X7,X8] :
( ( '>='(X7,X8)
& '>='(X8,X7) )
=> X7 = X8 ),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_06) ).
fof(sos_08,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_08) ).
fof(sos_04,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_04) ).
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_03) ).
fof(sos_09,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_09) ).
fof(sos_13,axiom,
! [X1] : '==>'('==>'('==>'(X1,'1'),X1),X1) = '0',
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_13) ).
fof(sos_11,axiom,
! [X18,X19,X20] :
( '>='(X18,X19)
=> '>='('==>'(X20,X18),'==>'(X20,X19)) ),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_11) ).
fof(sos_10,axiom,
! [X15,X16,X17] :
( '>='(X15,X16)
=> '>='('==>'(X16,X17),'==>'(X15,X17)) ),
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',sos_10) ).
fof(goals_14,conjecture,
! [X21] : '+'(X21,X21) = X21,
file('/export/starexec/sandbox/tmp/tmp.r8LiFlRDLb/E---3.1_9000.p',goals_14) ).
fof(c_0_12,plain,
! [X47] : '+'(X47,'1') = '1',
inference(variable_rename,[status(thm)],[sos_12]) ).
fof(c_0_13,plain,
! [X25,X26] : '+'(X25,X26) = '+'(X26,X25),
inference(variable_rename,[status(thm)],[sos_02]) ).
fof(c_0_14,plain,
! [X34,X35,X36] :
( ( ~ '>='('+'(X34,X35),X36)
| '>='(X35,'==>'(X34,X36)) )
& ( ~ '>='(X35,'==>'(X34,X36))
| '>='('+'(X34,X35),X36) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])]) ).
cnf(c_0_15,plain,
'+'(X1,'1') = '1',
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X32,X33] :
( ~ '>='(X32,X33)
| ~ '>='(X33,X32)
| X32 = X33 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])]) ).
fof(c_0_18,plain,
! [X37] : '>='(X37,'0'),
inference(variable_rename,[status(thm)],[sos_08]) ).
cnf(c_0_19,plain,
( '>='(X2,'==>'(X1,X3))
| ~ '>='('+'(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
'+'('1',X1) = '1',
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X28] : '>='(X28,X28),
inference(variable_rename,[status(thm)],[sos_04]) ).
fof(c_0_22,plain,
! [X27] : '+'(X27,'0') = X27,
inference(variable_rename,[status(thm)],[sos_03]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ '>='(X1,X2)
| ~ '>='(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( '>='(X1,'==>'('1',X2))
| ~ '>='('1',X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
'>='(X1,'==>'('1','1')),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_30,plain,
! [X38,X39,X40] :
( ~ '>='(X38,X39)
| '>='('+'(X38,X40),'+'(X39,X40)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])]) ).
cnf(c_0_31,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_32,plain,
'0' = '==>'('1','1'),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( '>='('+'(X1,X3),'+'(X2,X3))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
'+'('==>'('1','1'),X1) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_36,plain,
'>='('+'(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_34]) ).
cnf(c_0_37,plain,
'>='(X1,'==>'(X2,X2)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_38,plain,
! [X48] : '==>'('==>'('==>'(X48,'1'),X48),X48) = '0',
inference(variable_rename,[status(thm)],[sos_13]) ).
cnf(c_0_39,plain,
( '==>'(X1,X1) = X2
| ~ '>='('==>'(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
fof(c_0_40,plain,
! [X44,X45,X46] :
( ~ '>='(X44,X45)
| '>='('==>'(X46,X44),'==>'(X46,X45)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])]) ).
cnf(c_0_41,plain,
( '>='('+'(X2,X1),X3)
| ~ '>='(X1,'==>'(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,plain,
'==>'('==>'('==>'(X1,'1'),X1),X1) = '0',
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
'+'(X1,'==>'('1','1')) = X1,
inference(rw,[status(thm)],[c_0_27,c_0_32]) ).
cnf(c_0_44,plain,
'==>'(X1,X1) = '==>'(X2,X2),
inference(spm,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_45,plain,
( '>='('==>'(X3,X1),'==>'(X3,X2))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
'>='('1',X1),
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_47,plain,
'>='('+'(X1,'==>'(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_41,c_0_26]) ).
cnf(c_0_48,plain,
'==>'('==>'('==>'(X1,'1'),X1),X1) = '==>'('1','1'),
inference(rw,[status(thm)],[c_0_42,c_0_32]) ).
cnf(c_0_49,plain,
'+'(X1,'==>'(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
'>='('==>'(X1,'1'),'==>'(X1,X2)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
'>='('==>'('==>'(X1,'1'),X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
'>='(X1,'==>'(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_53,plain,
( X1 = '1'
| ~ '>='(X1,'1') ),
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_54,plain,
'>='('+'(X1,'==>'(X1,'1')),X2),
inference(spm,[status(thm)],[c_0_41,c_0_50]) ).
cnf(c_0_55,plain,
'==>'('==>'(X1,'1'),X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_51]),c_0_52])]) ).
cnf(c_0_56,plain,
'+'(X1,'==>'(X1,'1')) = '1',
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
fof(c_0_57,plain,
! [X41,X42,X43] :
( ~ '>='(X41,X42)
| '>='('==>'(X42,X43),'==>'(X41,X43)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])]) ).
cnf(c_0_58,plain,
'>='('==>'('==>'(X1,'1'),'1'),X1),
inference(spm,[status(thm)],[c_0_50,c_0_55]) ).
cnf(c_0_59,plain,
'>='(X1,'==>'('==>'(X1,'1'),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_56]),c_0_46])]) ).
cnf(c_0_60,plain,
( '>='('==>'(X2,X3),'==>'(X1,X3))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_61,plain,
'==>'('==>'(X1,'1'),'1') = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_58]),c_0_59])]) ).
cnf(c_0_62,plain,
'>='('==>'('==>'(X1,X2),X3),'==>'('==>'(X1,'1'),X3)),
inference(spm,[status(thm)],[c_0_60,c_0_50]) ).
cnf(c_0_63,plain,
'==>'(X1,'==>'(X1,'1')) = '==>'(X1,'1'),
inference(spm,[status(thm)],[c_0_55,c_0_61]) ).
cnf(c_0_64,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_65,plain,
'>='('==>'('==>'(X1,X2),X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_61]),c_0_61]) ).
cnf(c_0_66,plain,
'>='('==>'(X1,X2),'==>'(X1,'==>'(X3,'+'(X3,X2)))),
inference(spm,[status(thm)],[c_0_45,c_0_64]) ).
cnf(c_0_67,plain,
'==>'('==>'(X1,X2),X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_65]),c_0_52])]) ).
cnf(c_0_68,plain,
'==>'(X1,'==>'(X2,'+'(X2,X1))) = '==>'(X1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_66]) ).
cnf(c_0_69,plain,
'==>'(X1,'==>'(X1,X2)) = '==>'(X1,X2),
inference(spm,[status(thm)],[c_0_67,c_0_67]) ).
fof(c_0_70,negated_conjecture,
~ ! [X21] : '+'(X21,X21) = X21,
inference(assume_negation,[status(cth)],[goals_14]) ).
cnf(c_0_71,plain,
'==>'(X1,'+'(X1,X1)) = '==>'(X1,X1),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
fof(c_0_72,negated_conjecture,
'+'(esk1_0,esk1_0) != esk1_0,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])])]) ).
cnf(c_0_73,plain,
'>='(X1,'+'(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_71]),c_0_49]) ).
cnf(c_0_74,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_75,negated_conjecture,
'+'(esk1_0,esk1_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_76,plain,
'+'(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_73]),c_0_74])]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL903+1 : TPTP v8.1.2. Released v5.5.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 12:39:46 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.r8LiFlRDLb/E---3.1_9000.p
% 0.96/0.58 # Version: 3.1pre001
% 0.96/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.96/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.96/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.96/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.96/0.58 # Starting sh5l with 300s (1) cores
% 0.96/0.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9089 completed with status 0
% 0.96/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.96/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.96/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.96/0.58 # No SInE strategy applied
% 0.96/0.58 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.96/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.96/0.58 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 0.96/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.96/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.96/0.58 # Starting new_bool_3 with 136s (1) cores
% 0.96/0.58 # Starting new_bool_1 with 136s (1) cores
% 0.96/0.58 # H----_042_B03_F1_AE_Q4_SP_S2S with pid 9099 completed with status 0
% 0.96/0.58 # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 0.96/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.96/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.96/0.58 # No SInE strategy applied
% 0.96/0.58 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.96/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.96/0.58 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 0.96/0.58 # Preprocessing time : 0.001 s
% 0.96/0.58
% 0.96/0.58 # Proof found!
% 0.96/0.58 # SZS status Theorem
% 0.96/0.58 # SZS output start CNFRefutation
% See solution above
% 0.96/0.58 # Parsed axioms : 14
% 0.96/0.58 # Removed by relevancy pruning/SinE : 0
% 0.96/0.58 # Initial clauses : 15
% 0.96/0.58 # Removed in clause preprocessing : 0
% 0.96/0.58 # Initial clauses in saturation : 15
% 0.96/0.58 # Processed clauses : 1454
% 0.96/0.58 # ...of these trivial : 191
% 0.96/0.58 # ...subsumed : 1014
% 0.96/0.58 # ...remaining for further processing : 249
% 0.96/0.58 # Other redundant clauses eliminated : 0
% 0.96/0.58 # Clauses deleted for lack of memory : 0
% 0.96/0.58 # Backward-subsumed : 10
% 0.96/0.58 # Backward-rewritten : 62
% 0.96/0.58 # Generated clauses : 12238
% 0.96/0.58 # ...of the previous two non-redundant : 5567
% 0.96/0.58 # ...aggressively subsumed : 0
% 0.96/0.58 # Contextual simplify-reflections : 0
% 0.96/0.58 # Paramodulations : 12238
% 0.96/0.58 # Factorizations : 0
% 0.96/0.58 # NegExts : 0
% 0.96/0.58 # Equation resolutions : 0
% 0.96/0.58 # Total rewrite steps : 11874
% 0.96/0.58 # Propositional unsat checks : 0
% 0.96/0.58 # Propositional check models : 0
% 0.96/0.58 # Propositional check unsatisfiable : 0
% 0.96/0.58 # Propositional clauses : 0
% 0.96/0.58 # Propositional clauses after purity: 0
% 0.96/0.58 # Propositional unsat core size : 0
% 0.96/0.58 # Propositional preprocessing time : 0.000
% 0.96/0.58 # Propositional encoding time : 0.000
% 0.96/0.58 # Propositional solver time : 0.000
% 0.96/0.58 # Success case prop preproc time : 0.000
% 0.96/0.58 # Success case prop encoding time : 0.000
% 0.96/0.58 # Success case prop solver time : 0.000
% 0.96/0.58 # Current number of processed clauses : 177
% 0.96/0.58 # Positive orientable unit clauses : 111
% 0.96/0.58 # Positive unorientable unit clauses: 6
% 0.96/0.58 # Negative unit clauses : 0
% 0.96/0.58 # Non-unit-clauses : 60
% 0.96/0.58 # Current number of unprocessed clauses: 3872
% 0.96/0.58 # ...number of literals in the above : 4398
% 0.96/0.58 # Current number of archived formulas : 0
% 0.96/0.58 # Current number of archived clauses : 72
% 0.96/0.58 # Clause-clause subsumption calls (NU) : 2325
% 0.96/0.58 # Rec. Clause-clause subsumption calls : 2325
% 0.96/0.58 # Non-unit clause-clause subsumptions : 540
% 0.96/0.58 # Unit Clause-clause subsumption calls : 187
% 0.96/0.58 # Rewrite failures with RHS unbound : 292
% 0.96/0.58 # BW rewrite match attempts : 656
% 0.96/0.58 # BW rewrite match successes : 105
% 0.96/0.58 # Condensation attempts : 0
% 0.96/0.58 # Condensation successes : 0
% 0.96/0.58 # Termbank termtop insertions : 92607
% 0.96/0.58
% 0.96/0.58 # -------------------------------------------------
% 0.96/0.58 # User time : 0.096 s
% 0.96/0.58 # System time : 0.007 s
% 0.96/0.58 # Total time : 0.103 s
% 0.96/0.58 # Maximum resident set size: 1716 pages
% 0.96/0.58
% 0.96/0.58 # -------------------------------------------------
% 0.96/0.58 # User time : 0.487 s
% 0.96/0.58 # System time : 0.015 s
% 0.96/0.58 # Total time : 0.502 s
% 0.96/0.58 # Maximum resident set size: 1704 pages
% 0.96/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------