%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET984+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:42:28 PM UTC 2026
% Result : Theorem 2.94s 1.38s
% Output : Refutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 77 ( 23 unt; 6 def)
% Number of atoms : 176 ( 85 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 160 ( 61 ~; 73 |; 15 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 76 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( cartesian_product2(X0,X1) = empty_set
<=> ( X0 = empty_set
| X1 = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t113_zfmisc_1) ).
fof(f8,axiom,
! [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(f9,axiom,
! [X0,X1,X2,X3] :
( cartesian_product2(X0,X1) = cartesian_product2(X2,X3)
=> ( X0 = empty_set
| X1 = empty_set
| ( X0 = X2
& X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t134_zfmisc_1) ).
fof(f10,conjecture,
! [X0,X1,X2,X3] :
( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
=> ( cartesian_product2(X0,X1) = empty_set
| ( subset(X0,X2)
& subset(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t138_zfmisc_1) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
=> ( cartesian_product2(X0,X1) = empty_set
| ( subset(X0,X2)
& subset(X1,X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f12,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f13,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f16,plain,
! [X0,X1,X2,X3] :
( X0 = empty_set
| X1 = empty_set
| ( X0 = X2
& X1 = X3 )
| cartesian_product2(X0,X1) != cartesian_product2(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( X0 = empty_set
| X1 = empty_set
| ( X0 = X2
& X1 = X3 )
| cartesian_product2(X0,X1) != cartesian_product2(X2,X3) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
? [X0,X1,X2,X3] :
( empty_set != cartesian_product2(X0,X1)
& ( ~ subset(X0,X2)
| ~ subset(X1,X3) )
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f19,plain,
? [X0,X1,X2,X3] :
( empty_set != cartesian_product2(X0,X1)
& ( ~ subset(X0,X2)
| ~ subset(X1,X3) )
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f23,plain,
! [X0,X1] :
( ( cartesian_product2(X0,X1) = empty_set
| ( empty_set != X0
& empty_set != X1 ) )
& ( X0 = empty_set
| X1 = empty_set
| empty_set != cartesian_product2(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f24,plain,
! [X0,X1] :
( ( cartesian_product2(X0,X1) = empty_set
| ( empty_set != X0
& empty_set != X1 ) )
& ( X0 = empty_set
| X1 = empty_set
| empty_set != cartesian_product2(X0,X1) ) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
( empty_set != cartesian_product2(sK2,sK3)
& ( ~ subset(sK2,sK4)
| ~ subset(sK3,sK5) )
& subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f19]) ).
fof(f26,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f33,plain,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
| empty_set != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
| empty_set != X0 ),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
! [X2,X3,X0,X1] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
inference(cnf_transformation,[],[f8]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
| empty_set = X1
| X1 = X3
| empty_set = X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
| empty_set = X1
| X0 = X2
| empty_set = X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f38,plain,
subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5)),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
( ~ subset(sK2,sK4)
| ~ subset(sK3,sK5) ),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
empty_set != cartesian_product2(sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f12]) ).
fof(f42,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f43,plain,
! [X1] : empty_set = cartesian_product2(empty_set,X1),
inference(equality_resolution,[],[f34]) ).
fof(f44,plain,
! [X0] : empty_set = cartesian_product2(X0,empty_set),
inference(equality_resolution,[],[f33]) ).
fof(f46,definition,
( spl6_1
<=> subset(sK3,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f50,definition,
( spl6_2
<=> subset(sK2,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f52,plain,
( ~ subset(sK2,sK4)
| spl6_2 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f53,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f39,f50,f46]) ).
fof(f55,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X1),
inference(superposition,[],[f41,f26]) ).
fof(f60,plain,
cartesian_product2(sK2,sK3) = set_intersection2(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5)),
inference(resolution,[],[f42,f38]) ).
fof(f72,plain,
cartesian_product2(sK2,sK3) = cartesian_product2(set_intersection2(sK2,sK4),set_intersection2(sK3,sK5)),
inference(superposition,[],[f35,f60]) ).
fof(f91,plain,
! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK2,sK3)
| empty_set = set_intersection2(sK3,sK5)
| set_intersection2(sK3,sK5) = X1
| empty_set = set_intersection2(sK2,sK4) ),
inference(superposition,[],[f36,f72]) ).
fof(f98,definition,
( spl6_3
<=> empty_set = set_intersection2(sK2,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f100,plain,
( empty_set = set_intersection2(sK2,sK4)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f102,definition,
( spl6_4
<=> empty_set = set_intersection2(sK3,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f104,plain,
( empty_set = set_intersection2(sK3,sK5)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f106,definition,
( spl6_5
<=> ! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK2,sK3)
| set_intersection2(sK3,sK5) = X1 ) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f107,plain,
( ! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK2,sK3)
| set_intersection2(sK3,sK5) = X1 )
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f108,plain,
( spl6_3
| spl6_4
| spl6_5 ),
inference(avatar_split_clause,[],[f91,f106,f102,f98]) ).
fof(f109,plain,
( cartesian_product2(sK2,sK3) = cartesian_product2(empty_set,set_intersection2(sK3,sK5))
| ~ spl6_3 ),
inference(superposition,[],[f72,f100]) ).
fof(f112,plain,
( empty_set = cartesian_product2(sK2,sK3)
| ~ spl6_3 ),
inference(forward_demodulation,[],[f109,f43]) ).
fof(f113,plain,
( $false
| ~ spl6_3 ),
inference(forward_subsumption_resolution,[],[f112,f40]) ).
fof(f114,plain,
~ spl6_3,
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f115,plain,
! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK2,sK3)
| empty_set = set_intersection2(sK3,sK5)
| set_intersection2(sK2,sK4) = X0
| empty_set = set_intersection2(sK2,sK4) ),
inference(superposition,[],[f37,f72]) ).
fof(f122,definition,
( spl6_6
<=> ! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK2,sK3)
| set_intersection2(sK2,sK4) = X0 ) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f123,plain,
( ! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK2,sK3)
| set_intersection2(sK2,sK4) = X0 )
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f124,plain,
( spl6_3
| spl6_4
| spl6_6 ),
inference(avatar_split_clause,[],[f115,f122,f102,f98]) ).
fof(f135,plain,
( cartesian_product2(sK2,sK3) = cartesian_product2(set_intersection2(sK2,sK4),empty_set)
| ~ spl6_4 ),
inference(superposition,[],[f72,f104]) ).
fof(f140,plain,
( empty_set = cartesian_product2(sK2,sK3)
| ~ spl6_4 ),
inference(forward_demodulation,[],[f135,f44]) ).
fof(f141,plain,
( $false
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f140,f40]) ).
fof(f142,plain,
~ spl6_4,
inference(avatar_contradiction_clause,[],[f141]) ).
fof(f215,plain,
( sK3 = set_intersection2(sK3,sK5)
| ~ spl6_5 ),
inference(equality_resolution,[],[f107]) ).
fof(f248,plain,
( subset(sK3,sK5)
| ~ spl6_5 ),
inference(superposition,[],[f55,f215]) ).
fof(f257,plain,
( spl6_1
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f248,f106,f46]) ).
fof(f3609,plain,
( sK2 = set_intersection2(sK2,sK4)
| ~ spl6_6 ),
inference(equality_resolution,[],[f123]) ).
fof(f3628,plain,
( subset(sK2,sK4)
| ~ spl6_6 ),
inference(superposition,[],[f55,f3609]) ).
fof(f3674,plain,
( $false
| spl6_2
| ~ spl6_6 ),
inference(forward_subsumption_resolution,[],[f3628,f52]) ).
fof(f3675,plain,
( spl6_2
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f3674]) ).
cnf(s1,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f53]) ).
cnf(s2,plain,
( spl6_3
| spl6_4
| spl6_5 ),
inference(sat_conversion,[],[f108]) ).
cnf(s3,plain,
~ spl6_3,
inference(sat_conversion,[],[f114]) ).
cnf(s4,plain,
( spl6_3
| spl6_4
| spl6_6 ),
inference(sat_conversion,[],[f124]) ).
cnf(s5,plain,
~ spl6_4,
inference(sat_conversion,[],[f142]) ).
cnf(s7,plain,
( spl6_1
| ~ spl6_5 ),
inference(sat_conversion,[],[f257]) ).
cnf(s11,plain,
( spl6_2
| ~ spl6_6 ),
inference(sat_conversion,[],[f3675]) ).
cnf(s12,plain,
( spl6_3
| spl6_6 ),
inference(rat,[],[s4,s5]) ).
cnf(s13,plain,
spl6_6,
inference(rat,[],[s12,s3]) ).
cnf(s14,plain,
spl6_2,
inference(rat,[],[s11,s13]) ).
cnf(s15,plain,
spl6_5,
inference(rat,[],[s2,s5,s3]) ).
cnf(s16,plain,
spl6_1,
inference(rat,[],[s7,s15]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s1,s14,s16]) ).
fof(f3680,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET984+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 % Computer : n007.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 03:15:55 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/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.94/1.38 % (1994989)Detected formulas, will run a generic FOF schedule.
% 2.94/1.38 % (1995057)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=435139181:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.94/1.38 % (1995057)Instruction limit reached!
% 2.94/1.38 % (1995057)------------------------------
% 2.94/1.38 % (1995057)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.38 % (1995057)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.38 % (1995057)CaDiCaL version: 2.1.3
% 2.94/1.38 % (1995057)Termination reason: Instruction limit
% 2.94/1.38 % (1995057)Termination phase: Saturation
% 2.94/1.38 % (1995057)Time elapsed: 0.040 s
% 2.94/1.38 % (1995057)Peak memory usage: 89 MB
% 2.94/1.38 % (1995057)Instructions burned: 109 (million)
% 2.94/1.38 % (1995055)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=1823575909:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.94/1.38 % (1995054)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=2123993423:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.94/1.38 % (1995052)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=3525406389:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.94/1.38 % (1995059)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=736458780:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.94/1.38 % (1995062)dis-21_1_sil=8000:lcm=predicate:random_seed=4150205800: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.94/1.38 % (1995062)Refutation not found, incomplete strategy
% 2.94/1.38 % (1995062)------------------------------
% 2.94/1.38 % (1995062)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.38 % (1995062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.38 % (1995062)CaDiCaL version: 2.1.3
% 2.94/1.38 % (1995062)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.38 % (1995062)Time elapsed: 0.002 s
% 2.94/1.38 % (1995062)Peak memory usage: 88 MB
% 2.94/1.38 % (1995062)Instructions burned: 1 (million)
% 2.94/1.38 % (1995060)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2578184830:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.94/1.38 % (1995060)First to succeed.
% 2.94/1.38 % (1995059)Instruction limit reached!
% 2.94/1.38 % (1995059)------------------------------
% 2.94/1.38 % (1995059)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.38 % (1995059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.38 % (1995059)CaDiCaL version: 2.1.3
% 2.94/1.38 % (1995059)Termination reason: Instruction limit
% 2.94/1.38 % (1995059)Termination phase: Saturation
% 2.94/1.38 % (1995059)Time elapsed: 0.065 s
% 2.94/1.38 % (1995059)Peak memory usage: 88 MB
% 2.94/1.38 % (1995059)Instructions burned: 119 (million)
% 2.94/1.38 % (1995060)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1994989"
% 2.94/1.38 % (1995111)lrs+10_1_sil=8000:sp=occurrence:random_seed=3295612946:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.94/1.38 % (1995111)Also succeeded, but the first one will report.
% 2.94/1.38 % (1995133)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2459561103:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.94/1.38 % (1995133)Also succeeded, but the first one will report.
% 2.94/1.38 % (1995062)------------------------------
% 2.94/1.38 % (1995062)------------------------------
% 2.94/1.38 % (1995060)Refutation found. Thanks to Tanya!
% 2.94/1.38 % SZS status Theorem for theBenchmark
% 2.94/1.38 % SZS output start Proof for theBenchmark
% See solution above
% 3.99/1.48 % (1995060)------------------------------
% 3.99/1.48 % (1995060)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.48 % (1995060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.48 % (1995060)CaDiCaL version: 2.1.3
% 3.99/1.48 % (1995060)Termination reason: Refutation
% 3.99/1.48 % (1995060)Time elapsed: 0.059 s
% 3.99/1.48 % (1995060)Peak memory usage: 91 MB
% 3.99/1.48 % (1995060)Instructions burned: 99 (million)
% 3.99/1.48 % (1995060)------------------------------
% 3.99/1.48 % (1995060)------------------------------
% 3.99/1.48 % (1994989)Success in time 0.484 s
% 3.99/1.48 % Vampire exiting
%------------------------------------------------------------------------------