TSTP Solution File: SEU387+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU387+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:16 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 18 unt; 0 def)
% Number of atoms : 183 ( 7 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 214 ( 68 ~; 47 |; 88 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 27 ( 25 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 39 ( 8 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_waybel_7,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p',t8_waybel_7) ).
fof(t2_yellow19,conjecture,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p',t2_yellow19) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p',t7_boole) ).
fof(fc1_waybel_7,axiom,
! [X1] :
( ~ empty_carrier(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& up_complete_relstr(boole_POSet(X1))
& join_complete_relstr(boole_POSet(X1))
& ~ v1_yellow_3(boole_POSet(X1))
& distributive_relstr(boole_POSet(X1))
& heyting_relstr(boole_POSet(X1))
& complemented_relstr(boole_POSet(X1))
& boolean_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& complete_relstr(boole_POSet(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p',fc1_waybel_7) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p',t6_boole) ).
fof(t18_yellow_1,axiom,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p',t18_yellow_1) ).
fof(dt_k3_yellow_1,axiom,
! [X1] :
( strict_rel_str(boole_POSet(X1))
& rel_str(boole_POSet(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p',dt_k3_yellow_1) ).
fof(c_0_7,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[t8_waybel_7]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t2_yellow19])]) ).
fof(c_0_9,plain,
! [X119,X120] :
( ( ~ proper_element(X120,powerset(the_carrier(X119)))
| ~ in(bottom_of_relstr(X119),X120)
| empty(X120)
| ~ filtered_subset(X120,X119)
| ~ upper_relstr_subset(X120,X119)
| ~ element(X120,powerset(the_carrier(X119)))
| empty_carrier(X119)
| ~ reflexive_relstr(X119)
| ~ transitive_relstr(X119)
| ~ antisymmetric_relstr(X119)
| ~ lower_bounded_relstr(X119)
| ~ rel_str(X119) )
& ( in(bottom_of_relstr(X119),X120)
| proper_element(X120,powerset(the_carrier(X119)))
| empty(X120)
| ~ filtered_subset(X120,X119)
| ~ upper_relstr_subset(X120,X119)
| ~ element(X120,powerset(the_carrier(X119)))
| empty_carrier(X119)
| ~ reflexive_relstr(X119)
| ~ transitive_relstr(X119)
| ~ antisymmetric_relstr(X119)
| ~ lower_bounded_relstr(X119)
| ~ rel_str(X119) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X115,X116] :
( ~ in(X115,X116)
| ~ empty(X116) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_11,plain,
! [X1] :
( ~ empty_carrier(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& up_complete_relstr(boole_POSet(X1))
& join_complete_relstr(boole_POSet(X1))
& ~ v1_yellow_3(boole_POSet(X1))
& distributive_relstr(boole_POSet(X1))
& heyting_relstr(boole_POSet(X1))
& complemented_relstr(boole_POSet(X1))
& boolean_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& complete_relstr(boole_POSet(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_waybel_7]) ).
fof(c_0_12,plain,
! [X114] :
( ~ empty(X114)
| X114 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_13,negated_conjecture,
( ~ empty(esk28_0)
& ~ empty(esk29_0)
& filtered_subset(esk29_0,boole_POSet(esk28_0))
& upper_relstr_subset(esk29_0,boole_POSet(esk28_0))
& proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))
& element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))
& in(esk30_0,esk29_0)
& empty(esk30_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( empty(X1)
| empty_carrier(X2)
| ~ proper_element(X1,powerset(the_carrier(X2)))
| ~ in(bottom_of_relstr(X2),X1)
| ~ filtered_subset(X1,X2)
| ~ upper_relstr_subset(X1,X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ reflexive_relstr(X2)
| ~ transitive_relstr(X2)
| ~ antisymmetric_relstr(X2)
| ~ lower_bounded_relstr(X2)
| ~ rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X52] :
( ~ empty_carrier(boole_POSet(X52))
& strict_rel_str(boole_POSet(X52))
& reflexive_relstr(boole_POSet(X52))
& transitive_relstr(boole_POSet(X52))
& antisymmetric_relstr(boole_POSet(X52))
& lower_bounded_relstr(boole_POSet(X52))
& upper_bounded_relstr(boole_POSet(X52))
& bounded_relstr(boole_POSet(X52))
& up_complete_relstr(boole_POSet(X52))
& join_complete_relstr(boole_POSet(X52))
& ~ v1_yellow_3(boole_POSet(X52))
& distributive_relstr(boole_POSet(X52))
& heyting_relstr(boole_POSet(X52))
& complemented_relstr(boole_POSet(X52))
& boolean_relstr(boole_POSet(X52))
& with_suprema_relstr(boole_POSet(X52))
& with_infima_relstr(boole_POSet(X52))
& complete_relstr(boole_POSet(X52)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X98] : bottom_of_relstr(boole_POSet(X98)) = empty_set,
inference(variable_rename,[status(thm)],[t18_yellow_1]) ).
fof(c_0_18,plain,
! [X32] :
( strict_rel_str(boole_POSet(X32))
& rel_str(boole_POSet(X32)) ),
inference(variable_rename,[status(thm)],[dt_k3_yellow_1]) ).
cnf(c_0_19,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
empty(esk30_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( empty_carrier(X1)
| ~ proper_element(X2,powerset(the_carrier(X1)))
| ~ upper_relstr_subset(X2,X1)
| ~ filtered_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ antisymmetric_relstr(X1)
| ~ transitive_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ rel_str(X1) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
upper_relstr_subset(esk29_0,boole_POSet(esk28_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
filtered_subset(esk29_0,boole_POSet(esk28_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
antisymmetric_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
transitive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
lower_bounded_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
reflexive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,plain,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,plain,
rel_str(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
~ empty_carrier(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,negated_conjecture,
in(esk30_0,esk29_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
esk30_0 = empty_set,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_35,negated_conjecture,
~ in(empty_set,esk29_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : SEU387+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n024.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 08:33:27 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.5bn78REDXH/E---3.1_2072.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2152 completed with status 0
% 0.16/0.45 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSM-FSMM21-MFFFFFNN
% 0.16/0.45 # partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.16/0.45 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.16/0.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.16/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.16/0.45 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 2163 completed with status 0
% 0.16/0.45 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSM-FSMM21-MFFFFFNN
% 0.16/0.45 # partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.16/0.45 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.16/0.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.16/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.16/0.45 # Preprocessing time : 0.002 s
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 85
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 292
% 0.16/0.45 # Removed in clause preprocessing : 32
% 0.16/0.45 # Initial clauses in saturation : 260
% 0.16/0.45 # Processed clauses : 277
% 0.16/0.45 # ...of these trivial : 45
% 0.16/0.45 # ...subsumed : 19
% 0.16/0.45 # ...remaining for further processing : 212
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 2
% 0.16/0.45 # Generated clauses : 262
% 0.16/0.45 # ...of the previous two non-redundant : 191
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 4
% 0.16/0.45 # Paramodulations : 262
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 475
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 210
% 0.16/0.45 # Positive orientable unit clauses : 114
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 21
% 0.16/0.45 # Non-unit-clauses : 75
% 0.16/0.45 # Current number of unprocessed clauses: 170
% 0.16/0.45 # ...number of literals in the above : 282
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 2
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 2403
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 263
% 0.16/0.45 # Non-unit clause-clause subsumptions : 6
% 0.16/0.45 # Unit Clause-clause subsumption calls : 163
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 1
% 0.16/0.45 # BW rewrite match successes : 1
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 14432
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.015 s
% 0.16/0.45 # System time : 0.006 s
% 0.16/0.45 # Total time : 0.021 s
% 0.16/0.45 # Maximum resident set size: 2428 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.069 s
% 0.16/0.45 # System time : 0.012 s
% 0.16/0.45 # Total time : 0.081 s
% 0.16/0.45 # Maximum resident set size: 1764 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------