%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET598+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 : n009.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:17 PM UTC 2026
% Result : Theorem 2.75s 6.27s
% Output : Refutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 5
% Syntax : Number of formulae : 68 ( 13 unt; 0 def)
% Number of atoms : 275 ( 47 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 371 ( 164 ~; 163 |; 36 &)
% ( 3 <=>; 3 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 90 ( 72 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f6,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( X0 = intersection(X1,X2)
<=> ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( ( subset(X3,X1)
& subset(X3,X2) )
=> subset(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( X0 = intersection(X1,X2)
<=> ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( ( subset(X3,X1)
& subset(X3,X2) )
=> subset(X3,X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
? [X0,X1,X2] :
( X0 = intersection(X1,X2)
<~> ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( subset(X3,X0)
| ~ subset(X3,X1)
| ~ subset(X3,X2) ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f12,plain,
? [X0,X1,X2] :
( X0 = intersection(X1,X2)
<~> ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( subset(X3,X0)
| ~ subset(X3,X1)
| ~ subset(X3,X2) ) ) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ( ~ subset(X0,X1)
| ~ subset(X0,X2)
| ? [X3] :
( ~ subset(X3,X0)
& subset(X3,X1)
& subset(X3,X2) )
| intersection(X1,X2) != X0 )
& ( ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( subset(X3,X0)
| ~ subset(X3,X1)
| ~ subset(X3,X2) ) )
| X0 = intersection(X1,X2) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( ~ subset(X0,X1)
| ~ subset(X0,X2)
| ? [X3] :
( ~ subset(X3,X0)
& subset(X3,X1)
& subset(X3,X2) )
| intersection(X1,X2) != X0 )
& ( ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( subset(X3,X0)
| ~ subset(X3,X1)
| ~ subset(X3,X2) ) )
| X0 = intersection(X1,X2) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( ~ subset(X0,X1)
| ~ subset(X0,X2)
| ? [X3] :
( ~ subset(X3,X0)
& subset(X3,X1)
& subset(X3,X2) )
| intersection(X1,X2) != X0 )
& ( ( subset(X0,X1)
& subset(X0,X2)
& ! [X4] :
( subset(X4,X0)
| ~ subset(X4,X1)
| ~ subset(X4,X2) ) )
| X0 = intersection(X1,X2) ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
( ( ~ subset(sK0,sK1)
| ~ subset(sK0,sK2)
| ( ~ subset(sK3,sK0)
& subset(sK3,sK1)
& subset(sK3,sK2) )
| sK0 != intersection(sK1,sK2) )
& ( ( subset(sK0,sK1)
& subset(sK0,sK2)
& ! [X4] :
( subset(X4,sK0)
| ~ subset(X4,sK1)
| ~ subset(X4,sK2) ) )
| sK0 = intersection(sK1,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X4] :
( sK0 = intersection(sK1,sK2)
| ~ subset(X4,sK1)
| ~ subset(X4,sK2)
| subset(X4,sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f22,plain,
( sK0 = intersection(sK1,sK2)
| subset(sK0,sK2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f23,plain,
( sK0 = intersection(sK1,sK2)
| subset(sK0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f24,plain,
( sK0 != intersection(sK1,sK2)
| ~ subset(sK0,sK2)
| subset(sK3,sK2)
| ~ subset(sK0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f25,plain,
( sK0 != intersection(sK1,sK2)
| ~ subset(sK0,sK2)
| subset(sK3,sK1)
| ~ subset(sK0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
( sK0 != intersection(sK1,sK2)
| ~ subset(sK0,sK2)
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f30,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X2,X0,X1] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f32,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f1]) ).
fof(f44,plain,
! [X0] :
( sK0 != sK0
| ~ subset(sK0,sK2)
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1)
| ~ subset(X0,sK1)
| ~ subset(X0,sK2)
| subset(X0,sK0) ),
inference(superposition,[],[f26,f21]) ).
fof(f47,plain,
! [X0] :
( subset(X0,sK0)
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1)
| ~ subset(X0,sK1)
| ~ subset(X0,sK2)
| ~ subset(sK0,sK2) ),
inference(trivial_inequality_removal,[],[f44]) ).
fof(f49,plain,
( subset(sK0,sK1)
| subset(sK0,sK1) ),
inference(superposition,[],[f32,f23]) ).
fof(f51,plain,
subset(sK0,sK1),
inference(duplicate_literal_removal,[],[f49]) ).
fof(f52,plain,
! [X0,X1] : subset(intersection(X0,X1),X1),
inference(superposition,[],[f32,f27]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ subset(intersection(X1,X2),X0)
| ~ subset(X0,X2)
| ~ subset(X0,X1)
| intersection(X1,X2) = X0 ),
inference(resolution,[],[f31,f30]) ).
fof(f68,plain,
! [X0,X1] :
( subset(X1,sK0)
| ~ subset(X0,sK1)
| ~ subset(X0,sK2)
| ~ subset(X1,sK1)
| ~ subset(X1,sK2)
| subset(X0,sK0) ),
inference(superposition,[],[f31,f21]) ).
fof(f84,plain,
( subset(sK0,sK2)
| subset(sK0,sK2) ),
inference(superposition,[],[f52,f22]) ).
fof(f87,plain,
subset(sK0,sK2),
inference(duplicate_literal_removal,[],[f84]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ subset(intersection(X1,X0),sK2)
| ~ subset(sK0,X1)
| intersection(X1,X0) = sK0
| ~ subset(X2,sK1)
| ~ subset(X2,sK2)
| ~ subset(intersection(X1,X0),sK1)
| ~ subset(sK0,X0)
| subset(X2,sK0) ),
inference(resolution,[],[f67,f68]) ).
fof(f119,plain,
! [X0,X1] :
( ~ subset(sK0,X0)
| ~ subset(sK0,X1)
| intersection(X1,X0) = sK0
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1)
| ~ subset(intersection(X1,X0),sK1)
| ~ subset(intersection(X1,X0),sK2)
| ~ subset(sK0,sK2) ),
inference(resolution,[],[f67,f47]) ).
fof(f126,plain,
! [X0,X1] :
( ~ subset(sK0,X0)
| ~ subset(sK0,X1)
| intersection(X1,X0) = sK0
| ~ subset(sK3,sK0)
| ~ subset(intersection(X1,X0),sK1)
| ~ subset(intersection(X1,X0),sK2)
| ~ subset(sK0,sK2) ),
inference(forward_subsumption_resolution,[],[f119,f51]) ).
fof(f129,plain,
! [X0,X1] :
( ~ subset(intersection(X1,X0),sK2)
| ~ subset(sK0,X1)
| intersection(X1,X0) = sK0
| ~ subset(sK3,sK0)
| ~ subset(intersection(X1,X0),sK1)
| ~ subset(sK0,X0) ),
inference(forward_subsumption_resolution,[],[f126,f87]) ).
fof(f171,plain,
! [X0] :
( ~ subset(sK0,X0)
| sK0 = intersection(X0,sK2)
| ~ subset(sK3,sK0)
| ~ subset(intersection(X0,sK2),sK1)
| ~ subset(sK0,sK2) ),
inference(resolution,[],[f129,f52]) ).
fof(f174,plain,
! [X0] :
( ~ subset(intersection(X0,sK2),sK1)
| sK0 = intersection(X0,sK2)
| ~ subset(sK3,sK0)
| ~ subset(sK0,X0) ),
inference(forward_subsumption_resolution,[],[f171,f87]) ).
fof(f176,plain,
( sK0 = intersection(sK1,sK2)
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1) ),
inference(resolution,[],[f174,f32]) ).
fof(f179,plain,
( sK0 = intersection(sK1,sK2)
| ~ subset(sK3,sK0) ),
inference(forward_subsumption_resolution,[],[f176,f23]) ).
fof(f182,plain,
( sK0 != sK0
| ~ subset(sK0,sK2)
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1)
| ~ subset(sK3,sK0) ),
inference(superposition,[],[f26,f179]) ).
fof(f188,plain,
( sK0 != sK0
| ~ subset(sK0,sK2)
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1) ),
inference(duplicate_literal_removal,[],[f182]) ).
fof(f189,plain,
( ~ subset(sK0,sK2)
| ~ subset(sK3,sK0)
| ~ subset(sK0,sK1) ),
inference(trivial_inequality_removal,[],[f188]) ).
fof(f192,plain,
( ~ subset(sK3,sK0)
| ~ subset(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f189,f87]) ).
fof(f195,plain,
~ subset(sK3,sK0),
inference(forward_subsumption_resolution,[],[f192,f51]) ).
fof(f200,plain,
! [X0,X1] :
( ~ subset(intersection(X0,X1),sK2)
| ~ subset(sK0,X0)
| intersection(X0,X1) = sK0
| ~ subset(intersection(X0,X1),sK1)
| ~ subset(intersection(X0,X1),sK1)
| ~ subset(sK0,X1)
| subset(intersection(X0,X1),sK0) ),
inference(factoring,[],[f118]) ).
fof(f203,plain,
! [X0,X1] :
( ~ subset(intersection(X0,X1),sK2)
| ~ subset(sK0,X0)
| intersection(X0,X1) = sK0
| ~ subset(intersection(X0,X1),sK1)
| ~ subset(sK0,X1)
| subset(intersection(X0,X1),sK0) ),
inference(duplicate_literal_removal,[],[f200]) ).
fof(f204,plain,
! [X0,X1] :
( ~ subset(intersection(X0,X1),sK2)
| ~ subset(sK0,X0)
| intersection(X0,X1) = sK0
| ~ subset(intersection(X0,X1),sK1)
| ~ subset(sK0,X1) ),
inference(forward_subsumption_resolution,[],[f203,f67]) ).
fof(f208,plain,
! [X0] :
( subset(X0,sK0)
| ~ subset(X0,sK2)
| ~ subset(sK3,sK1)
| ~ subset(sK3,sK2)
| ~ subset(X0,sK1) ),
inference(resolution,[],[f195,f68]) ).
fof(f357,plain,
( ~ subset(sK3,sK2)
| ~ subset(sK3,sK1)
| ~ subset(sK3,sK2)
| ~ subset(sK3,sK1) ),
inference(resolution,[],[f208,f195]) ).
fof(f364,plain,
( ~ subset(sK3,sK2)
| ~ subset(sK3,sK1) ),
inference(duplicate_literal_removal,[],[f357]) ).
fof(f374,plain,
! [X0] :
( ~ subset(sK0,X0)
| sK0 = intersection(X0,sK2)
| ~ subset(intersection(X0,sK2),sK1)
| ~ subset(sK0,sK2) ),
inference(resolution,[],[f204,f52]) ).
fof(f381,plain,
! [X0] :
( ~ subset(intersection(X0,sK2),sK1)
| sK0 = intersection(X0,sK2)
| ~ subset(sK0,X0) ),
inference(forward_subsumption_resolution,[],[f374,f87]) ).
fof(f414,plain,
( sK0 = intersection(sK1,sK2)
| ~ subset(sK0,sK1) ),
inference(resolution,[],[f381,f32]) ).
fof(f421,plain,
sK0 = intersection(sK1,sK2),
inference(forward_subsumption_resolution,[],[f414,f23]) ).
fof(f426,plain,
( sK0 != sK0
| ~ subset(sK0,sK2)
| subset(sK3,sK2)
| ~ subset(sK0,sK1) ),
inference(superposition,[],[f24,f421]) ).
fof(f427,plain,
( sK0 != sK0
| ~ subset(sK0,sK2)
| subset(sK3,sK1)
| ~ subset(sK0,sK1) ),
inference(superposition,[],[f25,f421]) ).
fof(f440,plain,
( ~ subset(sK0,sK2)
| subset(sK3,sK1)
| ~ subset(sK0,sK1) ),
inference(trivial_inequality_removal,[],[f427]) ).
fof(f441,plain,
( ~ subset(sK0,sK2)
| subset(sK3,sK2)
| ~ subset(sK0,sK1) ),
inference(trivial_inequality_removal,[],[f426]) ).
fof(f442,plain,
( subset(sK3,sK1)
| ~ subset(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f440,f87]) ).
fof(f443,plain,
( subset(sK3,sK2)
| ~ subset(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f441,f87]) ).
fof(f446,plain,
subset(sK3,sK1),
inference(forward_subsumption_resolution,[],[f442,f51]) ).
fof(f447,plain,
subset(sK3,sK2),
inference(forward_subsumption_resolution,[],[f443,f51]) ).
fof(f451,plain,
~ subset(sK3,sK1),
inference(resolution,[],[f447,f364]) ).
fof(f453,plain,
$false,
inference(forward_subsumption_resolution,[],[f451,f446]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET598+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.12/5.38 % Computer : n009.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 28 02:17:21 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.41 Running first-order theorem proving
% 0.16/5.41 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
% 2.75/6.27 % (2604595)Detected formulas, will run a generic FOF schedule.
% 2.75/6.27 % (2604600)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=2908331095:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.75/6.27 % (2604606)dis-21_1_sil=8000:lcm=predicate:random_seed=2906477217: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)
% 2.75/6.27 % (2604605)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4022293750:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.75/6.27 % (2604603)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=360198197:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.75/6.27 % (2604602)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=3201377250:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.75/6.27 % (2604601)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=2684703030:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.75/6.27 % (2604604)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1260527170:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.75/6.27 % (2604603)Refutation not found, incomplete strategy
% 2.75/6.27 % (2604603)------------------------------
% 2.75/6.27 % (2604603)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/6.27 % (2604603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/6.27 % (2604603)CaDiCaL version: 2.1.3
% 2.75/6.27 % (2604603)Termination reason: Refutation not found, incomplete strategy
% 2.75/6.27 % (2604603)Time elapsed: 0.003 s
% 2.75/6.27 % (2604603)Peak memory usage: 88 MB
% 2.75/6.27 % (2604603)Instructions burned: 2 (million)
% 2.75/6.27 % (2604604)First to succeed.
% 2.75/6.27 % (2604604)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2604595"
% 2.75/6.27 % (2604605)Also succeeded, but the first one will report.
% 2.75/6.27 % (2604606)Instruction limit reached!
% 2.75/6.27 % (2604606)------------------------------
% 2.75/6.27 % (2604606)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/6.27 % (2604606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/6.27 % (2604606)CaDiCaL version: 2.1.3
% 2.75/6.27 % (2604606)Termination reason: Instruction limit
% 2.75/6.27 % (2604606)Termination phase: Saturation
% 2.75/6.27 % (2604606)Time elapsed: 0.081 s
% 2.75/6.27 % (2604606)Peak memory usage: 89 MB
% 2.75/6.27 % (2604606)Instructions burned: 129 (million)
% 2.75/6.27 % (2604614)lrs+10_1_sil=8000:sp=occurrence:random_seed=2536779533:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.75/6.27 % (2604614)Also succeeded, but the first one will report.
% 2.75/6.27 % (2604603)------------------------------
% 2.75/6.27 % (2604603)------------------------------
% 2.75/6.27 % (2604604)Refutation found. Thanks to Tanya!
% 2.75/6.27 % SZS status Theorem for theBenchmark
% 2.75/6.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.42/6.37 % (2604604)------------------------------
% 3.42/6.37 % (2604604)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.42/6.37 % (2604604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.42/6.37 % (2604604)CaDiCaL version: 2.1.3
% 3.42/6.37 % (2604604)Termination reason: Refutation
% 3.42/6.37 % (2604604)Time elapsed: 0.013 s
% 3.42/6.37 % (2604604)Peak memory usage: 88 MB
% 3.42/6.37 % (2604604)Instructions burned: 18 (million)
% 3.42/6.37 % (2604604)------------------------------
% 3.42/6.37 % (2604604)------------------------------
% 3.42/6.37 % (2604595)Success in time 0.415 s
% 3.42/6.37 % Vampire exiting
%------------------------------------------------------------------------------