TSTP Solution File: CSR018+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n029.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 : 300s
% DateTime : Tue Apr 30 20:14:19 EDT 2024
% Result : Theorem 1.68s 0.62s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of formulae : 105 ( 23 unt; 0 def)
% Number of atoms : 344 ( 120 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 370 ( 131 ~; 139 |; 77 &)
% ( 22 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 9 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 130 ( 129 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [Event,Time,Fluent] :
( ( happens(Event,Time)
& initiates(Event,Fluent,Time) )
=> holdsAt(Fluent,plus(Time,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [Event,Fluent,Time] :
( initiates(Event,Fluent,Time)
<=> ( ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) )
| ( Event = pull
& Fluent = spinning
& happens(push,Time) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [Event,Time] :
( happens(Event,Time)
<=> ( ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 )
| ( Event = pull
& Time = n2 )
| ( Event = push
& Time = n2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f32,axiom,
! [X,Y] :
( less_or_equal(X,Y)
<=> ( less(X,Y)
| X = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,axiom,
~ ? [X] : less(X,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f34,axiom,
! [X] :
( less(X,n1)
<=> less_or_equal(X,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f35,axiom,
! [X] :
( less(X,n2)
<=> less_or_equal(X,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f43,axiom,
! [X,Y] :
( less(X,Y)
<=> ( ~ less(Y,X)
& Y != X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f48,conjecture,
holdsAt(backwards,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f49,negated_conjecture,
~ holdsAt(backwards,n2),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f88,plain,
! [Event,Time,Fluent] :
( ~ happens(Event,Time)
| ~ initiates(Event,Fluent,Time)
| holdsAt(Fluent,plus(Time,n1)) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f89,plain,
! [Time,Fluent] :
( ! [Event] :
( ~ happens(Event,Time)
| ~ initiates(Event,Fluent,Time) )
| holdsAt(Fluent,plus(Time,n1)) ),
inference(miniscoping,[status(esa)],[f88]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ~ happens(X0,X1)
| ~ initiates(X0,X2,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[status(esa)],[f89]) ).
fof(f101,plain,
! [Event,Fluent,Time] :
( pd0_0(Time,Fluent,Event)
<=> ( ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) ) ),
introduced(predicate_definition,[f13]) ).
fof(f102,plain,
! [Event,Fluent,Time] :
( initiates(Event,Fluent,Time)
<=> ( pd0_0(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& happens(push,Time) ) ) ),
inference(formula_renaming,[status(thm)],[f13,f101]) ).
fof(f103,plain,
! [Event,Fluent,Time] :
( ( ~ initiates(Event,Fluent,Time)
| pd0_0(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& happens(push,Time) ) )
& ( initiates(Event,Fluent,Time)
| ( ~ pd0_0(Time,Fluent,Event)
& ( Event != pull
| Fluent != spinning
| ~ happens(push,Time) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f102]) ).
fof(f104,plain,
( ! [Event,Fluent,Time] :
( ~ initiates(Event,Fluent,Time)
| pd0_0(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& happens(push,Time) ) )
& ! [Event,Fluent,Time] :
( initiates(Event,Fluent,Time)
| ( ~ pd0_0(Time,Fluent,Event)
& ( Event != pull
| Fluent != spinning
| ~ happens(push,Time) ) ) ) ),
inference(miniscoping,[status(esa)],[f103]) ).
fof(f108,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
| ~ pd0_0(X2,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f104]) ).
fof(f120,plain,
! [Event,Time] :
( pd0_2(Time,Event)
<=> ( ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 )
| ( Event = pull
& Time = n2 ) ) ),
introduced(predicate_definition,[f16]) ).
fof(f121,plain,
! [Event,Time] :
( happens(Event,Time)
<=> ( pd0_2(Time,Event)
| ( Event = push
& Time = n2 ) ) ),
inference(formula_renaming,[status(thm)],[f16,f120]) ).
fof(f122,plain,
! [Event,Time] :
( ( ~ happens(Event,Time)
| pd0_2(Time,Event)
| ( Event = push
& Time = n2 ) )
& ( happens(Event,Time)
| ( ~ pd0_2(Time,Event)
& ( Event != push
| Time != n2 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f121]) ).
fof(f123,plain,
( ! [Event,Time] :
( ~ happens(Event,Time)
| pd0_2(Time,Event)
| ( Event = push
& Time = n2 ) )
& ! [Event,Time] :
( happens(Event,Time)
| ( ~ pd0_2(Time,Event)
& ( Event != push
| Time != n2 ) ) ) ),
inference(miniscoping,[status(esa)],[f122]) ).
fof(f125,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| pd0_2(X1,X0)
| X1 = n2 ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f126,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ pd0_2(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f128,plain,
push != pull,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f136,plain,
plus(n1,n1) = n2,
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f143,plain,
! [X,Y] :
( ( ~ less_or_equal(X,Y)
| less(X,Y)
| X = Y )
& ( less_or_equal(X,Y)
| ( ~ less(X,Y)
& X != Y ) ) ),
inference(NNF_transformation,[status(esa)],[f32]) ).
fof(f144,plain,
( ! [X,Y] :
( ~ less_or_equal(X,Y)
| less(X,Y)
| X = Y )
& ! [X,Y] :
( less_or_equal(X,Y)
| ( ~ less(X,Y)
& X != Y ) ) ),
inference(miniscoping,[status(esa)],[f143]) ).
fof(f147,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f144]) ).
fof(f148,plain,
! [X] : ~ less(X,n0),
inference(pre_NNF_transformation,[status(esa)],[f33]) ).
fof(f149,plain,
! [X0] : ~ less(X0,n0),
inference(cnf_transformation,[status(esa)],[f148]) ).
fof(f150,plain,
! [X] :
( ( ~ less(X,n1)
| less_or_equal(X,n0) )
& ( less(X,n1)
| ~ less_or_equal(X,n0) ) ),
inference(NNF_transformation,[status(esa)],[f34]) ).
fof(f151,plain,
( ! [X] :
( ~ less(X,n1)
| less_or_equal(X,n0) )
& ! [X] :
( less(X,n1)
| ~ less_or_equal(X,n0) ) ),
inference(miniscoping,[status(esa)],[f150]) ).
fof(f153,plain,
! [X0] :
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(cnf_transformation,[status(esa)],[f151]) ).
fof(f154,plain,
! [X] :
( ( ~ less(X,n2)
| less_or_equal(X,n1) )
& ( less(X,n2)
| ~ less_or_equal(X,n1) ) ),
inference(NNF_transformation,[status(esa)],[f35]) ).
fof(f155,plain,
( ! [X] :
( ~ less(X,n2)
| less_or_equal(X,n1) )
& ! [X] :
( less(X,n2)
| ~ less_or_equal(X,n1) ) ),
inference(miniscoping,[status(esa)],[f154]) ).
fof(f157,plain,
! [X0] :
( less(X0,n2)
| ~ less_or_equal(X0,n1) ),
inference(cnf_transformation,[status(esa)],[f155]) ).
fof(f186,plain,
! [X,Y] :
( ( ~ less(X,Y)
| ( ~ less(Y,X)
& Y != X ) )
& ( less(X,Y)
| less(Y,X)
| Y = X ) ),
inference(NNF_transformation,[status(esa)],[f43]) ).
fof(f187,plain,
( ! [X,Y] :
( ~ less(X,Y)
| ( ~ less(Y,X)
& Y != X ) )
& ! [X,Y] :
( less(X,Y)
| less(Y,X)
| Y = X ) ),
inference(miniscoping,[status(esa)],[f186]) ).
fof(f189,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X1 != X0 ),
inference(cnf_transformation,[status(esa)],[f187]) ).
fof(f195,plain,
~ holdsAt(backwards,n2),
inference(cnf_transformation,[status(esa)],[f49]) ).
fof(f196,plain,
! [Event,Fluent,Time] :
( pd0_3(Time,Fluent,Event)
<=> ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) ) ),
introduced(predicate_definition,[f101]) ).
fof(f197,plain,
! [Event,Fluent,Time] :
( pd0_0(Time,Fluent,Event)
<=> ( pd0_3(Time,Fluent,Event)
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) ) ),
inference(formula_renaming,[status(thm)],[f101,f196]) ).
fof(f198,plain,
! [Event,Fluent,Time] :
( ( ~ pd0_0(Time,Fluent,Event)
| pd0_3(Time,Fluent,Event)
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) )
& ( pd0_0(Time,Fluent,Event)
| ( ~ pd0_3(Time,Fluent,Event)
& ( Event != pull
| Fluent != backwards
| happens(push,Time) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f197]) ).
fof(f199,plain,
( ! [Event,Fluent,Time] :
( ~ pd0_0(Time,Fluent,Event)
| pd0_3(Time,Fluent,Event)
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) )
& ! [Event,Fluent,Time] :
( pd0_0(Time,Fluent,Event)
| ( ~ pd0_3(Time,Fluent,Event)
& ( Event != pull
| Fluent != backwards
| happens(push,Time) ) ) ) ),
inference(miniscoping,[status(esa)],[f198]) ).
fof(f204,plain,
! [X0,X1,X2] :
( pd0_0(X0,X1,X2)
| X2 != pull
| X1 != backwards
| happens(push,X0) ),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f214,plain,
! [Event,Time] :
( pd0_5(Time,Event)
<=> ( ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 ) ) ),
introduced(predicate_definition,[f120]) ).
fof(f215,plain,
! [Event,Time] :
( pd0_2(Time,Event)
<=> ( pd0_5(Time,Event)
| ( Event = pull
& Time = n2 ) ) ),
inference(formula_renaming,[status(thm)],[f120,f214]) ).
fof(f216,plain,
! [Event,Time] :
( ( ~ pd0_2(Time,Event)
| pd0_5(Time,Event)
| ( Event = pull
& Time = n2 ) )
& ( pd0_2(Time,Event)
| ( ~ pd0_5(Time,Event)
& ( Event != pull
| Time != n2 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f215]) ).
fof(f217,plain,
( ! [Event,Time] :
( ~ pd0_2(Time,Event)
| pd0_5(Time,Event)
| ( Event = pull
& Time = n2 ) )
& ! [Event,Time] :
( pd0_2(Time,Event)
| ( ~ pd0_5(Time,Event)
& ( Event != pull
| Time != n2 ) ) ) ),
inference(miniscoping,[status(esa)],[f216]) ).
fof(f219,plain,
! [X0,X1] :
( ~ pd0_2(X0,X1)
| pd0_5(X0,X1)
| X0 = n2 ),
inference(cnf_transformation,[status(esa)],[f217]) ).
fof(f220,plain,
! [X0,X1] :
( pd0_2(X0,X1)
| ~ pd0_5(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f217]) ).
fof(f237,plain,
! [Event,Time] :
( ( ~ pd0_5(Time,Event)
| ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 ) )
& ( pd0_5(Time,Event)
| ( ( Event != push
| Time != n0 )
& ( Event != pull
| Time != n1 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f214]) ).
fof(f238,plain,
( ! [Event,Time] :
( ~ pd0_5(Time,Event)
| ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 ) )
& ! [Event,Time] :
( pd0_5(Time,Event)
| ( ( Event != push
| Time != n0 )
& ( Event != pull
| Time != n1 ) ) ) ),
inference(miniscoping,[status(esa)],[f237]) ).
fof(f241,plain,
! [X0,X1] :
( ~ pd0_5(X0,X1)
| X0 = n0
| X1 = pull ),
inference(cnf_transformation,[status(esa)],[f238]) ).
fof(f244,plain,
! [X0,X1] :
( pd0_5(X0,X1)
| X1 != pull
| X0 != n1 ),
inference(cnf_transformation,[status(esa)],[f238]) ).
fof(f272,plain,
! [X0] : less_or_equal(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f147]) ).
fof(f273,plain,
! [X0] : ~ less(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f189]) ).
fof(f274,plain,
! [X0] :
( pd0_0(X0,backwards,pull)
| happens(push,X0) ),
inference(destructive_equality_resolution,[status(esa)],[f204]) ).
fof(f280,plain,
pd0_5(n1,pull),
inference(destructive_equality_resolution,[status(esa)],[f244]) ).
fof(f284,plain,
less(n1,n2),
inference(resolution,[status(thm)],[f272,f157]) ).
fof(f298,plain,
pd0_2(n1,pull),
inference(resolution,[status(thm)],[f220,f280]) ).
fof(f300,plain,
happens(pull,n1),
inference(resolution,[status(thm)],[f298,f126]) ).
fof(f307,plain,
( spl0_1
<=> n1 = n2 ),
introduced(split_symbol_definition) ).
fof(f308,plain,
( n1 = n2
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f307]) ).
fof(f324,plain,
( spl0_3
<=> n1 = n0 ),
introduced(split_symbol_definition) ).
fof(f325,plain,
( n1 = n0
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f324]) ).
fof(f330,plain,
less(n0,n1),
inference(resolution,[status(thm)],[f153,f272]) ).
fof(f799,plain,
! [X0,X1] :
( ~ happens(X0,n1)
| ~ initiates(X0,X1,n1)
| holdsAt(X1,n2) ),
inference(paramodulation,[status(thm)],[f136,f90]) ).
fof(f1033,plain,
( spl0_107
<=> happens(push,n1) ),
introduced(split_symbol_definition) ).
fof(f1034,plain,
( happens(push,n1)
| ~ spl0_107 ),
inference(component_clause,[status(thm)],[f1033]) ).
fof(f1036,plain,
( spl0_108
<=> happens(pull,n1) ),
introduced(split_symbol_definition) ).
fof(f1038,plain,
( ~ happens(pull,n1)
| spl0_108 ),
inference(component_clause,[status(thm)],[f1036]) ).
fof(f1058,plain,
( $false
| spl0_108 ),
inference(forward_subsumption_resolution,[status(thm)],[f1038,f300]) ).
fof(f1059,plain,
spl0_108,
inference(contradiction_clause,[status(thm)],[f1058]) ).
fof(f1366,plain,
( less(n1,n1)
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f308,f284]) ).
fof(f1367,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f1366,f273]) ).
fof(f1368,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f1367]) ).
fof(f1574,plain,
( spl0_141
<=> pull = push ),
introduced(split_symbol_definition) ).
fof(f1575,plain,
( pull = push
| ~ spl0_141 ),
inference(component_clause,[status(thm)],[f1574]) ).
fof(f1593,plain,
( $false
| ~ spl0_141 ),
inference(forward_subsumption_resolution,[status(thm)],[f1575,f128]) ).
fof(f1594,plain,
~ spl0_141,
inference(contradiction_clause,[status(thm)],[f1593]) ).
fof(f1934,plain,
! [X0] :
( happens(push,X0)
| initiates(pull,backwards,X0) ),
inference(resolution,[status(thm)],[f274,f108]) ).
fof(f2802,plain,
( less(n0,n0)
| ~ spl0_3 ),
inference(backward_demodulation,[status(thm)],[f325,f330]) ).
fof(f2803,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f2802,f149]) ).
fof(f2804,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f2803]) ).
fof(f3047,plain,
( spl0_191
<=> pd0_2(n1,push) ),
introduced(split_symbol_definition) ).
fof(f3048,plain,
( pd0_2(n1,push)
| ~ spl0_191 ),
inference(component_clause,[status(thm)],[f3047]) ).
fof(f3050,plain,
( pd0_2(n1,push)
| n1 = n2
| ~ spl0_107 ),
inference(resolution,[status(thm)],[f1034,f125]) ).
fof(f3051,plain,
( spl0_191
| spl0_1
| ~ spl0_107 ),
inference(split_clause,[status(thm)],[f3050,f3047,f307,f1033]) ).
fof(f4176,plain,
( spl0_220
<=> holdsAt(backwards,n2) ),
introduced(split_symbol_definition) ).
fof(f4177,plain,
( holdsAt(backwards,n2)
| ~ spl0_220 ),
inference(component_clause,[status(thm)],[f4176]) ).
fof(f4179,plain,
( happens(push,n1)
| ~ happens(pull,n1)
| holdsAt(backwards,n2) ),
inference(resolution,[status(thm)],[f1934,f799]) ).
fof(f4180,plain,
( spl0_107
| ~ spl0_108
| spl0_220 ),
inference(split_clause,[status(thm)],[f4179,f1033,f1036,f4176]) ).
fof(f4251,plain,
( $false
| ~ spl0_220 ),
inference(forward_subsumption_resolution,[status(thm)],[f4177,f195]) ).
fof(f4252,plain,
~ spl0_220,
inference(contradiction_clause,[status(thm)],[f4251]) ).
fof(f4307,plain,
( spl0_230
<=> pd0_5(n1,push) ),
introduced(split_symbol_definition) ).
fof(f4308,plain,
( pd0_5(n1,push)
| ~ spl0_230 ),
inference(component_clause,[status(thm)],[f4307]) ).
fof(f4310,plain,
( pd0_5(n1,push)
| n1 = n2
| ~ spl0_191 ),
inference(resolution,[status(thm)],[f3048,f219]) ).
fof(f4311,plain,
( spl0_230
| spl0_1
| ~ spl0_191 ),
inference(split_clause,[status(thm)],[f4310,f4307,f307,f3047]) ).
fof(f4323,plain,
( n1 = n0
| push = pull
| ~ spl0_230 ),
inference(resolution,[status(thm)],[f4308,f241]) ).
fof(f4324,plain,
( spl0_3
| spl0_141
| ~ spl0_230 ),
inference(split_clause,[status(thm)],[f4323,f324,f1574,f4307]) ).
fof(f4327,plain,
$false,
inference(sat_refutation,[status(thm)],[f1059,f1368,f1594,f2804,f3051,f4180,f4252,f4311,f4324]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 30 00:11:34 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 1.68/0.62 % Refutation found
% 1.68/0.62 % SZS status Theorem for theBenchmark: Theorem is valid
% 1.68/0.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.68/0.64 % Elapsed time: 0.287938 seconds
% 1.68/0.64 % CPU time: 2.149074 seconds
% 1.68/0.64 % Total memory used: 93.984 MB
% 1.68/0.64 % Net memory used: 90.651 MB
%------------------------------------------------------------------------------