%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET606+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 : n006.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:19 PM UTC 2026
% Result : Theorem 1.04s 1.46s
% Output : Refutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 77 ( 12 unt; 7 def)
% Number of atoms : 199 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 201 ( 79 ~; 88 |; 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 : 72 ( 0 sgn 68 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_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] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f9,conjecture,
! [X0,X1] : difference(X0,intersection(X0,X1)) = difference(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_difference_into_intersection) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] : difference(X0,intersection(X0,X1)) = difference(X0,X1),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
? [X0,X1] : difference(X0,X1) != difference(X0,intersection(X0,X1)),
inference(ennf_transformation,[],[f10]) ).
fof(f16,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,[],[f2]) ).
fof(f17,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,[],[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] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f20]) ).
fof(f25,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(f26,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,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f26]) ).
fof(f28,plain,
difference(sK3,sK4) != difference(sK3,intersection(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,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f33,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
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(f39,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f46,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f49,plain,
difference(sK3,sK4) != difference(sK3,intersection(sK3,sK4)),
inference(cnf_transformation,[],[f28]) ).
fof(f54,definition,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ5_eqProxy])],[equality_proxy_definition]) ).
fof(f57,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f39,f54]) ).
fof(f61,plain,
~ sQ5_eqProxy(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),
inference(equality_proxy_replacement,[],[f49,f54]) ).
fof(f69,plain,
( ~ subset(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4)))
| ~ subset(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)) ),
inference(resolution,[],[f57,f61]) ).
fof(f72,definition,
( spl6_1
<=> subset(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f73,plain,
( ~ subset(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4)))
| spl6_1 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f75,definition,
( spl6_2
<=> subset(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f76,plain,
( ~ subset(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4))
| spl6_2 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f78,plain,
( ~ spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f69,f72,f75]) ).
fof(f79,plain,
( ~ member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),difference(sK3,intersection(sK3,sK4)))
| spl6_1 ),
inference(resolution,[],[f73,f47]) ).
fof(f80,plain,
( member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),difference(sK3,sK4))
| spl6_1 ),
inference(resolution,[],[f73,f46]) ).
fof(f83,plain,
( member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),sK3)
| spl6_1 ),
inference(resolution,[],[f80,f35]) ).
fof(f84,plain,
( ~ member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),sK4)
| spl6_1 ),
inference(resolution,[],[f80,f34]) ).
fof(f87,plain,
( ~ member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),sK3)
| member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),intersection(sK3,sK4))
| spl6_1 ),
inference(resolution,[],[f36,f79]) ).
fof(f89,definition,
( spl6_3
<=> member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),intersection(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f90,plain,
( member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),intersection(sK3,sK4))
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f89]) ).
fof(f92,definition,
( spl6_4
<=> member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f93,plain,
( ~ member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),sK3)
| spl6_4 ),
inference(avatar_component_clause,[],[f92]) ).
fof(f94,plain,
( spl6_3
| ~ spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f87,f72,f92,f89]) ).
fof(f95,plain,
( $false
| spl6_1
| spl6_4 ),
inference(resolution,[],[f93,f83]) ).
fof(f96,plain,
( spl6_1
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f95]) ).
fof(f98,plain,
( member(sK2(difference(sK3,sK4),difference(sK3,intersection(sK3,sK4))),sK4)
| ~ spl6_3 ),
inference(resolution,[],[f90,f31]) ).
fof(f99,plain,
( $false
| spl6_1
| ~ spl6_3 ),
inference(resolution,[],[f98,f84]) ).
fof(f100,plain,
( spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f101,plain,
( ~ member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),difference(sK3,sK4))
| spl6_2 ),
inference(resolution,[],[f76,f47]) ).
fof(f102,plain,
( member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),difference(sK3,intersection(sK3,sK4)))
| spl6_2 ),
inference(resolution,[],[f76,f46]) ).
fof(f103,plain,
( ~ member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK3)
| member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK4)
| spl6_2 ),
inference(resolution,[],[f101,f36]) ).
fof(f105,definition,
( spl6_5
<=> member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f108,definition,
( spl6_6
<=> member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f109,plain,
( ~ member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK3)
| spl6_6 ),
inference(avatar_component_clause,[],[f108]) ).
fof(f110,plain,
( spl6_5
| ~ spl6_6
| spl6_2 ),
inference(avatar_split_clause,[],[f103,f75,f108,f105]) ).
fof(f111,plain,
( member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK3)
| spl6_2 ),
inference(resolution,[],[f102,f35]) ).
fof(f112,plain,
( ~ member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),intersection(sK3,sK4))
| spl6_2 ),
inference(resolution,[],[f102,f34]) ).
fof(f113,plain,
( $false
| spl6_2
| spl6_6 ),
inference(resolution,[],[f111,f109]) ).
fof(f114,plain,
( spl6_2
| spl6_6 ),
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f115,plain,
( ~ member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK3)
| ~ member(sK2(difference(sK3,intersection(sK3,sK4)),difference(sK3,sK4)),sK4)
| spl6_2 ),
inference(resolution,[],[f112,f33]) ).
fof(f117,plain,
( ~ spl6_5
| ~ spl6_6
| spl6_2 ),
inference(avatar_split_clause,[],[f115,f75,f108,f105]) ).
cnf(s2,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f78]) ).
cnf(s3,plain,
( spl6_1
| spl6_3
| ~ spl6_4 ),
inference(sat_conversion,[],[f94]) ).
cnf(s4,plain,
( spl6_1
| spl6_4 ),
inference(sat_conversion,[],[f96]) ).
cnf(s5,plain,
( spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f100]) ).
cnf(s6,plain,
( spl6_2
| spl6_5
| ~ spl6_6 ),
inference(sat_conversion,[],[f110]) ).
cnf(s7,plain,
( spl6_2
| spl6_6 ),
inference(sat_conversion,[],[f114]) ).
cnf(s8,plain,
( spl6_2
| ~ spl6_5
| ~ spl6_6 ),
inference(sat_conversion,[],[f117]) ).
cnf(s9,plain,
spl6_1,
inference(rat,[],[s3,s4,s5]) ).
cnf(s10,plain,
~ spl6_2,
inference(rat,[],[s2,s9]) ).
cnf(s11,plain,
spl6_6,
inference(rat,[],[s7,s10]) ).
cnf(s12,plain,
~ spl6_5,
inference(rat,[],[s8,s11,s10]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s6,s10,s12,s11]) ).
fof(f118,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET606+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.54 % Computer : n006.cluster.edu
% 0.13/0.54 % Model : x86_64 x86_64
% 0.13/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.54 % Memory : 8046.5625MB
% 0.13/0.54 % OS : Linux 6.8.0-71-generic
% 0.13/0.54 % CPULimit : 300
% 0.13/0.54 % WCLimit : 300
% 0.13/0.54 % DateTime : Mon Sep 28 02:18:12 UTC 2026
% 0.13/0.54 % CPUTime :
% 0.13/0.54 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.58 Running first-order theorem proving
% 0.16/0.58 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.04/1.46 % (3524108)Detected formulas, will run a generic FOF schedule.
% 1.04/1.46 % (3524147)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2569917140:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.04/1.46 % (3524147)Instruction limit reached!
% 1.04/1.46 % (3524147)------------------------------
% 1.04/1.46 % (3524147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/1.46 % (3524147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/1.46 % (3524147)CaDiCaL version: 2.1.3
% 1.04/1.46 % (3524147)Termination reason: Instruction limit
% 1.04/1.46 % (3524147)Termination phase: Saturation
% 1.04/1.46 % (3524147)Time elapsed: 0.036 s
% 1.04/1.46 % (3524147)Peak memory usage: 88 MB
% 1.04/1.46 % (3524147)Instructions burned: 119 (million)
% 1.04/1.46 % (3524149)dis-21_1_sil=8000:lcm=predicate:random_seed=430268563: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.04/1.46 % (3524146)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3502058876:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.04/1.46 % (3524148)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3031711986:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.04/1.46 % (3524143)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=283458766:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.04/1.46 % (3524144)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=1324574287:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.04/1.46 % (3524145)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=3432760444:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.04/1.46 % (3524146)Refutation not found, incomplete strategy
% 1.04/1.46 % (3524146)------------------------------
% 1.04/1.46 % (3524146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/1.46 % (3524146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/1.46 % (3524146)CaDiCaL version: 2.1.3
% 1.04/1.46 % (3524146)Termination reason: Refutation not found, incomplete strategy
% 1.04/1.46 % (3524146)Time elapsed: 0.002 s
% 1.04/1.46 % (3524146)Peak memory usage: 88 MB
% 1.04/1.46 % (3524149)First to succeed.
% 1.04/1.46 % (3524149)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3524108"
% 1.04/1.46 % (3524148)Instruction limit reached!
% 1.04/1.46 % (3524148)------------------------------
% 1.04/1.46 % (3524148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/1.46 % (3524148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/1.46 % (3524148)CaDiCaL version: 2.1.3
% 1.04/1.46 % (3524148)Termination reason: Instruction limit
% 1.04/1.46 % (3524148)Termination phase: Saturation
% 1.04/1.46 % (3524148)Time elapsed: 0.090 s
% 1.04/1.46 % (3524148)Peak memory usage: 89 MB
% 1.04/1.46 % (3524148)Instructions burned: 140 (million)
% 1.04/1.46 % (3524151)lrs+10_1_sil=8000:sp=occurrence:random_seed=4106589500:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 1.04/1.46 % (3524151)Instruction limit reached!
% 1.04/1.46 % (3524151)------------------------------
% 1.04/1.46 % (3524151)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/1.46 % (3524151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/1.46 % (3524151)CaDiCaL version: 2.1.3
% 1.04/1.46 % (3524151)Termination reason: Instruction limit
% 1.04/1.46 % (3524151)Termination phase: Saturation
% 1.04/1.46 % (3524151)Time elapsed: 0.086 s
% 1.04/1.46 % (3524151)Peak memory usage: 90 MB
% 1.04/1.46 % (3524151)Instructions burned: 287 (million)
% 1.04/1.46 % (3524146)------------------------------
% 1.04/1.46 % (3524146)------------------------------
% 1.04/1.46 % (3524149)Refutation found. Thanks to Tanya!
% 1.04/1.46 % SZS status Theorem for theBenchmark
% 1.04/1.46 % SZS output start Proof for theBenchmark
% See solution above
% 3.72/1.66 % (3524149)------------------------------
% 3.72/1.66 % (3524149)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.72/1.66 % (3524149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.72/1.66 % (3524149)CaDiCaL version: 2.1.3
% 3.72/1.66 % (3524149)Termination reason: Refutation
% 3.72/1.66 % (3524149)Time elapsed: 0.004 s
% 3.72/1.66 % (3524149)Peak memory usage: 89 MB
% 3.72/1.66 % (3524149)Instructions burned: 3 (million)
% 3.72/1.66 % (3524149)------------------------------
% 3.72/1.66 % (3524149)------------------------------
% 3.72/1.66 % (3524108)Success in time 0.436 s
% 3.72/1.66 % Vampire exiting
%------------------------------------------------------------------------------