TSTP Solution File: SEU418+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU418+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:32:04 EDT 2023
% Result : Theorem 30.25s 10.53s
% Output : CNFRefutation 30.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 28 unt; 0 def)
% Number of atoms : 99 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 90 ( 38 ~; 31 |; 6 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 82 ( 3 sgn; 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_relset_2,conjecture,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t8_relset_2) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t48_xboole_1) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X2)
& r1_tarski(X1,X3) )
=> r1_tarski(X1,k3_xboole_0(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t19_xboole_1) ).
fof(t50_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ! [X4] :
( v1_relat_1(X4)
=> ( ( r1_tarski(X1,X2)
& r1_tarski(X3,X4) )
=> r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X4)) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t50_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t3_relat_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',reflexivity_r1_tarski) ).
fof(t2_boole,axiom,
! [X1] : k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t2_boole) ).
fof(t36_xboole_1,axiom,
! [X1,X2] : r1_tarski(k4_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t36_xboole_1) ).
fof(t49_xboole_1,axiom,
! [X1,X2,X3] : k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t49_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t3_boole) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( k4_xboole_0(X1,X2) = k1_xboole_0
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p',t37_xboole_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
inference(assume_negation,[status(cth)],[t8_relset_2]) ).
fof(c_0_12,negated_conjecture,
( v1_relat_1(esk1_0)
& v1_relat_1(esk2_0)
& v1_relat_1(esk3_0)
& ~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X195,X196] : k4_xboole_0(X195,k4_xboole_0(X195,X196)) = k3_xboole_0(X195,X196),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_14,plain,
! [X155,X156,X157] :
( ~ r1_tarski(X155,X156)
| ~ r1_tarski(X155,X157)
| r1_tarski(X155,k3_xboole_0(X156,X157)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])]) ).
cnf(c_0_15,negated_conjecture,
~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( r1_tarski(X1,k3_xboole_0(X2,X3))
| ~ r1_tarski(X1,X2)
| ~ r1_tarski(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X439,X440,X441,X442] :
( ~ v1_relat_1(X439)
| ~ v1_relat_1(X440)
| ~ v1_relat_1(X441)
| ~ v1_relat_1(X442)
| ~ r1_tarski(X439,X440)
| ~ r1_tarski(X441,X442)
| r1_tarski(k5_relat_1(X439,X441),k5_relat_1(X440,X442)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t50_relat_1])])]) ).
fof(c_0_19,plain,
! [X86,X87] :
( ~ v1_relat_1(X87)
| ~ r1_tarski(X86,X87)
| v1_relat_1(X86) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])]) ).
cnf(c_0_20,negated_conjecture,
~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_21,plain,
( r1_tarski(X1,k4_xboole_0(X2,k4_xboole_0(X2,X3)))
| ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2) ),
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,plain,
( r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X4))
| ~ v1_relat_1(X1)
| ~ v1_relat_1(X2)
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X4)
| ~ r1_tarski(X1,X2)
| ~ r1_tarski(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( v1_relat_1(X2)
| ~ v1_relat_1(X1)
| ~ r1_tarski(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X61] : r1_tarski(X61,X61),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_25,plain,
! [X146] : k3_xboole_0(X146,k1_xboole_0) = k1_xboole_0,
inference(variable_rename,[status(thm)],[t2_boole]) ).
cnf(c_0_26,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk2_0,esk3_0))
| ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( r1_tarski(k5_relat_1(X1,X2),k5_relat_1(X3,X4))
| ~ v1_relat_1(X4)
| ~ v1_relat_1(X3)
| ~ r1_tarski(X2,X4)
| ~ r1_tarski(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
! [X1200,X1201] : r1_tarski(k4_xboole_0(X1200,X1201),X1200),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_32,plain,
! [X197,X198,X199] : k3_xboole_0(X197,k4_xboole_0(X198,X199)) = k4_xboole_0(k3_xboole_0(X197,X198),X199),
inference(variable_rename,[status(thm)],[t49_xboole_1]) ).
cnf(c_0_33,plain,
k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_34,plain,
! [X1186] : k4_xboole_0(X1186,k1_xboole_0) = X1186,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_35,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0))
| ~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_36,negated_conjecture,
v1_relat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_38,plain,
! [X1202,X1203] :
( ( k4_xboole_0(X1202,X1203) != k1_xboole_0
| r1_tarski(X1202,X1203) )
& ( ~ r1_tarski(X1202,X1203)
| k4_xboole_0(X1202,X1203) = k1_xboole_0 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])]) ).
cnf(c_0_39,plain,
k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k1_xboole_0)) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_41,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),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_35,c_0_27]),c_0_28]),c_0_36]),c_0_30]),c_0_37])]) ).
cnf(c_0_43,plain,
( r1_tarski(X1,X2)
| k4_xboole_0(X1,X2) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k4_xboole_0(X2,X3))) = k4_xboole_0(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_16]),c_0_16]) ).
cnf(c_0_45,plain,
k4_xboole_0(X1,X1) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
$false,
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_42,c_0_43]),c_0_44]),c_0_45]),c_0_41]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU418+4 : TPTP v8.1.2. Released v3.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 08:01:56 EDT 2023
% 0.14/0.34 % CPUTime :
% 4.95/5.11 Running first-order model finding
% 4.95/5.11 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/tmp/tmp.fpYNwED6Ha/E---3.1_20868.p
% 30.25/10.53 # Version: 3.1pre001
% 30.25/10.53 # Preprocessing class: FMLLMLLLSSSNFFN.
% 30.25/10.53 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 30.25/10.53 # Starting new_bool_3 with 897s (3) cores
% 30.25/10.53 # Starting new_bool_1 with 897s (3) cores
% 30.25/10.53 # Starting sh5l with 299s (1) cores
% 30.25/10.53 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 30.25/10.53 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 21609 completed with status 0
% 30.25/10.53 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 30.25/10.53 # Preprocessing class: FMLLMLLLSSSNFFN.
% 30.25/10.53 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 30.25/10.53 # Starting new_bool_3 with 897s (3) cores
% 30.25/10.53 # Starting new_bool_1 with 897s (3) cores
% 30.25/10.53 # Starting sh5l with 299s (1) cores
% 30.25/10.53 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 30.25/10.53 # SinE strategy is gf120_h_gu_RUU_F100_L01000
% 30.25/10.53 # Search class: FGHSM-SMLM32-DFFFFFNN
% 30.25/10.53 # Scheduled 12 strats onto 1 cores with 299 seconds (299 total)
% 30.25/10.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 25s (1) cores
% 30.25/10.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 21610 completed with status 0
% 30.25/10.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 30.25/10.53 # Preprocessing class: FMLLMLLLSSSNFFN.
% 30.25/10.53 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 30.25/10.53 # Starting new_bool_3 with 897s (3) cores
% 30.25/10.53 # Starting new_bool_1 with 897s (3) cores
% 30.25/10.53 # Starting sh5l with 299s (1) cores
% 30.25/10.53 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 30.25/10.53 # SinE strategy is gf120_h_gu_RUU_F100_L01000
% 30.25/10.53 # Search class: FGHSM-SMLM32-DFFFFFNN
% 30.25/10.53 # Scheduled 12 strats onto 1 cores with 299 seconds (299 total)
% 30.25/10.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 25s (1) cores
% 30.25/10.53 # Preprocessing time : 0.103 s
% 30.25/10.53 # Presaturation interreduction done
% 30.25/10.53
% 30.25/10.53 # Proof found!
% 30.25/10.53 # SZS status Theorem
% 30.25/10.53 # SZS output start CNFRefutation
% See solution above
% 30.27/10.53 # Parsed axioms : 71086
% 30.27/10.53 # Removed by relevancy pruning/SinE : 70085
% 30.27/10.53 # Initial clauses : 2082
% 30.27/10.53 # Removed in clause preprocessing : 46
% 30.27/10.53 # Initial clauses in saturation : 2036
% 30.27/10.53 # Processed clauses : 4031
% 30.27/10.53 # ...of these trivial : 32
% 30.27/10.53 # ...subsumed : 200
% 30.27/10.53 # ...remaining for further processing : 3799
% 30.27/10.53 # Other redundant clauses eliminated : 870
% 30.27/10.53 # Clauses deleted for lack of memory : 0
% 30.27/10.53 # Backward-subsumed : 7
% 30.27/10.53 # Backward-rewritten : 17
% 30.27/10.53 # Generated clauses : 72350
% 30.27/10.53 # ...of the previous two non-redundant : 68695
% 30.27/10.53 # ...aggressively subsumed : 0
% 30.27/10.53 # Contextual simplify-reflections : 139
% 30.27/10.53 # Paramodulations : 71422
% 30.27/10.53 # Factorizations : 29
% 30.27/10.53 # NegExts : 0
% 30.27/10.53 # Equation resolutions : 907
% 30.27/10.53 # Total rewrite steps : 16520
% 30.27/10.53 # Propositional unsat checks : 0
% 30.27/10.53 # Propositional check models : 0
% 30.27/10.53 # Propositional check unsatisfiable : 0
% 30.27/10.53 # Propositional clauses : 0
% 30.27/10.53 # Propositional clauses after purity: 0
% 30.27/10.53 # Propositional unsat core size : 0
% 30.27/10.53 # Propositional preprocessing time : 0.000
% 30.27/10.53 # Propositional encoding time : 0.000
% 30.27/10.53 # Propositional solver time : 0.000
% 30.27/10.53 # Success case prop preproc time : 0.000
% 30.27/10.53 # Success case prop encoding time : 0.000
% 30.27/10.53 # Success case prop solver time : 0.000
% 30.27/10.53 # Current number of processed clauses : 1801
% 30.27/10.53 # Positive orientable unit clauses : 215
% 30.27/10.53 # Positive unorientable unit clauses: 5
% 30.27/10.53 # Negative unit clauses : 51
% 30.27/10.53 # Non-unit-clauses : 1530
% 30.27/10.53 # Current number of unprocessed clauses: 68482
% 30.27/10.53 # ...number of literals in the above : 401626
% 30.27/10.53 # Current number of archived formulas : 0
% 30.27/10.53 # Current number of archived clauses : 1822
% 30.27/10.53 # Clause-clause subsumption calls (NU) : 1765785
% 30.27/10.53 # Rec. Clause-clause subsumption calls : 171922
% 30.27/10.53 # Non-unit clause-clause subsumptions : 318
% 30.27/10.53 # Unit Clause-clause subsumption calls : 15354
% 30.27/10.53 # Rewrite failures with RHS unbound : 0
% 30.27/10.53 # BW rewrite match attempts : 238
% 30.27/10.53 # BW rewrite match successes : 104
% 30.27/10.53 # Condensation attempts : 0
% 30.27/10.53 # Condensation successes : 0
% 30.27/10.53 # Termbank termtop insertions : 4279547
% 30.27/10.53
% 30.27/10.53 # -------------------------------------------------
% 30.27/10.53 # User time : 3.026 s
% 30.27/10.53 # System time : 0.245 s
% 30.27/10.53 # Total time : 3.271 s
% 30.27/10.53 # Maximum resident set size: 146392 pages
% 30.27/10.53
% 30.27/10.53 # -------------------------------------------------
% 30.27/10.53 # User time : 4.945 s
% 30.27/10.53 # System time : 0.328 s
% 30.27/10.53 # Total time : 5.274 s
% 30.27/10.53 # Maximum resident set size: 117688 pages
% 30.27/10.53 % E---3.1 exiting
%------------------------------------------------------------------------------