TSTP Solution File: NLP143+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NLP143+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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 : Mon Jul 18 02:10:08 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 3 unt; 0 def)
% Number of atoms : 208 ( 15 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 221 ( 65 ~; 59 |; 81 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 35 ( 33 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 118 ( 5 sgn 60 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6] :
( of(X1,X2,X3)
& city(X1,X3)
& hollywood_placename(X1,X2)
& placename(X1,X2)
& chevy(X1,X3)
& white(X1,X3)
& dirty(X1,X3)
& old(X1,X3)
& street(X1,X4)
& lonely(X1,X4)
& event(X1,X5)
& agent(X1,X5,X3)
& present(X1,X5)
& barrel(X1,X5)
& down(X1,X5,X4)
& in(X1,X5,X3)
& ! [X7] :
( member(X1,X7,X6)
=> ? [X8,X9] :
( frontseat(X1,X9)
& state(X1,X8)
& be(X1,X8,X7,X9)
& in(X1,X9,X9) ) )
& two(X1,X6)
& group(X1,X6)
& ! [X10] :
( member(X1,X10,X6)
=> ( fellow(X1,X10)
& young(X1,X10) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax59,axiom,
! [X1,X2,X3,X4] :
( be(X1,X2,X3,X4)
=> X3 = X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax59) ).
fof(ax3,axiom,
! [X1,X2] :
( frontseat(X1,X2)
=> seat(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax3) ).
fof(ax56,axiom,
! [X1,X2] :
( unisex(X1,X2)
=> ~ male(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax56) ).
fof(ax37,axiom,
! [X1,X2] :
( man(X1,X2)
=> male(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax37) ).
fof(ax49,axiom,
! [X1,X2] :
( fellow(X1,X2)
=> man(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax49) ).
fof(ax2,axiom,
! [X1,X2] :
( seat(X1,X2)
=> furniture(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax2) ).
fof(ax20,axiom,
! [X1,X2] :
( artifact(X1,X2)
=> object(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax20) ).
fof(ax21,axiom,
! [X1,X2] :
( instrumentality(X1,X2)
=> artifact(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax21) ).
fof(ax1,axiom,
! [X1,X2] :
( furniture(X1,X2)
=> instrumentality(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax1) ).
fof(ax16,axiom,
! [X1,X2] :
( object(X1,X2)
=> unisex(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax16) ).
fof(ax60,axiom,
! [X1,X2] :
( two(X1,X2)
<=> ? [X3] :
( member(X1,X3,X2)
& ? [X4] :
( member(X1,X4,X2)
& X4 != X3
& ! [X5] :
( member(X1,X5,X2)
=> ( X5 = X4
| X5 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax60) ).
fof(c_0_12,negated_conjecture,
~ ~ ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6] :
( of(X1,X2,X3)
& city(X1,X3)
& hollywood_placename(X1,X2)
& placename(X1,X2)
& chevy(X1,X3)
& white(X1,X3)
& dirty(X1,X3)
& old(X1,X3)
& street(X1,X4)
& lonely(X1,X4)
& event(X1,X5)
& agent(X1,X5,X3)
& present(X1,X5)
& barrel(X1,X5)
& down(X1,X5,X4)
& in(X1,X5,X3)
& ! [X7] :
( member(X1,X7,X6)
=> ? [X8,X9] :
( frontseat(X1,X9)
& state(X1,X8)
& be(X1,X8,X7,X9)
& in(X1,X9,X9) ) )
& two(X1,X6)
& group(X1,X6)
& ! [X10] :
( member(X1,X10,X6)
=> ( fellow(X1,X10)
& young(X1,X10) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8] :
( ~ be(X5,X6,X7,X8)
| X7 = X8 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])]) ).
fof(c_0_14,negated_conjecture,
! [X17,X20] :
( actual_world(esk4_0)
& of(esk4_0,esk5_0,esk6_0)
& city(esk4_0,esk6_0)
& hollywood_placename(esk4_0,esk5_0)
& placename(esk4_0,esk5_0)
& chevy(esk4_0,esk6_0)
& white(esk4_0,esk6_0)
& dirty(esk4_0,esk6_0)
& old(esk4_0,esk6_0)
& street(esk4_0,esk7_0)
& lonely(esk4_0,esk7_0)
& event(esk4_0,esk8_0)
& agent(esk4_0,esk8_0,esk6_0)
& present(esk4_0,esk8_0)
& barrel(esk4_0,esk8_0)
& down(esk4_0,esk8_0,esk7_0)
& in(esk4_0,esk8_0,esk6_0)
& ( frontseat(esk4_0,esk11_1(X17))
| ~ member(esk4_0,X17,esk9_0) )
& ( state(esk4_0,esk10_1(X17))
| ~ member(esk4_0,X17,esk9_0) )
& ( be(esk4_0,esk10_1(X17),X17,esk11_1(X17))
| ~ member(esk4_0,X17,esk9_0) )
& ( in(esk4_0,esk11_1(X17),esk11_1(X17))
| ~ member(esk4_0,X17,esk9_0) )
& two(esk4_0,esk9_0)
& group(esk4_0,esk9_0)
& ( fellow(esk4_0,X20)
| ~ member(esk4_0,X20,esk9_0) )
& ( young(esk4_0,X20)
| ~ member(esk4_0,X20,esk9_0) ) ),
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_12])])])])])])]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ be(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( be(esk4_0,esk10_1(X1),X1,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ frontseat(X3,X4)
| seat(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])]) ).
cnf(c_0_18,negated_conjecture,
( frontseat(esk4_0,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( esk11_1(X1) = X1
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ unisex(X3,X4)
| ~ male(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax56])])]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ man(X3,X4)
| male(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ fellow(X3,X4)
| man(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ~ seat(X3,X4)
| furniture(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])]) ).
cnf(c_0_24,plain,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( frontseat(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( man(X1,X2)
| ~ fellow(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( fellow(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_30,plain,
! [X3,X4] :
( ~ artifact(X3,X4)
| object(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ instrumentality(X3,X4)
| artifact(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])]) ).
fof(c_0_32,plain,
! [X3,X4] :
( ~ furniture(X3,X4)
| instrumentality(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])]) ).
cnf(c_0_33,plain,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( seat(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
( ~ man(X1,X2)
| ~ unisex(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( man(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_37,plain,
! [X3,X4] :
( ~ object(X3,X4)
| unisex(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])]) ).
cnf(c_0_38,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,plain,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( furniture(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(esk4_0,X1,esk9_0)
| ~ unisex(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
( object(X1,X2)
| ~ instrumentality(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( instrumentality(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( ~ member(esk4_0,X1,esk9_0)
| ~ object(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
fof(c_0_47,plain,
! [X6,X7,X10,X6,X7,X11,X12] :
( ( member(X6,esk1_2(X6,X7),X7)
| ~ two(X6,X7) )
& ( member(X6,esk2_2(X6,X7),X7)
| ~ two(X6,X7) )
& ( esk2_2(X6,X7) != esk1_2(X6,X7)
| ~ two(X6,X7) )
& ( ~ member(X6,X10,X7)
| X10 = esk2_2(X6,X7)
| X10 = esk1_2(X6,X7)
| ~ two(X6,X7) )
& ( member(X6,esk3_4(X6,X7,X11,X12),X7)
| ~ member(X6,X12,X7)
| X12 = X11
| ~ member(X6,X11,X7)
| two(X6,X7) )
& ( esk3_4(X6,X7,X11,X12) != X12
| ~ member(X6,X12,X7)
| X12 = X11
| ~ member(X6,X11,X7)
| two(X6,X7) )
& ( esk3_4(X6,X7,X11,X12) != X11
| ~ member(X6,X12,X7)
| X12 = X11
| ~ member(X6,X11,X7)
| two(X6,X7) ) ),
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)],[ax60])])])])])])]) ).
cnf(c_0_48,negated_conjecture,
~ member(esk4_0,X1,esk9_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_49,plain,
( member(X1,esk2_2(X1,X2),X2)
| ~ two(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_50,negated_conjecture,
two(esk4_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP143+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 30 21:52:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Failure: Out of unprocessed clauses!
% 0.22/1.40 # OLD status GaveUp
% 0.22/1.40 # Parsed axioms : 62
% 0.22/1.40 # Removed by relevancy pruning/SinE : 32
% 0.22/1.40 # Initial clauses : 60
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 60
% 0.22/1.40 # Processed clauses : 91
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 3
% 0.22/1.40 # ...remaining for further processing : 88
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 34
% 0.22/1.40 # ...of the previous two non-trivial : 31
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 34
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 88
% 0.22/1.40 # Positive orientable unit clauses : 23
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 63
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 1081
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 833
% 0.22/1.40 # Non-unit clause-clause subsumptions : 3
% 0.22/1.40 # Unit Clause-clause subsumption calls : 10
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 3579
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.019 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.020 s
% 0.22/1.40 # Maximum resident set size: 3156 pages
% 0.22/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 52
% 0.22/1.40 # Proof object clause steps : 27
% 0.22/1.40 # Proof object formula steps : 25
% 0.22/1.40 # Proof object conjectures : 17
% 0.22/1.40 # Proof object clause conjectures : 14
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 15
% 0.22/1.40 # Proof object initial formulas used : 12
% 0.22/1.40 # Proof object generating inferences : 12
% 0.22/1.40 # Proof object simplifying inferences : 3
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 62
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 92
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 92
% 0.22/1.40 # Processed clauses : 166
% 0.22/1.40 # ...of these trivial : 1
% 0.22/1.40 # ...subsumed : 7
% 0.22/1.40 # ...remaining for further processing : 158
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 84
% 0.22/1.40 # ...of the previous two non-trivial : 79
% 0.22/1.40 # Contextual simplify-reflections : 1
% 0.22/1.40 # Paramodulations : 84
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 158
% 0.22/1.40 # Positive orientable unit clauses : 23
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 14
% 0.22/1.40 # Non-unit-clauses : 121
% 0.22/1.40 # Current number of unprocessed clauses: 5
% 0.22/1.40 # ...number of literals in the above : 10
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 4737
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 4028
% 0.22/1.40 # Non-unit clause-clause subsumptions : 6
% 0.22/1.40 # Unit Clause-clause subsumption calls : 232
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 5537
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.020 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.022 s
% 0.22/1.40 # Maximum resident set size: 3348 pages
%------------------------------------------------------------------------------