%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET597+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 : n026.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 1.81s 1.11s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 5
% Syntax : Number of formulae : 71 ( 13 unt; 0 def)
% Number of atoms : 280 ( 50 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 375 ( 166 ~; 165 |; 36 &)
% ( 3 <=>; 3 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 5 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 : 86 ( 68 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_union) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X2,X1) )
=> subset(union(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_subset) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f6,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( X0 = union(X1,X2)
<=> ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( ( subset(X1,X3)
& subset(X2,X3) )
=> subset(X0,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th56) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( X0 = union(X1,X2)
<=> ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( ( subset(X1,X3)
& subset(X2,X3) )
=> subset(X0,X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
? [X0,X1,X2] :
( X0 = union(X1,X2)
<~> ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( subset(X0,X3)
| ~ subset(X1,X3)
| ~ subset(X2,X3) ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f12,plain,
? [X0,X1,X2] :
( X0 = union(X1,X2)
<~> ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( subset(X0,X3)
| ~ subset(X1,X3)
| ~ subset(X2,X3) ) ) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ( ~ subset(X1,X0)
| ~ subset(X2,X0)
| ? [X3] :
( ~ subset(X0,X3)
& subset(X1,X3)
& subset(X2,X3) )
| union(X1,X2) != X0 )
& ( ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( subset(X0,X3)
| ~ subset(X1,X3)
| ~ subset(X2,X3) ) )
| X0 = union(X1,X2) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( ~ subset(X1,X0)
| ~ subset(X2,X0)
| ? [X3] :
( ~ subset(X0,X3)
& subset(X1,X3)
& subset(X2,X3) )
| union(X1,X2) != X0 )
& ( ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( subset(X0,X3)
| ~ subset(X1,X3)
| ~ subset(X2,X3) ) )
| X0 = union(X1,X2) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( ~ subset(X1,X0)
| ~ subset(X2,X0)
| ? [X3] :
( ~ subset(X0,X3)
& subset(X1,X3)
& subset(X2,X3) )
| union(X1,X2) != X0 )
& ( ( subset(X1,X0)
& subset(X2,X0)
& ! [X4] :
( subset(X0,X4)
| ~ subset(X1,X4)
| ~ subset(X2,X4) ) )
| X0 = union(X1,X2) ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
( ( ~ subset(sK1,sK0)
| ~ subset(sK2,sK0)
| ( ~ subset(sK0,sK3)
& subset(sK1,sK3)
& subset(sK2,sK3) )
| sK0 != union(sK1,sK2) )
& ( ( subset(sK1,sK0)
& subset(sK2,sK0)
& ! [X4] :
( subset(sK0,X4)
| ~ subset(sK1,X4)
| ~ subset(sK2,X4) ) )
| sK0 = union(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 = union(sK1,sK2)
| ~ subset(sK1,X4)
| ~ subset(sK2,X4)
| subset(sK0,X4) ),
inference(cnf_transformation,[],[f18]) ).
fof(f22,plain,
( sK0 = union(sK1,sK2)
| subset(sK2,sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f23,plain,
( sK0 = union(sK1,sK2)
| subset(sK1,sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f24,plain,
( sK0 != union(sK1,sK2)
| ~ subset(sK2,sK0)
| subset(sK2,sK3)
| ~ subset(sK1,sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f25,plain,
( sK0 != union(sK1,sK2)
| ~ subset(sK2,sK0)
| subset(sK1,sK3)
| ~ subset(sK1,sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
( sK0 != union(sK1,sK2)
| ~ subset(sK2,sK0)
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X0,X1] : union(X0,X1) = union(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(union(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f32,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[],[f1]) ).
fof(f44,plain,
! [X0] :
( sK0 != sK0
| ~ subset(sK2,sK0)
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0)
| ~ subset(sK1,X0)
| ~ subset(sK2,X0)
| subset(sK0,X0) ),
inference(superposition,[],[f26,f21]) ).
fof(f47,plain,
! [X0] :
( subset(sK0,X0)
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0)
| ~ subset(sK1,X0)
| ~ subset(sK2,X0)
| ~ subset(sK2,sK0) ),
inference(trivial_inequality_removal,[],[f44]) ).
fof(f49,plain,
( subset(sK1,sK0)
| subset(sK1,sK0) ),
inference(superposition,[],[f32,f23]) ).
fof(f51,plain,
subset(sK1,sK0),
inference(duplicate_literal_removal,[],[f49]) ).
fof(f52,plain,
! [X0,X1] : subset(X1,union(X0,X1)),
inference(superposition,[],[f32,f27]) ).
fof(f56,plain,
! [X0] :
( ~ subset(X0,sK0)
| sK0 = X0
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0)
| ~ subset(sK1,X0)
| ~ subset(sK2,X0)
| ~ subset(sK2,sK0) ),
inference(resolution,[],[f30,f47]) ).
fof(f63,plain,
! [X0] :
( ~ subset(X0,sK0)
| sK0 = X0
| ~ subset(sK0,sK3)
| ~ subset(sK1,X0)
| ~ subset(sK2,X0)
| ~ subset(sK2,sK0) ),
inference(forward_subsumption_resolution,[],[f56,f51]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ subset(X1,union(X0,X2))
| ~ subset(X2,X1)
| ~ subset(X0,X1)
| union(X0,X2) = X1 ),
inference(resolution,[],[f31,f30]) ).
fof(f68,plain,
! [X0,X1] :
( subset(sK0,X1)
| ~ subset(sK1,X0)
| ~ subset(sK2,X0)
| ~ subset(sK1,X1)
| ~ subset(sK2,X1)
| subset(sK0,X0) ),
inference(superposition,[],[f31,f21]) ).
fof(f80,plain,
( subset(sK2,sK0)
| subset(sK2,sK0) ),
inference(superposition,[],[f52,f22]) ).
fof(f83,plain,
subset(sK2,sK0),
inference(duplicate_literal_removal,[],[f80]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ subset(sK2,union(X1,X0))
| ~ subset(X1,sK0)
| union(X1,X0) = sK0
| ~ subset(sK1,X2)
| ~ subset(sK2,X2)
| ~ subset(sK1,union(X1,X0))
| ~ subset(X0,sK0)
| subset(sK0,X2) ),
inference(resolution,[],[f67,f68]) ).
fof(f138,plain,
! [X0] :
( ~ subset(sK2,X0)
| sK0 = X0
| ~ subset(sK0,sK3)
| ~ subset(sK1,X0)
| ~ subset(X0,sK0) ),
inference(forward_subsumption_resolution,[],[f63,f83]) ).
fof(f143,plain,
! [X0] :
( ~ subset(sK1,union(sK2,X0))
| ~ subset(sK0,sK3)
| sK0 = union(sK2,X0)
| ~ subset(union(sK2,X0),sK0) ),
inference(resolution,[],[f138,f32]) ).
fof(f149,plain,
( ~ subset(sK0,sK3)
| sK0 = union(sK2,sK1)
| ~ subset(union(sK2,sK1),sK0) ),
inference(resolution,[],[f143,f52]) ).
fof(f152,plain,
( sK0 = union(sK1,sK2)
| ~ subset(sK0,sK3)
| ~ subset(union(sK2,sK1),sK0) ),
inference(forward_demodulation,[],[f149,f27]) ).
fof(f153,plain,
( ~ subset(union(sK1,sK2),sK0)
| sK0 = union(sK1,sK2)
| ~ subset(sK0,sK3) ),
inference(forward_demodulation,[],[f152,f27]) ).
fof(f154,plain,
( sK0 = union(sK1,sK2)
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0)
| ~ subset(sK2,sK0) ),
inference(resolution,[],[f153,f31]) ).
fof(f155,plain,
( sK0 = union(sK1,sK2)
| ~ subset(sK0,sK3)
| ~ subset(sK2,sK0) ),
inference(forward_subsumption_resolution,[],[f154,f23]) ).
fof(f156,plain,
( sK0 = union(sK1,sK2)
| ~ subset(sK0,sK3) ),
inference(forward_subsumption_resolution,[],[f155,f22]) ).
fof(f159,plain,
( sK0 != sK0
| ~ subset(sK2,sK0)
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0)
| ~ subset(sK0,sK3) ),
inference(superposition,[],[f26,f156]) ).
fof(f165,plain,
( sK0 != sK0
| ~ subset(sK2,sK0)
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0) ),
inference(duplicate_literal_removal,[],[f159]) ).
fof(f166,plain,
( ~ subset(sK2,sK0)
| ~ subset(sK0,sK3)
| ~ subset(sK1,sK0) ),
inference(trivial_inequality_removal,[],[f165]) ).
fof(f169,plain,
( ~ subset(sK0,sK3)
| ~ subset(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f166,f83]) ).
fof(f172,plain,
~ subset(sK0,sK3),
inference(forward_subsumption_resolution,[],[f169,f51]) ).
fof(f182,plain,
! [X0] :
( subset(sK0,X0)
| ~ subset(sK2,X0)
| ~ subset(sK1,sK3)
| ~ subset(sK2,sK3)
| ~ subset(sK1,X0) ),
inference(resolution,[],[f172,f68]) ).
fof(f190,plain,
! [X0,X1] :
( ~ subset(sK2,union(X0,X1))
| ~ subset(X0,sK0)
| union(X0,X1) = sK0
| ~ subset(sK1,union(X0,X1))
| ~ subset(sK1,union(X0,X1))
| ~ subset(X1,sK0)
| subset(sK0,union(X0,X1)) ),
inference(factoring,[],[f109]) ).
fof(f193,plain,
! [X0,X1] :
( ~ subset(sK2,union(X0,X1))
| ~ subset(X0,sK0)
| union(X0,X1) = sK0
| ~ subset(sK1,union(X0,X1))
| ~ subset(X1,sK0)
| subset(sK0,union(X0,X1)) ),
inference(duplicate_literal_removal,[],[f190]) ).
fof(f194,plain,
! [X0,X1] :
( ~ subset(sK2,union(X0,X1))
| ~ subset(X0,sK0)
| union(X0,X1) = sK0
| ~ subset(sK1,union(X0,X1))
| ~ subset(X1,sK0) ),
inference(forward_subsumption_resolution,[],[f193,f67]) ).
fof(f344,plain,
( ~ subset(sK2,sK3)
| ~ subset(sK1,sK3)
| ~ subset(sK2,sK3)
| ~ subset(sK1,sK3) ),
inference(resolution,[],[f182,f172]) ).
fof(f347,plain,
( ~ subset(sK2,sK3)
| ~ subset(sK1,sK3) ),
inference(duplicate_literal_removal,[],[f344]) ).
fof(f370,plain,
! [X0] :
( ~ subset(X0,sK0)
| sK0 = union(X0,sK2)
| ~ subset(sK1,union(X0,sK2))
| ~ subset(sK2,sK0) ),
inference(resolution,[],[f194,f52]) ).
fof(f377,plain,
! [X0] :
( ~ subset(sK1,union(X0,sK2))
| sK0 = union(X0,sK2)
| ~ subset(X0,sK0) ),
inference(forward_subsumption_resolution,[],[f370,f83]) ).
fof(f379,plain,
( sK0 = union(sK1,sK2)
| ~ subset(sK1,sK0) ),
inference(resolution,[],[f377,f32]) ).
fof(f386,plain,
sK0 = union(sK1,sK2),
inference(forward_subsumption_resolution,[],[f379,f23]) ).
fof(f391,plain,
( sK0 != sK0
| ~ subset(sK2,sK0)
| subset(sK2,sK3)
| ~ subset(sK1,sK0) ),
inference(superposition,[],[f24,f386]) ).
fof(f392,plain,
( sK0 != sK0
| ~ subset(sK2,sK0)
| subset(sK1,sK3)
| ~ subset(sK1,sK0) ),
inference(superposition,[],[f25,f386]) ).
fof(f405,plain,
( ~ subset(sK2,sK0)
| subset(sK1,sK3)
| ~ subset(sK1,sK0) ),
inference(trivial_inequality_removal,[],[f392]) ).
fof(f406,plain,
( ~ subset(sK2,sK0)
| subset(sK2,sK3)
| ~ subset(sK1,sK0) ),
inference(trivial_inequality_removal,[],[f391]) ).
fof(f407,plain,
( subset(sK1,sK3)
| ~ subset(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f405,f83]) ).
fof(f408,plain,
( subset(sK2,sK3)
| ~ subset(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f406,f83]) ).
fof(f411,plain,
subset(sK1,sK3),
inference(forward_subsumption_resolution,[],[f407,f51]) ).
fof(f412,plain,
subset(sK2,sK3),
inference(forward_subsumption_resolution,[],[f408,f51]) ).
fof(f416,plain,
~ subset(sK1,sK3),
inference(resolution,[],[f412,f347]) ).
fof(f421,plain,
$false,
inference(forward_subsumption_resolution,[],[f416,f411]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET597+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 02:19:58 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.81/1.11 % (3408853)Detected formulas, will run a generic FOF schedule.
% 1.81/1.11 % (3408862)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3888022626:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.81/1.11 % (3408862)First to succeed.
% 1.81/1.11 % (3408862)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3408853"
% 1.81/1.11 % (3408861)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2054051346:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.81/1.11 % (3408861)Refutation not found, incomplete strategy
% 1.81/1.11 % (3408861)------------------------------
% 1.81/1.11 % (3408861)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.81/1.11 % (3408861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.81/1.11 % (3408861)CaDiCaL version: 2.1.3
% 1.81/1.11 % (3408861)Termination reason: Refutation not found, incomplete strategy
% 1.81/1.11 % (3408861)Time elapsed: 0.003 s
% 1.81/1.11 % (3408861)Peak memory usage: 88 MB
% 1.81/1.11 % (3408861)Instructions burned: 2 (million)
% 1.81/1.11 % (3408863)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=913754403:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.81/1.11 % (3408860)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=1161282269:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.81/1.11 % (3408859)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=3458945925:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.81/1.11 % (3408858)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=3351116468:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.81/1.11 % (3408864)dis-21_1_sil=8000:lcm=predicate:random_seed=2689008401: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.81/1.11 % (3408863)Also succeeded, but the first one will report.
% 1.81/1.11 % (3408864)Instruction limit reached!
% 1.81/1.11 % (3408864)------------------------------
% 1.81/1.11 % (3408864)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.81/1.11 % (3408864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.81/1.11 % (3408864)CaDiCaL version: 2.1.3
% 1.81/1.11 % (3408864)Termination reason: Instruction limit
% 1.81/1.11 % (3408864)Termination phase: Saturation
% 1.81/1.11 % (3408864)Time elapsed: 0.063 s
% 1.81/1.11 % (3408864)Peak memory usage: 89 MB
% 1.81/1.11 % (3408864)Instructions burned: 130 (million)
% 1.81/1.11 % (3408862)Refutation found. Thanks to Tanya!
% 1.81/1.11 % SZS status Theorem for theBenchmark
% 1.81/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/1.31 % (3408862)------------------------------
% 0.15/1.31 % (3408862)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.15/1.31 % (3408862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/1.31 % (3408862)CaDiCaL version: 2.1.3
% 0.15/1.31 % (3408862)Termination reason: Refutation
% 0.15/1.31 % (3408862)Time elapsed: 0.007 s
% 0.15/1.31 % (3408862)Peak memory usage: 88 MB
% 0.15/1.31 % (3408862)Instructions burned: 18 (million)
% 0.15/1.31 % (3408862)------------------------------
% 0.15/1.31 % (3408862)------------------------------
% 0.15/1.31 % (3408853)Success in time 0.273 s
% 0.15/1.31 % Vampire exiting
%------------------------------------------------------------------------------