%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV406+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : Wed Jul 20 18:16:29 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 55 ( 8 unt; 0 def)
% Number of atoms : 163 ( 21 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 174 ( 66 ~; 79 |; 13 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-3 aty)
% Number of variables : 141 ( 28 sgn 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l42_co,conjecture,
! [X1] :
( ! [X2,X3] :
( check_cpq(triple(X2,X1,X3))
<=> ! [X4,X5] :
( pair_in_list(X1,X4,X5)
=> less_than(X5,X4) ) )
=> ! [X6,X7,X8,X9] :
( check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7))
<=> ! [X10,X11] :
( pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11)
=> less_than(X11,X10) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l42_co) ).
fof(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax38,axiom,
! [X1,X2,X3,X4,X5] :
( strictly_less_than(X4,X5)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> ~ $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax38) ).
fof(ax37,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ! [X2,X3] :
( check_cpq(triple(X2,X1,X3))
<=> ! [X4,X5] :
( pair_in_list(X1,X4,X5)
=> less_than(X5,X4) ) )
=> ! [X6,X7,X8,X9] :
( check_cpq(triple(X6,insert_slb(X1,pair(X8,X9)),X7))
<=> ! [X10,X11] :
( pair_in_list(insert_slb(X1,pair(X8,X9)),X10,X11)
=> less_than(X11,X10) ) ) ),
inference(assume_negation,[status(cth)],[l42_co]) ).
fof(c_0_7,plain,
! [X6,X7,X8,X9,X10,X6,X7,X8,X9,X10] :
( ( X7 = X8
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X9 = X10
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( ~ pair_in_list(X6,X8,X10)
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X7 != X8
| X9 != X10
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X13,X14,X15,X16,X13,X14,X25,X26] :
( ( ~ check_cpq(triple(X13,esk1_0,X14))
| ~ pair_in_list(esk1_0,X15,X16)
| less_than(X16,X15) )
& ( pair_in_list(esk1_0,esk2_0,esk3_0)
| check_cpq(triple(X13,esk1_0,X14)) )
& ( ~ less_than(esk3_0,esk2_0)
| check_cpq(triple(X13,esk1_0,X14)) )
& ( pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) )
& ( ~ less_than(esk9_0,esk8_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) )
& ( check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X25,X26)
| less_than(X26,X25) ) ),
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)],[c_0_6])])])])])])]) ).
cnf(c_0_9,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X3,X4,X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[status(thm)],[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)],[stricly_smaller_definition])])])])])]) ).
fof(c_0_11,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_12,negated_conjecture,
( less_than(X1,X2)
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X6,X7,X8,X9,X10] :
( ~ strictly_less_than(X9,X10)
| ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_15,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_16,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| check_cpq(triple(X6,X7,X8))
| ~ less_than(X10,X9) )
& ( ~ check_cpq(triple(X6,X7,X8))
| check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| ~ less_than(X10,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).
cnf(c_0_19,negated_conjecture,
( check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| ~ less_than(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| less_than(esk7_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_24,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
( check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| check_cpq(triple(X1,esk1_0,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
less_than(esk7_0,esk6_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ less_than(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,plain,
( check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( check_cpq(triple(esk4_0,esk1_0,esk5_0))
| check_cpq(triple(X1,esk1_0,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
( ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| ~ less_than(esk9_0,esk8_0)
| ~ less_than(esk7_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1)
| ~ check_cpq(triple(X3,esk1_0,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
check_cpq(triple(esk4_0,esk1_0,esk5_0)),
inference(ef,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
( pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
( ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| ~ less_than(esk9_0,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_27])]) ).
cnf(c_0_37,plain,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_38,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( esk7_0 = esk9_0
| pair_in_list(esk1_0,esk8_0,esk9_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
~ less_than(esk9_0,esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_33])]) ).
cnf(c_0_41,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1)
| ~ less_than(esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_42,negated_conjecture,
( esk6_0 = esk8_0
| pair_in_list(esk1_0,esk8_0,esk9_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( pair_in_list(esk1_0,esk2_0,esk3_0)
| less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_44,negated_conjecture,
( esk7_0 = esk9_0
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( esk6_0 = esk8_0
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ less_than(esk3_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_28]) ).
cnf(c_0_46,negated_conjecture,
( esk6_0 = esk8_0
| pair_in_list(esk1_0,esk2_0,esk3_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_28]) ).
cnf(c_0_47,negated_conjecture,
esk7_0 = esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_29]),c_0_33]),c_0_27])]) ).
cnf(c_0_48,negated_conjecture,
( esk6_0 = esk8_0
| ~ less_than(esk3_0,esk2_0)
| ~ less_than(esk7_0,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_29]),c_0_21]) ).
cnf(c_0_49,negated_conjecture,
( esk6_0 = esk8_0
| pair_in_list(esk1_0,esk2_0,esk3_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk9_0)),esk5_0)) ),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( esk6_0 = esk8_0
| ~ less_than(esk3_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_23]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( esk6_0 = esk8_0
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk9_0)),esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_49]),c_0_50]) ).
cnf(c_0_52,negated_conjecture,
less_than(esk9_0,esk6_0),
inference(rw,[status(thm)],[c_0_27,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
esk6_0 = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_29]),c_0_33]),c_0_52])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV406+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.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 : Wed Jun 15 09:53:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 55
% 0.23/1.42 # Proof object clause steps : 42
% 0.23/1.42 # Proof object formula steps : 13
% 0.23/1.42 # Proof object conjectures : 34
% 0.23/1.42 # Proof object clause conjectures : 31
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 15
% 0.23/1.42 # Proof object initial formulas used : 6
% 0.23/1.42 # Proof object generating inferences : 20
% 0.23/1.42 # Proof object simplifying inferences : 27
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 42
% 0.23/1.42 # Removed by relevancy pruning/SinE : 15
% 0.23/1.42 # Initial clauses : 40
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 40
% 0.23/1.42 # Processed clauses : 222
% 0.23/1.42 # ...of these trivial : 1
% 0.23/1.42 # ...subsumed : 88
% 0.23/1.42 # ...remaining for further processing : 133
% 0.23/1.42 # Other redundant clauses eliminated : 3
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 20
% 0.23/1.42 # Backward-rewritten : 43
% 0.23/1.42 # Generated clauses : 834
% 0.23/1.42 # ...of the previous two non-trivial : 778
% 0.23/1.42 # Contextual simplify-reflections : 35
% 0.23/1.42 # Paramodulations : 758
% 0.23/1.42 # Factorizations : 74
% 0.23/1.42 # Equation resolutions : 3
% 0.23/1.42 # Current number of processed clauses : 68
% 0.23/1.42 # Positive orientable unit clauses : 14
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 3
% 0.23/1.42 # Non-unit-clauses : 51
% 0.23/1.42 # Current number of unprocessed clauses: 209
% 0.23/1.42 # ...number of literals in the above : 1154
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 63
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 6887
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 3610
% 0.23/1.42 # Non-unit clause-clause subsumptions : 139
% 0.23/1.42 # Unit Clause-clause subsumption calls : 189
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 13
% 0.23/1.42 # BW rewrite match successes : 5
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 13615
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.058 s
% 0.23/1.42 # System time : 0.006 s
% 0.23/1.42 # Total time : 0.064 s
% 0.23/1.42 # Maximum resident set size: 3868 pages
%------------------------------------------------------------------------------