%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU164+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:47:31 PM UTC 2026
% Result : Theorem 2.70s 1.32s
% Output : Refutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 71 ( 15 unt; 5 def)
% Number of atoms : 227 ( 25 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 263 ( 107 ~; 113 |; 31 &)
% ( 11 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 102 ( 1 sgn 90 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0,X1] :
( X1 = union(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X2,X3)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f9,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f11,conjecture,
! [X0] : union(powerset(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t99_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0] : union(powerset(X0)) = X0,
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f9]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f17,plain,
? [X0] : union(powerset(X0)) != X0,
inference(ennf_transformation,[],[f12]) ).
fof(f21,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f22,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ( ( ~ subset(sK1(X0,X1),X0)
| ~ in(sK1(X0,X1),X1) )
& ( subset(sK1(X0,X1),X0)
| in(sK1(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) ) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f28,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X2,X4)
& in(X4,X0) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ? [X7] :
( in(X5,X7)
& in(X7,X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ( ( ! [X3] :
( ~ in(sK3(X0,X1),X3)
| ~ in(X3,X0) )
| ~ in(sK3(X0,X1),X1) )
& ( ( in(sK3(X0,X1),sK4(X0,X1))
& in(sK4(X0,X1),X0) )
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ( in(X5,sK5(X0,X5))
& in(sK5(X0,X5),X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X2,sK3(X0,X1)),skolemize(X4,sK4(X0,X1)),skolemize(X7,sK5(X0,X5))],[f28]) ).
fof(f35,plain,
sK9 != union(powerset(sK9)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X0,sK9)],[f17]) ).
fof(f41,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f42,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f45,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f51,plain,
! [X0,X1] :
( union(X0) = X1
| in(sK4(X0,X1),X0)
| in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
! [X0,X1] :
( union(X0) = X1
| in(sK3(X0,X1),sK4(X0,X1))
| in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f53,plain,
! [X3,X0,X1] :
( union(X0) = X1
| ~ in(sK3(X0,X1),X3)
| ~ in(X3,X0)
| ~ in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f58,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f13]) ).
fof(f61,plain,
sK9 != union(powerset(sK9)),
inference(cnf_transformation,[],[f35]) ).
fof(f65,plain,
! [X3,X0] :
( ~ subset(X3,X0)
| in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f42]) ).
fof(f66,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f41]) ).
fof(f70,definition,
! [X0,X1] :
( sQ10_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ10_eqProxy])],[equality_proxy_definition]) ).
fof(f76,plain,
! [X3,X0,X1] :
( sQ10_eqProxy(union(X0),X1)
| ~ in(sK3(X0,X1),X3)
| ~ in(X3,X0)
| ~ in(sK3(X0,X1),X1) ),
inference(equality_proxy_replacement,[],[f53,f70]) ).
fof(f77,plain,
! [X0,X1] :
( sQ10_eqProxy(union(X0),X1)
| in(sK3(X0,X1),sK4(X0,X1))
| in(sK3(X0,X1),X1) ),
inference(equality_proxy_replacement,[],[f52,f70]) ).
fof(f78,plain,
! [X0,X1] :
( sQ10_eqProxy(union(X0),X1)
| in(sK4(X0,X1),X0)
| in(sK3(X0,X1),X1) ),
inference(equality_proxy_replacement,[],[f51,f70]) ).
fof(f81,plain,
~ sQ10_eqProxy(sK9,union(powerset(sK9))),
inference(equality_proxy_replacement,[],[f61,f70]) ).
fof(f83,plain,
! [X0,X1] :
( sQ10_eqProxy(X1,X0)
| ~ sQ10_eqProxy(X0,X1) ),
inference(equality_proxy_axiom,[],[f70]) ).
fof(f85,plain,
~ sQ10_eqProxy(union(powerset(sK9)),sK9),
inference(resolution,[],[f83,f81]) ).
fof(f89,plain,
! [X0] : in(X0,powerset(X0)),
inference(resolution,[],[f65,f58]) ).
fof(f104,plain,
! [X2,X0,X1] :
( in(X0,X2)
| ~ in(X0,X1)
| ~ in(X1,powerset(X2)) ),
inference(resolution,[],[f45,f66]) ).
fof(f218,plain,
( in(sK4(powerset(sK9),sK9),powerset(sK9))
| in(sK3(powerset(sK9),sK9),sK9) ),
inference(resolution,[],[f78,f85]) ).
fof(f220,definition,
( spl11_5
<=> in(sK3(powerset(sK9),sK9),sK9) ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f221,plain,
( in(sK3(powerset(sK9),sK9),sK9)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f223,definition,
( spl11_6
<=> in(sK4(powerset(sK9),sK9),powerset(sK9)) ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f224,plain,
( in(sK4(powerset(sK9),sK9),powerset(sK9))
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f225,plain,
( spl11_5
| spl11_6 ),
inference(avatar_split_clause,[],[f218,f223,f220]) ).
fof(f229,plain,
( in(sK3(powerset(sK9),sK9),sK4(powerset(sK9),sK9))
| in(sK3(powerset(sK9),sK9),sK9) ),
inference(resolution,[],[f77,f85]) ).
fof(f231,definition,
( spl11_7
<=> in(sK3(powerset(sK9),sK9),sK4(powerset(sK9),sK9)) ),
introduced(definition,[new_symbols(definition,[spl11_7])],[avatar_definition]) ).
fof(f232,plain,
( in(sK3(powerset(sK9),sK9),sK4(powerset(sK9),sK9))
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f233,plain,
( spl11_5
| spl11_7 ),
inference(avatar_split_clause,[],[f229,f231,f220]) ).
fof(f237,plain,
! [X0] :
( ~ in(sK3(powerset(sK9),sK9),X0)
| ~ in(X0,powerset(sK9))
| ~ in(sK3(powerset(sK9),sK9),sK9) ),
inference(resolution,[],[f76,f85]) ).
fof(f238,plain,
( ~ in(sK3(powerset(sK9),sK9),sK9)
| spl11_5 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f240,definition,
( spl11_8
<=> ! [X0] :
( ~ in(sK3(powerset(sK9),sK9),X0)
| ~ in(X0,powerset(sK9)) ) ),
introduced(definition,[new_symbols(definition,[spl11_8])],[avatar_definition]) ).
fof(f241,plain,
( ! [X0] :
( ~ in(sK3(powerset(sK9),sK9),X0)
| ~ in(X0,powerset(sK9)) )
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f242,plain,
( ~ spl11_5
| spl11_8 ),
inference(avatar_split_clause,[],[f237,f240,f220]) ).
fof(f243,plain,
( ~ in(sK9,powerset(sK9))
| ~ spl11_5
| ~ spl11_8 ),
inference(resolution,[],[f241,f221]) ).
fof(f248,plain,
( $false
| ~ spl11_5
| ~ spl11_8 ),
inference(resolution,[],[f243,f89]) ).
fof(f249,plain,
( ~ spl11_5
| ~ spl11_8 ),
inference(avatar_contradiction_clause,[],[f248]) ).
fof(f250,plain,
( ~ in(sK4(powerset(sK9),sK9),powerset(sK9))
| ~ spl11_7
| ~ spl11_8 ),
inference(resolution,[],[f232,f241]) ).
fof(f251,plain,
( $false
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(resolution,[],[f250,f224]) ).
fof(f252,plain,
( ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(avatar_contradiction_clause,[],[f251]) ).
fof(f291,plain,
( ! [X0] :
( ~ in(sK3(powerset(sK9),sK9),X0)
| ~ in(X0,powerset(sK9)) )
| spl11_5 ),
inference(resolution,[],[f104,f238]) ).
fof(f295,plain,
( spl11_8
| spl11_5 ),
inference(avatar_split_clause,[],[f291,f220,f240]) ).
cnf(s7,plain,
( spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f225]) ).
cnf(s8,plain,
( spl11_5
| spl11_7 ),
inference(sat_conversion,[],[f233]) ).
cnf(s9,plain,
( ~ spl11_5
| spl11_8 ),
inference(sat_conversion,[],[f242]) ).
cnf(s10,plain,
( ~ spl11_5
| ~ spl11_8 ),
inference(sat_conversion,[],[f249]) ).
cnf(s11,plain,
( ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(sat_conversion,[],[f252]) ).
cnf(s12,plain,
( spl11_5
| spl11_8 ),
inference(sat_conversion,[],[f295]) ).
cnf(s15,plain,
spl11_5,
inference(rat,[],[s11,s7,s8,s12]) ).
cnf(s16,plain,
~ spl11_8,
inference(rat,[],[s10,s15]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s9,s16,s15]) ).
fof(f296,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU164+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 % Computer : n011.cluster.edu
% 0.09/0.40 % Model : x86_64 x86_64
% 0.09/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.40 % Memory : 8046.5625MB
% 0.09/0.40 % OS : Linux 6.8.0-71-generic
% 0.09/0.40 % CPULimit : 300
% 0.09/0.40 % WCLimit : 300
% 0.09/0.40 % DateTime : Mon Sep 28 03:50:16 UTC 2026
% 0.09/0.41 % CPUTime :
% 0.09/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.44 Running first-order theorem proving
% 0.09/0.44 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.32 % (3001986)Detected formulas, will run a generic FOF schedule.
% 2.70/1.32 % (3001994)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3028298099:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.70/1.32 % (3001994)Refutation not found, incomplete strategy
% 2.70/1.32 % (3001994)------------------------------
% 2.70/1.32 % (3001994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.32 % (3001994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.32 % (3001994)CaDiCaL version: 2.1.3
% 2.70/1.32 % (3001994)Termination reason: Refutation not found, incomplete strategy
% 2.70/1.32 % (3001994)Time elapsed: 0.001 s
% 2.70/1.32 % (3001994)Peak memory usage: 88 MB
% 2.70/1.32 % (3001994)Instructions burned: 1 (million)
% 2.70/1.32 % (3001997)dis-21_1_sil=8000:lcm=predicate:random_seed=1661058501:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.70/1.32 % (3001992)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2523711622:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.70/1.32 % (3001993)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=344508931:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.70/1.32 % (3001995)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=999260968:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.70/1.32 % (3001991)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2014910504:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.70/1.32 % (3001997)First to succeed.
% 2.70/1.32 % (3001997)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3001986"
% 2.70/1.32 % (3001996)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2924659134:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.70/1.32 % (3001995)Also succeeded, but the first one will report.
% 2.70/1.32 % (3001996)Instruction limit reached!
% 2.70/1.32 % (3001996)------------------------------
% 2.70/1.32 % (3001996)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.32 % (3001996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.32 % (3001996)CaDiCaL version: 2.1.3
% 2.70/1.32 % (3001996)Termination reason: Instruction limit
% 2.70/1.32 % (3001996)Termination phase: Saturation
% 2.70/1.32 % (3001996)Time elapsed: 0.095 s
% 2.70/1.32 % (3001996)Peak memory usage: 89 MB
% 2.70/1.32 % (3001996)Instructions burned: 139 (million)
% 2.70/1.32 % (3001994)------------------------------
% 2.70/1.32 % (3001994)------------------------------
% 2.70/1.32 % (3002006)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2799935729:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.70/1.32 % (3001997)Refutation found. Thanks to Tanya!
% 2.70/1.32 % SZS status Theorem for theBenchmark
% 2.70/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.69/1.51 % (3001997)------------------------------
% 3.69/1.51 % (3001997)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.51 % (3001997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.51 % (3001997)CaDiCaL version: 2.1.3
% 3.69/1.51 % (3001997)Termination reason: Refutation
% 3.69/1.51 % (3001997)Time elapsed: 0.007 s
% 3.69/1.51 % (3001997)Peak memory usage: 89 MB
% 3.69/1.51 % (3001997)Instructions burned: 8 (million)
% 3.69/1.51 % (3001997)------------------------------
% 3.69/1.51 % (3001997)------------------------------
% 3.69/1.51 % (3001986)Success in time 0.433 s
% 3.69/1.51 % Vampire exiting
%------------------------------------------------------------------------------