TSTP Solution File: SEU220+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU220+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:30:59 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 245 ( 69 equ)
% Maximal formula atoms : 130 ( 9 avg)
% Number of connectives : 376 ( 158 ~; 163 |; 39 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t57_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(X2)
& in(X1,relation_rng(X2)) )
=> ( X1 = apply(X2,apply(function_inverse(X2),X1))
& X1 = apply(relation_composition(function_inverse(X2),X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ddKIrYT2Mb/E---3.1_14337.p',t57_funct_1) ).
fof(t23_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ddKIrYT2Mb/E---3.1_14337.p',t23_funct_1) ).
fof(t54_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = function_inverse(X1)
<=> ( relation_dom(X2) = relation_rng(X1)
& ! [X3,X4] :
( ( ( in(X3,relation_rng(X1))
& X4 = apply(X2,X3) )
=> ( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) )
& ( ( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) )
=> ( in(X3,relation_rng(X1))
& X4 = apply(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ddKIrYT2Mb/E---3.1_14337.p',t54_funct_1) ).
fof(dt_k2_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( relation(function_inverse(X1))
& function(function_inverse(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.ddKIrYT2Mb/E---3.1_14337.p',dt_k2_funct_1) ).
fof(t55_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ddKIrYT2Mb/E---3.1_14337.p',t55_funct_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(X2)
& in(X1,relation_rng(X2)) )
=> ( X1 = apply(X2,apply(function_inverse(X2),X1))
& X1 = apply(relation_composition(function_inverse(X2),X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[t57_funct_1]) ).
fof(c_0_6,negated_conjecture,
( relation(esk2_0)
& function(esk2_0)
& one_to_one(esk2_0)
& in(esk1_0,relation_rng(esk2_0))
& ( esk1_0 != apply(esk2_0,apply(function_inverse(esk2_0),esk1_0))
| esk1_0 != apply(relation_composition(function_inverse(esk2_0),esk2_0),esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X7,X8,X9] :
( ~ relation(X8)
| ~ function(X8)
| ~ relation(X9)
| ~ function(X9)
| ~ in(X7,relation_dom(X8))
| apply(relation_composition(X8,X9),X7) = apply(X9,apply(X8,X7)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])]) ).
fof(c_0_8,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( relation_dom(X11) = relation_rng(X10)
| X11 != function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( in(X13,relation_dom(X10))
| ~ in(X12,relation_rng(X10))
| X13 != apply(X11,X12)
| X11 != function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( X12 = apply(X10,X13)
| ~ in(X12,relation_rng(X10))
| X13 != apply(X11,X12)
| X11 != function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( in(X14,relation_rng(X10))
| ~ in(X15,relation_dom(X10))
| X14 != apply(X10,X15)
| X11 != function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( X15 = apply(X11,X14)
| ~ in(X15,relation_dom(X10))
| X14 != apply(X10,X15)
| X11 != function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( in(esk6_2(X10,X11),relation_dom(X10))
| in(esk3_2(X10,X11),relation_rng(X10))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( esk5_2(X10,X11) = apply(X10,esk6_2(X10,X11))
| in(esk3_2(X10,X11),relation_rng(X10))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( ~ in(esk5_2(X10,X11),relation_rng(X10))
| esk6_2(X10,X11) != apply(X11,esk5_2(X10,X11))
| in(esk3_2(X10,X11),relation_rng(X10))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( in(esk6_2(X10,X11),relation_dom(X10))
| esk4_2(X10,X11) = apply(X11,esk3_2(X10,X11))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( esk5_2(X10,X11) = apply(X10,esk6_2(X10,X11))
| esk4_2(X10,X11) = apply(X11,esk3_2(X10,X11))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( ~ in(esk5_2(X10,X11),relation_rng(X10))
| esk6_2(X10,X11) != apply(X11,esk5_2(X10,X11))
| esk4_2(X10,X11) = apply(X11,esk3_2(X10,X11))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( in(esk6_2(X10,X11),relation_dom(X10))
| ~ in(esk4_2(X10,X11),relation_dom(X10))
| esk3_2(X10,X11) != apply(X10,esk4_2(X10,X11))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( esk5_2(X10,X11) = apply(X10,esk6_2(X10,X11))
| ~ in(esk4_2(X10,X11),relation_dom(X10))
| esk3_2(X10,X11) != apply(X10,esk4_2(X10,X11))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) )
& ( ~ in(esk5_2(X10,X11),relation_rng(X10))
| esk6_2(X10,X11) != apply(X11,esk5_2(X10,X11))
| ~ in(esk4_2(X10,X11),relation_dom(X10))
| esk3_2(X10,X11) != apply(X10,esk4_2(X10,X11))
| relation_dom(X11) != relation_rng(X10)
| X11 = function_inverse(X10)
| ~ relation(X11)
| ~ function(X11)
| ~ one_to_one(X10)
| ~ relation(X10)
| ~ function(X10) ) ),
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)],[t54_funct_1])])])])])]) ).
fof(c_0_9,plain,
! [X28] :
( ( relation(function_inverse(X28))
| ~ relation(X28)
| ~ function(X28) )
& ( function(function_inverse(X28))
| ~ relation(X28)
| ~ function(X28) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])]) ).
cnf(c_0_10,negated_conjecture,
( esk1_0 != apply(esk2_0,apply(function_inverse(esk2_0),esk1_0))
| esk1_0 != apply(relation_composition(function_inverse(esk2_0),esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X3,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( X1 = apply(X2,X3)
| ~ in(X1,relation_rng(X2))
| X3 != apply(X4,X1)
| X4 != function_inverse(X2)
| ~ relation(X4)
| ~ function(X4)
| ~ one_to_one(X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( function(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( relation(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( apply(esk2_0,apply(function_inverse(esk2_0),esk1_0)) != esk1_0
| ~ relation(function_inverse(esk2_0))
| ~ function(function_inverse(esk2_0))
| ~ in(esk1_0,relation_dom(function_inverse(esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_18,plain,
( apply(X1,apply(function_inverse(X1),X2)) = X2
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_rng(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]),c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
one_to_one(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
in(esk1_0,relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_21,plain,
! [X29] :
( ( relation_rng(X29) = relation_dom(function_inverse(X29))
| ~ one_to_one(X29)
| ~ relation(X29)
| ~ function(X29) )
& ( relation_dom(X29) = relation_rng(function_inverse(X29))
| ~ one_to_one(X29)
| ~ relation(X29)
| ~ function(X29) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_funct_1])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ relation(function_inverse(esk2_0))
| ~ function(function_inverse(esk2_0))
| ~ in(esk1_0,relation_dom(function_inverse(esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_12]),c_0_13]),c_0_20])]) ).
cnf(c_0_23,plain,
( relation_rng(X1) = relation_dom(function_inverse(X1))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( ~ relation(function_inverse(esk2_0))
| ~ function(function_inverse(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_19]),c_0_12]),c_0_13])]) ).
cnf(c_0_25,negated_conjecture,
~ relation(function_inverse(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_12]),c_0_13])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU220+3 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n007.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:09:24 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ddKIrYT2Mb/E---3.1_14337.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # new_bool_3 with pid 14415 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSS-FFMM21-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.45 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 14420 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSS-FFMM21-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.002 s
% 0.16/0.45 # Presaturation interreduction done
% 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 : 41
% 0.16/0.45 # Removed by relevancy pruning/SinE : 7
% 0.16/0.45 # Initial clauses : 69
% 0.16/0.45 # Removed in clause preprocessing : 2
% 0.16/0.45 # Initial clauses in saturation : 67
% 0.16/0.45 # Processed clauses : 159
% 0.16/0.45 # ...of these trivial : 2
% 0.16/0.45 # ...subsumed : 4
% 0.16/0.45 # ...remaining for further processing : 153
% 0.16/0.45 # Other redundant clauses eliminated : 9
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 3
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 95
% 0.16/0.45 # ...of the previous two non-redundant : 86
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 10
% 0.16/0.45 # Paramodulations : 90
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 9
% 0.16/0.45 # Total rewrite steps : 33
% 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 : 80
% 0.16/0.45 # Positive orientable unit clauses : 25
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 8
% 0.16/0.45 # Non-unit-clauses : 47
% 0.16/0.45 # Current number of unprocessed clauses: 59
% 0.16/0.45 # ...number of literals in the above : 342
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 68
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 3209
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 470
% 0.16/0.45 # Non-unit clause-clause subsumptions : 15
% 0.16/0.45 # Unit Clause-clause subsumption calls : 152
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 0
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 6597
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.013 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.016 s
% 0.16/0.45 # Maximum resident set size: 1868 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.016 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.019 s
% 0.16/0.45 # Maximum resident set size: 1728 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------