%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV403+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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 01:21:10 PM UTC 2026
% Result : Theorem 0.09s 0.27s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 85 ( 11 unt; 7 def)
% Number of atoms : 194 ( 27 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 183 ( 74 ~; 80 |; 12 &)
% ( 9 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 133 ( 0 sgn 121 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(f17,axiom,
! [X0,X1,X2,X3] :
( strictly_less_than(X3,X2)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax29) ).
fof(f18,axiom,
! [X0,X1,X2,X3] :
( less_than(X2,X3)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax30) ).
fof(f19,conjecture,
! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& strictly_less_than(X2,X3) )
=> pair_in_list(update_slb(X0,X3),X1,X3) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l39_co) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& strictly_less_than(X2,X3) )
=> pair_in_list(update_slb(X0,X3),X1,X3) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f27,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f28,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(ennf_transformation,[],[f18]) ).
fof(f29,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X2,X3) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f30,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X2,X3) ) ),
inference(flattening,[],[f29]) ).
fof(f32,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f36,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f45,plain,
! [X2,X3,X0,X1,X4] :
( X3 != X4
| X1 != X2
| pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ),
inference(cnf_transformation,[],[f11]) ).
fof(f46,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X3 = X4 ),
inference(cnf_transformation,[],[f11]) ).
fof(f47,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X1 = X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f48,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f11]) ).
fof(f54,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f55,plain,
! [X2,X3,X0,X1] :
( ~ less_than(X2,X3)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f56,plain,
strictly_less_than(sK2,sK3),
inference(cnf_transformation,[],[f30]) ).
fof(f57,plain,
pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2),
inference(cnf_transformation,[],[f30]) ).
fof(f58,plain,
~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK3),
inference(cnf_transformation,[],[f30]) ).
fof(f59,plain,
! [X2,X3,X1] :
( ~ strictly_less_than(X2,X3)
| ~ pair_in_list(sK0,X1,X2)
| pair_in_list(update_slb(sK0,X3),X1,X3) ),
inference(cnf_transformation,[],[f30]) ).
fof(f61,plain,
! [X2,X0,X1,X4] :
( X1 != X2
| pair_in_list(insert_slb(X0,pair(X1,X4)),X2,X4) ),
inference(equality_resolution,[],[f45]) ).
fof(f62,plain,
! [X2,X0,X4] : pair_in_list(insert_slb(X0,pair(X2,X4)),X2,X4),
inference(equality_resolution,[],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| ~ strictly_less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f36]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( strictly_less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
inference(consistent_polarity_flipping,[],[f54]) ).
fof(f73,plain,
! [X2,X3,X1] :
( ~ pair_in_list(sK0,X1,X2)
| strictly_less_than(X2,X3)
| pair_in_list(update_slb(sK0,X3),X1,X3) ),
inference(consistent_polarity_flipping,[],[f59]) ).
fof(f74,plain,
~ strictly_less_than(sK2,sK3),
inference(consistent_polarity_flipping,[],[f56]) ).
fof(f91,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f63,f32]) ).
fof(f101,plain,
( pair_in_list(sK0,sK1,sK2)
| sK2 = sK5 ),
inference(resolution,[],[f46,f57]) ).
fof(f105,definition,
( spl6_1
<=> sK2 = sK5 ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f107,plain,
( sK2 = sK5
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f109,definition,
( spl6_2
<=> pair_in_list(sK0,sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f111,plain,
( pair_in_list(sK0,sK1,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f112,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f101,f109,f105]) ).
fof(f113,plain,
( pair_in_list(sK0,sK1,sK2)
| sK1 = sK4 ),
inference(resolution,[],[f47,f57]) ).
fof(f117,definition,
( spl6_3
<=> sK1 = sK4 ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f119,plain,
( sK1 = sK4
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f120,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f113,f109,f117]) ).
fof(f121,plain,
( ! [X0] :
( pair_in_list(update_slb(sK0,X0),sK1,X0)
| strictly_less_than(sK2,X0) )
| ~ spl6_2 ),
inference(resolution,[],[f111,f73]) ).
fof(f133,plain,
! [X0,X1] : update_slb(insert_slb(X0,pair(X1,sK2)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK3)),
inference(resolution,[],[f72,f74]) ).
fof(f134,plain,
! [X2,X3,X0,X1] :
( less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3)) ),
inference(resolution,[],[f72,f91]) ).
fof(f183,plain,
! [X2,X3,X0,X1,X4,X5] :
( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3))
| update_slb(insert_slb(X4,pair(X5,X2)),X3) = insert_slb(update_slb(X4,X3),pair(X5,X2)) ),
inference(resolution,[],[f134,f55]) ).
fof(f356,definition,
( spl6_5
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK3) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f358,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK3)
| spl6_5 ),
inference(avatar_component_clause,[],[f356]) ).
fof(f399,plain,
! [X0,X1] :
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK3)
| insert_slb(update_slb(X0,sK3),pair(X1,sK3)) = update_slb(insert_slb(X0,pair(X1,sK5)),sK3) ),
inference(superposition,[],[f58,f183]) ).
fof(f404,definition,
( spl6_6
<=> ! [X0,X1] : insert_slb(update_slb(X0,sK3),pair(X1,sK3)) = update_slb(insert_slb(X0,pair(X1,sK5)),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f405,plain,
( ! [X0,X1] : insert_slb(update_slb(X0,sK3),pair(X1,sK3)) = update_slb(insert_slb(X0,pair(X1,sK5)),sK3)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f404]) ).
fof(f406,plain,
( spl6_6
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f399,f356,f404]) ).
fof(f411,definition,
( spl6_8
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f412,plain,
( pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f411]) ).
fof(f413,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3)
| spl6_8 ),
inference(avatar_component_clause,[],[f411]) ).
fof(f488,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| spl6_5 ),
inference(resolution,[],[f358,f48]) ).
fof(f489,plain,
( strictly_less_than(sK2,sK3)
| ~ spl6_2
| spl6_5 ),
inference(resolution,[],[f488,f121]) ).
fof(f490,plain,
( $false
| ~ spl6_2
| spl6_5 ),
inference(forward_subsumption_resolution,[],[f489,f74]) ).
fof(f491,plain,
( ~ spl6_2
| spl6_5 ),
inference(avatar_contradiction_clause,[],[f490]) ).
fof(f498,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK1,sK5)),sK3),sK1,sK3)
| ~ spl6_3 ),
inference(superposition,[],[f58,f119]) ).
fof(f501,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK1,sK2)),sK3),sK1,sK3)
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_demodulation,[],[f498,f107]) ).
fof(f503,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK1,sK3)),sK1,sK3)
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_demodulation,[],[f501,f133]) ).
fof(f504,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_subsumption_resolution,[],[f503,f62]) ).
fof(f505,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f504]) ).
fof(f522,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| spl6_8 ),
inference(resolution,[],[f413,f48]) ).
fof(f530,definition,
( spl6_10
<=> pair_in_list(update_slb(sK0,sK3),sK1,sK3) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f531,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| spl6_10 ),
inference(avatar_component_clause,[],[f530]) ).
fof(f578,plain,
( ~ spl6_10
| spl6_8 ),
inference(avatar_split_clause,[],[f522,f411,f530]) ).
fof(f579,plain,
( strictly_less_than(sK2,sK3)
| ~ spl6_2
| spl6_10 ),
inference(resolution,[],[f531,f121]) ).
fof(f580,plain,
( $false
| ~ spl6_2
| spl6_10 ),
inference(forward_subsumption_resolution,[],[f579,f74]) ).
fof(f581,plain,
( ~ spl6_2
| spl6_10 ),
inference(avatar_contradiction_clause,[],[f580]) ).
fof(f600,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3)
| ~ spl6_6 ),
inference(superposition,[],[f58,f405]) ).
fof(f604,plain,
( $false
| ~ spl6_6
| ~ spl6_8 ),
inference(forward_subsumption_resolution,[],[f600,f412]) ).
fof(f605,plain,
( ~ spl6_6
| ~ spl6_8 ),
inference(avatar_contradiction_clause,[],[f604]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f112]) ).
cnf(s2,plain,
( spl6_2
| spl6_3 ),
inference(sat_conversion,[],[f120]) ).
cnf(s5,plain,
( ~ spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f406]) ).
cnf(s7,plain,
( ~ spl6_2
| spl6_5 ),
inference(sat_conversion,[],[f491]) ).
cnf(s9,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f505]) ).
cnf(s13,plain,
( spl6_8
| ~ spl6_10 ),
inference(sat_conversion,[],[f578]) ).
cnf(s14,plain,
( ~ spl6_2
| spl6_10 ),
inference(sat_conversion,[],[f581]) ).
cnf(s18,plain,
( ~ spl6_6
| ~ spl6_8 ),
inference(sat_conversion,[],[f605]) ).
cnf(s19,plain,
~ spl6_2,
inference(rat,[],[s18,s5,s13,s7,s14]) ).
cnf(s20,plain,
spl6_3,
inference(rat,[],[s2,s19]) ).
cnf(s21,plain,
spl6_1,
inference(rat,[],[s1,s19]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s9,s20,s21]) ).
fof(f606,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV403+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.16 % Computer : n015.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Mon Sep 28 10:53:47 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/0.20 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.27 % (2540256)Will run a generic schedule for satisfiability detection.
% 0.09/0.27 % (2540261)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2651065504_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.27 % TRYING [1]
% 0.09/0.27 % TRYING [2]
% 0.09/0.27 % TRYING [3]
% 0.09/0.27 % (2540262)% WARNING: option uhcvi not known.
% 0.09/0.27 % TRYING [4]
% 0.09/0.27 % (2540264)dis+10_1_sil=32000:sp=arity:random_seed=4041916662:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.27 % (2540262)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3932197572:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.27 % (2540263)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3573226927:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.27 % (2540266)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3624169957:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.27 % (2540265)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1517857862:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.27 % (2540267)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2625842023:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.27 % TRYING [5]
% 0.09/0.27 % (2540262) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2540256-2540262"...
% 0.09/0.27 % (2540262)...printing done.
% 0.09/0.27 % (2540262)Refutation found. Thanks to Tanya!
% 0.09/0.27 % SZS status Theorem for theBenchmark
% 0.09/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.27 % (2540262)------------------------------
% 0.09/0.27 % (2540262)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.27 % (2540262)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.27 % (2540262)CaDiCaL version: 2.1.3
% 0.09/0.27 % (2540262)Termination reason: Refutation
% 0.09/0.27 % (2540262)Time elapsed: 0.024 s
% 0.09/0.27 % (2540262)Peak memory usage: 13 MB
% 0.09/0.27 % (2540262)Instructions burned: 36 (million)
% 0.09/0.27 % (2540256)Success in time 0.061 s
% 0.09/0.27 % Vampire exiting
%------------------------------------------------------------------------------