TSTP Solution File: SWC017+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC017+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 : n021.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:13 EDT 2022
% Result : Theorem 1.35s 0.53s
% Output : Refutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 60 ( 12 unt; 3 typ; 0 def)
% Number of atoms : 310 ( 109 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 377 ( 124 ~; 125 |; 110 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 62 ( 40 !; 22 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_27,type,
sQ58_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_28,type,
sQ59_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_29,type,
sQ60_eqProxy: ( $real * $real ) > $o ).
fof(f1212,plain,
$false,
inference(subsumption_resolution,[],[f1210,f721]) ).
fof(f721,plain,
ssList(nil),
inference(literal_reordering,[],[f453]) ).
fof(f453,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1210,plain,
~ ssList(nil),
inference(resolution,[],[f1199,f982]) ).
fof(f982,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f624]) ).
fof(f624,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(literal_reordering,[],[f584]) ).
fof(f584,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f465]) ).
fof(f465,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f288]) ).
fof(f288,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f122,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/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f1199,plain,
neq(nil,nil),
inference(subsumption_resolution,[],[f1170,f1198]) ).
fof(f1198,plain,
nil = sK6,
inference(subsumption_resolution,[],[f1197,f617]) ).
fof(f617,plain,
ssList(sK6),
inference(literal_reordering,[],[f350]) ).
fof(f350,plain,
ssList(sK6),
inference(cnf_transformation,[],[f235]) ).
fof(f235,plain,
( sK9 = sK7
& ssList(sK9)
& sK8 = sK6
& ( ( nil = sK9
& nil = sK8 )
| ( neq(sK8,nil)
& frontsegP(sK9,sK8) ) )
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK7,X4) ) )
| ( nil = sK7
& nil != sK6 ) )
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f137,f234,f233,f232,f231]) ).
fof(f231,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X0 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) ) )
| ( nil = X1
& nil != X0 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& sK6 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) ) )
| ( nil = X1
& nil != sK6 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f232,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& sK6 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) ) )
| ( nil = X1
& nil != sK6 ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK7 = X3
& ssList(X3)
& sK6 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK7,X4) ) )
| ( nil = sK7
& nil != sK6 ) ) )
& ssList(X2) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f233,plain,
( ? [X2] :
( ? [X3] :
( sK7 = X3
& ssList(X3)
& sK6 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK7,X4) ) )
| ( nil = sK7
& nil != sK6 ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK7 = X3
& ssList(X3)
& sK8 = sK6
& ( ( nil = X3
& nil = sK8 )
| ( neq(sK8,nil)
& frontsegP(X3,sK8) ) )
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK7,X4) ) )
| ( nil = sK7
& nil != sK6 ) ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f234,plain,
( ? [X3] :
( sK7 = X3
& ssList(X3)
& sK8 = sK6
& ( ( nil = X3
& nil = sK8 )
| ( neq(sK8,nil)
& frontsegP(X3,sK8) ) )
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK7,X4) ) )
| ( nil = sK7
& nil != sK6 ) ) )
=> ( sK9 = sK7
& ssList(sK9)
& sK8 = sK6
& ( ( nil = sK9
& nil = sK8 )
| ( neq(sK8,nil)
& frontsegP(sK9,sK8) ) )
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK7,X4) ) )
| ( nil = sK7
& nil != sK6 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X0 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ( ( neq(X1,nil)
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) ) )
| ( nil = X1
& nil != X0 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| X1 != X3
| ~ ssList(X3)
| ( ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) )
& ( nil != X3
| nil != X2 ) )
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X0,X4)
& frontsegP(X1,X4) ) )
& ( nil = X0
| nil != X1 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| X1 != X3
| ~ ssList(X3)
| ( ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) )
& ( nil != X3
| nil != X2 ) )
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X0,X4)
& frontsegP(X1,X4) ) )
& ( nil = X0
| nil != X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f1197,plain,
( nil = sK6
| ~ ssList(sK6) ),
inference(duplicate_literal_removal,[],[f1196]) ).
fof(f1196,plain,
( nil = sK6
| nil = sK6
| ~ ssList(sK6) ),
inference(resolution,[],[f1172,f757]) ).
fof(f757,plain,
! [X0] :
( ~ frontsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(literal_reordering,[],[f462]) ).
fof(f462,plain,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f287]) ).
fof(f287,plain,
! [X0] :
( ~ ssList(X0)
| ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ~ ssList(X0)
| ( frontsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f1172,plain,
( frontsegP(nil,sK6)
| nil = sK6 ),
inference(backward_demodulation,[],[f642,f1139]) ).
fof(f1139,plain,
nil = sK7,
inference(subsumption_resolution,[],[f1138,f739]) ).
fof(f739,plain,
( neq(sK6,nil)
| nil = sK7 ),
inference(literal_reordering,[],[f561]) ).
fof(f561,plain,
( neq(sK6,nil)
| nil = sK7 ),
inference(definition_unfolding,[],[f360,f363,f361]) ).
fof(f361,plain,
sK8 = sK6,
inference(cnf_transformation,[],[f235]) ).
fof(f363,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f235]) ).
fof(f360,plain,
( nil = sK9
| neq(sK8,nil) ),
inference(cnf_transformation,[],[f235]) ).
fof(f1138,plain,
( nil = sK7
| ~ neq(sK6,nil) ),
inference(subsumption_resolution,[],[f1137,f631]) ).
fof(f631,plain,
( frontsegP(sK7,sK6)
| nil = sK7 ),
inference(literal_reordering,[],[f562]) ).
fof(f562,plain,
( frontsegP(sK7,sK6)
| nil = sK7 ),
inference(definition_unfolding,[],[f359,f363,f363,f361]) ).
fof(f359,plain,
( nil = sK9
| frontsegP(sK9,sK8) ),
inference(cnf_transformation,[],[f235]) ).
fof(f1137,plain,
( nil = sK7
| ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) ),
inference(subsumption_resolution,[],[f1136,f617]) ).
fof(f1136,plain,
( ~ neq(sK6,nil)
| ~ ssList(sK6)
| nil = sK7
| ~ frontsegP(sK7,sK6) ),
inference(duplicate_literal_removal,[],[f1135]) ).
fof(f1135,plain,
( ~ ssList(sK6)
| ~ ssList(sK6)
| nil = sK7
| ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) ),
inference(resolution,[],[f766,f787]) ).
fof(f787,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(literal_reordering,[],[f460]) ).
fof(f460,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(cnf_transformation,[],[f213]) ).
fof(f213,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax42) ).
fof(f766,plain,
! [X4] :
( ~ frontsegP(sK6,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| nil = sK7
| ~ frontsegP(sK7,X4) ),
inference(literal_reordering,[],[f354]) ).
fof(f354,plain,
! [X4] :
( ~ frontsegP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ frontsegP(sK7,X4)
| nil = sK7 ),
inference(cnf_transformation,[],[f235]) ).
fof(f642,plain,
( frontsegP(sK7,sK6)
| nil = sK6 ),
inference(literal_reordering,[],[f564]) ).
fof(f564,plain,
( frontsegP(sK7,sK6)
| nil = sK6 ),
inference(definition_unfolding,[],[f357,f361,f363,f361]) ).
fof(f357,plain,
( nil = sK8
| frontsegP(sK9,sK8) ),
inference(cnf_transformation,[],[f235]) ).
fof(f1170,plain,
( nil != sK6
| neq(nil,nil) ),
inference(backward_demodulation,[],[f625,f1139]) ).
fof(f625,plain,
( neq(sK7,nil)
| nil != sK6 ),
inference(literal_reordering,[],[f355]) ).
fof(f355,plain,
( neq(sK7,nil)
| nil != sK6 ),
inference(cnf_transformation,[],[f235]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC017+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 17:51:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.48 % (26529)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.20/0.49 % (26529)Refutation not found, incomplete strategy% (26529)------------------------------
% 0.20/0.49 % (26529)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (26542)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.20/0.51 % (26532)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (26529)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (26529)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (26529)Memory used [KB]: 6012
% 0.20/0.51 % (26529)Time elapsed: 0.084 s
% 0.20/0.51 % (26529)Instructions burned: 21 (million)
% 0.20/0.51 % (26529)------------------------------
% 0.20/0.51 % (26529)------------------------------
% 0.20/0.51 % (26540)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.20/0.52 % (26534)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.20/0.52 % (26528)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.20/0.52 % (26536)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.35/0.52 % (26550)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)
% 1.35/0.52 % (26536)Instruction limit reached!
% 1.35/0.52 % (26536)------------------------------
% 1.35/0.52 % (26536)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.35/0.52 % (26536)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.35/0.52 % (26536)Termination reason: Unknown
% 1.35/0.52 % (26536)Termination phase: Preprocessing 2
% 1.35/0.52
% 1.35/0.52 % (26536)Memory used [KB]: 1023
% 1.35/0.52 % (26536)Time elapsed: 0.004 s
% 1.35/0.52 % (26536)Instructions burned: 2 (million)
% 1.35/0.52 % (26536)------------------------------
% 1.35/0.52 % (26536)------------------------------
% 1.35/0.53 % (26543)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)
% 1.35/0.53 % (26542)First to succeed.
% 1.35/0.53 % (26537)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)
% 1.35/0.53 % (26554)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)
% 1.35/0.53 % (26555)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.35/0.53 % (26531)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)
% 1.35/0.53 % (26556)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.35/0.53 % (26551)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)
% 1.35/0.53 % (26542)Refutation found. Thanks to Tanya!
% 1.35/0.53 % SZS status Theorem for theBenchmark
% 1.35/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.35/0.53 % (26542)------------------------------
% 1.35/0.53 % (26542)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.35/0.53 % (26542)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.35/0.53 % (26542)Termination reason: Refutation
% 1.35/0.53
% 1.35/0.53 % (26542)Memory used [KB]: 6524
% 1.35/0.53 % (26542)Time elapsed: 0.019 s
% 1.35/0.53 % (26542)Instructions burned: 28 (million)
% 1.35/0.53 % (26542)------------------------------
% 1.35/0.53 % (26542)------------------------------
% 1.35/0.53 % (26527)Success in time 0.178 s
%------------------------------------------------------------------------------