%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET018+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:42:38 PM UTC 2026
% Result : Theorem 0.15s 0.49s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 9
% Syntax : Number of formulae : 101 ( 17 unt; 4 def)
% Number of atoms : 253 ( 62 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 261 ( 109 ~; 123 |; 16 &)
% ( 9 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 73 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f8,axiom,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(f9,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X1
| X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(f12,conjecture,
! [X0,X1,X2,X3] :
( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3)))
=> X1 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI50b) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3)))
=> X1 = X3 ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( equal_set(X0,X1)
=> ( subset(X0,X1)
& subset(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,plain,
? [X0,X1,X2,X3] :
( X1 != X3
& equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3))) ),
inference(ennf_transformation,[],[f13]) ).
fof(f19,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,[],[f15]) ).
fof(f20,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,[],[f19]) ).
fof(f21,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))],[f20]) ).
fof(f29,plain,
! [X0,X1] :
( ( member(X0,singleton(X1))
| X0 != X1 )
& ( X0 = X1
| ~ member(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f30]) ).
fof(f38,plain,
( sK4 != sK6
& equal_set(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f18]) ).
fof(f39,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| member(X3,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f42,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f43,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f56,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f57,plain,
! [X0,X1] :
( member(X0,singleton(X1))
| X0 != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f59,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2 ),
inference(cnf_transformation,[],[f31]) ).
fof(f60,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f67,plain,
equal_set(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(cnf_transformation,[],[f38]) ).
fof(f68,plain,
sK4 != sK6,
inference(cnf_transformation,[],[f38]) ).
fof(f69,plain,
! [X1] : member(X1,singleton(X1)),
inference(equality_resolution,[],[f57]) ).
fof(f70,plain,
! [X2,X1] : member(X1,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f60]) ).
fof(f71,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f59]) ).
fof(f72,plain,
subset(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),unordered_pair(singleton(sK3),unordered_pair(sK3,sK4))),
inference(resolution,[],[f42,f67]) ).
fof(f73,plain,
subset(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(resolution,[],[f43,f67]) ).
fof(f92,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X0,X2),X1)
| member(X0,X1) ),
inference(resolution,[],[f39,f70]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X2,X0),X1)
| member(X0,X1) ),
inference(resolution,[],[f39,f71]) ).
fof(f97,plain,
member(singleton(sK5),unordered_pair(singleton(sK3),unordered_pair(sK3,sK4))),
inference(resolution,[],[f92,f72]) ).
fof(f98,plain,
member(singleton(sK3),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(resolution,[],[f92,f73]) ).
fof(f162,plain,
( unordered_pair(sK3,sK4) = singleton(sK5)
| singleton(sK3) = singleton(sK5) ),
inference(resolution,[],[f58,f97]) ).
fof(f163,plain,
( singleton(sK3) = unordered_pair(sK5,sK6)
| singleton(sK3) = singleton(sK5) ),
inference(resolution,[],[f58,f98]) ).
fof(f168,definition,
( spl7_1
<=> singleton(sK3) = singleton(sK5) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f170,plain,
( singleton(sK3) = singleton(sK5)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f172,definition,
( spl7_2
<=> singleton(sK3) = unordered_pair(sK5,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f173,plain,
( singleton(sK3) != unordered_pair(sK5,sK6)
| spl7_2 ),
inference(avatar_component_clause,[],[f172]) ).
fof(f174,plain,
( singleton(sK3) = unordered_pair(sK5,sK6)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f172]) ).
fof(f175,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f163,f172,f168]) ).
fof(f177,definition,
( spl7_3
<=> unordered_pair(sK3,sK4) = singleton(sK5) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f178,plain,
( unordered_pair(sK3,sK4) != singleton(sK5)
| spl7_3 ),
inference(avatar_component_clause,[],[f177]) ).
fof(f179,plain,
( unordered_pair(sK3,sK4) = singleton(sK5)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f177]) ).
fof(f180,plain,
( spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f162,f177,f168]) ).
fof(f190,plain,
( member(sK6,singleton(sK3))
| ~ spl7_2 ),
inference(superposition,[],[f71,f174]) ).
fof(f191,plain,
( member(sK5,singleton(sK3))
| ~ spl7_2 ),
inference(superposition,[],[f70,f174]) ).
fof(f195,plain,
( sK3 = sK6
| ~ spl7_2 ),
inference(resolution,[],[f190,f56]) ).
fof(f203,plain,
( sK3 != sK4
| ~ spl7_2 ),
inference(superposition,[],[f68,f195]) ).
fof(f212,plain,
member(unordered_pair(sK5,sK6),unordered_pair(singleton(sK3),unordered_pair(sK3,sK4))),
inference(resolution,[],[f93,f72]) ).
fof(f213,plain,
member(unordered_pair(sK3,sK4),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(resolution,[],[f93,f73]) ).
fof(f222,plain,
( sK3 = sK5
| ~ spl7_2 ),
inference(resolution,[],[f191,f56]) ).
fof(f249,plain,
( singleton(sK3) = unordered_pair(sK3,sK4)
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_demodulation,[],[f179,f222]) ).
fof(f259,plain,
( member(sK4,singleton(sK3))
| ~ spl7_2
| ~ spl7_3 ),
inference(superposition,[],[f71,f249]) ).
fof(f275,plain,
( sK3 = sK4
| ~ spl7_2
| ~ spl7_3 ),
inference(resolution,[],[f259,f56]) ).
fof(f278,plain,
( $false
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f275,f203]) ).
fof(f279,plain,
( ~ spl7_2
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f278]) ).
fof(f294,plain,
( member(sK5,singleton(sK3))
| ~ spl7_1 ),
inference(superposition,[],[f69,f170]) ).
fof(f296,plain,
( sK3 = sK5
| ~ spl7_1 ),
inference(resolution,[],[f294,f56]) ).
fof(f310,plain,
( singleton(sK3) != unordered_pair(sK3,sK6)
| ~ spl7_1
| spl7_2 ),
inference(forward_demodulation,[],[f173,f296]) ).
fof(f708,plain,
( singleton(sK3) != unordered_pair(sK3,sK4)
| ~ spl7_1
| spl7_3 ),
inference(forward_demodulation,[],[f178,f170]) ).
fof(f715,plain,
( member(unordered_pair(sK3,sK6),unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)))
| ~ spl7_1 ),
inference(forward_demodulation,[],[f212,f296]) ).
fof(f752,plain,
( member(unordered_pair(sK3,sK4),unordered_pair(singleton(sK3),unordered_pair(sK3,sK6)))
| ~ spl7_1 ),
inference(forward_demodulation,[],[f213,f296]) ).
fof(f772,plain,
( unordered_pair(sK3,sK4) = unordered_pair(sK3,sK6)
| singleton(sK3) = unordered_pair(sK3,sK6)
| ~ spl7_1 ),
inference(resolution,[],[f715,f58]) ).
fof(f778,plain,
( unordered_pair(sK3,sK4) = unordered_pair(sK3,sK6)
| ~ spl7_1
| spl7_2 ),
inference(forward_subsumption_resolution,[],[f772,f310]) ).
fof(f801,plain,
( member(sK6,unordered_pair(sK3,sK4))
| ~ spl7_1
| spl7_2 ),
inference(superposition,[],[f71,f778]) ).
fof(f824,plain,
( sK4 = sK6
| sK3 = sK6
| ~ spl7_1
| spl7_2 ),
inference(resolution,[],[f801,f58]) ).
fof(f830,plain,
( sK3 = sK6
| ~ spl7_1
| spl7_2 ),
inference(forward_subsumption_resolution,[],[f824,f68]) ).
fof(f850,plain,
( sK3 != sK4
| ~ spl7_1
| spl7_2 ),
inference(superposition,[],[f68,f830]) ).
fof(f859,plain,
( unordered_pair(sK3,sK4) = unordered_pair(sK3,sK3)
| ~ spl7_1
| spl7_2 ),
inference(superposition,[],[f778,f830]) ).
fof(f929,plain,
( member(sK4,unordered_pair(sK3,sK3))
| ~ spl7_1
| spl7_2 ),
inference(superposition,[],[f71,f859]) ).
fof(f962,plain,
( sK3 = sK4
| sK3 = sK4
| ~ spl7_1
| spl7_2 ),
inference(resolution,[],[f929,f58]) ).
fof(f968,plain,
( sK3 = sK4
| ~ spl7_1
| spl7_2 ),
inference(duplicate_literal_removal,[],[f962]) ).
fof(f969,plain,
( $false
| ~ spl7_1
| spl7_2 ),
inference(forward_subsumption_resolution,[],[f968,f850]) ).
fof(f970,plain,
( ~ spl7_1
| spl7_2 ),
inference(avatar_contradiction_clause,[],[f969]) ).
fof(f971,plain,
( singleton(sK3) = unordered_pair(sK3,sK6)
| ~ spl7_1
| ~ spl7_2 ),
inference(forward_demodulation,[],[f174,f296]) ).
fof(f974,definition,
( spl7_4
<=> singleton(sK3) = unordered_pair(sK3,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f976,plain,
( singleton(sK3) = unordered_pair(sK3,sK6)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f974]) ).
fof(f983,plain,
( spl7_4
| ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f971,f172,f168,f974]) ).
fof(f1073,plain,
( singleton(sK3) = unordered_pair(sK3,sK3)
| ~ spl7_2
| ~ spl7_4 ),
inference(forward_demodulation,[],[f976,f195]) ).
fof(f1287,plain,
( member(unordered_pair(sK3,sK4),unordered_pair(singleton(sK3),unordered_pair(sK3,sK3)))
| ~ spl7_1
| ~ spl7_2 ),
inference(forward_demodulation,[],[f752,f195]) ).
fof(f1288,plain,
( member(unordered_pair(sK3,sK4),unordered_pair(singleton(sK3),singleton(sK3)))
| ~ spl7_1
| ~ spl7_2
| ~ spl7_4 ),
inference(forward_demodulation,[],[f1287,f1073]) ).
fof(f1328,plain,
( singleton(sK3) = unordered_pair(sK3,sK4)
| singleton(sK3) = unordered_pair(sK3,sK4)
| ~ spl7_1
| ~ spl7_2
| ~ spl7_4 ),
inference(resolution,[],[f1288,f58]) ).
fof(f1336,plain,
( singleton(sK3) = unordered_pair(sK3,sK4)
| ~ spl7_1
| ~ spl7_2
| ~ spl7_4 ),
inference(duplicate_literal_removal,[],[f1328]) ).
fof(f1337,plain,
( $false
| ~ spl7_1
| ~ spl7_2
| spl7_3
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f1336,f708]) ).
fof(f1338,plain,
( ~ spl7_1
| ~ spl7_2
| spl7_3
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f1337]) ).
cnf(s1,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f175]) ).
cnf(s2,plain,
( spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f180]) ).
cnf(s3,plain,
( ~ spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f279]) ).
cnf(s5,plain,
( ~ spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f970]) ).
cnf(s7,plain,
( ~ spl7_1
| ~ spl7_2
| spl7_4 ),
inference(sat_conversion,[],[f983]) ).
cnf(s8,plain,
( ~ spl7_1
| ~ spl7_2
| spl7_3
| ~ spl7_4 ),
inference(sat_conversion,[],[f1338]) ).
cnf(s9,plain,
spl7_1,
inference(rat,[],[s3,s1,s2]) ).
cnf(s10,plain,
spl7_2,
inference(rat,[],[s5,s9]) ).
cnf(s11,plain,
spl7_4,
inference(rat,[],[s7,s9,s10]) ).
cnf(s12,plain,
~ spl7_3,
inference(rat,[],[s3,s10]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s8,s11,s9,s10,s12]) ).
fof(f1339,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET018+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 00:08:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.49 % (3471389)Will run a generic schedule for satisfiability detection.
% 0.15/0.49 % (3471395)% WARNING: option uhcvi not known.
% 0.15/0.49 % (3471395)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3301408627:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.49 % (3471394)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2386120677_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.49 % (3471396)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3647363796:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.49 % (3471397)dis+10_1_sil=32000:sp=arity:random_seed=1979086895:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.49 % (3471398)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3458614173:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.49 % (3471400)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=675878365:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.49 % (3471399)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1540094182:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.49 % TRYING [1]
% 0.15/0.49 % TRYING [2]
% 0.15/0.49 % TRYING [3]
% 0.15/0.49 % TRYING [4]
% 0.15/0.49 % TRYING [5]
% 0.15/0.49 % TRYING [6]
% 0.15/0.49 % (3471397) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3471389-3471397"...
% 0.15/0.49 % (3471397)...printing done.
% 0.15/0.49 % (3471397)Refutation found. Thanks to Tanya!
% 0.15/0.49 % SZS status Theorem for theBenchmark
% 0.15/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.49 % (3471397)------------------------------
% 0.15/0.49 % (3471397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.49 % (3471397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.49 % (3471397)CaDiCaL version: 2.1.3
% 0.15/0.49 % (3471397)Termination reason: Refutation
% 0.15/0.49 % (3471397)Time elapsed: 0.034 s
% 0.15/0.49 % (3471397)Peak memory usage: 13 MB
% 0.15/0.49 % (3471397)Instructions burned: 54 (million)
% 0.15/0.49 % (3471389)Success in time 0.085 s
% 0.15/0.49 % Vampire exiting
%------------------------------------------------------------------------------