TSTP Solution File: SET793+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET793+4 : TPTP v8.1.0. Released v3.2.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 : n010.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:25:40 EDT 2022
% Result : Theorem 0.15s 0.49s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 73 ( 14 unt; 3 typ; 0 def)
% Number of atoms : 281 ( 17 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 313 ( 102 ~; 103 |; 67 &)
% ( 8 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 192 ( 177 !; 15 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_14,type,
sQ5_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_15,type,
sQ6_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_16,type,
sQ7_eqProxy: ( $real * $real ) > $o ).
fof(f181,plain,
$false,
inference(subsumption_resolution,[],[f180,f114]) ).
fof(f114,plain,
apply(sK0,sK2,sK2),
inference(resolution,[],[f109,f103]) ).
fof(f103,plain,
order(sK0,sK1),
inference(resolution,[],[f63,f59]) ).
fof(f59,plain,
total_order(sK0,sK1),
inference(literal_reordering,[],[f45]) ).
fof(f45,plain,
total_order(sK0,sK1),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
( max(sK2,sK0,sK1)
& ~ greatest(sK2,sK0,sK1)
& total_order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f38,f39]) ).
fof(f39,plain,
( ? [X0,X1,X2] :
( max(X2,X0,X1)
& ~ greatest(X2,X0,X1)
& total_order(X0,X1) )
=> ( max(sK2,sK0,sK1)
& ~ greatest(sK2,sK0,sK1)
& total_order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
? [X0,X1,X2] :
( max(X2,X0,X1)
& ~ greatest(X2,X0,X1)
& total_order(X0,X1) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
? [X1,X2,X0] :
( max(X0,X1,X2)
& ~ greatest(X0,X1,X2)
& total_order(X1,X2) ),
inference(flattening,[],[f34]) ).
fof(f34,plain,
? [X0,X1,X2] :
( ~ greatest(X0,X1,X2)
& max(X0,X1,X2)
& total_order(X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X0,X1,X2] :
( ( max(X0,X1,X2)
& total_order(X1,X2) )
=> greatest(X0,X1,X2) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X5,X0,X1] :
( ( max(X5,X0,X1)
& total_order(X0,X1) )
=> greatest(X5,X0,X1) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X5,X0,X1] :
( ( max(X5,X0,X1)
& total_order(X0,X1) )
=> greatest(X5,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV5) ).
fof(f63,plain,
! [X0,X1] :
( ~ total_order(X0,X1)
| order(X0,X1) ),
inference(literal_reordering,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( ~ total_order(X0,X1)
| order(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( order(X0,X1)
& ! [X2,X3] :
( ~ member(X2,X1)
| apply(X0,X3,X2)
| apply(X0,X2,X3)
| ~ member(X3,X1) ) )
| ~ total_order(X0,X1) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( ! [X3,X2] :
( apply(X0,X3,X2)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& order(X0,X1) )
| ~ total_order(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( total_order(X0,X1)
=> ( ! [X3,X2] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X3,X2)
| apply(X0,X2,X3) ) )
& order(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( ! [X3,X2] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X3,X2)
| apply(X0,X2,X3) ) )
& order(X0,X1) )
<=> total_order(X0,X1) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ( order(X0,X1)
& ! [X3,X2] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X2,X3)
| apply(X0,X3,X2) ) ) )
<=> total_order(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',total_order) ).
fof(f109,plain,
! [X5] :
( ~ order(X5,sK1)
| apply(X5,sK2,sK2) ),
inference(resolution,[],[f104,f62]) ).
fof(f62,plain,
! [X0,X1,X5] :
( ~ member(X5,X1)
| ~ order(X0,X1)
| apply(X0,X5,X5) ),
inference(literal_reordering,[],[f53]) ).
fof(f53,plain,
! [X0,X1,X5] :
( ~ member(X5,X1)
| ~ order(X0,X1)
| apply(X0,X5,X5) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ~ order(X0,X1)
| ( ! [X2,X3,X4] :
( ~ member(X2,X1)
| apply(X0,X4,X2)
| ~ member(X3,X1)
| ~ apply(X0,X4,X3)
| ~ apply(X0,X3,X2)
| ~ member(X4,X1) )
& ! [X5] :
( ~ member(X5,X1)
| apply(X0,X5,X5) )
& ! [X6,X7] :
( ~ apply(X0,X7,X6)
| X6 = X7
| ~ member(X7,X1)
| ~ member(X6,X1)
| ~ apply(X0,X6,X7) ) ) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ~ order(X1,X0)
| ( ! [X5,X7,X6] :
( ~ member(X5,X0)
| apply(X1,X6,X5)
| ~ member(X7,X0)
| ~ apply(X1,X6,X7)
| ~ apply(X1,X7,X5)
| ~ member(X6,X0) )
& ! [X2] :
( ~ member(X2,X0)
| apply(X1,X2,X2) )
& ! [X3,X4] :
( ~ apply(X1,X4,X3)
| X3 = X4
| ~ member(X4,X0)
| ~ member(X3,X0)
| ~ apply(X1,X3,X4) ) ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( ( ! [X6,X5,X7] :
( apply(X1,X6,X5)
| ~ apply(X1,X6,X7)
| ~ apply(X1,X7,X5)
| ~ member(X7,X0)
| ~ member(X6,X0)
| ~ member(X5,X0) )
& ! [X2] :
( ~ member(X2,X0)
| apply(X1,X2,X2) )
& ! [X3,X4] :
( X3 = X4
| ~ apply(X1,X4,X3)
| ~ apply(X1,X3,X4)
| ~ member(X3,X0)
| ~ member(X4,X0) ) )
| ~ order(X1,X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( order(X1,X0)
=> ( ! [X6,X5,X7] :
( ( member(X7,X0)
& member(X6,X0)
& member(X5,X0) )
=> ( ( apply(X1,X6,X7)
& apply(X1,X7,X5) )
=> apply(X1,X6,X5) ) )
& ! [X2] :
( member(X2,X0)
=> apply(X1,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X0)
& member(X4,X0) )
=> ( ( apply(X1,X4,X3)
& apply(X1,X3,X4) )
=> X3 = X4 ) ) ) ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( order(X1,X0)
<=> ( ! [X6,X5,X7] :
( ( member(X7,X0)
& member(X6,X0)
& member(X5,X0) )
=> ( ( apply(X1,X6,X7)
& apply(X1,X7,X5) )
=> apply(X1,X6,X5) ) )
& ! [X2] :
( member(X2,X0)
=> apply(X1,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X0)
& member(X4,X0) )
=> ( ( apply(X1,X4,X3)
& apply(X1,X3,X4) )
=> X3 = X4 ) ) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X2] :
( ( member(X2,X1)
& member(X3,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X2) )
=> X2 = X3 ) )
& ! [X4,X2,X3] :
( ( member(X2,X1)
& member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f104,plain,
member(sK2,sK1),
inference(resolution,[],[f64,f58]) ).
fof(f58,plain,
max(sK2,sK0,sK1),
inference(literal_reordering,[],[f47]) ).
fof(f47,plain,
max(sK2,sK0,sK1),
inference(cnf_transformation,[],[f40]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ max(X1,X0,X2)
| member(X1,X2) ),
inference(literal_reordering,[],[f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( member(X1,X2)
| ~ max(X1,X0,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ~ max(X1,X0,X2)
| ( member(X1,X2)
& ! [X3] :
( ~ apply(X0,X1,X3)
| ~ member(X3,X2)
| X1 = X3 ) ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X1,X2,X0] :
( ~ max(X2,X1,X0)
| ( member(X2,X0)
& ! [X3] :
( ~ apply(X1,X2,X3)
| ~ member(X3,X0)
| X2 = X3 ) ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0,X2,X1] :
( ( member(X2,X0)
& ! [X3] :
( X2 = X3
| ~ apply(X1,X2,X3)
| ~ member(X3,X0) ) )
| ~ max(X2,X1,X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X2,X1] :
( max(X2,X1,X0)
=> ( member(X2,X0)
& ! [X3] :
( ( apply(X1,X2,X3)
& member(X3,X0) )
=> X2 = X3 ) ) ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f22,plain,
! [X0,X2,X1] :
( max(X2,X1,X0)
<=> ( member(X2,X0)
& ! [X3] :
( ( apply(X1,X2,X3)
& member(X3,X0) )
=> X2 = X3 ) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0,X5] :
( ( member(X5,X1)
& ! [X2] :
( ( apply(X0,X5,X2)
& member(X2,X1) )
=> X2 = X5 ) )
<=> max(X5,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',max) ).
fof(f180,plain,
~ apply(sK0,sK2,sK2),
inference(subsumption_resolution,[],[f175,f60]) ).
fof(f60,plain,
~ greatest(sK2,sK0,sK1),
inference(literal_reordering,[],[f46]) ).
fof(f46,plain,
~ greatest(sK2,sK0,sK1),
inference(cnf_transformation,[],[f40]) ).
fof(f175,plain,
( greatest(sK2,sK0,sK1)
| ~ apply(sK0,sK2,sK2) ),
inference(superposition,[],[f110,f150]) ).
fof(f150,plain,
sK2 = sK3(sK1,sK2,sK0),
inference(subsumption_resolution,[],[f146,f58]) ).
fof(f146,plain,
( ~ max(sK2,sK0,sK1)
| sK2 = sK3(sK1,sK2,sK0) ),
inference(resolution,[],[f137,f130]) ).
fof(f130,plain,
! [X11,X12] :
( ~ apply(X11,X12,sK3(sK1,sK2,sK0))
| ~ max(X12,X11,sK1)
| sK3(sK1,sK2,sK0) = X12 ),
inference(resolution,[],[f115,f67]) ).
fof(f67,plain,
! [X2,X3,X0,X1] :
( ~ member(X3,X2)
| ~ apply(X0,X1,X3)
| X1 = X3
| ~ max(X1,X0,X2) ),
inference(literal_reordering,[],[f48]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( ~ max(X1,X0,X2)
| X1 = X3
| ~ apply(X0,X1,X3)
| ~ member(X3,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f115,plain,
member(sK3(sK1,sK2,sK0),sK1),
inference(resolution,[],[f111,f60]) ).
fof(f111,plain,
! [X7] :
( greatest(sK2,X7,sK1)
| member(sK3(sK1,sK2,X7),sK1) ),
inference(resolution,[],[f104,f66]) ).
fof(f66,plain,
! [X2,X0,X1] :
( ~ member(X1,X0)
| member(sK3(X0,X1,X2),X0)
| greatest(X1,X2,X0) ),
inference(literal_reordering,[],[f50]) ).
fof(f50,plain,
! [X2,X0,X1] :
( member(sK3(X0,X1,X2),X0)
| greatest(X1,X2,X0)
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( ~ apply(X2,sK3(X0,X1,X2),X1)
& member(sK3(X0,X1,X2),X0) )
| greatest(X1,X2,X0)
| ~ member(X1,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f33,f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X2,X3,X1)
& member(X3,X0) )
=> ( ~ apply(X2,sK3(X0,X1,X2),X1)
& member(sK3(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X2,X3,X1)
& member(X3,X0) )
| greatest(X1,X2,X0)
| ~ member(X1,X0) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X2,X1] :
( greatest(X1,X2,X0)
| ? [X3] :
( ~ apply(X2,X3,X1)
& member(X3,X0) )
| ~ member(X1,X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X2,X1] :
( ( ! [X3] :
( member(X3,X0)
=> apply(X2,X3,X1) )
& member(X1,X0) )
=> greatest(X1,X2,X0) ),
inference(unused_predicate_definition_removal,[],[f14]) ).
fof(f14,plain,
! [X0,X2,X1] :
( greatest(X1,X2,X0)
<=> ( ! [X3] :
( member(X3,X0)
=> apply(X2,X3,X1) )
& member(X1,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X5,X0] :
( greatest(X5,X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X5) )
& member(X5,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greatest) ).
fof(f137,plain,
apply(sK0,sK2,sK3(sK1,sK2,sK0)),
inference(subsumption_resolution,[],[f136,f60]) ).
fof(f136,plain,
( greatest(sK2,sK0,sK1)
| apply(sK0,sK2,sK3(sK1,sK2,sK0)) ),
inference(resolution,[],[f133,f110]) ).
fof(f133,plain,
( apply(sK0,sK3(sK1,sK2,sK0),sK2)
| apply(sK0,sK2,sK3(sK1,sK2,sK0)) ),
inference(resolution,[],[f118,f115]) ).
fof(f118,plain,
! [X0] :
( ~ member(X0,sK1)
| apply(sK0,X0,sK2)
| apply(sK0,sK2,X0) ),
inference(resolution,[],[f113,f59]) ).
fof(f113,plain,
! [X10,X11] :
( ~ total_order(X11,sK1)
| apply(X11,sK2,X10)
| ~ member(X10,sK1)
| apply(X11,X10,sK2) ),
inference(resolution,[],[f104,f68]) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( ~ member(X2,X1)
| ~ member(X3,X1)
| apply(X0,X2,X3)
| ~ total_order(X0,X1)
| apply(X0,X3,X2) ),
inference(literal_reordering,[],[f55]) ).
fof(f55,plain,
! [X2,X3,X0,X1] :
( ~ member(X2,X1)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| apply(X0,X3,X2)
| ~ total_order(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f110,plain,
! [X6] :
( ~ apply(X6,sK3(sK1,sK2,X6),sK2)
| greatest(sK2,X6,sK1) ),
inference(resolution,[],[f104,f65]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ member(X1,X0)
| greatest(X1,X2,X0)
| ~ apply(X2,sK3(X0,X1,X2),X1) ),
inference(literal_reordering,[],[f51]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ apply(X2,sK3(X0,X1,X2),X1)
| greatest(X1,X2,X0)
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% 0.05/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Aug 30 14:12:59 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.46 % (6145)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.15/0.47 % (6151)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.15/0.47 % (6151)First to succeed.
% 0.15/0.47 % (6153)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.15/0.48 % (6145)Instruction limit reached!
% 0.15/0.48 % (6145)------------------------------
% 0.15/0.48 % (6145)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48 % (6145)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48 % (6145)Termination reason: Unknown
% 0.15/0.48 % (6145)Termination phase: Saturation
% 0.15/0.48
% 0.15/0.48 % (6145)Memory used [KB]: 895
% 0.15/0.48 % (6145)Time elapsed: 0.003 s
% 0.15/0.48 % (6145)Instructions burned: 2 (million)
% 0.15/0.48 % (6145)------------------------------
% 0.15/0.48 % (6145)------------------------------
% 0.15/0.48 % (6143)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.15/0.48 % (6161)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.15/0.48 TRYING [1]
% 0.15/0.48 TRYING [2]
% 0.15/0.48 % (6159)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.15/0.49 % (6159)Also succeeded, but the first one will report.
% 0.15/0.49 % (6151)Refutation found. Thanks to Tanya!
% 0.15/0.49 % SZS status Theorem for theBenchmark
% 0.15/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.49 % (6151)------------------------------
% 0.15/0.49 % (6151)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.49 % (6151)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.49 % (6151)Termination reason: Refutation
% 0.15/0.49
% 0.15/0.49 % (6151)Memory used [KB]: 5884
% 0.15/0.49 % (6151)Time elapsed: 0.012 s
% 0.15/0.49 % (6151)Instructions burned: 8 (million)
% 0.15/0.49 % (6151)------------------------------
% 0.15/0.49 % (6151)------------------------------
% 0.15/0.49 % (6136)Success in time 0.178 s
%------------------------------------------------------------------------------