TSTP Solution File: SET916+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET916+1 : 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_uns --cores 0 -t %d %s
% Computer : n017.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:22:44 EDT 2022
% Result : Theorem 1.51s 0.58s
% Output : Refutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 18 unt; 0 def)
% Number of atoms : 239 ( 82 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 309 ( 124 ~; 98 |; 75 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 139 ( 117 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f111,plain,
$false,
inference(subsumption_resolution,[],[f106,f68]) ).
fof(f68,plain,
~ in(sK4,sK3),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
( ~ in(sK4,sK3)
& ~ disjoint(unordered_pair(sK5,sK4),sK3)
& ~ in(sK5,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f40,f41]) ).
fof(f41,plain,
( ? [X0,X1,X2] :
( ~ in(X1,X0)
& ~ disjoint(unordered_pair(X2,X1),X0)
& ~ in(X2,X0) )
=> ( ~ in(sK4,sK3)
& ~ disjoint(unordered_pair(sK5,sK4),sK3)
& ~ in(sK5,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
? [X0,X1,X2] :
( ~ in(X1,X0)
& ~ disjoint(unordered_pair(X2,X1),X0)
& ~ in(X2,X0) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
? [X2,X1,X0] :
( ~ in(X1,X2)
& ~ disjoint(unordered_pair(X0,X1),X2)
& ~ in(X0,X2) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X1,X0,X2] :
~ ( ~ in(X1,X2)
& ~ disjoint(unordered_pair(X0,X1),X2)
& ~ in(X0,X2) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X2,X1] :
~ ( ~ disjoint(unordered_pair(X0,X2),X1)
& ~ in(X2,X1)
& ~ in(X0,X1) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X2,X1] :
~ ( ~ disjoint(unordered_pair(X0,X2),X1)
& ~ in(X2,X1)
& ~ in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(f106,plain,
in(sK4,sK3),
inference(backward_demodulation,[],[f84,f102]) ).
fof(f102,plain,
sK2(sK3,unordered_pair(sK4,sK5)) = sK4,
inference(subsumption_resolution,[],[f97,f66]) ).
fof(f66,plain,
~ in(sK5,sK3),
inference(cnf_transformation,[],[f42]) ).
fof(f97,plain,
( sK2(sK3,unordered_pair(sK4,sK5)) = sK4
| in(sK5,sK3) ),
inference(superposition,[],[f84,f89]) ).
fof(f89,plain,
( sK5 = sK2(sK3,unordered_pair(sK4,sK5))
| sK2(sK3,unordered_pair(sK4,sK5)) = sK4 ),
inference(resolution,[],[f83,f75]) ).
fof(f75,plain,
! [X2,X3,X0] :
( ~ in(X3,unordered_pair(X2,X0))
| X2 = X3
| X0 = X3 ),
inference(equality_resolution,[],[f59]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( X0 = X3
| X2 = X3
| ~ in(X3,X1)
| unordered_pair(X2,X0) != X1 ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( X0 = X3
| X2 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X0 != X3
& X2 != X3 ) ) )
| unordered_pair(X2,X0) != X1 )
& ( unordered_pair(X2,X0) = X1
| ( ( ~ in(sK1(X0,X1,X2),X1)
| ( sK1(X0,X1,X2) != X0
& sK1(X0,X1,X2) != X2 ) )
& ( in(sK1(X0,X1,X2),X1)
| sK1(X0,X1,X2) = X0
| sK1(X0,X1,X2) = X2 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f32,f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X1)
| ( X0 != X4
& X2 != X4 ) )
& ( in(X4,X1)
| X0 = X4
| X2 = X4 ) )
=> ( ( ~ in(sK1(X0,X1,X2),X1)
| ( sK1(X0,X1,X2) != X0
& sK1(X0,X1,X2) != X2 ) )
& ( in(sK1(X0,X1,X2),X1)
| sK1(X0,X1,X2) = X0
| sK1(X0,X1,X2) = X2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( X0 = X3
| X2 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X0 != X3
& X2 != X3 ) ) )
| unordered_pair(X2,X0) != X1 )
& ( unordered_pair(X2,X0) = X1
| ? [X4] :
( ( ~ in(X4,X1)
| ( X0 != X4
& X2 != X4 ) )
& ( in(X4,X1)
| X0 = X4
| X2 = X4 ) ) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( X2 = X3
| X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) ) )
| unordered_pair(X0,X2) != X1 )
& ( unordered_pair(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( in(X3,X1)
| X2 = X3
| X0 = X3 ) ) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( X2 = X3
| X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) ) )
| unordered_pair(X0,X2) != X1 )
& ( unordered_pair(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( in(X3,X1)
| X2 = X3
| X0 = X3 ) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X1,X0] :
( ! [X3] :
( ( X2 = X3
| X0 = X3 )
<=> in(X3,X1) )
<=> unordered_pair(X0,X2) = X1 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X2,X1] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f83,plain,
in(sK2(sK3,unordered_pair(sK4,sK5)),unordered_pair(sK4,sK5)),
inference(resolution,[],[f82,f72]) ).
fof(f72,plain,
! [X2,X3,X1] :
( ~ in(X3,set_intersection2(X1,X2))
| in(X3,X2) ),
inference(equality_resolution,[],[f53]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( in(X3,X2)
| ~ in(X3,X0)
| set_intersection2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X1) )
| ~ in(X3,X0) )
& ( in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) ) )
| set_intersection2(X1,X2) != X0 )
& ( set_intersection2(X1,X2) = X0
| ( ( ~ in(sK0(X0,X1,X2),X0)
| ~ in(sK0(X0,X1,X2),X2)
| ~ in(sK0(X0,X1,X2),X1) )
& ( in(sK0(X0,X1,X2),X0)
| ( in(sK0(X0,X1,X2),X2)
& in(sK0(X0,X1,X2),X1) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f27,f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X0)
| ~ in(X4,X2)
| ~ in(X4,X1) )
& ( in(X4,X0)
| ( in(X4,X2)
& in(X4,X1) ) ) )
=> ( ( ~ in(sK0(X0,X1,X2),X0)
| ~ in(sK0(X0,X1,X2),X2)
| ~ in(sK0(X0,X1,X2),X1) )
& ( in(sK0(X0,X1,X2),X0)
| ( in(sK0(X0,X1,X2),X2)
& in(sK0(X0,X1,X2),X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X1) )
| ~ in(X3,X0) )
& ( in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) ) )
| set_intersection2(X1,X2) != X0 )
& ( set_intersection2(X1,X2) = X0
| ? [X4] :
( ( ~ in(X4,X0)
| ~ in(X4,X2)
| ~ in(X4,X1) )
& ( in(X4,X0)
| ( in(X4,X2)
& in(X4,X1) ) ) ) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X1,X0,X2] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( in(X3,X1)
| ( in(X3,X2)
& in(X3,X0) ) ) ) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X1,X0,X2] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( in(X3,X1)
| ( in(X3,X2)
& in(X3,X0) ) ) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0,X2] :
( ! [X3] :
( ( in(X3,X2)
& in(X3,X0) )
<=> in(X3,X1) )
<=> set_intersection2(X0,X2) = X1 ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X0,X2,X1] :
( ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) )
<=> set_intersection2(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f82,plain,
in(sK2(sK3,unordered_pair(sK4,sK5)),set_intersection2(sK3,unordered_pair(sK4,sK5))),
inference(forward_demodulation,[],[f81,f62]) ).
fof(f62,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f81,plain,
in(sK2(sK3,unordered_pair(sK4,sK5)),set_intersection2(unordered_pair(sK4,sK5),sK3)),
inference(resolution,[],[f80,f64]) ).
fof(f64,plain,
! [X0,X1] :
( disjoint(X1,X0)
| in(sK2(X0,X1),set_intersection2(X1,X0)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( disjoint(X1,X0)
| in(sK2(X0,X1),set_intersection2(X1,X0)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X1,X0))
| ~ disjoint(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f36,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ? [X2] : in(X2,set_intersection2(X1,X0))
=> in(sK2(X0,X1),set_intersection2(X1,X0)) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X0,X1] :
( ( disjoint(X1,X0)
| ? [X2] : in(X2,set_intersection2(X1,X0)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X1,X0))
| ~ disjoint(X1,X0) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( ( disjoint(X0,X1)
| ? [X3] : in(X3,set_intersection2(X0,X1)) )
& ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) )
& ~ ( ~ disjoint(X0,X1)
& ! [X3] : ~ in(X3,set_intersection2(X0,X1)) ) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) )
& ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f80,plain,
~ disjoint(unordered_pair(sK4,sK5),sK3),
inference(forward_demodulation,[],[f67,f65]) ).
fof(f65,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f67,plain,
~ disjoint(unordered_pair(sK5,sK4),sK3),
inference(cnf_transformation,[],[f42]) ).
fof(f84,plain,
in(sK2(sK3,unordered_pair(sK4,sK5)),sK3),
inference(resolution,[],[f82,f73]) ).
fof(f73,plain,
! [X2,X3,X1] :
( ~ in(X3,set_intersection2(X1,X2))
| in(X3,X1) ),
inference(equality_resolution,[],[f52]) ).
fof(f52,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| set_intersection2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET916+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n017.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 13:54:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.54 % (18590)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.55 % (18590)Refutation not found, incomplete strategy% (18590)------------------------------
% 0.21/0.55 % (18590)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (18590)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (18590)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.55
% 0.21/0.55 % (18590)Memory used [KB]: 5884
% 0.21/0.55 % (18590)Time elapsed: 0.116 s
% 0.21/0.55 % (18590)Instructions burned: 2 (million)
% 0.21/0.55 % (18590)------------------------------
% 0.21/0.55 % (18590)------------------------------
% 0.21/0.56 % (18606)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.56 % (18606)Instruction limit reached!
% 0.21/0.56 % (18606)------------------------------
% 0.21/0.56 % (18606)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56 % (18606)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56 % (18606)Termination reason: Unknown
% 0.21/0.56 % (18606)Termination phase: Saturation
% 0.21/0.56
% 0.21/0.56 % (18606)Memory used [KB]: 1407
% 0.21/0.56 % (18606)Time elapsed: 0.005 s
% 0.21/0.56 % (18606)Instructions burned: 2 (million)
% 0.21/0.56 % (18606)------------------------------
% 0.21/0.56 % (18606)------------------------------
% 0.21/0.57 % (18598)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.51/0.57 % (18611)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)
% 1.51/0.57 % (18598)Refutation not found, incomplete strategy% (18598)------------------------------
% 1.51/0.57 % (18598)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.57 % (18598)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.57 % (18598)Termination reason: Refutation not found, incomplete strategy
% 1.51/0.57
% 1.51/0.57 % (18598)Memory used [KB]: 5884
% 1.51/0.57 % (18598)Time elapsed: 0.140 s
% 1.51/0.57 % (18598)Instructions burned: 3 (million)
% 1.51/0.57 % (18598)------------------------------
% 1.51/0.57 % (18598)------------------------------
% 1.51/0.57 % (18603)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)
% 1.51/0.58 % (18611)First to succeed.
% 1.51/0.58 % (18602)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)
% 1.51/0.58 % (18602)Instruction limit reached!
% 1.51/0.58 % (18602)------------------------------
% 1.51/0.58 % (18602)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.58 % (18602)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.58 % (18602)Termination reason: Unknown
% 1.51/0.58 % (18602)Termination phase: Saturation
% 1.51/0.58
% 1.51/0.58 % (18602)Memory used [KB]: 5884
% 1.51/0.58 % (18602)Time elapsed: 0.154 s
% 1.51/0.58 % (18602)Instructions burned: 3 (million)
% 1.51/0.58 % (18602)------------------------------
% 1.51/0.58 % (18602)------------------------------
% 1.51/0.58 % (18611)Refutation found. Thanks to Tanya!
% 1.51/0.58 % SZS status Theorem for theBenchmark
% 1.51/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.51/0.58 % (18611)------------------------------
% 1.51/0.58 % (18611)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.58 % (18611)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.58 % (18611)Termination reason: Refutation
% 1.51/0.58
% 1.51/0.58 % (18611)Memory used [KB]: 1535
% 1.51/0.58 % (18611)Time elapsed: 0.099 s
% 1.51/0.58 % (18611)Instructions burned: 5 (million)
% 1.51/0.58 % (18611)------------------------------
% 1.51/0.58 % (18611)------------------------------
% 1.51/0.58 % (18587)Success in time 0.221 s
%------------------------------------------------------------------------------