%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET595+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:41:16 PM UTC 2026
% Result : Theorem 1.66s 1.20s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 80 ( 9 unt; 7 def)
% Number of atoms : 207 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 207 ( 80 ~; 90 |; 22 &)
% ( 12 <=>; 3 =>; 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 : 76 ( 0 sgn 72 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f9,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> X1 = union(X0,difference(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th54) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> X1 = union(X0,difference(X1,X0)) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f13,plain,
? [X0,X1] :
( union(X0,difference(X1,X0)) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f16]) ).
fof(f18,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,[],[f3]) ).
fof(f19,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,[],[f18]) ).
fof(f20,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,[],[f12]) ).
fof(f21,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,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f24,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f23]) ).
fof(f28,plain,
( sK4 != union(sK3,difference(sK4,sK3))
& subset(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f13]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f33,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f28]) ).
fof(f50,plain,
sK4 != union(sK3,difference(sK4,sK3)),
inference(cnf_transformation,[],[f28]) ).
fof(f55,definition,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ5_eqProxy])],[equality_proxy_definition]) ).
fof(f58,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f42,f55]) ).
fof(f62,plain,
~ sQ5_eqProxy(sK4,union(sK3,difference(sK4,sK3))),
inference(equality_proxy_replacement,[],[f50,f55]) ).
fof(f67,plain,
! [X0] :
( member(X0,sK4)
| ~ member(X0,sK3) ),
inference(resolution,[],[f37,f49]) ).
fof(f71,plain,
( ~ subset(sK4,union(sK3,difference(sK4,sK3)))
| ~ subset(union(sK3,difference(sK4,sK3)),sK4) ),
inference(resolution,[],[f58,f62]) ).
fof(f74,definition,
( spl6_1
<=> subset(sK4,union(sK3,difference(sK4,sK3))) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f75,plain,
( ~ subset(sK4,union(sK3,difference(sK4,sK3)))
| spl6_1 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f77,definition,
( spl6_2
<=> subset(union(sK3,difference(sK4,sK3)),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f78,plain,
( ~ subset(union(sK3,difference(sK4,sK3)),sK4)
| spl6_2 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f80,plain,
( ~ spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f71,f74,f77]) ).
fof(f81,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),union(sK3,difference(sK4,sK3)))
| spl6_1 ),
inference(resolution,[],[f75,f39]) ).
fof(f82,plain,
( member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK4)
| spl6_1 ),
inference(resolution,[],[f75,f38]) ).
fof(f83,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK3)
| spl6_1 ),
inference(resolution,[],[f81,f33]) ).
fof(f84,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),difference(sK4,sK3))
| spl6_1 ),
inference(resolution,[],[f81,f32]) ).
fof(f89,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK4)
| member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK3)
| spl6_1 ),
inference(resolution,[],[f36,f84]) ).
fof(f91,definition,
( spl6_3
<=> member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f92,plain,
( member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK3)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f94,definition,
( spl6_4
<=> member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f95,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK4)
| spl6_4 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f96,plain,
( spl6_3
| ~ spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f89,f74,f94,f91]) ).
fof(f97,plain,
( $false
| spl6_1
| spl6_4 ),
inference(resolution,[],[f95,f82]) ).
fof(f99,plain,
( spl6_1
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f97]) ).
fof(f100,plain,
( $false
| spl6_1
| ~ spl6_3 ),
inference(resolution,[],[f92,f83]) ).
fof(f101,plain,
( spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f100]) ).
fof(f102,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4)
| spl6_2 ),
inference(resolution,[],[f78,f39]) ).
fof(f103,plain,
( member(sK1(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| spl6_2 ),
inference(resolution,[],[f78,f38]) ).
fof(f104,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK3)
| spl6_2 ),
inference(resolution,[],[f102,f67]) ).
fof(f105,plain,
( member(sK1(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,sK3))
| member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK3)
| spl6_2 ),
inference(resolution,[],[f103,f31]) ).
fof(f107,definition,
( spl6_5
<=> member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f108,plain,
( member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK3)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f110,definition,
( spl6_6
<=> member(sK1(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f111,plain,
( member(sK1(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,sK3))
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f112,plain,
( spl6_5
| spl6_6
| spl6_2 ),
inference(avatar_split_clause,[],[f105,f77,f110,f107]) ).
fof(f113,plain,
( member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4)
| ~ spl6_6 ),
inference(resolution,[],[f111,f35]) ).
fof(f115,plain,
( $false
| spl6_2
| ~ spl6_6 ),
inference(resolution,[],[f113,f102]) ).
fof(f116,plain,
( spl6_2
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f117,plain,
( $false
| spl6_2
| ~ spl6_5 ),
inference(resolution,[],[f108,f104]) ).
fof(f118,plain,
( spl6_2
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f117]) ).
cnf(s2,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f80]) ).
cnf(s3,plain,
( spl6_1
| spl6_3
| ~ spl6_4 ),
inference(sat_conversion,[],[f96]) ).
cnf(s4,plain,
( spl6_1
| spl6_4 ),
inference(sat_conversion,[],[f99]) ).
cnf(s5,plain,
( spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f101]) ).
cnf(s6,plain,
( spl6_2
| spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f112]) ).
cnf(s7,plain,
( spl6_2
| ~ spl6_6 ),
inference(sat_conversion,[],[f116]) ).
cnf(s8,plain,
( spl6_2
| ~ spl6_5 ),
inference(sat_conversion,[],[f118]) ).
cnf(s9,plain,
spl6_1,
inference(rat,[],[s3,s4,s5]) ).
cnf(s10,plain,
~ spl6_2,
inference(rat,[],[s2,s9]) ).
cnf(s11,plain,
~ spl6_5,
inference(rat,[],[s8,s10]) ).
cnf(s12,plain,
~ spl6_6,
inference(rat,[],[s7,s10]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s6,s11,s12,s10]) ).
fof(f119,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET595+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.58 % Computer : n005.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Mon Sep 28 02:17:03 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 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
% 1.66/1.20 % (366090)Detected formulas, will run a generic FOF schedule.
% 1.66/1.20 % (366100)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=644693917:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.66/1.20 % (366099)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3357569384:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.66/1.20 % (366101)dis-21_1_sil=8000:lcm=predicate:random_seed=1865855639: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.66/1.20 % (366095)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=4150137614:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.66/1.20 % (366098)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3191136400:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.66/1.20 % (366096)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=2545012954:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.66/1.20 % (366097)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=737316962:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.66/1.20 % (366098)Refutation not found, incomplete strategy
% 1.66/1.20 % (366098)------------------------------
% 1.66/1.20 % (366098)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.20 % (366098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.20 % (366098)CaDiCaL version: 2.1.3
% 1.66/1.20 % (366098)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.20 % (366098)Time elapsed: 0.002 s
% 1.66/1.20 % (366098)Peak memory usage: 88 MB
% 1.66/1.20 % (366098)Instructions burned: 2 (million)
% 1.66/1.20 % (366101)First to succeed.
% 1.66/1.20 % (366101)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-366090"
% 1.66/1.20 % (366099)Instruction limit reached!
% 1.66/1.20 % (366099)------------------------------
% 1.66/1.20 % (366099)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.20 % (366099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.20 % (366099)CaDiCaL version: 2.1.3
% 1.66/1.20 % (366099)Termination reason: Instruction limit
% 1.66/1.20 % (366099)Termination phase: Saturation
% 1.66/1.20 % (366099)Time elapsed: 0.070 s
% 1.66/1.20 % (366099)Peak memory usage: 88 MB
% 1.66/1.20 % (366099)Instructions burned: 119 (million)
% 1.66/1.20 % (366100)Instruction limit reached!
% 1.66/1.20 % (366100)------------------------------
% 1.66/1.20 % (366100)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.20 % (366100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.20 % (366100)CaDiCaL version: 2.1.3
% 1.66/1.20 % (366100)Termination reason: Instruction limit
% 1.66/1.20 % (366100)Termination phase: Saturation
% 1.66/1.20 % (366100)Time elapsed: 0.077 s
% 1.66/1.20 % (366100)Peak memory usage: 89 MB
% 1.66/1.20 % (366100)Instructions burned: 139 (million)
% 1.66/1.20 % (366110)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2875646171:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 1.66/1.20 % (366110)Refutation not found, incomplete strategy
% 1.66/1.20 % (366110)------------------------------
% 1.66/1.20 % (366110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.20 % (366110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.20 % (366110)CaDiCaL version: 2.1.3
% 1.66/1.20 % (366110)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.20 % (366110)Time elapsed: 0.001 s
% 1.66/1.20 % (366110)Peak memory usage: 89 MB
% 1.66/1.20 % (366110)Instructions burned: 1 (million)
% 1.66/1.20 % (366109)lrs+10_1_sil=8000:sp=occurrence:random_seed=3579994738:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.66/1.20 % (366098)------------------------------
% 1.66/1.20 % (366098)------------------------------
% 1.66/1.20 % (366101)Refutation found. Thanks to Tanya!
% 1.66/1.20 % SZS status Theorem for theBenchmark
% 1.66/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.40 % (366101)------------------------------
% 0.16/1.40 % (366101)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.40 % (366101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.40 % (366101)CaDiCaL version: 2.1.3
% 0.16/1.40 % (366101)Termination reason: Refutation
% 0.16/1.40 % (366101)Time elapsed: 0.004 s
% 0.16/1.40 % (366101)Peak memory usage: 89 MB
% 0.16/1.40 % (366101)Instructions burned: 3 (million)
% 0.16/1.40 % (366101)------------------------------
% 0.16/1.40 % (366101)------------------------------
% 0.16/1.40 % (366090)Success in time 0.386 s
% 0.16/1.40 % Vampire exiting
%------------------------------------------------------------------------------