TSTP Solution File: LCL953_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL953_8 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:54:58 EDT 2024
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 41 ( 11 unt; 15 typ; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 154 ( 58 ~; 60 |; 9 &)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 17 ( 7 >; 10 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-5 aty)
% Number of variables : 65 ( 0 sgn 65 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_22,type,
'$ki_local_world': '$ki_world' ).
tff(decl_23,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_24,type,
in: ( '$ki_world' * $i * $i ) > $o ).
tff(decl_25,type,
disjoint: ( '$ki_world' * $i * $i ) > $o ).
tff(decl_27,type,
singleton: $i > $i ).
tff(decl_28,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(decl_29,type,
esk1_0: '$ki_world' ).
tff(decl_30,type,
esk2_0: $i ).
tff(decl_31,type,
esk3_0: '$ki_world' ).
tff(decl_32,type,
esk4_0: $i ).
tff(decl_33,type,
esk5_0: '$ki_world' ).
tff(decl_34,type,
esk6_1: '$ki_world' > '$ki_world' ).
tff(decl_35,type,
esk7_0: '$ki_world' ).
tff(decl_37,type,
esk9_5: ( '$ki_world' * $i * '$ki_world' * $i * '$ki_world' ) > '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X1,X4)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X4,X5)
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> ~ ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> in(X8,X3,X5) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> disjoint(X7,singleton(X3),X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(l28_zfmisc_1,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X1,X4)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X4,X5)
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> ~ ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> in(X8,X3,X5) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> disjoint(X7,singleton(X3),X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
tff(c_0_2,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X1,X4)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X4,X5)
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> ~ ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> in(X8,X3,X5) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> disjoint(X7,singleton(X3),X5) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,plain,
! [X24: '$ki_world',X25,X26: '$ki_world',X27,X28: '$ki_world',X30: '$ki_world',X31: '$ki_world'] :
( ( '$ki_accessible'(X28,esk9_5(X24,X25,X26,X27,X28))
| ~ '$ki_accessible'(X28,X31)
| disjoint(X31,singleton(X25),X27)
| ~ '$ki_accessible'(X26,X28)
| ~ '$ki_exists_in_world_$i'(X26,X27)
| ~ '$ki_accessible'(X24,X26)
| ~ '$ki_exists_in_world_$i'(X24,X25)
| ~ '$ki_accessible'('$ki_local_world',X24) )
& ( ~ '$ki_accessible'(esk9_5(X24,X25,X26,X27,X28),X30)
| in(X30,X25,X27)
| ~ '$ki_accessible'(X28,X31)
| disjoint(X31,singleton(X25),X27)
| ~ '$ki_accessible'(X26,X28)
| ~ '$ki_exists_in_world_$i'(X26,X27)
| ~ '$ki_accessible'(X24,X26)
| ~ '$ki_exists_in_world_$i'(X24,X25)
| ~ '$ki_accessible'('$ki_local_world',X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l28_zfmisc_1])])])])])]) ).
tff(c_0_4,negated_conjecture,
! [X14: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk1_0)
& '$ki_exists_in_world_$i'(esk1_0,esk2_0)
& '$ki_accessible'(esk1_0,esk3_0)
& '$ki_exists_in_world_$i'(esk3_0,esk4_0)
& '$ki_accessible'(esk3_0,esk5_0)
& ( '$ki_accessible'(X14,esk6_1(X14))
| ~ '$ki_accessible'(esk5_0,X14) )
& ( ~ in(esk6_1(X14),esk2_0,esk4_0)
| ~ '$ki_accessible'(esk5_0,X14) )
& '$ki_accessible'(esk5_0,esk7_0)
& ~ disjoint(esk7_0,singleton(esk2_0),esk4_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
tcf(c_0_5,plain,
! [X1: '$ki_world',X2,X3,X7: '$ki_world',X6: '$ki_world',X4: '$ki_world'] :
( '$ki_accessible'(X1,esk9_5(X4,X2,X6,X3,X1))
| disjoint(X7,singleton(X2),X3)
| ~ '$ki_accessible'(X1,X7)
| ~ '$ki_accessible'(X6,X1)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ '$ki_accessible'('$ki_local_world',X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,negated_conjecture,
'$ki_accessible'(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,negated_conjecture,
! [X2,X4: '$ki_world',X3,X1: '$ki_world'] :
( disjoint(X1,singleton(X2),X3)
| '$ki_accessible'(esk5_0,esk9_5(X4,X2,esk3_0,X3,esk5_0))
| ~ '$ki_exists_in_world_$i'(esk3_0,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ '$ki_accessible'('$ki_local_world',X4)
| ~ '$ki_accessible'(X4,esk3_0)
| ~ '$ki_accessible'(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
tcf(c_0_8,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_9,negated_conjecture,
'$ki_accessible'(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_10,negated_conjecture,
! [X3,X2,X1: '$ki_world'] :
( disjoint(X1,singleton(X2),X3)
| '$ki_accessible'(esk5_0,esk9_5(esk1_0,X2,esk3_0,X3,esk5_0))
| ~ '$ki_exists_in_world_$i'(esk3_0,X3)
| ~ '$ki_exists_in_world_$i'(esk1_0,X2)
| ~ '$ki_accessible'(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
tcf(c_0_11,negated_conjecture,
'$ki_accessible'(esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_12,negated_conjecture,
! [X3,X2] :
( disjoint(esk7_0,singleton(X2),X3)
| '$ki_accessible'(esk5_0,esk9_5(esk1_0,X2,esk3_0,X3,esk5_0))
| ~ '$ki_exists_in_world_$i'(esk3_0,X3)
| ~ '$ki_exists_in_world_$i'(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_13,negated_conjecture,
'$ki_exists_in_world_$i'(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_14,plain,
! [X3,X8: '$ki_world',X7: '$ki_world',X6: '$ki_world',X4: '$ki_world',X2,X1: '$ki_world'] :
( in(X7,X2,X3)
| disjoint(X8,singleton(X2),X3)
| ~ '$ki_accessible'(esk9_5(X1,X2,X4,X3,X6),X7)
| ~ '$ki_accessible'(X6,X8)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(X1,X4)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_15,negated_conjecture,
! [X2] :
( disjoint(esk7_0,singleton(X2),esk4_0)
| '$ki_accessible'(esk5_0,esk9_5(esk1_0,X2,esk3_0,esk4_0,esk5_0))
| ~ '$ki_exists_in_world_$i'(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_16,negated_conjecture,
'$ki_exists_in_world_$i'(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_17,negated_conjecture,
~ disjoint(esk7_0,singleton(esk2_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_18,negated_conjecture,
! [X1: '$ki_world',X3,X2,X6: '$ki_world',X4: '$ki_world'] :
( disjoint(esk7_0,singleton(X2),X3)
| in(X1,X2,X3)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(esk9_5(X6,X2,X4,X3,esk5_0),X1)
| ~ '$ki_accessible'('$ki_local_world',X6)
| ~ '$ki_accessible'(X4,esk5_0)
| ~ '$ki_accessible'(X6,X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
tcf(c_0_19,negated_conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'(X1,esk6_1(X1))
| ~ '$ki_accessible'(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_20,negated_conjecture,
'$ki_accessible'(esk5_0,esk9_5(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
tcf(c_0_21,negated_conjecture,
! [X3,X2,X1: '$ki_world'] :
( disjoint(esk7_0,singleton(X2),X3)
| in(X1,X2,X3)
| ~ '$ki_exists_in_world_$i'(esk3_0,X3)
| ~ '$ki_exists_in_world_$i'(esk1_0,X2)
| ~ '$ki_accessible'(esk9_5(esk1_0,X2,esk3_0,X3,esk5_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_9]),c_0_8]),c_0_6])]) ).
tcf(c_0_22,negated_conjecture,
'$ki_accessible'(esk9_5(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0),esk6_1(esk9_5(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( ~ in(esk6_1(X1),esk2_0,esk4_0)
| ~ '$ki_accessible'(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_24,negated_conjecture,
in(esk6_1(esk9_5(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0)),esk2_0,esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13]),c_0_16])]),c_0_17]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL953_8 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n015.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 02:12:52 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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/benchmark/theBenchmark.p
% 0.14/0.43 # Version: 3.1.0
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # sh5l with pid 14276 completed with status 0
% 0.14/0.43 # Result found by sh5l
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 # Search class: FGHNS-FFMM33-SFFFFFNN
% 0.14/0.43 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.14/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.14/0.43 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 14284 completed with status 0
% 0.14/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 # Search class: FGHNS-FFMM33-SFFFFFNN
% 0.14/0.43 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.14/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.14/0.43 # Preprocessing time : 0.001 s
% 0.14/0.43 # Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Theorem
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 16
% 0.14/0.43 # Removed by relevancy pruning/SinE : 8
% 0.14/0.43 # Initial clauses : 24
% 0.14/0.43 # Removed in clause preprocessing : 0
% 0.14/0.43 # Initial clauses in saturation : 24
% 0.14/0.43 # Processed clauses : 332
% 0.14/0.43 # ...of these trivial : 0
% 0.14/0.43 # ...subsumed : 0
% 0.14/0.43 # ...remaining for further processing : 332
% 0.14/0.43 # Other redundant clauses eliminated : 0
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 0
% 0.14/0.43 # Backward-rewritten : 1
% 0.14/0.43 # Generated clauses : 526
% 0.14/0.43 # ...of the previous two non-redundant : 525
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 0
% 0.14/0.43 # Paramodulations : 526
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 0
% 0.14/0.43 # Disequality decompositions : 0
% 0.14/0.43 # Total rewrite steps : 85
% 0.14/0.43 # ...of those cached : 70
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 307
% 0.14/0.43 # Positive orientable unit clauses : 23
% 0.14/0.43 # Positive unorientable unit clauses: 0
% 0.14/0.43 # Negative unit clauses : 4
% 0.14/0.43 # Non-unit-clauses : 280
% 0.14/0.43 # Current number of unprocessed clauses: 241
% 0.14/0.43 # ...number of literals in the above : 1373
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 25
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 3780
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 1264
% 0.14/0.43 # Non-unit clause-clause subsumptions : 0
% 0.14/0.43 # Unit Clause-clause subsumption calls : 183
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 9
% 0.14/0.43 # BW rewrite match successes : 1
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 18767
% 0.14/0.43 # Search garbage collected termcells : 706
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.027 s
% 0.14/0.43 # System time : 0.003 s
% 0.14/0.43 # Total time : 0.031 s
% 0.14/0.43 # Maximum resident set size: 1868 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.028 s
% 0.14/0.43 # System time : 0.005 s
% 0.14/0.43 # Total time : 0.033 s
% 0.14/0.43 # Maximum resident set size: 1720 pages
% 0.14/0.43 % E---3.1 exiting
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------