TSTP Solution File: SEU325+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU325+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 19:26:00 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 24 unt; 0 def)
% Number of atoms : 146 ( 26 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 149 ( 61 ~; 46 |; 26 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 72 ( 8 sgn; 44 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',t6_boole) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',rc2_subset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',t5_subset) ).
fof(fc6_membered,axiom,
( empty(empty_set)
& v1_membered(empty_set)
& v2_membered(empty_set)
& v3_membered(empty_set)
& v4_membered(empty_set)
& v5_membered(empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',fc6_membered) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',d4_tarski) ).
fof(t5_tops_2,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ~ ( is_a_cover_of_carrier(X1,X2)
& X2 = empty_set ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',t5_tops_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',existence_m1_subset_1) ).
fof(d8_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ( is_a_cover_of_carrier(X1,X2)
<=> cast_as_carrier_subset(X1) = union_of_subsets(the_carrier(X1),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',d8_pre_topc) ).
fof(fc2_pre_topc,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',fc2_pre_topc) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> union_of_subsets(X1,X2) = union(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.99kgvjIKPt/E---3.1_26170.p',redefinition_k5_setfam_1) ).
fof(c_0_11,plain,
! [X80] :
( ~ empty(X80)
| X80 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_12,plain,
! [X58] :
( element(esk8_1(X58),powerset(X58))
& empty(esk8_1(X58)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
cnf(c_0_13,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
empty(esk8_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X75,X76,X77] :
( ~ in(X75,X76)
| ~ element(X76,powerset(X77))
| ~ empty(X77) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
cnf(c_0_16,plain,
element(esk8_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
esk8_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
( ~ epred1_0
<=> ! [X1] : ~ empty(X1) ),
introduced(definition) ).
fof(c_0_19,plain,
( ~ epred2_0
<=> ! [X2] : ~ in(X2,empty_set) ),
introduced(definition) ).
cnf(c_0_20,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( epred1_0
| ~ empty(X1) ),
inference(split_equiv,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_24,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]),c_0_19]) ).
cnf(c_0_25,plain,
epred1_0,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X33,X34,X35,X37,X38,X39,X40,X42] :
( ( in(X35,esk1_3(X33,X34,X35))
| ~ in(X35,X34)
| X34 != union(X33) )
& ( in(esk1_3(X33,X34,X35),X33)
| ~ in(X35,X34)
| X34 != union(X33) )
& ( ~ in(X37,X38)
| ~ in(X38,X33)
| in(X37,X34)
| X34 != union(X33) )
& ( ~ in(esk2_2(X39,X40),X40)
| ~ in(esk2_2(X39,X40),X42)
| ~ in(X42,X39)
| X40 = union(X39) )
& ( in(esk2_2(X39,X40),esk3_2(X39,X40))
| in(esk2_2(X39,X40),X40)
| X40 = union(X39) )
& ( in(esk3_2(X39,X40),X39)
| in(esk2_2(X39,X40),X40)
| X40 = union(X39) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_tarski])])])])])]) ).
cnf(c_0_27,plain,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_28,plain,
( in(esk1_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_29,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ~ ( is_a_cover_of_carrier(X1,X2)
& X2 = empty_set ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t5_tops_2])]) ).
cnf(c_0_30,plain,
~ in(X1,empty_set),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_19]),c_0_27]) ).
cnf(c_0_31,plain,
( in(esk1_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_28]) ).
fof(c_0_32,plain,
! [X68,X69] :
( ~ element(X68,X69)
| empty(X69)
| in(X68,X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_33,negated_conjecture,
( ~ empty_carrier(esk11_0)
& one_sorted_str(esk11_0)
& element(esk12_0,powerset(powerset(the_carrier(esk11_0))))
& is_a_cover_of_carrier(esk11_0,esk12_0)
& esk12_0 = empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_34,plain,
~ in(X1,union(empty_set)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_36,plain,
! [X50] : element(esk5_1(X50),X50),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_37,plain,
! [X44,X45] :
( ( ~ is_a_cover_of_carrier(X44,X45)
| cast_as_carrier_subset(X44) = union_of_subsets(the_carrier(X44),X45)
| ~ element(X45,powerset(powerset(the_carrier(X44))))
| ~ one_sorted_str(X44) )
& ( cast_as_carrier_subset(X44) != union_of_subsets(the_carrier(X44),X45)
| is_a_cover_of_carrier(X44,X45)
| ~ element(X45,powerset(powerset(the_carrier(X44))))
| ~ one_sorted_str(X44) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_pre_topc])])])]) ).
cnf(c_0_38,negated_conjecture,
is_a_cover_of_carrier(esk11_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
esk12_0 = empty_set,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
element(esk12_0,powerset(powerset(the_carrier(esk11_0)))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
( empty(union(empty_set))
| ~ element(X1,union(empty_set)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
element(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_43,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
inference(fof_simplification,[status(thm)],[fc2_pre_topc]) ).
fof(c_0_44,plain,
! [X63,X64] :
( ~ element(X64,powerset(powerset(X63)))
| union_of_subsets(X63,X64) = union(X64) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])]) ).
cnf(c_0_45,plain,
( cast_as_carrier_subset(X1) = union_of_subsets(the_carrier(X1),X2)
| ~ is_a_cover_of_carrier(X1,X2)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,negated_conjecture,
is_a_cover_of_carrier(esk11_0,empty_set),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
one_sorted_str(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_48,negated_conjecture,
element(empty_set,powerset(powerset(the_carrier(esk11_0)))),
inference(rw,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_49,plain,
empty(union(empty_set)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
fof(c_0_50,plain,
! [X54] :
( empty_carrier(X54)
| ~ one_sorted_str(X54)
| ~ empty(cast_as_carrier_subset(X54)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])]) ).
cnf(c_0_51,plain,
( union_of_subsets(X2,X1) = union(X1)
| ~ element(X1,powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,negated_conjecture,
union_of_subsets(the_carrier(esk11_0),empty_set) = cast_as_carrier_subset(esk11_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_53,plain,
union(empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_49]) ).
cnf(c_0_54,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,negated_conjecture,
cast_as_carrier_subset(esk11_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_21])]) ).
cnf(c_0_56,negated_conjecture,
~ empty_carrier(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_57,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_54,c_0_55]),c_0_47]),c_0_23])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU325+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 08:30:44 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/tmp/tmp.99kgvjIKPt/E---3.1_26170.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26265 completed with status 0
% 0.22/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.22/0.53 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.53 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.22/0.53 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.22/0.53 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.22/0.53 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 26274 completed with status 0
% 0.22/0.53 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.22/0.53 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.53 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 49
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 98
% 0.22/0.53 # Removed in clause preprocessing : 6
% 0.22/0.53 # Initial clauses in saturation : 92
% 0.22/0.53 # Processed clauses : 375
% 0.22/0.53 # ...of these trivial : 1
% 0.22/0.53 # ...subsumed : 101
% 0.22/0.53 # ...remaining for further processing : 273
% 0.22/0.53 # Other redundant clauses eliminated : 3
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 1
% 0.22/0.53 # Backward-rewritten : 9
% 0.22/0.53 # Generated clauses : 593
% 0.22/0.53 # ...of the previous two non-redundant : 510
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 587
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 3
% 0.22/0.53 # Total rewrite steps : 118
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 259
% 0.22/0.53 # Positive orientable unit clauses : 24
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 14
% 0.22/0.53 # Non-unit-clauses : 221
% 0.22/0.53 # Current number of unprocessed clauses: 174
% 0.22/0.53 # ...number of literals in the above : 572
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 10
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 14428
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 13183
% 0.22/0.53 # Non-unit clause-clause subsumptions : 67
% 0.22/0.53 # Unit Clause-clause subsumption calls : 126
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 17
% 0.22/0.53 # BW rewrite match successes : 6
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 11307
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.021 s
% 0.22/0.53 # System time : 0.006 s
% 0.22/0.53 # Total time : 0.027 s
% 0.22/0.53 # Maximum resident set size: 1908 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.092 s
% 0.22/0.53 # System time : 0.018 s
% 0.22/0.53 # Total time : 0.111 s
% 0.22/0.53 # Maximum resident set size: 1720 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------