%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET810+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:44:40 PM UTC 2026
% Result : Theorem 0.15s 0.51s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 57 ( 9 unt; 1 def)
% Number of atoms : 309 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 399 ( 147 ~; 132 |; 95 &)
% ( 14 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 171 ( 143 !; 28 ?)
% 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(f12,axiom,
! [X0] :
( member(X0,on)
<=> ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( member(X1,X0)
=> subset(X1,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',ordinal_number) ).
fof(f13,axiom,
! [X0,X1] :
( strict_well_order(X0,X1)
<=> ( strict_order(X0,X1)
& ! [X2] :
( ( subset(X2,X1)
& ? [X3] : member(X3,X2) )
=> ? [X4] : least(X4,X0,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',strict_well_order) ).
fof(f15,axiom,
! [X0,X1] :
( apply(member_predicate,X0,X1)
<=> member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',rel_member) ).
fof(f16,axiom,
! [X0,X1] :
( strict_order(X0,X1)
<=> ( ! [X2,X3] :
( ( member(X2,X1)
& member(X3,X1) )
=> ~ ( apply(X0,X2,X3)
& apply(X0,X3,X2) ) )
& ! [X2,X3,X4] :
( ( member(X2,X1)
& member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X4) )
=> apply(X0,X2,X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',strict_order) ).
fof(f20,conjecture,
! [X0,X1] :
( ( member(X0,on)
& member(X1,on) )
=> ~ ( member(X0,X1)
& member(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thV3) ).
fof(f21,negated_conjecture,
~ ! [X0,X1] :
( ( member(X0,on)
& member(X1,on) )
=> ~ ( member(X0,X1)
& member(X1,X0) ) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( strict_order(X0,X1)
<=> ( ! [X2,X3] :
( ( member(X2,X1)
& member(X3,X1) )
=> ~ ( apply(X0,X2,X3)
& apply(X0,X3,X2) ) )
& ! [X4,X5,X6] :
( ( member(X4,X1)
& member(X5,X1)
& member(X6,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X5,X6) )
=> apply(X0,X4,X6) ) ) ) ),
inference(rectify,[],[f16]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f25,plain,
! [X0] :
( member(X0,on)
<=> ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( subset(X1,X0)
| ~ member(X1,X0) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0,X1] :
( strict_well_order(X0,X1)
<=> ( strict_order(X0,X1)
& ! [X2] :
( ? [X4] : least(X4,X0,X2)
| ~ subset(X2,X1)
| ! [X3] : ~ member(X3,X2) ) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0,X1] :
( strict_well_order(X0,X1)
<=> ( strict_order(X0,X1)
& ! [X2] :
( ? [X4] : least(X4,X0,X2)
| ~ subset(X2,X1)
| ! [X3] : ~ member(X3,X2) ) ) ),
inference(flattening,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( strict_order(X0,X1)
<=> ( ! [X2,X3] :
( ~ apply(X0,X2,X3)
| ~ apply(X0,X3,X2)
| ~ member(X2,X1)
| ~ member(X3,X1) )
& ! [X4,X5,X6] :
( apply(X0,X4,X6)
| ~ apply(X0,X4,X5)
| ~ apply(X0,X5,X6)
| ~ member(X4,X1)
| ~ member(X5,X1)
| ~ member(X6,X1) ) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f31,plain,
! [X0,X1] :
( strict_order(X0,X1)
<=> ( ! [X2,X3] :
( ~ apply(X0,X2,X3)
| ~ apply(X0,X3,X2)
| ~ member(X2,X1)
| ~ member(X3,X1) )
& ! [X4,X5,X6] :
( apply(X0,X4,X6)
| ~ apply(X0,X4,X5)
| ~ apply(X0,X5,X6)
| ~ member(X4,X1)
| ~ member(X5,X1)
| ~ member(X6,X1) ) ) ),
inference(flattening,[],[f30]) ).
fof(f33,plain,
? [X0,X1] :
( member(X0,X1)
& member(X1,X0)
& member(X0,on)
& member(X1,on) ),
inference(ennf_transformation,[],[f21]) ).
fof(f34,plain,
? [X0,X1] :
( member(X0,X1)
& member(X1,X0)
& member(X0,on)
& member(X1,on) ),
inference(flattening,[],[f33]) ).
fof(f35,definition,
! [X0,X1] :
( sP0(X0,X1)
<=> ! [X4,X5,X6] :
( apply(X0,X4,X6)
| ~ apply(X0,X4,X5)
| ~ apply(X0,X5,X6)
| ~ member(X4,X1)
| ~ member(X5,X1)
| ~ member(X6,X1) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f36,plain,
! [X0,X1] :
( strict_order(X0,X1)
<=> ( ! [X2,X3] :
( ~ apply(X0,X2,X3)
| ~ apply(X0,X3,X2)
| ~ member(X2,X1)
| ~ member(X3,X1) )
& sP0(X0,X1) ) ),
inference(definition_folding,[],[f31,f35]) ).
fof(f37,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,[],[f23]) ).
fof(f38,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,[],[f37]) ).
fof(f39,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))],[f38]) ).
fof(f56,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ? [X1] :
( ~ subset(X1,X0)
& member(X1,X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( subset(X1,X0)
| ~ member(X1,X0) ) )
| ~ member(X0,on) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f57,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ? [X1] :
( ~ subset(X1,X0)
& member(X1,X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( subset(X1,X0)
| ~ member(X1,X0) ) )
| ~ member(X0,on) ) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ? [X1] :
( ~ subset(X1,X0)
& member(X1,X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X2] :
( subset(X2,X0)
| ~ member(X2,X0) ) )
| ~ member(X0,on) ) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ( ~ subset(sK4(X0),X0)
& member(sK4(X0),X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X2] :
( subset(X2,X0)
| ~ member(X2,X0) ) )
| ~ member(X0,on) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f58]) ).
fof(f60,plain,
! [X0,X1] :
( ( strict_well_order(X0,X1)
| ~ strict_order(X0,X1)
| ? [X2] :
( ! [X4] : ~ least(X4,X0,X2)
& subset(X2,X1)
& ? [X3] : member(X3,X2) ) )
& ( ( strict_order(X0,X1)
& ! [X2] :
( ? [X4] : least(X4,X0,X2)
| ~ subset(X2,X1)
| ! [X3] : ~ member(X3,X2) ) )
| ~ strict_well_order(X0,X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f61,plain,
! [X0,X1] :
( ( strict_well_order(X0,X1)
| ~ strict_order(X0,X1)
| ? [X2] :
( ! [X4] : ~ least(X4,X0,X2)
& subset(X2,X1)
& ? [X3] : member(X3,X2) ) )
& ( ( strict_order(X0,X1)
& ! [X2] :
( ? [X4] : least(X4,X0,X2)
| ~ subset(X2,X1)
| ! [X3] : ~ member(X3,X2) ) )
| ~ strict_well_order(X0,X1) ) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1] :
( ( strict_well_order(X0,X1)
| ~ strict_order(X0,X1)
| ? [X2] :
( ! [X3] : ~ least(X3,X0,X2)
& subset(X2,X1)
& ? [X4] : member(X4,X2) ) )
& ( ( strict_order(X0,X1)
& ! [X5] :
( ? [X6] : least(X6,X0,X5)
| ~ subset(X5,X1)
| ! [X7] : ~ member(X7,X5) ) )
| ~ strict_well_order(X0,X1) ) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( ( strict_well_order(X0,X1)
| ~ strict_order(X0,X1)
| ( ! [X3] : ~ least(X3,X0,sK5(X0,X1))
& subset(sK5(X0,X1),X1)
& member(sK6(X0,X1),sK5(X0,X1)) ) )
& ( ( strict_order(X0,X1)
& ! [X5] :
( least(sK7(X0,X5),X0,X5)
| ~ subset(X5,X1)
| ! [X7] : ~ member(X7,X5) ) )
| ~ strict_well_order(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X2,sK5(X0,X1)),skolemize(X4,sK6(X0,X1)),skolemize(X6,sK7(X0,X5))],[f62]) ).
fof(f68,plain,
! [X0,X1] :
( ( apply(member_predicate,X0,X1)
| ~ member(X0,X1) )
& ( member(X0,X1)
| ~ apply(member_predicate,X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f72,plain,
! [X0,X1] :
( ( strict_order(X0,X1)
| ? [X2,X3] :
( apply(X0,X2,X3)
& apply(X0,X3,X2)
& member(X2,X1)
& member(X3,X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X2,X3] :
( ~ apply(X0,X2,X3)
| ~ apply(X0,X3,X2)
| ~ member(X2,X1)
| ~ member(X3,X1) )
& sP0(X0,X1) )
| ~ strict_order(X0,X1) ) ),
inference(nnf_transformation,[],[f36]) ).
fof(f73,plain,
! [X0,X1] :
( ( strict_order(X0,X1)
| ? [X2,X3] :
( apply(X0,X2,X3)
& apply(X0,X3,X2)
& member(X2,X1)
& member(X3,X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X2,X3] :
( ~ apply(X0,X2,X3)
| ~ apply(X0,X3,X2)
| ~ member(X2,X1)
| ~ member(X3,X1) )
& sP0(X0,X1) )
| ~ strict_order(X0,X1) ) ),
inference(flattening,[],[f72]) ).
fof(f74,plain,
! [X0,X1] :
( ( strict_order(X0,X1)
| ? [X2,X3] :
( apply(X0,X2,X3)
& apply(X0,X3,X2)
& member(X2,X1)
& member(X3,X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X4,X5] :
( ~ apply(X0,X4,X5)
| ~ apply(X0,X5,X4)
| ~ member(X4,X1)
| ~ member(X5,X1) )
& sP0(X0,X1) )
| ~ strict_order(X0,X1) ) ),
inference(rectify,[],[f73]) ).
fof(f75,plain,
! [X0,X1] :
( ( strict_order(X0,X1)
| ( apply(X0,sK12(X0,X1),sK13(X0,X1))
& apply(X0,sK13(X0,X1),sK12(X0,X1))
& member(sK12(X0,X1),X1)
& member(sK13(X0,X1),X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X4,X5] :
( ~ apply(X0,X4,X5)
| ~ apply(X0,X5,X4)
| ~ member(X4,X1)
| ~ member(X5,X1) )
& sP0(X0,X1) )
| ~ strict_order(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X2,sK12(X0,X1)),skolemize(X3,sK13(X0,X1))],[f74]) ).
fof(f79,plain,
( member(sK14,sK15)
& member(sK15,sK14)
& member(sK14,on)
& member(sK15,on) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X0,sK14),skolemize(X1,sK15)],[f34]) ).
fof(f80,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| member(X3,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f106,plain,
! [X2,X0] :
( ~ member(X2,X0)
| subset(X2,X0)
| ~ member(X0,on) ),
inference(cnf_transformation,[],[f59]) ).
fof(f107,plain,
! [X0] :
( ~ member(X0,on)
| strict_well_order(member_predicate,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f112,plain,
! [X0,X1] :
( ~ strict_well_order(X0,X1)
| strict_order(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f122,plain,
! [X0,X1] :
( apply(member_predicate,X0,X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f131,plain,
! [X0,X1,X4,X5] :
( ~ apply(X0,X5,X4)
| ~ apply(X0,X4,X5)
| ~ member(X4,X1)
| ~ member(X5,X1)
| ~ strict_order(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f142,plain,
member(sK15,on),
inference(cnf_transformation,[],[f79]) ).
fof(f144,plain,
member(sK15,sK14),
inference(cnf_transformation,[],[f79]) ).
fof(f145,plain,
member(sK14,sK15),
inference(cnf_transformation,[],[f79]) ).
fof(f178,plain,
strict_well_order(member_predicate,sK15),
inference(resolution,[],[f107,f142]) ).
fof(f193,plain,
strict_order(member_predicate,sK15),
inference(resolution,[],[f112,f178]) ).
fof(f364,plain,
! [X2,X0,X1] :
( ~ apply(member_predicate,X1,X0)
| ~ member(X0,X1)
| ~ member(X1,X2)
| ~ member(X0,X2)
| ~ strict_order(member_predicate,X2) ),
inference(resolution,[],[f122,f131]) ).
fof(f403,plain,
! [X2,X0,X1] :
( ~ strict_order(member_predicate,X2)
| ~ member(X1,X2)
| ~ member(X0,X2)
| ~ member(X0,X1)
| ~ member(X1,X0) ),
inference(resolution,[],[f364,f122]) ).
fof(f408,plain,
! [X0,X1] :
( ~ member(X1,sK15)
| ~ member(X0,sK15)
| ~ member(X1,X0)
| ~ member(X0,X1) ),
inference(resolution,[],[f403,f193]) ).
fof(f410,plain,
! [X0] :
( ~ member(sK14,X0)
| ~ member(X0,sK15)
| ~ member(X0,sK14) ),
inference(resolution,[],[f408,f145]) ).
fof(f421,plain,
( ~ member(sK15,sK15)
| ~ member(sK15,sK14) ),
inference(resolution,[],[f410,f145]) ).
fof(f422,plain,
~ member(sK15,sK15),
inference(forward_subsumption_resolution,[],[f421,f144]) ).
fof(f767,plain,
! [X0] :
( ~ subset(sK14,X0)
| member(sK15,X0) ),
inference(resolution,[],[f80,f144]) ).
fof(f1419,plain,
( subset(sK14,sK15)
| ~ member(sK15,on) ),
inference(resolution,[],[f106,f145]) ).
fof(f1420,plain,
subset(sK14,sK15),
inference(forward_subsumption_resolution,[],[f1419,f142]) ).
fof(f1422,plain,
member(sK15,sK15),
inference(resolution,[],[f1420,f767]) ).
fof(f1423,plain,
$false,
inference(forward_subsumption_resolution,[],[f1422,f422]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET810+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39 % Computer : n011.cluster.edu
% 0.09/0.39 % Model : x86_64 x86_64
% 0.09/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39 % Memory : 8046.5625MB
% 0.09/0.39 % OS : Linux 6.8.0-71-generic
% 0.09/0.40 % CPULimit : 300
% 0.09/0.40 % WCLimit : 300
% 0.09/0.40 % DateTime : Mon Sep 28 02:52:52 UTC 2026
% 0.09/0.40 % CPUTime :
% 0.09/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.43 Running first-order model finding
% 0.09/0.43 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.51 % (2973876)Will run a generic schedule for satisfiability detection.
% 0.15/0.51 % (2973885)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4085002751:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.51 % (2973882)% WARNING: option uhcvi not known.
% 0.15/0.51 % (2973884)dis+10_1_sil=32000:sp=arity:random_seed=3535101571:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.51 % (2973881)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3027270448_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.51 % (2973882)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=995657092:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.51 % (2973886)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3232646786:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.51 % (2973883)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3564435213:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.51 % (2973887)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2250902971:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.51 % TRYING [1]
% 0.15/0.51 % TRYING [2]
% 0.15/0.51 % TRYING [3]
% 0.15/0.51 % TRYING [4]
% 0.15/0.51 % TRYING [5]
% 0.15/0.51 % (2973883) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2973876-2973883"...
% 0.15/0.51 % (2973883)...printing done.
% 0.15/0.51 % (2973885)Instruction limit reached!
% 0.15/0.51 % (2973885)------------------------------
% 0.15/0.51 % (2973885)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (2973885)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (2973885)CaDiCaL version: 2.1.3
% 0.15/0.51 % (2973885)Termination reason: Instruction limit
% 0.15/0.51 % (2973885)Termination phase: Saturation
% 0.15/0.51 % (2973885)Time elapsed: 0.038 s
% 0.15/0.51 % (2973885)Peak memory usage: 13 MB
% 0.15/0.51 % (2973885)Instructions burned: 119 (million)
% 0.15/0.51 % (2973883)Refutation found. Thanks to Tanya!
% 0.15/0.51 % SZS status Theorem for theBenchmark
% 0.15/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.51 % (2973883)------------------------------
% 0.15/0.51 % (2973883)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (2973883)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (2973883)CaDiCaL version: 2.1.3
% 0.15/0.51 % (2973883)Termination reason: Refutation
% 0.15/0.51 % (2973883)Time elapsed: 0.028 s
% 0.15/0.51 % (2973883)Peak memory usage: 12 MB
% 0.15/0.51 % (2973883)Instructions burned: 37 (million)
% 0.15/0.51 % (2973876)Success in time 0.069 s
% 0.15/0.51 % Vampire exiting
%------------------------------------------------------------------------------