TSTP Solution File: SEU449+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU449+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:16 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 108 ( 47 ~; 39 |; 8 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 84 ( 1 sgn; 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X3,k8_relset_2(X2,X1,k8_relset_2(X1,X2,X3,X5),k6_relset_1(X1,X2,X5)))
& r1_tarski(X4,k8_relset_2(X1,X2,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)),X5)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bU1qxqF14q/E---3.1_3497.p',t63_relset_2) ).
fof(t61_relset_2,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X3,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)))
<=> r1_tarski(X4,k8_relset_2(X1,X2,X3,X5)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bU1qxqF14q/E---3.1_3497.p',t61_relset_2) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.bU1qxqF14q/E---3.1_3497.p',reflexivity_r1_tarski) ).
fof(dt_k8_relset_2,axiom,
! [X1,X2,X3,X4] :
( ( m1_subset_1(X3,k1_zfmisc_1(X1))
& m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) )
=> m1_subset_1(k8_relset_2(X1,X2,X3,X4),k1_zfmisc_1(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.bU1qxqF14q/E---3.1_3497.p',dt_k8_relset_2) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
=> m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.bU1qxqF14q/E---3.1_3497.p',dt_m2_relset_1) ).
fof(dt_k6_relset_1,axiom,
! [X1,X2,X3] :
( m1_relset_1(X3,X1,X2)
=> m2_relset_1(k6_relset_1(X1,X2,X3),X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bU1qxqF14q/E---3.1_3497.p',dt_k6_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
<=> m1_relset_1(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.bU1qxqF14q/E---3.1_3497.p',redefinition_m2_relset_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X3,k8_relset_2(X2,X1,k8_relset_2(X1,X2,X3,X5),k6_relset_1(X1,X2,X5)))
& r1_tarski(X4,k8_relset_2(X1,X2,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)),X5)) ) ) ) ),
inference(assume_negation,[status(cth)],[t63_relset_2]) ).
fof(c_0_8,plain,
! [X14,X15,X16,X17,X18] :
( ( ~ r1_tarski(X16,k8_relset_2(X15,X14,X17,k6_relset_1(X14,X15,X18)))
| r1_tarski(X17,k8_relset_2(X14,X15,X16,X18))
| ~ m2_relset_1(X18,X14,X15)
| ~ m1_subset_1(X17,k1_zfmisc_1(X15))
| ~ m1_subset_1(X16,k1_zfmisc_1(X14)) )
& ( ~ r1_tarski(X17,k8_relset_2(X14,X15,X16,X18))
| r1_tarski(X16,k8_relset_2(X15,X14,X17,k6_relset_1(X14,X15,X18)))
| ~ m2_relset_1(X18,X14,X15)
| ~ m1_subset_1(X17,k1_zfmisc_1(X15))
| ~ m1_subset_1(X16,k1_zfmisc_1(X14)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_relset_2])])])]) ).
fof(c_0_9,plain,
! [X11] : r1_tarski(X11,X11),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_10,negated_conjecture,
( m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))
& m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0))
& m2_relset_1(esk5_0,esk1_0,esk2_0)
& ( ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0)))
| ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( r1_tarski(X4,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X5)))
| ~ r1_tarski(X1,k8_relset_2(X2,X3,X4,X5))
| ~ m2_relset_1(X5,X2,X3)
| ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0)))
| ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,k8_relset_2(X3,X2,X1,X4),k6_relset_1(X3,X2,X4)))
| ~ m2_relset_1(X4,X3,X2)
| ~ m1_subset_1(k8_relset_2(X3,X2,X1,X4),k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
m2_relset_1(esk5_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( r1_tarski(X4,k8_relset_2(X3,X2,X1,X5))
| ~ r1_tarski(X1,k8_relset_2(X2,X3,X4,k6_relset_1(X3,X2,X5)))
| ~ m2_relset_1(X5,X3,X2)
| ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0))
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),X4))
| ~ m2_relset_1(X4,X2,X3)
| ~ m1_subset_1(k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_21,plain,
! [X23,X24,X25,X26] :
( ~ m1_subset_1(X25,k1_zfmisc_1(X23))
| ~ m1_subset_1(X26,k1_zfmisc_1(k2_zfmisc_1(X23,X24)))
| m1_subset_1(k8_relset_2(X23,X24,X25,X26),k1_zfmisc_1(X24)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relset_2])]) ).
fof(c_0_22,plain,
! [X42,X43,X44] :
( ~ m2_relset_1(X44,X42,X43)
| m1_subset_1(X44,k1_zfmisc_1(k2_zfmisc_1(X42,X43))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_23,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),k1_zfmisc_1(esk1_0))
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]),c_0_20])]) ).
cnf(c_0_24,plain,
( m1_subset_1(k8_relset_2(X2,X4,X1,X3),k1_zfmisc_1(X4))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X33,X34,X35] :
( ~ m1_relset_1(X35,X33,X34)
| m2_relset_1(k6_relset_1(X33,X34,X35),X34,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_relset_1])]) ).
cnf(c_0_27,negated_conjecture,
( ~ m1_subset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk1_0)))
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]) ).
cnf(c_0_28,negated_conjecture,
m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_29,plain,
( m2_relset_1(k6_relset_1(X2,X3,X1),X3,X2)
| ~ m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ m1_subset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_28]),c_0_16])]) ).
cnf(c_0_31,plain,
( m1_subset_1(k6_relset_1(X1,X2,X3),k1_zfmisc_1(k2_zfmisc_1(X2,X1)))
| ~ m1_relset_1(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
fof(c_0_32,plain,
! [X39,X40,X41] :
( ( ~ m2_relset_1(X41,X39,X40)
| m1_relset_1(X41,X39,X40) )
& ( ~ m1_relset_1(X41,X39,X40)
| m2_relset_1(X41,X39,X40) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_33,negated_conjecture,
~ m1_relset_1(esk5_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( m1_relset_1(X1,X2,X3)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU449+1 : TPTP v8.1.2. Released v3.4.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.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 09:29:36 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.bU1qxqF14q/E---3.1_3497.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # sh5l with pid 3577 completed with status 0
% 0.16/0.47 # Result found by sh5l
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.16/0.47 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 3583 completed with status 0
% 0.16/0.47 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.16/0.47 # Preprocessing time : 0.001 s
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 55
% 0.16/0.47 # Removed by relevancy pruning/SinE : 7
% 0.16/0.47 # Initial clauses : 68
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 68
% 0.16/0.47 # Processed clauses : 457
% 0.16/0.47 # ...of these trivial : 2
% 0.16/0.47 # ...subsumed : 189
% 0.16/0.47 # ...remaining for further processing : 266
% 0.16/0.47 # Other redundant clauses eliminated : 0
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 35
% 0.16/0.47 # Backward-rewritten : 7
% 0.16/0.47 # Generated clauses : 1000
% 0.16/0.47 # ...of the previous two non-redundant : 910
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 16
% 0.16/0.47 # Paramodulations : 1000
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 0
% 0.16/0.47 # Total rewrite steps : 244
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 224
% 0.16/0.47 # Positive orientable unit clauses : 47
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 5
% 0.16/0.47 # Non-unit-clauses : 172
% 0.16/0.47 # Current number of unprocessed clauses: 486
% 0.16/0.47 # ...number of literals in the above : 2160
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 42
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 8051
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 3135
% 0.16/0.47 # Non-unit clause-clause subsumptions : 218
% 0.16/0.47 # Unit Clause-clause subsumption calls : 660
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 5
% 0.16/0.47 # BW rewrite match successes : 3
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 20536
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.035 s
% 0.16/0.47 # System time : 0.003 s
% 0.16/0.47 # Total time : 0.038 s
% 0.16/0.47 # Maximum resident set size: 2028 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.037 s
% 0.16/0.47 # System time : 0.005 s
% 0.16/0.47 # Total time : 0.041 s
% 0.16/0.47 # Maximum resident set size: 1728 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------