%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU008+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:03 PM UTC 2026
% Result : Theorem 2.74s 1.25s
% Output : Refutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 63 ( 15 unt; 3 def)
% Number of atoms : 259 ( 59 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 331 ( 135 ~; 129 |; 51 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 89 ( 0 sgn 77 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f15,axiom,
! [X0] :
( relation(identity_relation(X0))
& function(identity_relation(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_funct_1) ).
fof(f31,axiom,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X0,relation_dom(X1))
=> apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).
fof(f34,axiom,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ( X1 = identity_relation(X0)
<=> ( relation_dom(X1) = X0
& ! [X2] :
( in(X2,X0)
=> apply(X1,X2) = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t34_funct_1) ).
fof(f35,conjecture,
! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,set_intersection2(relation_dom(X2),X0))
=> apply(X2,X1) = apply(relation_composition(identity_relation(X0),X2),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_funct_1) ).
fof(f36,negated_conjecture,
~ ! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,set_intersection2(relation_dom(X2),X0))
=> apply(X2,X1) = apply(relation_composition(identity_relation(X0),X2),X1) ) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f44,plain,
? [X0,X1,X2] :
( apply(X2,X1) != apply(relation_composition(identity_relation(X0),X2),X1)
& in(X1,set_intersection2(relation_dom(X2),X0))
& relation(X2)
& function(X2) ),
inference(ennf_transformation,[],[f36]) ).
fof(f45,plain,
? [X0,X1,X2] :
( apply(X2,X1) != apply(relation_composition(identity_relation(X0),X2),X1)
& in(X1,set_intersection2(relation_dom(X2),X0))
& relation(X2)
& function(X2) ),
inference(flattening,[],[f44]) ).
fof(f64,plain,
! [X0,X1] :
( ( X1 = identity_relation(X0)
<=> ( relation_dom(X1) = X0
& ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) ) ) )
| ~ relation(X1)
| ~ function(X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f65,plain,
! [X0,X1] :
( ( X1 = identity_relation(X0)
<=> ( relation_dom(X1) = X0
& ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) ) ) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0,X1] :
( ! [X2] :
( apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ in(X0,relation_dom(X1))
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(ennf_transformation,[],[f31]) ).
fof(f67,plain,
! [X0,X1] :
( ! [X2] :
( apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ in(X0,relation_dom(X1))
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f66]) ).
fof(f68,plain,
( apply(sK2,sK1) != apply(relation_composition(identity_relation(sK0),sK2),sK1)
& in(sK1,set_intersection2(relation_dom(sK2),sK0))
& relation(sK2)
& function(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f45]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f69]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f70]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK3(X0,X1,X2),X0)
& in(sK3(X0,X1,X2),X1) )
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f71]) ).
fof(f76,plain,
! [X0,X1] :
( ( ( X1 = identity_relation(X0)
| relation_dom(X1) != X0
| ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) ) )
& ( ( relation_dom(X1) = X0
& ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) ) )
| identity_relation(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) ),
inference(nnf_transformation,[],[f65]) ).
fof(f77,plain,
! [X0,X1] :
( ( ( X1 = identity_relation(X0)
| relation_dom(X1) != X0
| ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) ) )
& ( ( relation_dom(X1) = X0
& ! [X2] :
( apply(X1,X2) = X2
| ~ in(X2,X0) ) )
| identity_relation(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
! [X0,X1] :
( ( ( X1 = identity_relation(X0)
| relation_dom(X1) != X0
| ? [X2] :
( apply(X1,X2) != X2
& in(X2,X0) ) )
& ( ( relation_dom(X1) = X0
& ! [X3] :
( apply(X1,X3) = X3
| ~ in(X3,X0) ) )
| identity_relation(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) ),
inference(rectify,[],[f77]) ).
fof(f79,plain,
! [X0,X1] :
( ( ( X1 = identity_relation(X0)
| relation_dom(X1) != X0
| ( sK7(X0,X1) != apply(X1,sK7(X0,X1))
& in(sK7(X0,X1),X0) ) )
& ( ( relation_dom(X1) = X0
& ! [X3] :
( apply(X1,X3) = X3
| ~ in(X3,X0) ) )
| identity_relation(X0) != X1 ) )
| ~ relation(X1)
| ~ function(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f78]) ).
fof(f80,plain,
function(sK2),
inference(cnf_transformation,[],[f68]) ).
fof(f81,plain,
relation(sK2),
inference(cnf_transformation,[],[f68]) ).
fof(f82,plain,
in(sK1,set_intersection2(relation_dom(sK2),sK0)),
inference(cnf_transformation,[],[f68]) ).
fof(f83,plain,
apply(sK2,sK1) != apply(relation_composition(identity_relation(sK0),sK2),sK1),
inference(cnf_transformation,[],[f68]) ).
fof(f87,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f103,plain,
! [X0] : function(identity_relation(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f104,plain,
! [X0] : relation(identity_relation(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f117,plain,
! [X3,X0,X1] :
( apply(X1,X3) = X3
| ~ in(X3,X0)
| identity_relation(X0) != X1
| ~ relation(X1)
| ~ function(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f118,plain,
! [X0,X1] :
( relation_dom(X1) = X0
| identity_relation(X0) != X1
| ~ relation(X1)
| ~ function(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f121,plain,
! [X2,X0,X1] :
( apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ in(X0,relation_dom(X1))
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f122,definition,
~ sP8(apply(sK2,sK1)),
introduced(definition,[new_symbols(definition,[sP8])],[inequality_splitting_name_introduction]) ).
fof(f123,plain,
sP8(apply(relation_composition(identity_relation(sK0),sK2),sK1)),
inference(inequality_splitting,[],[f83,f122]) ).
fof(f126,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f87]) ).
fof(f129,plain,
! [X0] :
( relation_dom(identity_relation(X0)) = X0
| ~ relation(identity_relation(X0))
| ~ function(identity_relation(X0)) ),
inference(equality_resolution,[],[f118]) ).
fof(f130,plain,
! [X3,X0] :
( apply(identity_relation(X0),X3) = X3
| ~ in(X3,X0)
| ~ relation(identity_relation(X0))
| ~ function(identity_relation(X0)) ),
inference(equality_resolution,[],[f117]) ).
fof(f131,plain,
in(sK1,sK0),
inference(resolution,[],[f82,f126]) ).
fof(f137,plain,
( sP8(apply(sK2,apply(identity_relation(sK0),sK1)))
| ~ in(sK1,relation_dom(identity_relation(sK0)))
| ~ relation(sK2)
| ~ function(sK2)
| ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0)) ),
inference(superposition,[],[f123,f121]) ).
fof(f138,plain,
( sP8(apply(sK2,apply(identity_relation(sK0),sK1)))
| ~ in(sK1,relation_dom(identity_relation(sK0)))
| ~ function(sK2)
| ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0)) ),
inference(forward_subsumption_resolution,[],[f137,f81]) ).
fof(f139,plain,
( sP8(apply(sK2,apply(identity_relation(sK0),sK1)))
| ~ in(sK1,relation_dom(identity_relation(sK0)))
| ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0)) ),
inference(forward_subsumption_resolution,[],[f138,f80]) ).
fof(f140,plain,
( sP8(apply(sK2,apply(identity_relation(sK0),sK1)))
| ~ in(sK1,relation_dom(identity_relation(sK0)))
| ~ function(identity_relation(sK0)) ),
inference(forward_subsumption_resolution,[],[f139,f104]) ).
fof(f141,plain,
( sP8(apply(sK2,apply(identity_relation(sK0),sK1)))
| ~ in(sK1,relation_dom(identity_relation(sK0))) ),
inference(forward_subsumption_resolution,[],[f140,f103]) ).
fof(f143,definition,
( spl9_1
<=> in(sK1,relation_dom(identity_relation(sK0))) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f145,plain,
( ~ in(sK1,relation_dom(identity_relation(sK0)))
| spl9_1 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f147,definition,
( spl9_2
<=> sP8(apply(sK2,apply(identity_relation(sK0),sK1))) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f149,plain,
( sP8(apply(sK2,apply(identity_relation(sK0),sK1)))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f147]) ).
fof(f150,plain,
( ~ spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f141,f147,f143]) ).
fof(f154,plain,
( ~ in(sK1,sK0)
| ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0))
| spl9_1 ),
inference(superposition,[],[f145,f129]) ).
fof(f155,plain,
( ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0))
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f154,f131]) ).
fof(f156,plain,
( ~ function(identity_relation(sK0))
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f155,f104]) ).
fof(f157,plain,
( $false
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f156,f103]) ).
fof(f158,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f157]) ).
fof(f164,plain,
( sP8(apply(sK2,sK1))
| ~ in(sK1,sK0)
| ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0))
| ~ spl9_2 ),
inference(superposition,[],[f149,f130]) ).
fof(f165,plain,
( ~ in(sK1,sK0)
| ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0))
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f164,f122]) ).
fof(f166,plain,
( ~ relation(identity_relation(sK0))
| ~ function(identity_relation(sK0))
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f165,f131]) ).
fof(f167,plain,
( ~ function(identity_relation(sK0))
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f166,f104]) ).
fof(f168,plain,
( $false
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f167,f103]) ).
fof(f169,plain,
~ spl9_2,
inference(avatar_contradiction_clause,[],[f168]) ).
cnf(s1,plain,
( ~ spl9_1
| spl9_2 ),
inference(sat_conversion,[],[f150]) ).
cnf(s2,plain,
spl9_1,
inference(sat_conversion,[],[f158]) ).
cnf(s3,plain,
~ spl9_2,
inference(sat_conversion,[],[f169]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f170,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU008+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n008.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:22:25 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.74/1.25 % (1836775)Detected formulas, will run a generic FOF schedule.
% 2.74/1.25 % (1836780)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=4057126952:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.25 % (1836783)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=348627631:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.25 % (1836783)First to succeed.
% 2.74/1.25 % (1836783)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1836775"
% 2.74/1.25 % (1836782)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=3841909877:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.25 % (1836781)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=966524936:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.25 % (1836786)dis-21_1_sil=8000:lcm=predicate:random_seed=2347729884: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.74/1.25 % (1836784)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=653451908:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.25 % (1836785)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3433452910:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.25 % (1836784)Also succeeded, but the first one will report.
% 2.74/1.25 % (1836785)Also succeeded, but the first one will report.
% 2.74/1.25 % (1836786)Instruction limit reached!
% 2.74/1.25 % (1836786)------------------------------
% 2.74/1.25 % (1836786)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.25 % (1836786)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.25 % (1836786)CaDiCaL version: 2.1.3
% 2.74/1.25 % (1836786)Termination reason: Instruction limit
% 2.74/1.25 % (1836786)Termination phase: Saturation
% 2.74/1.25 % (1836786)Time elapsed: 0.074 s
% 2.74/1.25 % (1836786)Peak memory usage: 90 MB
% 2.74/1.25 % (1836786)Instructions burned: 131 (million)
% 2.74/1.25 % (1836794)lrs+10_1_sil=8000:sp=occurrence:random_seed=3319232658:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.74/1.25 % (1836783)Refutation found. Thanks to Tanya!
% 2.74/1.25 % SZS status Theorem for theBenchmark
% 2.74/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.43/1.45 % (1836783)------------------------------
% 3.43/1.45 % (1836783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.45 % (1836783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.45 % (1836783)CaDiCaL version: 2.1.3
% 3.43/1.45 % (1836783)Termination reason: Refutation
% 3.43/1.45 % (1836783)Time elapsed: 0.005 s
% 3.43/1.45 % (1836783)Peak memory usage: 89 MB
% 3.43/1.45 % (1836783)Instructions burned: 6 (million)
% 3.43/1.45 % (1836783)------------------------------
% 3.43/1.45 % (1836783)------------------------------
% 3.43/1.45 % (1836775)Success in time 0.4 s
% 3.43/1.45 % Vampire exiting
%------------------------------------------------------------------------------