%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL494+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:07:51 PM UTC 2026
% Result : Theorem 0.08s 15.48s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 29
% Syntax : Number of formulae : 106 ( 23 unt; 15 def)
% Number of atoms : 256 ( 17 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 256 ( 106 ~; 110 |; 16 &)
% ( 20 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 25 ( 23 usr; 23 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 109 ( 99 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
( equivalence_2
<=> ! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(Y,X))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,axiom,
( r2
<=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f24,axiom,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f29,axiom,
( op_implies_and
=> ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f30,axiom,
( op_implies_or
=> ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f31,axiom,
( op_equiv
=> ! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f45,conjecture,
equivalence_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f46,negated_conjecture,
~ equivalence_2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
( modus_ponens
<=> ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f48,plain,
( ( ? [X,Y] :
( ~ is_a_theorem(Y)
& is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
| modus_ponens )
& ( ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| ~ modus_ponens ) ),
inference(NNF_transformation,[status(thm)],[f47]) ).
fof(f49,plain,
( ( ? [Y] :
( ~ is_a_theorem(Y)
& ? [X] :
( is_a_theorem(implies(X,Y))
& is_a_theorem(X) ) )
| modus_ponens )
& ( ! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) )
| ~ modus_ponens ) ),
inference(miniscoping,[status(thm)],[f48]) ).
fof(f50,plain,
( ( ( ~ is_a_theorem(sK0_skl)
& is_a_theorem(implies(sK1_skl,sK0_skl))
& is_a_theorem(sK1_skl) )
| modus_ponens )
& ( ! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) )
| ~ modus_ponens ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f49]) ).
fof(f51,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(thm)],[f50]) ).
fof(f105,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(equiv(X,Y),implies(Y,X)))
| equivalence_2 )
& ( ! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(Y,X)))
| ~ equivalence_2 ) ),
inference(NNF_transformation,[status(thm)],[f14]) ).
fof(f106,plain,
( ( ~ is_a_theorem(implies(equiv(sK28_skl,sK29_skl),implies(sK29_skl,sK28_skl)))
| equivalence_2 )
& ( ! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(Y,X)))
| ~ equivalence_2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK28_skl,sK29_skl]),skolemize(X,sK28_skl),skolemize(Y,sK29_skl)],[f105]) ).
fof(f108,plain,
( ~ is_a_theorem(implies(equiv(sK28_skl,sK29_skl),implies(sK29_skl,sK28_skl)))
| equivalence_2 ),
inference(cnf_transformation,[status(thm)],[f106]) ).
fof(f141,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(Q,or(P,Q)))
| r2 )
& ( ! [P,Q] : is_a_theorem(implies(Q,or(P,Q)))
| ~ r2 ) ),
inference(NNF_transformation,[status(thm)],[f23]) ).
fof(f142,plain,
( ( ~ is_a_theorem(implies(sK46_skl,or(sK45_skl,sK46_skl)))
| r2 )
& ( ! [P,Q] : is_a_theorem(implies(Q,or(P,Q)))
| ~ r2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK45_skl,sK46_skl]),skolemize(P,sK45_skl),skolemize(Q,sK46_skl)],[f141]) ).
fof(f143,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(cnf_transformation,[status(thm)],[f142]) ).
fof(f145,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(or(P,Q),or(Q,P)))
| r3 )
& ( ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(NNF_transformation,[status(thm)],[f24]) ).
fof(f146,plain,
( ( ~ is_a_theorem(implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl)))
| r3 )
& ( ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl]),skolemize(P,sK47_skl),skolemize(Q,sK48_skl)],[f145]) ).
fof(f147,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[status(thm)],[f146]) ).
fof(f161,plain,
( ! [X,Y] : implies(X,Y) = not(and(X,not(Y)))
| ~ op_implies_and ),
inference(pre_NNF_transformation,[status(thm)],[f29]) ).
fof(f162,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[status(thm)],[f161]) ).
fof(f163,plain,
( ! [X,Y] : implies(X,Y) = or(not(X),Y)
| ~ op_implies_or ),
inference(pre_NNF_transformation,[status(thm)],[f30]) ).
fof(f164,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[status(thm)],[f163]) ).
fof(f165,plain,
( ! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X))
| ~ op_equiv ),
inference(pre_NNF_transformation,[status(thm)],[f31]) ).
fof(f166,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[status(thm)],[f165]) ).
fof(f167,plain,
op_implies_or,
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f169,plain,
op_equiv,
inference(cnf_transformation,[status(thm)],[f34]) ).
fof(f170,plain,
modus_ponens,
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f172,plain,
r2,
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f173,plain,
r3,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f178,plain,
op_implies_and,
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f180,plain,
~ equivalence_2,
inference(cnf_transformation,[status(thm)],[f46]) ).
fof(f181,definition,
( sQ0_spl
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f183,plain,
( sQ0_spl
| ~ modus_ponens ),
inference(component_clause,[status(thm)],[f181]) ).
fof(f184,definition,
! [X0,X1] :
( sQ1_spl
<=> ( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f185,plain,
! [X0,X1] :
( ~ sQ1_spl
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f184]) ).
fof(f187,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f51,f181,f184]) ).
fof(f229,definition,
! [X0,X1] :
( sQ13_spl
<=> is_a_theorem(implies(X0,implies(X1,X0))) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f230,plain,
! [X0,X1] :
( ~ sQ13_spl
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(component_clause,[status(thm)],[f229]) ).
fof(f306,definition,
! [X0,X1] :
( sQ34_spl
<=> is_a_theorem(implies(X0,or(X1,X0))) ),
introduced(definition,[new_symbols(definition,[sQ34_spl])],[split_symbol_definition]) ).
fof(f307,plain,
! [X0,X1] :
( ~ sQ34_spl
| is_a_theorem(implies(X0,or(X1,X0))) ),
inference(component_clause,[status(thm)],[f306]) ).
fof(f336,definition,
( sQ42_spl
<=> equivalence_2 ),
introduced(definition,[new_symbols(definition,[sQ42_spl])],[split_symbol_definition]) ).
fof(f337,plain,
( ~ sQ42_spl
| equivalence_2 ),
inference(component_clause,[status(thm)],[f336]) ).
fof(f343,definition,
( sQ44_spl
<=> is_a_theorem(implies(equiv(sK28_skl,sK29_skl),implies(sK29_skl,sK28_skl))) ),
introduced(definition,[new_symbols(definition,[sQ44_spl])],[split_symbol_definition]) ).
fof(f345,plain,
( sQ44_spl
| ~ is_a_theorem(implies(equiv(sK28_skl,sK29_skl),implies(sK29_skl,sK28_skl))) ),
inference(component_clause,[status(thm)],[f343]) ).
fof(f346,plain,
( ~ sQ44_spl
| sQ42_spl ),
inference(split_clause,[status(thm)],[f108,f336,f343]) ).
fof(f429,definition,
( sQ67_spl
<=> r2 ),
introduced(definition,[new_symbols(definition,[sQ67_spl])],[split_symbol_definition]) ).
fof(f431,plain,
( sQ67_spl
| ~ r2 ),
inference(component_clause,[status(thm)],[f429]) ).
fof(f432,plain,
( sQ34_spl
| ~ sQ67_spl ),
inference(split_clause,[status(thm)],[f143,f429,f306]) ).
fof(f437,definition,
( sQ69_spl
<=> r3 ),
introduced(definition,[new_symbols(definition,[sQ69_spl])],[split_symbol_definition]) ).
fof(f439,plain,
( sQ69_spl
| ~ r3 ),
inference(component_clause,[status(thm)],[f437]) ).
fof(f440,definition,
! [X0,X1] :
( sQ70_spl
<=> is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
introduced(definition,[new_symbols(definition,[sQ70_spl])],[split_symbol_definition]) ).
fof(f441,plain,
! [X0,X1] :
( ~ sQ70_spl
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(component_clause,[status(thm)],[f440]) ).
fof(f443,plain,
( sQ70_spl
| ~ sQ69_spl ),
inference(split_clause,[status(thm)],[f147,f437,f440]) ).
fof(f484,definition,
( sQ82_spl
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[sQ82_spl])],[split_symbol_definition]) ).
fof(f486,plain,
( sQ82_spl
| ~ op_implies_and ),
inference(component_clause,[status(thm)],[f484]) ).
fof(f487,definition,
! [X0,X1] :
( sQ83_spl
<=> implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[sQ83_spl])],[split_symbol_definition]) ).
fof(f488,plain,
! [X0,X1] :
( ~ sQ83_spl
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(component_clause,[status(thm)],[f487]) ).
fof(f490,plain,
( sQ83_spl
| ~ sQ82_spl ),
inference(split_clause,[status(thm)],[f162,f484,f487]) ).
fof(f491,definition,
( sQ84_spl
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[sQ84_spl])],[split_symbol_definition]) ).
fof(f493,plain,
( sQ84_spl
| ~ op_implies_or ),
inference(component_clause,[status(thm)],[f491]) ).
fof(f494,definition,
! [X0,X1] :
( sQ85_spl
<=> implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[sQ85_spl])],[split_symbol_definition]) ).
fof(f495,plain,
! [X0,X1] :
( ~ sQ85_spl
| implies(X0,X1) = or(not(X0),X1) ),
inference(component_clause,[status(thm)],[f494]) ).
fof(f497,plain,
( sQ85_spl
| ~ sQ84_spl ),
inference(split_clause,[status(thm)],[f164,f491,f494]) ).
fof(f498,definition,
( sQ86_spl
<=> op_equiv ),
introduced(definition,[new_symbols(definition,[sQ86_spl])],[split_symbol_definition]) ).
fof(f500,plain,
( sQ86_spl
| ~ op_equiv ),
inference(component_clause,[status(thm)],[f498]) ).
fof(f501,definition,
! [X0,X1] :
( sQ87_spl
<=> equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
introduced(definition,[new_symbols(definition,[sQ87_spl])],[split_symbol_definition]) ).
fof(f502,plain,
! [X0,X1] :
( ~ sQ87_spl
| equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(component_clause,[status(thm)],[f501]) ).
fof(f504,plain,
( sQ87_spl
| ~ sQ86_spl ),
inference(split_clause,[status(thm)],[f166,f498,f501]) ).
fof(f505,plain,
( sQ86_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f500,f169]) ).
fof(f506,plain,
sQ86_spl,
inference(contradiction_clause,[status(thm)],[f505]) ).
fof(f507,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f183,f170]) ).
fof(f508,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f507]) ).
fof(f511,plain,
( sQ84_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f493,f167]) ).
fof(f512,plain,
sQ84_spl,
inference(contradiction_clause,[status(thm)],[f511]) ).
fof(f513,plain,
( sQ82_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f486,f178]) ).
fof(f514,plain,
sQ82_spl,
inference(contradiction_clause,[status(thm)],[f513]) ).
fof(f527,plain,
! [X0,X1] :
( ~ sQ85_spl
| ~ sQ70_spl
| is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0))) ),
inference(paramodulation,[status(thm)],[f495,f441]) ).
fof(f530,plain,
( sQ67_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f431,f172]) ).
fof(f531,plain,
sQ67_spl,
inference(contradiction_clause,[status(thm)],[f530]) ).
fof(f532,plain,
! [X0,X1] :
( ~ sQ85_spl
| ~ sQ34_spl
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(paramodulation,[status(thm)],[f495,f307]) ).
fof(f554,plain,
( sQ69_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f439,f173]) ).
fof(f555,plain,
sQ69_spl,
inference(contradiction_clause,[status(thm)],[f554]) ).
fof(f574,plain,
( ~ sQ85_spl
| ~ sQ34_spl
| sQ13_spl ),
inference(split_clause,[status(thm)],[f532,f229,f306,f494]) ).
fof(f581,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| implies(X0,and(X1,not(X2))) = not(and(X0,implies(X1,X2))) ),
inference(paramodulation,[status(thm)],[f488,f488]) ).
fof(f582,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ85_spl
| implies(and(X0,not(X1)),X2) = or(implies(X0,X1),X2) ),
inference(paramodulation,[status(thm)],[f488,f495]) ).
fof(f721,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ85_spl
| ~ sQ13_spl
| is_a_theorem(or(implies(X0,X1),implies(X2,and(X0,not(X1))))) ),
inference(paramodulation,[status(thm)],[f582,f230]) ).
fof(f738,plain,
! [X0] :
( ~ sQ1_spl
| sQ44_spl
| ~ is_a_theorem(implies(X0,implies(equiv(sK28_skl,sK29_skl),implies(sK29_skl,sK28_skl))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f345,f185]) ).
fof(f1145,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ85_spl
| ~ sQ13_spl
| is_a_theorem(or(implies(X0,X1),not(and(X2,implies(X0,X1))))) ),
inference(backward_demodulation,[status(thm)],[f581,f721]) ).
fof(f1197,plain,
! [X0,X1] :
( ~ sQ87_spl
| ~ sQ83_spl
| ~ sQ85_spl
| ~ sQ13_spl
| is_a_theorem(or(implies(X0,X1),not(equiv(X1,X0)))) ),
inference(paramodulation,[status(thm)],[f502,f1145]) ).
fof(f1841,plain,
( ~ sQ85_spl
| ~ sQ70_spl
| ~ sQ1_spl
| sQ44_spl
| ~ is_a_theorem(or(implies(sK29_skl,sK28_skl),not(equiv(sK28_skl,sK29_skl)))) ),
inference(resolution,[status(thm)],[f738,f527]) ).
fof(f1848,plain,
( ~ sQ85_spl
| ~ sQ70_spl
| ~ sQ1_spl
| sQ44_spl
| ~ sQ87_spl
| ~ sQ83_spl
| ~ sQ13_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f1841,f1197]) ).
fof(f1849,plain,
( ~ sQ85_spl
| ~ sQ70_spl
| ~ sQ1_spl
| sQ44_spl
| ~ sQ87_spl
| ~ sQ83_spl
| ~ sQ13_spl ),
inference(contradiction_clause,[status(thm)],[f1848]) ).
fof(f1850,plain,
( ~ sQ42_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f337,f180]) ).
fof(f1851,plain,
~ sQ42_spl,
inference(contradiction_clause,[status(thm)],[f1850]) ).
fof(f1852,plain,
$false,
inference(sat_refutation,[status(thm)],[f187,f346,f432,f443,f490,f497,f504,f506,f508,f512,f514,f531,f555,f574,f1849,f1851]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL494+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/15.43 % CPULimit : 300
% 0.08/15.43 % WCLimit : 300
% 0.08/15.43 % DateTime : Mon Sep 21 00:36:30 UTC 2026
% 0.08/15.43 % CPUTime :
% 0.08/15.44 % Drodi V4.1.1
% 0.08/15.48 % Refutation found
% 0.08/15.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/15.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.32/15.51 % Elapsed time: 0.066040 seconds
% 0.32/15.51 % CPU time: 0.249735 seconds
% 0.32/15.51 % Total memory used: 88.343 MB
% 0.32/15.51 % Net memory used: 88.123 MB
%------------------------------------------------------------------------------