TSTP Solution File: PRO011+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Sat May 4 09:10:13 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 169 ( 10 equ)
% Maximal formula atoms : 49 ( 4 avg)
% Number of connectives : 192 ( 59 ~; 73 |; 50 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 62 ( 3 sgn 27 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& subactivity_occurrence(X113,X110)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& subactivity_occurrence(X114,X110)
& min_precedes(X111,X114,tptp0) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.8INfD0X4T2/E---3.1_3331.p',goals) ).
fof(sos_35,axiom,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108,X109] :
( occurrence_of(X107,tptp3)
& root_occ(X107,X106)
& occurrence_of(X108,tptp4)
& next_subocc(X107,X108,tptp0)
& ( occurrence_of(X109,tptp1)
| occurrence_of(X109,tptp2) )
& next_subocc(X108,X109,tptp0)
& leaf_occ(X109,X106) ) ),
file('/export/starexec/sandbox/tmp/tmp.8INfD0X4T2/E---3.1_3331.p',sos_35) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox/tmp/tmp.8INfD0X4T2/E---3.1_3331.p',sos_02) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox/tmp/tmp.8INfD0X4T2/E---3.1_3331.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox/tmp/tmp.8INfD0X4T2/E---3.1_3331.p',sos_21) ).
fof(sos_47,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox/tmp/tmp.8INfD0X4T2/E---3.1_3331.p',sos_47) ).
fof(c_0_6,negated_conjecture,
~ ! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& subactivity_occurrence(X113,X110)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& subactivity_occurrence(X114,X110)
& min_precedes(X111,X114,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X237] :
( ( occurrence_of(esk16_1(X237),tptp3)
| ~ occurrence_of(X237,tptp0) )
& ( root_occ(esk16_1(X237),X237)
| ~ occurrence_of(X237,tptp0) )
& ( occurrence_of(esk17_1(X237),tptp4)
| ~ occurrence_of(X237,tptp0) )
& ( next_subocc(esk16_1(X237),esk17_1(X237),tptp0)
| ~ occurrence_of(X237,tptp0) )
& ( occurrence_of(esk18_1(X237),tptp1)
| occurrence_of(esk18_1(X237),tptp2)
| ~ occurrence_of(X237,tptp0) )
& ( next_subocc(esk17_1(X237),esk18_1(X237),tptp0)
| ~ occurrence_of(X237,tptp0) )
& ( leaf_occ(esk18_1(X237),X237)
| ~ occurrence_of(X237,tptp0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X242,X243] :
( occurrence_of(esk19_0,tptp0)
& ( occurrence_of(X243,tptp2)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(X243,tptp2)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(X243,tptp2)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(X243,tptp2)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_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_6])])])])])]) ).
fof(c_0_9,plain,
! [X119,X120,X121] :
( ~ occurrence_of(X119,X120)
| ~ occurrence_of(X119,X121)
| X120 = X121 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_10,plain,
! [X231,X232,X234,X235,X236] :
( ( occurrence_of(X232,esk15_2(X231,X232))
| ~ leaf_occ(X231,X232) )
& ( subactivity_occurrence(X231,X232)
| ~ leaf_occ(X231,X232) )
& ( leaf(X231,esk15_2(X231,X232))
| ~ leaf_occ(X231,X232) )
& ( ~ occurrence_of(X235,X236)
| ~ subactivity_occurrence(X234,X235)
| ~ leaf(X234,X236)
| leaf_occ(X234,X235) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[sos_34])])])])])])]) ).
cnf(c_0_11,plain,
( leaf_occ(esk18_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
leaf_occ(esk18_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X171,X172,X174,X175,X176,X177] :
( ( root(X171,X172)
| min_precedes(esk6_2(X171,X172),X171,X172)
| ~ leaf(X171,X172) )
& ( ~ min_precedes(X171,X174,X172)
| ~ leaf(X171,X172) )
& ( ~ root(X175,X176)
| min_precedes(X175,esk7_2(X175,X176),X176)
| leaf(X175,X176) )
& ( ~ min_precedes(X177,X175,X176)
| min_precedes(X175,esk7_2(X175,X176),X176)
| leaf(X175,X176) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[sos_21])])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( min_precedes(X1,esk21_2(X1,X2),tptp0)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
occurrence_of(esk19_0,esk15_2(esk18_1(esk19_0),esk19_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( min_precedes(X1,esk21_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_22,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
esk15_2(esk18_1(esk19_0),esk19_0) = tptp0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk20_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
leaf(esk18_1(esk19_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( min_precedes(X1,esk20_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
fof(c_0_28,plain,
tptp1 != tptp2,
inference(fof_simplification,[status(thm)],[sos_47]) ).
cnf(c_0_29,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
fof(c_0_31,plain,
tptp1 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( X1 = tptp1
| ~ occurrence_of(esk18_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp2),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_34,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 15:47:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.8INfD0X4T2/E---3.1_3331.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3425 completed with status 0
% 0.19/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.19/0.51 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.19/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 3430 completed with status 0
% 0.19/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 49
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 102
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 102
% 0.19/0.51 # Processed clauses : 406
% 0.19/0.51 # ...of these trivial : 4
% 0.19/0.51 # ...subsumed : 23
% 0.19/0.51 # ...remaining for further processing : 379
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 3
% 0.19/0.51 # Backward-rewritten : 32
% 0.19/0.51 # Generated clauses : 556
% 0.19/0.51 # ...of the previous two non-redundant : 465
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 2
% 0.19/0.51 # Paramodulations : 556
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 189
% 0.19/0.51 # ...of those cached : 135
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 242
% 0.19/0.51 # Positive orientable unit clauses : 87
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 23
% 0.19/0.51 # Non-unit-clauses : 132
% 0.19/0.51 # Current number of unprocessed clauses: 239
% 0.19/0.51 # ...number of literals in the above : 561
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 137
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 6109
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 4394
% 0.19/0.51 # Non-unit clause-clause subsumptions : 9
% 0.19/0.51 # Unit Clause-clause subsumption calls : 531
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 14
% 0.19/0.51 # BW rewrite match successes : 14
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 15028
% 0.19/0.51 # Search garbage collected termcells : 1436
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.020 s
% 0.19/0.51 # System time : 0.002 s
% 0.19/0.51 # Total time : 0.022 s
% 0.19/0.51 # Maximum resident set size: 2108 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.084 s
% 0.19/0.51 # System time : 0.011 s
% 0.19/0.51 # Total time : 0.095 s
% 0.19/0.51 # Maximum resident set size: 1812 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------