TSTP Solution File: LCL953_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n010.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 : Tue May 21 00:04:13 EDT 2024
% Result : Theorem 0.13s 0.41s
% Output : CNFRefutation 0.13s
% 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_36,type,
esk8_5: ( '$ki_world' * $i * '$ki_world' * $i * '$ki_world' ) > '$ki_world' ).
tff(decl_37,type,
esk9_0: '$ki_world' ).
tff(decl_38,type,
esk10_0: $i ).
tff(decl_39,type,
esk11_0: '$ki_world' ).
tff(decl_40,type,
esk12_0: $i ).
tff(decl_41,type,
esk13_0: '$ki_world' ).
tff(decl_42,type,
esk14_1: '$ki_world' > '$ki_world' ).
tff(decl_43,type,
esk15_0: '$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/sandbox2/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/sandbox2/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,
! [X32: '$ki_world',X33,X34: '$ki_world',X35,X36: '$ki_world',X38: '$ki_world',X39: '$ki_world'] :
( ( '$ki_accessible'(X36,esk8_5(X32,X33,X34,X35,X36))
| ~ '$ki_accessible'(X36,X39)
| disjoint(X39,singleton(X33),X35)
| ~ '$ki_accessible'(X34,X36)
| ~ '$ki_exists_in_world_$i'(X34,X35)
| ~ '$ki_accessible'(X32,X34)
| ~ '$ki_exists_in_world_$i'(X32,X33)
| ~ '$ki_accessible'('$ki_local_world',X32) )
& ( ~ '$ki_accessible'(esk8_5(X32,X33,X34,X35,X36),X38)
| in(X38,X33,X35)
| ~ '$ki_accessible'(X36,X39)
| disjoint(X39,singleton(X33),X35)
| ~ '$ki_accessible'(X34,X36)
| ~ '$ki_exists_in_world_$i'(X34,X35)
| ~ '$ki_accessible'(X32,X34)
| ~ '$ki_exists_in_world_$i'(X32,X33)
| ~ '$ki_accessible'('$ki_local_world',X32) ) ),
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,
! [X45: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk9_0)
& '$ki_exists_in_world_$i'(esk9_0,esk10_0)
& '$ki_accessible'(esk9_0,esk11_0)
& '$ki_exists_in_world_$i'(esk11_0,esk12_0)
& '$ki_accessible'(esk11_0,esk13_0)
& ( '$ki_accessible'(X45,esk14_1(X45))
| ~ '$ki_accessible'(esk13_0,X45) )
& ( ~ in(esk14_1(X45),esk10_0,esk12_0)
| ~ '$ki_accessible'(esk13_0,X45) )
& '$ki_accessible'(esk13_0,esk15_0)
& ~ disjoint(esk15_0,singleton(esk10_0),esk12_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,esk8_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'(esk11_0,esk13_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'(esk13_0,esk8_5(X4,X2,esk11_0,X3,esk13_0))
| ~ '$ki_exists_in_world_$i'(esk11_0,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ '$ki_accessible'('$ki_local_world',X4)
| ~ '$ki_accessible'(X4,esk11_0)
| ~ '$ki_accessible'(esk13_0,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
tcf(c_0_8,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_9,negated_conjecture,
'$ki_accessible'(esk9_0,esk11_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'(esk13_0,esk8_5(esk9_0,X2,esk11_0,X3,esk13_0))
| ~ '$ki_exists_in_world_$i'(esk11_0,X3)
| ~ '$ki_exists_in_world_$i'(esk9_0,X2)
| ~ '$ki_accessible'(esk13_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'(esk13_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_12,negated_conjecture,
! [X3,X2] :
( disjoint(esk15_0,singleton(X2),X3)
| '$ki_accessible'(esk13_0,esk8_5(esk9_0,X2,esk11_0,X3,esk13_0))
| ~ '$ki_exists_in_world_$i'(esk11_0,X3)
| ~ '$ki_exists_in_world_$i'(esk9_0,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_13,negated_conjecture,
'$ki_exists_in_world_$i'(esk11_0,esk12_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'(esk8_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(esk15_0,singleton(X2),esk12_0)
| '$ki_accessible'(esk13_0,esk8_5(esk9_0,X2,esk11_0,esk12_0,esk13_0))
| ~ '$ki_exists_in_world_$i'(esk9_0,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_16,negated_conjecture,
'$ki_exists_in_world_$i'(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_17,negated_conjecture,
~ disjoint(esk15_0,singleton(esk10_0),esk12_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(esk15_0,singleton(X2),X3)
| in(X1,X2,X3)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(esk8_5(X6,X2,X4,X3,esk13_0),X1)
| ~ '$ki_accessible'('$ki_local_world',X6)
| ~ '$ki_accessible'(X4,esk13_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,esk14_1(X1))
| ~ '$ki_accessible'(esk13_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_20,negated_conjecture,
'$ki_accessible'(esk13_0,esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_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(esk15_0,singleton(X2),X3)
| in(X1,X2,X3)
| ~ '$ki_exists_in_world_$i'(esk11_0,X3)
| ~ '$ki_exists_in_world_$i'(esk9_0,X2)
| ~ '$ki_accessible'(esk8_5(esk9_0,X2,esk11_0,X3,esk13_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'(esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_0),esk14_1(esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_0))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( ~ in(esk14_1(X1),esk10_0,esk12_0)
| ~ '$ki_accessible'(esk13_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_24,negated_conjecture,
in(esk14_1(esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_0)),esk10_0,esk12_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.02/0.08 % Problem : LCL953_8 : TPTP v8.2.0. Released v8.2.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n010.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.13/0.38 Running first-order model finding
% 0.13/0.38 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41 # Version: 3.1.0
% 0.13/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 # Starting sh5l with 300s (1) cores
% 0.13/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15191 completed with status 0
% 0.13/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41 # No SInE strategy applied
% 0.13/0.41 # Search class: FGHNS-FFMM33-SFFFFFNN
% 0.13/0.41 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.13/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.13/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.13/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.13/0.41 # Starting sh5l with 136s (1) cores
% 0.13/0.41 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 15195 completed with status 0
% 0.13/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.13/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41 # No SInE strategy applied
% 0.13/0.41 # Search class: FGHNS-FFMM33-SFFFFFNN
% 0.13/0.41 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.13/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.13/0.41 # Preprocessing time : 0.001 s
% 0.13/0.41 # Presaturation interreduction done
% 0.13/0.41
% 0.13/0.41 # Proof found!
% 0.13/0.41 # SZS status Theorem
% 0.13/0.41 # SZS output start CNFRefutation
% See solution above
% 0.13/0.41 # Parsed axioms : 16
% 0.13/0.41 # Removed by relevancy pruning/SinE : 0
% 0.13/0.41 # Initial clauses : 32
% 0.13/0.41 # Removed in clause preprocessing : 8
% 0.13/0.41 # Initial clauses in saturation : 24
% 0.13/0.41 # Processed clauses : 337
% 0.13/0.41 # ...of these trivial : 0
% 0.13/0.41 # ...subsumed : 0
% 0.13/0.41 # ...remaining for further processing : 337
% 0.13/0.41 # Other redundant clauses eliminated : 0
% 0.13/0.41 # Clauses deleted for lack of memory : 0
% 0.13/0.41 # Backward-subsumed : 0
% 0.13/0.41 # Backward-rewritten : 1
% 0.13/0.41 # Generated clauses : 539
% 0.13/0.41 # ...of the previous two non-redundant : 538
% 0.13/0.41 # ...aggressively subsumed : 0
% 0.13/0.41 # Contextual simplify-reflections : 0
% 0.13/0.41 # Paramodulations : 539
% 0.13/0.41 # Factorizations : 0
% 0.13/0.41 # NegExts : 0
% 0.13/0.41 # Equation resolutions : 0
% 0.13/0.41 # Disequality decompositions : 0
% 0.13/0.41 # Total rewrite steps : 85
% 0.13/0.41 # ...of those cached : 70
% 0.13/0.41 # Propositional unsat checks : 0
% 0.13/0.41 # Propositional check models : 0
% 0.13/0.41 # Propositional check unsatisfiable : 0
% 0.13/0.41 # Propositional clauses : 0
% 0.13/0.41 # Propositional clauses after purity: 0
% 0.13/0.41 # Propositional unsat core size : 0
% 0.13/0.41 # Propositional preprocessing time : 0.000
% 0.13/0.41 # Propositional encoding time : 0.000
% 0.13/0.41 # Propositional solver time : 0.000
% 0.13/0.41 # Success case prop preproc time : 0.000
% 0.13/0.41 # Success case prop encoding time : 0.000
% 0.13/0.41 # Success case prop solver time : 0.000
% 0.13/0.41 # Current number of processed clauses : 312
% 0.13/0.41 # Positive orientable unit clauses : 23
% 0.13/0.41 # Positive unorientable unit clauses: 0
% 0.13/0.41 # Negative unit clauses : 4
% 0.13/0.41 # Non-unit-clauses : 285
% 0.13/0.41 # Current number of unprocessed clauses: 249
% 0.13/0.41 # ...number of literals in the above : 1439
% 0.13/0.41 # Current number of archived formulas : 0
% 0.13/0.41 # Current number of archived clauses : 25
% 0.13/0.41 # Clause-clause subsumption calls (NU) : 4297
% 0.13/0.41 # Rec. Clause-clause subsumption calls : 2044
% 0.13/0.41 # Non-unit clause-clause subsumptions : 0
% 0.13/0.41 # Unit Clause-clause subsumption calls : 54
% 0.13/0.41 # Rewrite failures with RHS unbound : 0
% 0.13/0.41 # BW rewrite match attempts : 9
% 0.13/0.41 # BW rewrite match successes : 1
% 0.13/0.41 # Condensation attempts : 0
% 0.13/0.41 # Condensation successes : 0
% 0.13/0.41 # Termbank termtop insertions : 19267
% 0.13/0.41 # Search garbage collected termcells : 701
% 0.13/0.41
% 0.13/0.41 # -------------------------------------------------
% 0.13/0.41 # User time : 0.027 s
% 0.13/0.41 # System time : 0.002 s
% 0.13/0.41 # Total time : 0.029 s
% 0.13/0.41 # Maximum resident set size: 1816 pages
% 0.13/0.41
% 0.13/0.41 # -------------------------------------------------
% 0.13/0.41 # User time : 0.125 s
% 0.13/0.41 # System time : 0.007 s
% 0.13/0.41 # Total time : 0.132 s
% 0.13/0.41 # Maximum resident set size: 1716 pages
% 0.13/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------