TSTP Solution File: COM008+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : COM008+2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 17:21:14 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 11 unt; 0 def)
% Number of atoms : 158 ( 22 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 192 ( 86 ~; 88 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 0 sgn; 28 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(found,axiom,
! [X1] :
( ( transitive_reflexive_rewrite(b,X1)
& transitive_reflexive_rewrite(c,X1) )
=> goal ),
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',found) ).
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',goal_to_be_proved) ).
fof(ih_cfl,axiom,
! [X1,X2,X3] :
( ( rewrite(a,X1)
& transitive_reflexive_rewrite(X1,X2)
& transitive_reflexive_rewrite(X1,X3) )
=> ? [X4] :
( transitive_reflexive_rewrite(X2,X4)
& transitive_reflexive_rewrite(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',ih_cfl) ).
fof(transitivity_of_transitive_reflexive_rewrite,axiom,
! [X1,X2,X3] :
( ( transitive_reflexive_rewrite(X1,X2)
& transitive_reflexive_rewrite(X2,X3) )
=> transitive_reflexive_rewrite(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',transitivity_of_transitive_reflexive_rewrite) ).
fof(equal_or_rewrite,axiom,
! [X1,X2] :
( transitive_reflexive_rewrite(X1,X2)
=> ( X1 = X2
| ? [X3] :
( rewrite(X1,X3)
& transitive_reflexive_rewrite(X3,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',equal_or_rewrite) ).
fof(assumption,axiom,
( transitive_reflexive_rewrite(a,b)
& transitive_reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',assumption) ).
fof(lo_cfl,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X2)
& rewrite(X1,X3) )
=> ? [X4] :
( transitive_reflexive_rewrite(X2,X4)
& transitive_reflexive_rewrite(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',lo_cfl) ).
fof(equality_in_transitive_reflexive_rewrite,axiom,
! [X1,X2] :
( X1 = X2
=> transitive_reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.WBVbN8qfs2/E---3.1_26120.p',equality_in_transitive_reflexive_rewrite) ).
fof(c_0_8,plain,
! [X5] :
( ~ transitive_reflexive_rewrite(b,X5)
| ~ transitive_reflexive_rewrite(c,X5)
| goal ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[found])]) ).
fof(c_0_9,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).
cnf(c_0_10,plain,
( goal
| ~ transitive_reflexive_rewrite(b,X1)
| ~ transitive_reflexive_rewrite(c,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X17,X18,X19] :
( ( transitive_reflexive_rewrite(X18,esk2_3(X17,X18,X19))
| ~ rewrite(a,X17)
| ~ transitive_reflexive_rewrite(X17,X18)
| ~ transitive_reflexive_rewrite(X17,X19) )
& ( transitive_reflexive_rewrite(X19,esk2_3(X17,X18,X19))
| ~ rewrite(a,X17)
| ~ transitive_reflexive_rewrite(X17,X18)
| ~ transitive_reflexive_rewrite(X17,X19) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ih_cfl])])])]) ).
fof(c_0_13,plain,
! [X10,X11,X12] :
( ~ transitive_reflexive_rewrite(X10,X11)
| ~ transitive_reflexive_rewrite(X11,X12)
| transitive_reflexive_rewrite(X10,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_transitive_reflexive_rewrite])]) ).
cnf(c_0_14,plain,
( ~ transitive_reflexive_rewrite(b,X1)
| ~ transitive_reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( transitive_reflexive_rewrite(X1,esk2_3(X2,X1,X3))
| ~ rewrite(a,X2)
| ~ transitive_reflexive_rewrite(X2,X1)
| ~ transitive_reflexive_rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( transitive_reflexive_rewrite(X1,X3)
| ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X1))
| ~ rewrite(a,X2)
| ~ transitive_reflexive_rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X21,X22] :
( ( rewrite(X21,esk3_2(X21,X22))
| X21 = X22
| ~ transitive_reflexive_rewrite(X21,X22) )
& ( transitive_reflexive_rewrite(esk3_2(X21,X22),X22)
| X21 = X22
| ~ transitive_reflexive_rewrite(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_or_rewrite])])])]) ).
cnf(c_0_19,plain,
( ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(b,esk2_3(X1,c,X2))
| ~ transitive_reflexive_rewrite(X1,c)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X4))
| ~ rewrite(a,X2)
| ~ transitive_reflexive_rewrite(X1,X4)
| ~ transitive_reflexive_rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(X2,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( rewrite(X1,esk3_2(X1,X2))
| X1 = X2
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
transitive_reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_23,plain,
( transitive_reflexive_rewrite(esk3_2(X1,X2),X2)
| X1 = X2
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(X1,c)
| ~ transitive_reflexive_rewrite(b,X2)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( c = a
| rewrite(a,esk3_2(a,c)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( c = a
| transitive_reflexive_rewrite(esk3_2(a,c),c) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,plain,
( c = a
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X1)
| ~ transitive_reflexive_rewrite(b,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
fof(c_0_28,plain,
! [X13,X14,X15] :
( ( transitive_reflexive_rewrite(X14,esk1_3(X13,X14,X15))
| ~ rewrite(X13,X14)
| ~ rewrite(X13,X15) )
& ( transitive_reflexive_rewrite(X15,esk1_3(X13,X14,X15))
| ~ rewrite(X13,X14)
| ~ rewrite(X13,X15) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lo_cfl])])])]) ).
cnf(c_0_29,plain,
( c = a
| ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(b,esk2_3(X1,X2,X3))
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X3)
| ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X1,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_30,plain,
( transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,plain,
( c = a
| ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X2)
| ~ transitive_reflexive_rewrite(X1,b)
| ~ transitive_reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_32,plain,
( transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X4))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X4)
| ~ transitive_reflexive_rewrite(X1,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
fof(c_0_33,plain,
! [X6,X7] :
( X6 != X7
| transitive_reflexive_rewrite(X6,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equality_in_transitive_reflexive_rewrite])]) ).
cnf(c_0_34,plain,
( c = a
| ~ rewrite(a,X1)
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X4)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X4)
| ~ transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X4))
| ~ transitive_reflexive_rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( transitive_reflexive_rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( transitive_reflexive_rewrite(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
( c = a
| ~ rewrite(a,X1)
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X3)
| ~ transitive_reflexive_rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
transitive_reflexive_rewrite(X1,X1),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_39,plain,
transitive_reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_40,plain,
( c = a
| ~ rewrite(X1,esk3_2(a,c))
| ~ rewrite(a,X2)
| ~ rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X2,b) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( transitive_reflexive_rewrite(X1,b)
| ~ transitive_reflexive_rewrite(X1,a) ),
inference(spm,[status(thm)],[c_0_16,c_0_39]) ).
cnf(c_0_42,plain,
( c = a
| ~ rewrite(a,X1)
| ~ transitive_reflexive_rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_43,plain,
( b = a
| rewrite(a,esk3_2(a,b)) ),
inference(spm,[status(thm)],[c_0_21,c_0_39]) ).
cnf(c_0_44,plain,
( b = a
| transitive_reflexive_rewrite(esk3_2(a,b),b) ),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_45,plain,
~ transitive_reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_46,plain,
( transitive_reflexive_rewrite(X1,c)
| ~ transitive_reflexive_rewrite(X1,a) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_47,plain,
~ transitive_reflexive_rewrite(c,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_41]),c_0_38])]) ).
cnf(c_0_48,plain,
( b = a
| c = a ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_49,plain,
~ transitive_reflexive_rewrite(b,a),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
b = a,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_38])]) ).
cnf(c_0_51,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : COM008+2 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n032.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Oct 3 04:59:50 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.WBVbN8qfs2/E---3.1_26120.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26199 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.47 # Starting sh5l with 136s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26207 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 9
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 13
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 13
% 0.17/0.47 # Processed clauses : 465
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 195
% 0.17/0.47 # ...remaining for further processing : 270
% 0.17/0.47 # Other redundant clauses eliminated : 1
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 16
% 0.17/0.47 # Backward-rewritten : 159
% 0.17/0.47 # Generated clauses : 905
% 0.17/0.47 # ...of the previous two non-redundant : 964
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 7
% 0.17/0.47 # Paramodulations : 904
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 1
% 0.17/0.47 # Total rewrite steps : 377
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 81
% 0.17/0.47 # Positive orientable unit clauses : 3
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 2
% 0.17/0.47 # Non-unit-clauses : 76
% 0.17/0.47 # Current number of unprocessed clauses: 457
% 0.17/0.47 # ...number of literals in the above : 2677
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 188
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 10209
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 2483
% 0.17/0.47 # Non-unit clause-clause subsumptions : 206
% 0.17/0.47 # Unit Clause-clause subsumption calls : 6
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 7
% 0.17/0.47 # BW rewrite match successes : 1
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 24684
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.030 s
% 0.17/0.47 # System time : 0.004 s
% 0.17/0.47 # Total time : 0.033 s
% 0.17/0.47 # Maximum resident set size: 1708 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.144 s
% 0.17/0.47 # System time : 0.011 s
% 0.17/0.47 # Total time : 0.155 s
% 0.17/0.47 # Maximum resident set size: 1676 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------