TSTP Solution File: SEU039+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU039+1 : TPTP v8.1.2. Released v3.2.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 19:24:37 EDT 2023
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 185 ( 43 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 246 ( 97 ~; 101 |; 31 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 2 sgn; 54 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',d5_funct_1) ).
fof(t73_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( ( in(X2,relation_dom(X3))
& in(X2,X1) )
=> in(apply(X3,X2),relation_rng(relation_dom_restriction(X3,X1))) ) ),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',t73_funct_1) ).
fof(t72_funct_1,axiom,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,X1)
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',t72_funct_1) ).
fof(fc4_funct_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1) )
=> ( relation(relation_dom_restriction(X1,X2))
& function(relation_dom_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',fc4_funct_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',dt_k7_relat_1) ).
fof(t68_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( X2 = relation_dom_restriction(X3,X1)
<=> ( relation_dom(X2) = set_intersection2(relation_dom(X3),X1)
& ! [X4] :
( in(X4,relation_dom(X2))
=> apply(X2,X4) = apply(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',t68_funct_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',commutativity_k3_xboole_0) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.B4vfEBmtE2/E---3.1_3103.p',d3_xboole_0) ).
fof(c_0_8,plain,
! [X21,X22,X23,X25,X26,X27,X29] :
( ( in(esk2_3(X21,X22,X23),relation_dom(X21))
| ~ in(X23,X22)
| X22 != relation_rng(X21)
| ~ relation(X21)
| ~ function(X21) )
& ( X23 = apply(X21,esk2_3(X21,X22,X23))
| ~ in(X23,X22)
| X22 != relation_rng(X21)
| ~ relation(X21)
| ~ function(X21) )
& ( ~ in(X26,relation_dom(X21))
| X25 != apply(X21,X26)
| in(X25,X22)
| X22 != relation_rng(X21)
| ~ relation(X21)
| ~ function(X21) )
& ( ~ in(esk3_2(X21,X27),X27)
| ~ in(X29,relation_dom(X21))
| esk3_2(X21,X27) != apply(X21,X29)
| X27 = relation_rng(X21)
| ~ relation(X21)
| ~ function(X21) )
& ( in(esk4_2(X21,X27),relation_dom(X21))
| in(esk3_2(X21,X27),X27)
| X27 = relation_rng(X21)
| ~ relation(X21)
| ~ function(X21) )
& ( esk3_2(X21,X27) = apply(X21,esk4_2(X21,X27))
| in(esk3_2(X21,X27),X27)
| X27 = relation_rng(X21)
| ~ relation(X21)
| ~ function(X21) ) ),
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)],[d5_funct_1])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( ( in(X2,relation_dom(X3))
& in(X2,X1) )
=> in(apply(X3,X2),relation_rng(relation_dom_restriction(X3,X1))) ) ),
inference(assume_negation,[status(cth)],[t73_funct_1]) ).
cnf(c_0_10,plain,
( in(X3,X4)
| ~ in(X1,relation_dom(X2))
| X3 != apply(X2,X1)
| X4 != relation_rng(X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X79,X80,X81] :
( ~ relation(X81)
| ~ function(X81)
| ~ in(X80,X79)
| apply(relation_dom_restriction(X81,X79),X80) = apply(X81,X80) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t72_funct_1])]) ).
fof(c_0_12,plain,
! [X40,X41] :
( ( relation(relation_dom_restriction(X40,X41))
| ~ relation(X40)
| ~ function(X40) )
& ( function(relation_dom_restriction(X40,X41))
| ~ relation(X40)
| ~ function(X40) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])]) ).
fof(c_0_13,plain,
! [X31,X32] :
( ~ relation(X31)
| relation(relation_dom_restriction(X31,X32)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])]) ).
fof(c_0_14,negated_conjecture,
( relation(esk19_0)
& function(esk19_0)
& in(esk18_0,relation_dom(esk19_0))
& in(esk18_0,esk17_0)
& ~ in(apply(esk19_0,esk18_0),relation_rng(relation_dom_restriction(esk19_0,esk17_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_15,plain,
( in(apply(X1,X2),relation_rng(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).
cnf(c_0_16,plain,
( apply(relation_dom_restriction(X1,X3),X2) = apply(X1,X2)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X73,X74,X75,X76] :
( ( relation_dom(X74) = set_intersection2(relation_dom(X75),X73)
| X74 != relation_dom_restriction(X75,X73)
| ~ relation(X75)
| ~ function(X75)
| ~ relation(X74)
| ~ function(X74) )
& ( ~ in(X76,relation_dom(X74))
| apply(X74,X76) = apply(X75,X76)
| X74 != relation_dom_restriction(X75,X73)
| ~ relation(X75)
| ~ function(X75)
| ~ relation(X74)
| ~ function(X74) )
& ( in(esk16_3(X73,X74,X75),relation_dom(X74))
| relation_dom(X74) != set_intersection2(relation_dom(X75),X73)
| X74 = relation_dom_restriction(X75,X73)
| ~ relation(X75)
| ~ function(X75)
| ~ relation(X74)
| ~ function(X74) )
& ( apply(X74,esk16_3(X73,X74,X75)) != apply(X75,esk16_3(X73,X74,X75))
| relation_dom(X74) != set_intersection2(relation_dom(X75),X73)
| X74 = relation_dom_restriction(X75,X73)
| ~ relation(X75)
| ~ function(X75)
| ~ relation(X74)
| ~ function(X74) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t68_funct_1])])])])]) ).
cnf(c_0_20,negated_conjecture,
~ in(apply(esk19_0,esk18_0),relation_rng(relation_dom_restriction(esk19_0,esk17_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( in(apply(X1,X2),relation_rng(relation_dom_restriction(X1,X3)))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(relation_dom_restriction(X1,X3)))
| ~ in(X2,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
relation(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
function(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
in(esk18_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X10,X11] : set_intersection2(X10,X11) = set_intersection2(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_27,plain,
! [X12,X13,X14,X15,X16,X17,X18,X19] :
( ( in(X15,X12)
| ~ in(X15,X14)
| X14 != set_intersection2(X12,X13) )
& ( in(X15,X13)
| ~ in(X15,X14)
| X14 != set_intersection2(X12,X13) )
& ( ~ in(X16,X12)
| ~ in(X16,X13)
| in(X16,X14)
| X14 != set_intersection2(X12,X13) )
& ( ~ in(esk1_3(X17,X18,X19),X19)
| ~ in(esk1_3(X17,X18,X19),X17)
| ~ in(esk1_3(X17,X18,X19),X18)
| X19 = set_intersection2(X17,X18) )
& ( in(esk1_3(X17,X18,X19),X17)
| in(esk1_3(X17,X18,X19),X19)
| X19 = set_intersection2(X17,X18) )
& ( in(esk1_3(X17,X18,X19),X18)
| in(esk1_3(X17,X18,X19),X19)
| X19 = set_intersection2(X17,X18) ) ),
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)],[d3_xboole_0])])])])])]) ).
cnf(c_0_28,negated_conjecture,
~ in(esk18_0,relation_dom(relation_dom_restriction(esk19_0,esk17_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
( relation_dom(relation_dom_restriction(X1,X2)) = set_intersection2(relation_dom(X1),X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_17]),c_0_18]) ).
cnf(c_0_30,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ in(esk18_0,set_intersection2(esk17_0,relation_dom(esk19_0))),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22]),c_0_23])]),c_0_30]) ).
cnf(c_0_33,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
in(esk18_0,relation_dom(esk19_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SEU039+1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.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 09:29:16 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.B4vfEBmtE2/E---3.1_3103.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3181 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.16/0.46 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.46 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3188 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 # Preprocessing time : 0.002 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 44
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 81
% 0.16/0.46 # Removed in clause preprocessing : 2
% 0.16/0.46 # Initial clauses in saturation : 79
% 0.16/0.46 # Processed clauses : 375
% 0.16/0.46 # ...of these trivial : 4
% 0.16/0.46 # ...subsumed : 140
% 0.16/0.46 # ...remaining for further processing : 231
% 0.16/0.46 # Other redundant clauses eliminated : 9
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 10
% 0.16/0.46 # Backward-rewritten : 9
% 0.16/0.46 # Generated clauses : 523
% 0.16/0.46 # ...of the previous two non-redundant : 462
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 13
% 0.16/0.46 # Paramodulations : 510
% 0.16/0.46 # Factorizations : 4
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 10
% 0.16/0.46 # Total rewrite steps : 99
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 130
% 0.16/0.46 # Positive orientable unit clauses : 31
% 0.16/0.46 # Positive unorientable unit clauses: 1
% 0.16/0.46 # Negative unit clauses : 15
% 0.16/0.46 # Non-unit-clauses : 83
% 0.16/0.46 # Current number of unprocessed clauses: 235
% 0.16/0.46 # ...number of literals in the above : 1097
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 93
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 2540
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 1487
% 0.16/0.46 # Non-unit clause-clause subsumptions : 114
% 0.16/0.46 # Unit Clause-clause subsumption calls : 181
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 21
% 0.16/0.46 # BW rewrite match successes : 16
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 10360
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.018 s
% 0.16/0.46 # System time : 0.005 s
% 0.16/0.46 # Total time : 0.023 s
% 0.16/0.46 # Maximum resident set size: 1888 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.085 s
% 0.16/0.46 # System time : 0.015 s
% 0.16/0.46 # Total time : 0.100 s
% 0.16/0.46 # Maximum resident set size: 1732 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------