%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET011+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:39:29 PM UTC 2026
% Result : Theorem 1.42s 1.66s
% Output : Refutation 5.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 78 ( 12 unt; 7 def)
% Number of atoms : 201 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 202 ( 79 ~; 89 |; 21 &)
% ( 12 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 71 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f8,conjecture,
! [X0,X1] : difference(X0,difference(X0,X1)) = intersection(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_difference_difference_intersection) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] : difference(X0,difference(X0,X1)) = intersection(X0,X1),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
? [X0,X1] : intersection(X0,X1) != difference(X0,difference(X0,X1)),
inference(ennf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f17,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f19]) ).
fof(f24,plain,
intersection(sK2,sK3) != difference(sK2,difference(sK2,sK3)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f11]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f36,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f43,plain,
intersection(sK2,sK3) != difference(sK2,difference(sK2,sK3)),
inference(cnf_transformation,[],[f24]) ).
fof(f48,definition,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ4_eqProxy])],[equality_proxy_definition]) ).
fof(f49,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f33,f48]) ).
fof(f53,plain,
~ sQ4_eqProxy(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),
inference(equality_proxy_replacement,[],[f43,f48]) ).
fof(f61,plain,
( ~ subset(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3)))
| ~ subset(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)) ),
inference(resolution,[],[f49,f53]) ).
fof(f64,definition,
( spl5_1
<=> subset(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f65,plain,
( ~ subset(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3)))
| spl5_1 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,definition,
( spl5_2
<=> subset(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f68,plain,
( ~ subset(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3))
| spl5_2 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f70,plain,
( ~ spl5_2
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f61,f64,f67]) ).
fof(f71,plain,
( ~ member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),difference(sK2,difference(sK2,sK3)))
| spl5_1 ),
inference(resolution,[],[f65,f37]) ).
fof(f72,plain,
( member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),intersection(sK2,sK3))
| spl5_1 ),
inference(resolution,[],[f65,f36]) ).
fof(f75,plain,
( member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),sK2)
| spl5_1 ),
inference(resolution,[],[f72,f26]) ).
fof(f76,plain,
( member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),sK3)
| spl5_1 ),
inference(resolution,[],[f72,f25]) ).
fof(f79,plain,
( ~ member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),sK2)
| member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),difference(sK2,sK3))
| spl5_1 ),
inference(resolution,[],[f30,f71]) ).
fof(f81,definition,
( spl5_3
<=> member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),difference(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f82,plain,
( member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),difference(sK2,sK3))
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f84,definition,
( spl5_4
<=> member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f85,plain,
( ~ member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),sK2)
| spl5_4 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f86,plain,
( spl5_3
| ~ spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f79,f64,f84,f81]) ).
fof(f87,plain,
( $false
| spl5_1
| spl5_4 ),
inference(resolution,[],[f85,f75]) ).
fof(f88,plain,
( spl5_1
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f87]) ).
fof(f90,plain,
( ~ member(sK0(intersection(sK2,sK3),difference(sK2,difference(sK2,sK3))),sK3)
| ~ spl5_3 ),
inference(resolution,[],[f82,f28]) ).
fof(f91,plain,
( $false
| spl5_1
| ~ spl5_3 ),
inference(resolution,[],[f90,f76]) ).
fof(f92,plain,
( spl5_1
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f91]) ).
fof(f93,plain,
( ~ member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),intersection(sK2,sK3))
| spl5_2 ),
inference(resolution,[],[f68,f37]) ).
fof(f94,plain,
( member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),difference(sK2,difference(sK2,sK3)))
| spl5_2 ),
inference(resolution,[],[f68,f36]) ).
fof(f95,plain,
( ~ member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK2)
| ~ member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK3)
| spl5_2 ),
inference(resolution,[],[f93,f27]) ).
fof(f97,definition,
( spl5_5
<=> member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK3) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f100,definition,
( spl5_6
<=> member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition]) ).
fof(f101,plain,
( ~ member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK2)
| spl5_6 ),
inference(avatar_component_clause,[],[f100]) ).
fof(f102,plain,
( ~ spl5_5
| ~ spl5_6
| spl5_2 ),
inference(avatar_split_clause,[],[f95,f67,f100,f97]) ).
fof(f103,plain,
( member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK2)
| spl5_2 ),
inference(resolution,[],[f94,f29]) ).
fof(f104,plain,
( ~ member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),difference(sK2,sK3))
| spl5_2 ),
inference(resolution,[],[f94,f28]) ).
fof(f105,plain,
( ~ member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK2)
| member(sK0(difference(sK2,difference(sK2,sK3)),intersection(sK2,sK3)),sK3)
| spl5_2 ),
inference(resolution,[],[f104,f30]) ).
fof(f107,plain,
( spl5_5
| ~ spl5_6
| spl5_2 ),
inference(avatar_split_clause,[],[f105,f67,f100,f97]) ).
fof(f108,plain,
( $false
| spl5_2
| spl5_6 ),
inference(resolution,[],[f101,f103]) ).
fof(f109,plain,
( spl5_2
| spl5_6 ),
inference(avatar_contradiction_clause,[],[f108]) ).
cnf(s2,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f70]) ).
cnf(s3,plain,
( spl5_1
| spl5_3
| ~ spl5_4 ),
inference(sat_conversion,[],[f86]) ).
cnf(s4,plain,
( spl5_1
| spl5_4 ),
inference(sat_conversion,[],[f88]) ).
cnf(s5,plain,
( spl5_1
| ~ spl5_3 ),
inference(sat_conversion,[],[f92]) ).
cnf(s6,plain,
( spl5_2
| ~ spl5_5
| ~ spl5_6 ),
inference(sat_conversion,[],[f102]) ).
cnf(s7,plain,
( spl5_2
| spl5_5
| ~ spl5_6 ),
inference(sat_conversion,[],[f107]) ).
cnf(s8,plain,
( spl5_2
| spl5_6 ),
inference(sat_conversion,[],[f109]) ).
cnf(s9,plain,
spl5_1,
inference(rat,[],[s3,s4,s5]) ).
cnf(s10,plain,
~ spl5_2,
inference(rat,[],[s2,s9]) ).
cnf(s11,plain,
spl5_6,
inference(rat,[],[s8,s10]) ).
cnf(s12,plain,
spl5_5,
inference(rat,[],[s7,s11,s10]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s6,s11,s12,s10]) ).
fof(f110,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET011+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n017.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Sun Sep 27 23:58:35 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.46 Running first-order theorem proving
% 0.15/0.46 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
% 1.42/1.66 % (3092809)Detected formulas, will run a generic FOF schedule.
% 1.42/1.66 % (3092822)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=168613366:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.42/1.66 % (3092824)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3482782534:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.42/1.66 % (3092826)dis-21_1_sil=8000:lcm=predicate:random_seed=1604075921: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)
% 1.42/1.66 % (3092826)First to succeed.
% 1.42/1.66 % (3092826)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3092809"
% 1.42/1.66 % (3092820)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=189356963:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.42/1.66 % (3092821)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=4011867788:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.42/1.66 % (3092825)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3225074856:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.42/1.66 % (3092823)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1528416681:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.42/1.66 % (3092823)Refutation not found, incomplete strategy
% 1.42/1.66 % (3092823)------------------------------
% 1.42/1.66 % (3092823)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.42/1.66 % (3092823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.42/1.66 % (3092823)CaDiCaL version: 2.1.3
% 1.42/1.66 % (3092823)Termination reason: Refutation not found, incomplete strategy
% 1.42/1.66 % (3092823)Time elapsed: 0.002 s
% 1.42/1.66 % (3092823)Peak memory usage: 88 MB
% 1.42/1.66 % (3092824)Instruction limit reached!
% 1.42/1.66 % (3092824)------------------------------
% 1.42/1.66 % (3092824)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.42/1.66 % (3092824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.42/1.66 % (3092824)CaDiCaL version: 2.1.3
% 1.42/1.66 % (3092824)Termination reason: Instruction limit
% 1.42/1.66 % (3092824)Termination phase: Saturation
% 1.42/1.66 % (3092824)Time elapsed: 0.112 s
% 1.42/1.66 % (3092824)Peak memory usage: 88 MB
% 1.42/1.66 % (3092824)Instructions burned: 119 (million)
% 1.42/1.66 % (3092825)Instruction limit reached!
% 1.42/1.66 % (3092825)------------------------------
% 1.42/1.66 % (3092825)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.42/1.66 % (3092825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.42/1.66 % (3092825)CaDiCaL version: 2.1.3
% 1.42/1.66 % (3092825)Termination reason: Instruction limit
% 1.42/1.66 % (3092825)Termination phase: Saturation
% 1.42/1.66 % (3092825)Time elapsed: 0.142 s
% 1.42/1.66 % (3092825)Peak memory usage: 89 MB
% 1.42/1.66 % (3092825)Instructions burned: 139 (million)
% 1.42/1.66 % (3092836)lrs+10_1_sil=8000:sp=occurrence:random_seed=1124981540:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.42/1.66 % (3092837)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2709741463:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 1.42/1.66 % (3092826)Refutation found. Thanks to Tanya!
% 1.42/1.66 % SZS status Theorem for theBenchmark
% 1.42/1.66 % SZS output start Proof for theBenchmark
% See solution above
% 5.49/1.93 % (3092826)------------------------------
% 5.49/1.93 % (3092826)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.49/1.93 % (3092826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.49/1.93 % (3092826)CaDiCaL version: 2.1.3
% 5.49/1.93 % (3092826)Termination reason: Refutation
% 5.49/1.93 % (3092826)Time elapsed: 0.004 s
% 5.49/1.93 % (3092826)Peak memory usage: 89 MB
% 5.49/1.93 % (3092826)Instructions burned: 3 (million)
% 5.49/1.93 % (3092826)------------------------------
% 5.49/1.93 % (3092826)------------------------------
% 5.49/1.93 % (3092809)Success in time 0.66 s
% 5.49/1.93 % Vampire exiting
%------------------------------------------------------------------------------