TSTP Solution File: LCL654+1.001 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL654+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : 600s
% DateTime : Sun Jul 17 10:14:53 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 252 ( 0 equ)
% Maximal formula atoms : 50 ( 6 avg)
% Number of connectives : 417 ( 206 ~; 192 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 119 ( 0 sgn 54 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_3,negated_conjecture,
! [X4,X5,X7,X8,X9,X11,X12,X13,X15,X16,X18,X23] :
( ( r1(X5,esk2_2(X4,X5))
| ~ r1(X4,X5)
| ~ p1(X4)
| ~ r1(esk1_0,X4) )
& ( p1(esk2_2(X4,X5))
| ~ r1(X4,X5)
| ~ p1(X4)
| ~ r1(esk1_0,X4) )
& ( r1(X9,esk3_3(X7,X8,X9))
| ~ r1(X8,X9)
| ~ r1(X8,X11)
| p1(X11)
| ~ r1(X7,X8)
| ~ r1(esk1_0,X7) )
& ( ~ p1(esk3_3(X7,X8,X9))
| ~ r1(X8,X9)
| ~ r1(X8,X11)
| p1(X11)
| ~ r1(X7,X8)
| ~ r1(esk1_0,X7) )
& ( r1(X16,esk5_2(X12,X16))
| ~ r1(X12,X16)
| r1(X13,esk4_2(X12,X13))
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( ~ p1(esk5_2(X12,X16))
| ~ r1(X12,X16)
| r1(X13,esk4_2(X12,X13))
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( r1(X16,esk5_2(X12,X16))
| ~ r1(X12,X16)
| ~ r1(esk4_2(X12,X13),X15)
| p1(X15)
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( ~ p1(esk5_2(X12,X16))
| ~ r1(X12,X16)
| ~ r1(esk4_2(X12,X13),X15)
| p1(X15)
| ~ r1(X12,X13)
| ~ r1(esk1_0,X12) )
& ( ~ r1(esk1_0,X18)
| r1(X18,esk6_1(X18)) )
& r1(esk1_0,esk7_0)
& r1(esk7_0,esk8_0)
& r1(esk8_0,esk9_0)
& ~ p1(esk9_0)
& ( ~ r1(esk7_0,X23)
| p1(X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( p1(X3)
| r1(X4,esk3_3(X1,X2,X4))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
r1(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
~ p1(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( r1(X1,esk3_3(X2,esk8_0,X1))
| ~ r1(esk1_0,X2)
| ~ r1(esk8_0,X1)
| ~ r1(X2,esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( p1(esk3_3(X1,esk8_0,X2))
| r1(X3,esk3_3(X4,X2,X3))
| ~ r1(esk1_0,X4)
| ~ r1(esk1_0,X1)
| ~ r1(esk8_0,X2)
| ~ r1(X1,esk8_0)
| ~ r1(X2,X3)
| ~ r1(X4,X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
r1(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( p1(esk3_3(X1,esk8_0,X2))
| r1(X3,esk3_3(esk7_0,X2,X3))
| ~ r1(esk1_0,X1)
| ~ r1(esk8_0,X2)
| ~ r1(X1,esk8_0)
| ~ r1(esk7_0,X2)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
r1(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_12,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_13,negated_conjecture,
( r1(X2,esk4_2(X1,X2))
| r1(X3,esk5_2(X1,X3))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,X1))
| r1(X2,esk3_3(esk7_0,X1,X2))
| ~ r1(esk8_0,X1)
| ~ r1(esk7_0,X1)
| ~ r1(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11])]) ).
cnf(c_0_15,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( r1(X1,esk5_2(esk7_0,X1))
| r1(X2,esk4_2(esk7_0,X2))
| ~ r1(esk7_0,X1)
| ~ r1(esk7_0,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk8_0))
| r1(X1,esk3_3(esk7_0,esk8_0,X1))
| ~ r1(esk8_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
( r1(esk7_0,esk5_2(esk7_0,esk7_0))
| r1(X1,esk4_2(esk7_0,X1))
| ~ r1(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( p1(X3)
| r1(X4,esk5_2(X1,X4))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(esk4_2(X1,X2),X3)
| ~ r1(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk8_0))
| r1(esk4_2(esk7_0,esk8_0),esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
| r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]) ).
cnf(c_0_21,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
| p1(esk3_3(esk7_0,esk8_0,esk8_0))
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| r1(X1,esk5_2(esk7_0,X1))
| ~ r1(esk7_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9]),c_0_11])]) ).
cnf(c_0_22,negated_conjecture,
( p1(X3)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X2,X4)
| ~ p1(esk3_3(X1,X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_23,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk4_2(esk7_0,esk8_0)))
| p1(esk3_3(esk7_0,esk8_0,esk8_0))
| r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk8_0))
| p1(X1)
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| ~ r1(esk8_0,esk4_2(esk7_0,esk8_0))
| ~ r1(esk8_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9]),c_0_11])]) ).
cnf(c_0_25,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk8_0))
| p1(X1)
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| ~ r1(esk8_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_11])]) ).
cnf(c_0_26,negated_conjecture,
( p1(X3)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(esk4_2(X1,X2),X3)
| ~ r1(X1,X4)
| ~ p1(esk5_2(X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_27,negated_conjecture,
( p1(esk3_3(esk7_0,esk8_0,esk8_0))
| r1(esk7_0,esk5_2(esk7_0,esk7_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_5]),c_0_6]) ).
cnf(c_0_28,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(X2,X3)))
| ~ p1(esk5_2(X2,X4))
| ~ r1(esk8_0,esk4_2(X2,X3))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(X2,X4)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_7]) ).
cnf(c_0_29,negated_conjecture,
( p1(X1)
| ~ r1(esk7_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_30,negated_conjecture,
( p1(X1)
| r1(esk7_0,esk5_2(esk7_0,esk7_0))
| ~ r1(esk8_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_27]),c_0_9]),c_0_15]),c_0_11])]) ).
cnf(c_0_31,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(X2,X3)))
| ~ r1(esk8_0,esk4_2(X2,X3))
| ~ r1(esk7_0,esk5_2(X2,X4))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(X2,X4)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
r1(esk7_0,esk5_2(esk7_0,esk7_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_5]),c_0_6]) ).
cnf(c_0_33,negated_conjecture,
( r1(X2,esk4_2(X1,X2))
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ p1(esk5_2(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_34,negated_conjecture,
( p1(esk3_3(X1,esk8_0,esk4_2(esk7_0,X2)))
| ~ r1(esk8_0,esk4_2(esk7_0,X2))
| ~ r1(esk1_0,X1)
| ~ r1(X1,esk8_0)
| ~ r1(esk7_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_9]),c_0_15])]) ).
cnf(c_0_35,negated_conjecture,
( r1(X1,esk4_2(X2,X1))
| ~ r1(esk7_0,esk5_2(X2,X3))
| ~ r1(esk1_0,X2)
| ~ r1(X2,X3)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,esk4_2(esk7_0,X2))
| ~ r1(esk1_0,X3)
| ~ r1(esk8_0,X1)
| ~ r1(X3,esk8_0)
| ~ r1(esk7_0,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( r1(X1,esk4_2(esk7_0,X1))
| ~ r1(esk7_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_9]),c_0_15])]) ).
cnf(c_0_38,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk8_0,X1)
| ~ r1(X2,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_11])]) ).
cnf(c_0_39,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_9]),c_0_11])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_39]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL654+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 06:34:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 41
% 0.24/1.42 # Proof object clause steps : 36
% 0.24/1.42 # Proof object formula steps : 5
% 0.24/1.42 # Proof object conjectures : 38
% 0.24/1.42 # Proof object clause conjectures : 35
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 12
% 0.24/1.42 # Proof object initial formulas used : 2
% 0.24/1.42 # Proof object generating inferences : 24
% 0.24/1.42 # Proof object simplifying inferences : 33
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 2
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 15
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 15
% 0.24/1.42 # Processed clauses : 912
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 146
% 0.24/1.42 # ...remaining for further processing : 765
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 159
% 0.24/1.42 # Backward-rewritten : 54
% 0.24/1.42 # Generated clauses : 7601
% 0.24/1.42 # ...of the previous two non-trivial : 7573
% 0.24/1.42 # Contextual simplify-reflections : 372
% 0.24/1.42 # Paramodulations : 7601
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 552
% 0.24/1.42 # Positive orientable unit clauses : 8
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 541
% 0.24/1.42 # Current number of unprocessed clauses: 4270
% 0.24/1.42 # ...number of literals in the above : 35446
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 213
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 50232
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 8739
% 0.24/1.42 # Non-unit clause-clause subsumptions : 648
% 0.24/1.42 # Unit Clause-clause subsumption calls : 352
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 4
% 0.24/1.42 # BW rewrite match successes : 4
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 248212
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.680 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.685 s
% 0.24/1.42 # Maximum resident set size: 9368 pages
%------------------------------------------------------------------------------