TSTP Solution File: SWC048+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC048+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n014.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 : Wed Aug 31 18:41:23 EDT 2022
% Result : Theorem 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 10 unt; 0 def)
% Number of atoms : 316 ( 116 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 380 ( 118 ~; 121 |; 121 &)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 63 ( 37 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f685,plain,
$false,
inference(subsumption_resolution,[],[f684,f623]) ).
fof(f623,plain,
nil != sK25,
inference(subsumption_resolution,[],[f622,f520]) ).
fof(f520,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f622,plain,
( ~ ssList(nil)
| nil != sK25 ),
inference(resolution,[],[f594,f616]) ).
fof(f616,plain,
( neq(nil,nil)
| nil != sK25 ),
inference(backward_demodulation,[],[f434,f613]) ).
fof(f613,plain,
nil = sK26,
inference(subsumption_resolution,[],[f612,f603]) ).
fof(f603,plain,
( neq(sK25,nil)
| nil = sK26 ),
inference(backward_demodulation,[],[f601,f431]) ).
fof(f431,plain,
sK26 = sK28,
inference(cnf_transformation,[],[f280]) ).
fof(f280,plain,
( ssList(sK26)
& ( ( nil = sK28
& nil = sK27 )
| ( neq(sK27,nil)
& rearsegP(sK28,sK27) ) )
& ( ( neq(sK26,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(sK26,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK26
& nil != sK25 ) )
& sK26 = sK28
& ssList(sK28)
& sK27 = sK25
& ssList(sK27)
& ssList(sK25) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK25,sK26,sK27,sK28])],[f205,f279,f278,f277,f276]) ).
fof(f276,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != X0 ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != sK25 ) )
& X1 = X3
& ssList(X3)
& sK25 = X2 )
& ssList(X2) ) )
& ssList(sK25) ) ),
introduced(choice_axiom,[]) ).
fof(f277,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != sK25 ) )
& X1 = X3
& ssList(X3)
& sK25 = X2 )
& ssList(X2) ) )
=> ( ssList(sK26)
& ? [X2] :
( ? [X3] :
( ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ( ( neq(sK26,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(sK26,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK26
& nil != sK25 ) )
& sK26 = X3
& ssList(X3)
& sK25 = X2 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f278,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ( ( neq(sK26,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(sK26,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK26
& nil != sK25 ) )
& sK26 = X3
& ssList(X3)
& sK25 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = X3
& nil = sK27 )
| ( neq(sK27,nil)
& rearsegP(X3,sK27) ) )
& ( ( neq(sK26,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(sK26,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK26
& nil != sK25 ) )
& sK26 = X3
& ssList(X3)
& sK27 = sK25 )
& ssList(sK27) ) ),
introduced(choice_axiom,[]) ).
fof(f279,plain,
( ? [X3] :
( ( ( nil = X3
& nil = sK27 )
| ( neq(sK27,nil)
& rearsegP(X3,sK27) ) )
& ( ( neq(sK26,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(sK26,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK26
& nil != sK25 ) )
& sK26 = X3
& ssList(X3)
& sK27 = sK25 )
=> ( ( ( nil = sK28
& nil = sK27 )
| ( neq(sK27,nil)
& rearsegP(sK28,sK27) ) )
& ( ( neq(sK26,nil)
& ! [X4] :
( ~ rearsegP(sK25,X4)
| ~ rearsegP(sK26,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK26
& nil != sK25 ) )
& sK26 = sK28
& ssList(sK28)
& sK27 = sK25 ) ),
introduced(choice_axiom,[]) ).
fof(f205,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != X0 ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f204]) ).
fof(f204,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != X0 ) )
& X0 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( neq(X4,nil)
& rearsegP(X0,X4)
& ssList(X4)
& rearsegP(X1,X4) )
| ~ neq(X1,nil) )
& ( nil != X1
| nil = X0 ) )
| X0 != X2
| ( ( nil != X2
| nil != X3 )
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( neq(X4,nil)
& rearsegP(X0,X4)
& ssList(X4)
& rearsegP(X1,X4) )
| ~ neq(X1,nil) )
& ( nil != X1
| nil = X0 ) )
| X0 != X2
| ( ( nil != X2
| nil != X3 )
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f601,plain,
( neq(sK25,nil)
| nil = sK28 ),
inference(forward_demodulation,[],[f439,f429]) ).
fof(f429,plain,
sK27 = sK25,
inference(cnf_transformation,[],[f280]) ).
fof(f439,plain,
( neq(sK27,nil)
| nil = sK28 ),
inference(cnf_transformation,[],[f280]) ).
fof(f612,plain,
( ~ neq(sK25,nil)
| nil = sK26 ),
inference(subsumption_resolution,[],[f611,f607]) ).
fof(f607,plain,
( rearsegP(sK26,sK25)
| nil = sK26 ),
inference(forward_demodulation,[],[f605,f431]) ).
fof(f605,plain,
( nil = sK28
| rearsegP(sK26,sK25) ),
inference(backward_demodulation,[],[f595,f431]) ).
fof(f595,plain,
( nil = sK28
| rearsegP(sK28,sK25) ),
inference(backward_demodulation,[],[f438,f429]) ).
fof(f438,plain,
( rearsegP(sK28,sK27)
| nil = sK28 ),
inference(cnf_transformation,[],[f280]) ).
fof(f611,plain,
( nil = sK26
| ~ rearsegP(sK26,sK25)
| ~ neq(sK25,nil) ),
inference(subsumption_resolution,[],[f610,f600]) ).
fof(f600,plain,
ssList(sK25),
inference(forward_demodulation,[],[f428,f429]) ).
fof(f428,plain,
ssList(sK27),
inference(cnf_transformation,[],[f280]) ).
fof(f610,plain,
( nil = sK26
| ~ ssList(sK25)
| ~ rearsegP(sK26,sK25)
| ~ neq(sK25,nil) ),
inference(duplicate_literal_removal,[],[f609]) ).
fof(f609,plain,
( ~ ssList(sK25)
| ~ ssList(sK25)
| ~ rearsegP(sK26,sK25)
| ~ neq(sK25,nil)
| nil = sK26 ),
inference(resolution,[],[f498,f433]) ).
fof(f433,plain,
! [X4] :
( ~ rearsegP(sK25,X4)
| nil = sK26
| ~ rearsegP(sK26,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ),
inference(cnf_transformation,[],[f280]) ).
fof(f498,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f176,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f434,plain,
( neq(sK26,nil)
| nil != sK25 ),
inference(cnf_transformation,[],[f280]) ).
fof(f594,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f564]) ).
fof(f564,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f368]) ).
fof(f368,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f237]) ).
fof(f237,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0] :
( ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f684,plain,
nil = sK25,
inference(subsumption_resolution,[],[f681,f600]) ).
fof(f681,plain,
( ~ ssList(sK25)
| nil = sK25 ),
inference(duplicate_literal_removal,[],[f676]) ).
fof(f676,plain,
( nil = sK25
| ~ ssList(sK25)
| nil = sK25 ),
inference(resolution,[],[f425,f619]) ).
fof(f619,plain,
( rearsegP(nil,sK25)
| nil = sK25 ),
inference(backward_demodulation,[],[f604,f613]) ).
fof(f604,plain,
( rearsegP(sK26,sK25)
| nil = sK25 ),
inference(backward_demodulation,[],[f597,f431]) ).
fof(f597,plain,
( rearsegP(sK28,sK25)
| nil = sK25 ),
inference(forward_demodulation,[],[f596,f429]) ).
fof(f596,plain,
( nil = sK25
| rearsegP(sK28,sK27) ),
inference(forward_demodulation,[],[f436,f429]) ).
fof(f436,plain,
( nil = sK27
| rearsegP(sK28,sK27) ),
inference(cnf_transformation,[],[f280]) ).
fof(f425,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f275]) ).
fof(f275,plain,
! [X0] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f152]) ).
fof(f152,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC048+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:02:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.50 % (3087)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.50 % (3079)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.50 % (3076)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.51 % (3084)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.21/0.51 % (3073)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (3070)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (3068)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (3067)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (3072)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.53 % (3069)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.53 % (3065)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.53 % (3066)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.53 % (3074)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.53 % (3086)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.53 % (3071)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.53 % (3064)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.53 % (3077)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.53 % (3072)Instruction limit reached!
% 0.21/0.53 % (3072)------------------------------
% 0.21/0.53 % (3072)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (3080)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.53 % (3072)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (3072)Termination reason: Unknown
% 0.21/0.53 % (3072)Termination phase: Unused predicate definition removal
% 0.21/0.53
% 0.21/0.53 % (3072)Memory used [KB]: 895
% 0.21/0.53 % (3072)Time elapsed: 0.003 s
% 0.21/0.53 % (3072)Instructions burned: 2 (million)
% 0.21/0.53 % (3072)------------------------------
% 0.21/0.53 % (3072)------------------------------
% 0.21/0.54 % (3079)First to succeed.
% 0.21/0.54 % (3078)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.54 % (3092)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.54 % (3090)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.54 % (3079)Refutation found. Thanks to Tanya!
% 0.21/0.54 % SZS status Theorem for theBenchmark
% 0.21/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54 % (3079)------------------------------
% 0.21/0.54 % (3079)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (3079)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (3079)Termination reason: Refutation
% 0.21/0.54
% 0.21/0.54 % (3079)Memory used [KB]: 1535
% 0.21/0.54 % (3079)Time elapsed: 0.094 s
% 0.21/0.54 % (3079)Instructions burned: 20 (million)
% 0.21/0.54 % (3079)------------------------------
% 0.21/0.54 % (3079)------------------------------
% 0.21/0.54 % (3062)Success in time 0.182 s
%------------------------------------------------------------------------------