TSTP Solution File: SWC317+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC317+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_uns --cores 0 -t %d %s
% Computer : n024.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:40:23 EDT 2022
% Result : Theorem 0.21s 0.60s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 5 unt; 0 def)
% Number of atoms : 334 ( 114 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 421 ( 134 ~; 113 |; 150 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 102 ( 44 !; 58 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f665,plain,
$false,
inference(avatar_sat_refutation,[],[f601,f620,f640,f653,f658,f659,f664]) ).
fof(f664,plain,
( ~ spl53_8
| ~ spl53_10
| ~ spl53_2
| ~ spl53_5
| ~ spl53_9 ),
inference(avatar_split_clause,[],[f663,f631,f612,f597,f637,f626]) ).
fof(f626,plain,
( spl53_8
<=> ssList(sK23) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_8])]) ).
fof(f637,plain,
( spl53_10
<=> ssItem(sK22) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_10])]) ).
fof(f597,plain,
( spl53_2
<=> app(sK23,cons(sK22,nil)) = sK19 ),
introduced(avatar_definition,[new_symbols(naming,[spl53_2])]) ).
fof(f612,plain,
( spl53_5
<=> ! [X6,X7] :
( app(X7,cons(X6,nil)) != sK19
| app(cons(X6,nil),X7) != sK20
| ~ ssList(X7)
| ~ ssItem(X6) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_5])]) ).
fof(f631,plain,
( spl53_9
<=> sK20 = app(cons(sK22,nil),sK23) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_9])]) ).
fof(f663,plain,
( ~ ssItem(sK22)
| ~ ssList(sK23)
| ~ spl53_2
| ~ spl53_5
| ~ spl53_9 ),
inference(trivial_inequality_removal,[],[f662]) ).
fof(f662,plain,
( sK19 != sK19
| ~ ssItem(sK22)
| ~ ssList(sK23)
| ~ spl53_2
| ~ spl53_5
| ~ spl53_9 ),
inference(forward_demodulation,[],[f661,f599]) ).
fof(f599,plain,
( app(sK23,cons(sK22,nil)) = sK19
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f661,plain,
( ~ ssItem(sK22)
| ~ ssList(sK23)
| app(sK23,cons(sK22,nil)) != sK19
| ~ spl53_5
| ~ spl53_9 ),
inference(trivial_inequality_removal,[],[f660]) ).
fof(f660,plain,
( ~ ssList(sK23)
| sK20 != sK20
| ~ ssItem(sK22)
| app(sK23,cons(sK22,nil)) != sK19
| ~ spl53_5
| ~ spl53_9 ),
inference(superposition,[],[f613,f633]) ).
fof(f633,plain,
( sK20 = app(cons(sK22,nil),sK23)
| ~ spl53_9 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f613,plain,
( ! [X6,X7] :
( app(cons(X6,nil),X7) != sK20
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK19
| ~ ssItem(X6) )
| ~ spl53_5 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f659,plain,
spl53_1,
inference(avatar_split_clause,[],[f591,f593]) ).
fof(f593,plain,
( spl53_1
<=> neq(sK19,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_1])]) ).
fof(f591,plain,
neq(sK19,nil),
inference(duplicate_literal_removal,[],[f412]) ).
fof(f412,plain,
( neq(sK19,nil)
| neq(sK19,nil) ),
inference(cnf_transformation,[],[f268]) ).
fof(f268,plain,
( ssList(sK19)
& ( ( neq(sK19,nil)
& ~ neq(sK21,nil) )
| ( neq(sK19,nil)
& app(sK23,cons(sK22,nil)) = sK21
& ssList(sK23)
& sK20 = app(cons(sK22,nil),sK23)
& ssItem(sK22)
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != sK19 )
| ~ ssItem(X6) ) ) )
& sK21 = sK19
& ssList(sK21)
& sK18 = sK20
& ssList(sK20)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22,sK23])],[f261,f267,f266,f265,f264,f263,f262]) ).
fof(f262,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = X2 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X0
| app(X7,cons(X6,nil)) != X1 )
| ~ ssItem(X6) ) ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = X2 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != X1 )
| ~ ssItem(X6) ) ) )
& X1 = X3
& ssList(X3)
& sK18 = X2 )
& ssList(X2) ) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f263,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = X2 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != X1 )
| ~ ssItem(X6) ) ) )
& X1 = X3
& ssList(X3)
& sK18 = X2 )
& ssList(X2) ) )
=> ( ssList(sK19)
& ? [X2] :
( ? [X3] :
( ( ( neq(sK19,nil)
& ~ neq(X3,nil) )
| ( neq(sK19,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = X2 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != sK19 )
| ~ ssItem(X6) ) ) )
& sK19 = X3
& ssList(X3)
& sK18 = X2 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f264,plain,
( ? [X2] :
( ? [X3] :
( ( ( neq(sK19,nil)
& ~ neq(X3,nil) )
| ( neq(sK19,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = X2 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != sK19 )
| ~ ssItem(X6) ) ) )
& sK19 = X3
& ssList(X3)
& sK18 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ( ( neq(sK19,nil)
& ~ neq(X3,nil) )
| ( neq(sK19,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = sK20 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != sK19 )
| ~ ssItem(X6) ) ) )
& sK19 = X3
& ssList(X3)
& sK18 = sK20 )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f265,plain,
( ? [X3] :
( ( ( neq(sK19,nil)
& ~ neq(X3,nil) )
| ( neq(sK19,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = sK20 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != sK19 )
| ~ ssItem(X6) ) ) )
& sK19 = X3
& ssList(X3)
& sK18 = sK20 )
=> ( ( ( neq(sK19,nil)
& ~ neq(sK21,nil) )
| ( neq(sK19,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK21
& ssList(X5)
& app(cons(X4,nil),X5) = sK20 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != sK19 )
| ~ ssItem(X6) ) ) )
& sK21 = sK19
& ssList(sK21)
& sK18 = sK20 ) ),
introduced(choice_axiom,[]) ).
fof(f266,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK21
& ssList(X5)
& app(cons(X4,nil),X5) = sK20 )
& ssItem(X4) )
=> ( ? [X5] :
( sK21 = app(X5,cons(sK22,nil))
& ssList(X5)
& app(cons(sK22,nil),X5) = sK20 )
& ssItem(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f267,plain,
( ? [X5] :
( sK21 = app(X5,cons(sK22,nil))
& ssList(X5)
& app(cons(sK22,nil),X5) = sK20 )
=> ( app(sK23,cons(sK22,nil)) = sK21
& ssList(sK23)
& sK20 = app(cons(sK22,nil),sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f261,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) = X2 )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X0
| app(X7,cons(X6,nil)) != X1 )
| ~ ssItem(X6) ) ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) ),
inference(rectify,[],[f204]) ).
fof(f204,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& ssList(X7)
& app(cons(X6,nil),X7) = X2 )
& ssItem(X6) )
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X0
| app(X5,cons(X4,nil)) != X1 )
| ~ ssItem(X4) ) ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f203]) ).
fof(f203,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X2
& app(X7,cons(X6,nil)) = X3
& ssList(X7) )
& ssItem(X6) )
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X0
| app(X5,cons(X4,nil)) != X1 )
| ~ ssItem(X4) ) ) )
& X0 = 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)
=> ( ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ~ neq(X1,nil)
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(cons(X4,nil),X5) = X0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) ) ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ~ neq(X1,nil)
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(cons(X4,nil),X5) = X0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) ) ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f658,plain,
( ~ spl53_1
| spl53_9 ),
inference(avatar_split_clause,[],[f552,f631,f593]) ).
fof(f552,plain,
( sK20 = app(cons(sK22,nil),sK23)
| ~ neq(sK19,nil) ),
inference(definition_unfolding,[],[f403,f400]) ).
fof(f400,plain,
sK21 = sK19,
inference(cnf_transformation,[],[f268]) ).
fof(f403,plain,
( ~ neq(sK21,nil)
| sK20 = app(cons(sK22,nil),sK23) ),
inference(cnf_transformation,[],[f268]) ).
fof(f653,plain,
( spl53_8
| ~ spl53_1 ),
inference(avatar_split_clause,[],[f551,f593,f626]) ).
fof(f551,plain,
( ~ neq(sK19,nil)
| ssList(sK23) ),
inference(definition_unfolding,[],[f404,f400]) ).
fof(f404,plain,
( ~ neq(sK21,nil)
| ssList(sK23) ),
inference(cnf_transformation,[],[f268]) ).
fof(f640,plain,
( ~ spl53_1
| spl53_10 ),
inference(avatar_split_clause,[],[f553,f637,f593]) ).
fof(f553,plain,
( ssItem(sK22)
| ~ neq(sK19,nil) ),
inference(definition_unfolding,[],[f402,f400]) ).
fof(f402,plain,
( ~ neq(sK21,nil)
| ssItem(sK22) ),
inference(cnf_transformation,[],[f268]) ).
fof(f620,plain,
( ~ spl53_1
| spl53_5 ),
inference(avatar_split_clause,[],[f554,f612,f593]) ).
fof(f554,plain,
! [X6,X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK20
| app(X7,cons(X6,nil)) != sK19
| ~ neq(sK19,nil)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f401,f400,f398]) ).
fof(f398,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f268]) ).
fof(f401,plain,
! [X6,X7] :
( ~ neq(sK21,nil)
| ~ ssList(X7)
| app(cons(X6,nil),X7) != sK18
| app(X7,cons(X6,nil)) != sK19
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f268]) ).
fof(f601,plain,
( ~ spl53_1
| spl53_2 ),
inference(avatar_split_clause,[],[f550,f597,f593]) ).
fof(f550,plain,
( app(sK23,cons(sK22,nil)) = sK19
| ~ neq(sK19,nil) ),
inference(definition_unfolding,[],[f405,f400,f400]) ).
fof(f405,plain,
( ~ neq(sK21,nil)
| app(sK23,cons(sK22,nil)) = sK21 ),
inference(cnf_transformation,[],[f268]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC317+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 30 18:48:04 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.54 % (18798)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.54 % (18797)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.55 % (18789)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.55 % (18788)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.55 % (18781)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.55 % (18780)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.56 % (18788)Instruction limit reached!
% 0.21/0.56 % (18788)------------------------------
% 0.21/0.56 % (18788)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (18789)Instruction limit reached!
% 0.21/0.57 % (18789)------------------------------
% 0.21/0.57 % (18789)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (18797)First to succeed.
% 0.21/0.57 % (18788)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (18788)Termination reason: Unknown
% 0.21/0.57 % (18788)Termination phase: shuffling
% 0.21/0.57
% 0.21/0.57 % (18788)Memory used [KB]: 1535
% 0.21/0.57 % (18788)Time elapsed: 0.005 s
% 0.21/0.57 % (18788)Instructions burned: 3 (million)
% 0.21/0.57 % (18788)------------------------------
% 0.21/0.57 % (18788)------------------------------
% 0.21/0.57 % (18789)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (18789)Termination reason: Unknown
% 0.21/0.57 % (18789)Termination phase: Property scanning
% 0.21/0.57
% 0.21/0.57 % (18789)Memory used [KB]: 1791
% 0.21/0.57 % (18789)Time elapsed: 0.008 s
% 0.21/0.57 % (18789)Instructions burned: 7 (million)
% 0.21/0.57 % (18789)------------------------------
% 0.21/0.57 % (18789)------------------------------
% 0.21/0.59 % (18798)Also succeeded, but the first one will report.
% 0.21/0.60 % (18797)Refutation found. Thanks to Tanya!
% 0.21/0.60 % SZS status Theorem for theBenchmark
% 0.21/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.60 % (18797)------------------------------
% 0.21/0.60 % (18797)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.60 % (18797)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.60 % (18797)Termination reason: Refutation
% 0.21/0.60
% 0.21/0.60 % (18797)Memory used [KB]: 6396
% 0.21/0.60 % (18797)Time elapsed: 0.138 s
% 0.21/0.60 % (18797)Instructions burned: 12 (million)
% 0.21/0.60 % (18797)------------------------------
% 0.21/0.60 % (18797)------------------------------
% 0.21/0.60 % (18773)Success in time 0.231 s
%------------------------------------------------------------------------------