%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET957+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:45:05 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 76 ( 12 unt; 4 def)
% Number of atoms : 198 ( 42 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 193 ( 71 ~; 81 |; 28 &)
% ( 9 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 108 ( 0 sgn 86 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f8,axiom,
! [X0,X1,X2,X3] :
~ ( subset(X0,cartesian_product2(X1,X2))
& in(X3,X0)
& ! [X4,X5] :
~ ( in(X4,X1)
& in(X5,X2)
& X3 = ordered_pair(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t103_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( subset(X0,cartesian_product2(X1,X2))
& subset(X3,cartesian_product2(X4,X5))
& ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) ) )
=> X0 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t110_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( subset(X0,cartesian_product2(X1,X2))
& subset(X3,cartesian_product2(X4,X5))
& ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) ) )
=> X0 = X3 ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f14,plain,
! [X0,X1,X2,X3] :
( ~ subset(X0,cartesian_product2(X1,X2))
| ~ in(X3,X0)
| ? [X4,X5] :
( in(X4,X1)
& in(X5,X2)
& X3 = ordered_pair(X4,X5) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
? [X0,X1,X2,X3,X4,X5] :
( X0 != X3
& subset(X0,cartesian_product2(X1,X2))
& subset(X3,cartesian_product2(X4,X5))
& ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f16,plain,
? [X0,X1,X2,X3,X4,X5] :
( X0 != X3
& subset(X0,cartesian_product2(X1,X2))
& subset(X3,cartesian_product2(X4,X5))
& ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( ~ subset(X0,cartesian_product2(X1,X2))
| ~ in(X3,X0)
| ( in(sK2(X1,X2,X3),X1)
& in(sK3(X1,X2,X3),X2)
& ordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)) = X3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X4,sK2(X1,X2,X3)),skolemize(X5,sK3(X1,X2,X3))],[f14]) ).
fof(f21,plain,
? [X0,X1,X2,X3,X4,X5] :
( X0 != X3
& subset(X0,cartesian_product2(X1,X2))
& subset(X3,cartesian_product2(X4,X5))
& ! [X6,X7] :
( ( in(ordered_pair(X6,X7),X0)
| ~ in(ordered_pair(X6,X7),X3) )
& ( in(ordered_pair(X6,X7),X3)
| ~ in(ordered_pair(X6,X7),X0) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f22,plain,
( sK4 != sK7
& subset(sK4,cartesian_product2(sK5,sK6))
& subset(sK7,cartesian_product2(sK8,sK9))
& ! [X6,X7] :
( ( in(ordered_pair(X6,X7),sK4)
| ~ in(ordered_pair(X6,X7),sK7) )
& ( in(ordered_pair(X6,X7),sK7)
| ~ in(ordered_pair(X6,X7),sK4) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7),skolemize(X4,sK8),skolemize(X5,sK9)],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f24,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK10(X0,X1),X1)
| ~ in(sK10(X0,X1),X0) )
& ( in(sK10(X0,X1),X1)
| in(sK10(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0,X1))],[f23]) ).
fof(f26,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( ~ subset(X0,cartesian_product2(X1,X2))
| ~ in(X3,X0)
| ordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)) = X3 ),
inference(cnf_transformation,[],[f20]) ).
fof(f35,plain,
! [X6,X7] :
( in(ordered_pair(X6,X7),sK7)
| ~ in(ordered_pair(X6,X7),sK4) ),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
! [X6,X7] :
( in(ordered_pair(X6,X7),sK4)
| ~ in(ordered_pair(X6,X7),sK7) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
subset(sK7,cartesian_product2(sK8,sK9)),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
subset(sK4,cartesian_product2(sK5,sK6)),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
sK4 != sK7,
inference(cnf_transformation,[],[f22]) ).
fof(f40,plain,
! [X0,X1] :
( in(sK10(X0,X1),X1)
| in(sK10(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
! [X0,X1] :
( ~ in(sK10(X0,X1),X1)
| X0 = X1
| ~ in(sK10(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ~ subset(X0,cartesian_product2(X1,X2))
| ~ in(X3,X0)
| unordered_pair(unordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)),singleton(sK2(X1,X2,X3))) = X3 ),
inference(definition_unfolding,[],[f32,f27]) ).
fof(f44,plain,
! [X6,X7] :
( ~ in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK7)
| in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK4) ),
inference(definition_unfolding,[],[f36,f27,f27]) ).
fof(f45,plain,
! [X6,X7] :
( ~ in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK4)
| in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK7) ),
inference(definition_unfolding,[],[f35,f27,f27]) ).
fof(f48,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK4)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK7) ),
inference(superposition,[],[f45,f26]) ).
fof(f49,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK7)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK4) ),
inference(superposition,[],[f44,f26]) ).
fof(f84,plain,
! [X2,X3,X0,X1] :
( ~ subset(X0,cartesian_product2(X1,X2))
| unordered_pair(singleton(sK2(X1,X2,X3)),unordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3))) = X3
| ~ in(X3,X0) ),
inference(forward_demodulation,[],[f43,f26]) ).
fof(f86,plain,
! [X0] :
( ~ in(X0,sK7)
| unordered_pair(singleton(sK2(sK8,sK9,X0)),unordered_pair(sK2(sK8,sK9,X0),sK3(sK8,sK9,X0))) = X0 ),
inference(resolution,[],[f84,f37]) ).
fof(f87,plain,
! [X0] :
( ~ in(X0,sK4)
| unordered_pair(singleton(sK2(sK5,sK6,X0)),unordered_pair(sK2(sK5,sK6,X0),sK3(sK5,sK6,X0))) = X0 ),
inference(resolution,[],[f84,f38]) ).
fof(f95,plain,
! [X0] :
( in(sK10(sK4,X0),X0)
| sK10(sK4,X0) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,X0))),unordered_pair(sK2(sK5,sK6,sK10(sK4,X0)),sK3(sK5,sK6,sK10(sK4,X0))))
| sK4 = X0 ),
inference(resolution,[],[f87,f40]) ).
fof(f112,definition,
( spl11_1
<=> sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,sK7))),unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7)))) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f114,plain,
( sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,sK7))),unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))))
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f116,definition,
( spl11_2
<=> sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK8,sK9,sK10(sK4,sK7))),unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7)))) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f118,plain,
( sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK8,sK9,sK10(sK4,sK7))),unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))))
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f121,plain,
( ~ in(sK10(sK4,sK7),sK7)
| in(sK10(sK4,sK7),sK4)
| ~ spl11_2 ),
inference(superposition,[],[f49,f118]) ).
fof(f148,definition,
( spl11_5
<=> in(sK10(sK4,sK7),sK7) ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f149,plain,
( ~ in(sK10(sK4,sK7),sK7)
| spl11_5 ),
inference(avatar_component_clause,[],[f148]) ).
fof(f150,plain,
( in(sK10(sK4,sK7),sK7)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f148]) ).
fof(f152,definition,
( spl11_6
<=> in(sK10(sK4,sK7),sK4) ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f153,plain,
( in(sK10(sK4,sK7),sK4)
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f152]) ).
fof(f156,plain,
( spl11_6
| ~ spl11_5
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f121,f116,f148,f152]) ).
fof(f178,plain,
( in(sK10(sK4,sK7),sK4)
| sK4 = sK7
| spl11_5 ),
inference(resolution,[],[f149,f40]) ).
fof(f179,plain,
( in(sK10(sK4,sK7),sK4)
| spl11_5 ),
inference(forward_subsumption_resolution,[],[f178,f39]) ).
fof(f180,plain,
( spl11_6
| spl11_5 ),
inference(avatar_split_clause,[],[f179,f148,f152]) ).
fof(f198,plain,
( sK4 = sK7
| ~ in(sK10(sK4,sK7),sK4)
| ~ spl11_5 ),
inference(resolution,[],[f150,f41]) ).
fof(f201,plain,
( ~ in(sK10(sK4,sK7),sK4)
| ~ spl11_5 ),
inference(forward_subsumption_resolution,[],[f198,f39]) ).
fof(f202,plain,
( ~ spl11_6
| ~ spl11_5 ),
inference(avatar_split_clause,[],[f201,f148,f152]) ).
fof(f215,plain,
( sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,sK7))),unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))))
| sK4 = sK7
| spl11_5 ),
inference(resolution,[],[f95,f149]) ).
fof(f219,plain,
( sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,sK7))),unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))))
| sK4 = sK7
| sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK8,sK9,sK10(sK4,sK7))),unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7)))) ),
inference(resolution,[],[f95,f86]) ).
fof(f222,plain,
( sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,sK7))),unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))))
| sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK8,sK9,sK10(sK4,sK7))),unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7)))) ),
inference(forward_subsumption_resolution,[],[f219,f39]) ).
fof(f223,plain,
( sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,sK7))),unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))))
| spl11_5 ),
inference(forward_subsumption_resolution,[],[f215,f39]) ).
fof(f224,plain,
( spl11_2
| spl11_1 ),
inference(avatar_split_clause,[],[f222,f112,f116]) ).
fof(f225,plain,
( spl11_1
| spl11_5 ),
inference(avatar_split_clause,[],[f223,f148,f112]) ).
fof(f226,plain,
( sK10(sK4,sK7) = unordered_pair(singleton(sK2(sK5,sK6,sK10(sK4,sK7))),unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))))
| ~ spl11_6 ),
inference(resolution,[],[f153,f87]) ).
fof(f228,plain,
( spl11_1
| ~ spl11_6 ),
inference(avatar_split_clause,[],[f226,f152,f112]) ).
fof(f262,plain,
( ~ in(sK10(sK4,sK7),sK7)
| in(sK10(sK4,sK7),sK4)
| ~ spl11_1 ),
inference(superposition,[],[f49,f114]) ).
fof(f263,plain,
( ~ in(sK10(sK4,sK7),sK4)
| in(sK10(sK4,sK7),sK7)
| ~ spl11_1 ),
inference(superposition,[],[f48,f114]) ).
fof(f307,plain,
( spl11_5
| ~ spl11_6
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f263,f112,f152,f148]) ).
fof(f308,plain,
( spl11_6
| ~ spl11_5
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f262,f112,f148,f152]) ).
cnf(s5,plain,
( ~ spl11_2
| ~ spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f156]) ).
cnf(s10,plain,
( spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f180]) ).
cnf(s12,plain,
( ~ spl11_5
| ~ spl11_6 ),
inference(sat_conversion,[],[f202]) ).
cnf(s16,plain,
( spl11_1
| spl11_2 ),
inference(sat_conversion,[],[f224]) ).
cnf(s17,plain,
( spl11_1
| spl11_5 ),
inference(sat_conversion,[],[f225]) ).
cnf(s18,plain,
( spl11_1
| ~ spl11_6 ),
inference(sat_conversion,[],[f228]) ).
cnf(s27,plain,
( ~ spl11_1
| spl11_5
| ~ spl11_6 ),
inference(sat_conversion,[],[f307]) ).
cnf(s28,plain,
( ~ spl11_1
| ~ spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f308]) ).
cnf(s29,plain,
spl11_1,
inference(rat,[],[s5,s16,s17,s18]) ).
cnf(s30,plain,
~ spl11_5,
inference(rat,[],[s12,s28,s29]) ).
cnf(s31,plain,
spl11_6,
inference(rat,[],[s10,s30]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s27,s29,s30,s31]) ).
fof(f309,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET957+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n019.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 03:16:19 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.11/0.45 % (3628928)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3628937)dis+10_1_sil=32000:sp=arity:random_seed=650275115:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.11/0.45 % (3628935)% WARNING: option uhcvi not known.
% 0.11/0.45 % (3628937) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3628928-3628937"...
% 0.11/0.45 % (3628934)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=502495937_3000 on theBenchmark for (3000ds/0Mi)
% 0.11/0.45 % (3628937)...printing done.
% 0.11/0.45 % (3628935)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3933330931:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.11/0.45 % (3628936)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1156866655:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.11/0.45 % (3628937)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (3628937)------------------------------
% 0.11/0.46 % (3628937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (3628937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (3628937)CaDiCaL version: 2.1.3
% 0.11/0.46 % (3628937)Termination reason: Refutation
% 0.11/0.46 % (3628937)Time elapsed: 0.007 s
% 0.11/0.46 % (3628937)Peak memory usage: 12 MB
% 0.11/0.46 % (3628937)Instructions burned: 17 (million)
% 0.11/0.46 % (3628928)Success in time 0.022 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------