TSTP Solution File: MGT004-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT004-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 18:35:56 EDT 2023
% Result : Unsatisfiable 0.22s 0.48s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 46 ( 19 unt; 19 nHn; 46 RR)
% Number of literals : 229 ( 0 equ; 155 neg)
% Maximal clause size : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 135 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a6_FOL_5,hypothesis,
( greater(X4,X2)
| greater(X3,X5)
| greater(X8,X9)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization(X1,X4,X5)
| ~ reliability(X1,X6,X2)
| ~ reliability(X1,X7,X3)
| ~ accountability(X1,X8,X2)
| ~ accountability(X1,X9,X3)
| ~ greater(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',a6_FOL_5) ).
cnf(t4_FOL_8,negated_conjecture,
reorganization(sk3,sk8,sk9),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_8) ).
cnf(mp2_2,axiom,
( accountability(X1,sk2(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',mp2_2) ).
cnf(a1_FOL_3,hypothesis,
( greater(X10,X9)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reliability(X1,X5,X2)
| ~ reliability(X3,X6,X4)
| ~ accountability(X1,X7,X2)
| ~ accountability(X3,X8,X4)
| ~ survival_chance(X1,X9,X2)
| ~ survival_chance(X3,X10,X4)
| ~ greater(X6,X5)
| ~ greater(X8,X7) ),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',a1_FOL_3) ).
cnf(t4_FOL_9,negated_conjecture,
survival_chance(sk3,sk4,sk6),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_9) ).
cnf(t4_FOL_6,negated_conjecture,
organization(sk3,sk6),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_6) ).
cnf(mp1_1,axiom,
( reliability(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',mp1_1) ).
cnf(a6_FOL_4,hypothesis,
( greater(X4,X2)
| greater(X3,X5)
| greater(X6,X7)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization(X1,X4,X5)
| ~ reliability(X1,X6,X2)
| ~ reliability(X1,X7,X3)
| ~ accountability(X1,X8,X2)
| ~ accountability(X1,X9,X3)
| ~ greater(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',a6_FOL_4) ).
cnf(t4_FOL_11,negated_conjecture,
~ greater(sk8,sk6),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_11) ).
cnf(t4_FOL_10,negated_conjecture,
survival_chance(sk3,sk5,sk7),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_10) ).
cnf(t4_FOL_12,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_12) ).
cnf(t4_FOL_7,negated_conjecture,
organization(sk3,sk7),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_7) ).
cnf(t4_FOL_14,negated_conjecture,
~ greater(sk4,sk5),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_14) ).
cnf(t4_FOL_13,negated_conjecture,
~ greater(sk7,sk9),
file('/export/starexec/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p',t4_FOL_13) ).
cnf(c_0_14,hypothesis,
( greater(X4,X2)
| greater(X3,X5)
| greater(X8,X9)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization(X1,X4,X5)
| ~ reliability(X1,X6,X2)
| ~ reliability(X1,X7,X3)
| ~ accountability(X1,X8,X2)
| ~ accountability(X1,X9,X3)
| ~ greater(X3,X2) ),
a6_FOL_5 ).
cnf(c_0_15,negated_conjecture,
reorganization(sk3,sk8,sk9),
t4_FOL_8 ).
cnf(c_0_16,negated_conjecture,
( greater(X1,sk9)
| greater(sk8,X2)
| greater(X3,X4)
| ~ greater(X1,X2)
| ~ accountability(sk3,X4,X1)
| ~ accountability(sk3,X3,X2)
| ~ reliability(sk3,X5,X1)
| ~ reliability(sk3,X6,X2)
| ~ organization(sk3,X1)
| ~ organization(sk3,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
( accountability(X1,sk2(X2,X1),X2)
| ~ organization(X1,X2) ),
mp2_2 ).
cnf(c_0_18,negated_conjecture,
( greater(X1,sk2(X2,sk3))
| greater(sk8,X3)
| greater(X2,sk9)
| ~ greater(X2,X3)
| ~ accountability(sk3,X1,X3)
| ~ reliability(sk3,X4,X2)
| ~ reliability(sk3,X5,X3)
| ~ organization(sk3,X2)
| ~ organization(sk3,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,hypothesis,
( greater(X10,X9)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reliability(X1,X5,X2)
| ~ reliability(X3,X6,X4)
| ~ accountability(X1,X7,X2)
| ~ accountability(X3,X8,X4)
| ~ survival_chance(X1,X9,X2)
| ~ survival_chance(X3,X10,X4)
| ~ greater(X6,X5)
| ~ greater(X8,X7) ),
a1_FOL_3 ).
cnf(c_0_20,negated_conjecture,
survival_chance(sk3,sk4,sk6),
t4_FOL_9 ).
cnf(c_0_21,negated_conjecture,
organization(sk3,sk6),
t4_FOL_6 ).
cnf(c_0_22,negated_conjecture,
( greater(sk2(X1,sk3),sk2(X2,sk3))
| greater(X2,sk9)
| greater(sk8,X1)
| ~ greater(X2,X1)
| ~ reliability(sk3,X3,X2)
| ~ reliability(sk3,X4,X1)
| ~ organization(sk3,X2)
| ~ organization(sk3,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,axiom,
( reliability(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
mp1_1 ).
cnf(c_0_24,hypothesis,
( greater(X4,X2)
| greater(X3,X5)
| greater(X6,X7)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization(X1,X4,X5)
| ~ reliability(X1,X6,X2)
| ~ reliability(X1,X7,X3)
| ~ accountability(X1,X8,X2)
| ~ accountability(X1,X9,X3)
| ~ greater(X3,X2) ),
a6_FOL_4 ).
cnf(c_0_25,negated_conjecture,
( greater(sk4,X1)
| ~ greater(X2,X3)
| ~ greater(X4,X5)
| ~ survival_chance(X6,X1,X7)
| ~ accountability(sk3,X2,sk6)
| ~ accountability(X6,X3,X7)
| ~ reliability(sk3,X4,sk6)
| ~ reliability(X6,X5,X7)
| ~ organization(X6,X7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
( greater(sk2(X1,sk3),sk2(X2,sk3))
| greater(sk8,X1)
| greater(X2,sk9)
| ~ greater(X2,X1)
| ~ reliability(sk3,X3,X1)
| ~ organization(sk3,X2)
| ~ organization(sk3,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( greater(X1,sk9)
| greater(sk8,X2)
| greater(X3,X4)
| ~ greater(X1,X2)
| ~ accountability(sk3,X5,X1)
| ~ accountability(sk3,X6,X2)
| ~ reliability(sk3,X4,X1)
| ~ reliability(sk3,X3,X2)
| ~ organization(sk3,X1)
| ~ organization(sk3,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( greater(sk4,X1)
| ~ greater(sk2(sk6,sk3),X2)
| ~ greater(X3,X4)
| ~ survival_chance(X5,X1,X6)
| ~ accountability(X5,X2,X6)
| ~ reliability(sk3,X3,sk6)
| ~ reliability(X5,X4,X6)
| ~ organization(X5,X6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
( greater(sk2(X1,sk3),sk2(X2,sk3))
| greater(X2,sk9)
| greater(sk8,X1)
| ~ greater(X2,X1)
| ~ organization(sk3,X2)
| ~ organization(sk3,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ greater(sk8,sk6),
t4_FOL_11 ).
cnf(c_0_31,negated_conjecture,
( greater(sk8,X1)
| greater(X2,sk9)
| greater(X3,X4)
| ~ greater(X2,X1)
| ~ accountability(sk3,X5,X1)
| ~ reliability(sk3,X4,X2)
| ~ reliability(sk3,X3,X1)
| ~ organization(sk3,X2)
| ~ organization(sk3,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( greater(X1,sk9)
| greater(sk4,X2)
| ~ greater(X1,sk6)
| ~ greater(X3,X4)
| ~ survival_chance(X5,X2,X6)
| ~ accountability(X5,sk2(X1,sk3),X6)
| ~ reliability(sk3,X3,sk6)
| ~ reliability(X5,X4,X6)
| ~ organization(sk3,X1)
| ~ organization(X5,X6) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21])]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( greater(X1,sk9)
| greater(sk8,X2)
| greater(X3,X4)
| ~ greater(X1,X2)
| ~ reliability(sk3,X4,X1)
| ~ reliability(sk3,X3,X2)
| ~ organization(sk3,X1)
| ~ organization(sk3,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( greater(sk4,X1)
| greater(X2,sk9)
| ~ greater(X2,sk6)
| ~ greater(X3,X4)
| ~ survival_chance(sk3,X1,X2)
| ~ reliability(sk3,X3,sk6)
| ~ reliability(sk3,X4,X2)
| ~ organization(sk3,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_35,negated_conjecture,
( greater(X1,sk1(X2,sk3))
| greater(sk8,X3)
| greater(X2,sk9)
| ~ greater(X2,X3)
| ~ reliability(sk3,X1,X3)
| ~ organization(sk3,X2)
| ~ organization(sk3,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
cnf(c_0_36,negated_conjecture,
( greater(X1,sk9)
| greater(sk4,X2)
| ~ greater(sk1(sk6,sk3),X3)
| ~ greater(X1,sk6)
| ~ survival_chance(sk3,X2,X1)
| ~ reliability(sk3,X3,X1)
| ~ organization(sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
( greater(sk1(X1,sk3),sk1(X2,sk3))
| greater(X2,sk9)
| greater(sk8,X1)
| ~ greater(X2,X1)
| ~ organization(sk3,X2)
| ~ organization(sk3,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_38,negated_conjecture,
( greater(X1,sk9)
| greater(sk4,X2)
| greater(X3,sk9)
| ~ greater(X3,sk6)
| ~ greater(X1,sk6)
| ~ survival_chance(sk3,X2,X3)
| ~ reliability(sk3,sk1(X1,sk3),X3)
| ~ organization(sk3,X3)
| ~ organization(sk3,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21])]),c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( greater(sk4,X1)
| greater(X2,sk9)
| ~ greater(X2,sk6)
| ~ survival_chance(sk3,X1,X2)
| ~ organization(sk3,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_23]) ).
cnf(c_0_40,negated_conjecture,
survival_chance(sk3,sk5,sk7),
t4_FOL_10 ).
cnf(c_0_41,negated_conjecture,
greater(sk7,sk6),
t4_FOL_12 ).
cnf(c_0_42,negated_conjecture,
organization(sk3,sk7),
t4_FOL_7 ).
cnf(c_0_43,negated_conjecture,
~ greater(sk4,sk5),
t4_FOL_14 ).
cnf(c_0_44,negated_conjecture,
~ greater(sk7,sk9),
t4_FOL_13 ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]),c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : MGT004-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Oct 3 00:34:54 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.46 Running first-order model finding
% 0.22/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.LgY6H1CQRV/E---3.1_4616.p
% 0.22/0.48 # Version: 3.1pre001
% 0.22/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 # Starting sh5l with 300s (1) cores
% 0.22/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4703 completed with status 0
% 0.22/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.48 # No SInE strategy applied
% 0.22/0.48 # Search class: FGUNF-FFSM22-SFFFFFNN
% 0.22/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.48 # Starting sh5l with 136s (1) cores
% 0.22/0.48 # SAT001_MinMin_p005000_rr_RG with pid 4708 completed with status 0
% 0.22/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.48 # No SInE strategy applied
% 0.22/0.48 # Search class: FGUNF-FFSM22-SFFFFFNN
% 0.22/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.48 # Preprocessing time : 0.001 s
% 0.22/0.48 # Presaturation interreduction done
% 0.22/0.48
% 0.22/0.48 # Proof found!
% 0.22/0.48 # SZS status Unsatisfiable
% 0.22/0.48 # SZS output start CNFRefutation
% See solution above
% 0.22/0.48 # Parsed axioms : 14
% 0.22/0.48 # Removed by relevancy pruning/SinE : 0
% 0.22/0.48 # Initial clauses : 14
% 0.22/0.48 # Removed in clause preprocessing : 0
% 0.22/0.48 # Initial clauses in saturation : 14
% 0.22/0.48 # Processed clauses : 51
% 0.22/0.48 # ...of these trivial : 0
% 0.22/0.48 # ...subsumed : 0
% 0.22/0.48 # ...remaining for further processing : 51
% 0.22/0.48 # Other redundant clauses eliminated : 0
% 0.22/0.48 # Clauses deleted for lack of memory : 0
% 0.22/0.48 # Backward-subsumed : 7
% 0.22/0.48 # Backward-rewritten : 0
% 0.22/0.48 # Generated clauses : 26
% 0.22/0.48 # ...of the previous two non-redundant : 24
% 0.22/0.48 # ...aggressively subsumed : 0
% 0.22/0.48 # Contextual simplify-reflections : 0
% 0.22/0.48 # Paramodulations : 26
% 0.22/0.48 # Factorizations : 0
% 0.22/0.48 # NegExts : 0
% 0.22/0.48 # Equation resolutions : 0
% 0.22/0.48 # Total rewrite steps : 12
% 0.22/0.48 # Propositional unsat checks : 0
% 0.22/0.48 # Propositional check models : 0
% 0.22/0.48 # Propositional check unsatisfiable : 0
% 0.22/0.48 # Propositional clauses : 0
% 0.22/0.48 # Propositional clauses after purity: 0
% 0.22/0.48 # Propositional unsat core size : 0
% 0.22/0.48 # Propositional preprocessing time : 0.000
% 0.22/0.48 # Propositional encoding time : 0.000
% 0.22/0.48 # Propositional solver time : 0.000
% 0.22/0.48 # Success case prop preproc time : 0.000
% 0.22/0.48 # Success case prop encoding time : 0.000
% 0.22/0.48 # Success case prop solver time : 0.000
% 0.22/0.48 # Current number of processed clauses : 30
% 0.22/0.48 # Positive orientable unit clauses : 6
% 0.22/0.48 # Positive unorientable unit clauses: 0
% 0.22/0.48 # Negative unit clauses : 3
% 0.22/0.48 # Non-unit-clauses : 21
% 0.22/0.48 # Current number of unprocessed clauses: 1
% 0.22/0.48 # ...number of literals in the above : 6
% 0.22/0.48 # Current number of archived formulas : 0
% 0.22/0.48 # Current number of archived clauses : 21
% 0.22/0.48 # Clause-clause subsumption calls (NU) : 643
% 0.22/0.48 # Rec. Clause-clause subsumption calls : 22
% 0.22/0.48 # Non-unit clause-clause subsumptions : 7
% 0.22/0.48 # Unit Clause-clause subsumption calls : 2
% 0.22/0.48 # Rewrite failures with RHS unbound : 0
% 0.22/0.48 # BW rewrite match attempts : 0
% 0.22/0.48 # BW rewrite match successes : 0
% 0.22/0.48 # Condensation attempts : 0
% 0.22/0.48 # Condensation successes : 0
% 0.22/0.48 # Termbank termtop insertions : 1996
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.005 s
% 0.22/0.48 # System time : 0.003 s
% 0.22/0.48 # Total time : 0.008 s
% 0.22/0.48 # Maximum resident set size: 1632 pages
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.025 s
% 0.22/0.48 # System time : 0.011 s
% 0.22/0.48 # Total time : 0.036 s
% 0.22/0.48 # Maximum resident set size: 1684 pages
% 0.22/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------