%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n018.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:59 PM UTC 2026
% Result : Theorem 2.17s 1.15s
% Output : Refutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 57 ( 8 unt; 1 def)
% Number of atoms : 307 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 400 ( 150 ~; 130 |; 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 : 175 ( 147 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',strict_well_order) ).
fof(f15,axiom,
! [X0,X1] :
( apply(member_predicate,X0,X1)
<=> member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',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] :
( member(X0,X1)
& member(X1,X0)
& member(X0,on)
& member(X1,on) ),
inference(ennf_transformation,[],[f21]) ).
fof(f24,plain,
? [X0,X1] :
( member(X0,X1)
& member(X1,X0)
& member(X0,on)
& member(X1,on) ),
inference(flattening,[],[f23]) ).
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] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f28,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(f29,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,[],[f28]) ).
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(f34,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(f35,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,f34]) ).
fof(f36,plain,
( member(sK1,sK2)
& member(sK2,sK1)
& member(sK1,on)
& member(sK2,on) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f24]) ).
fof(f37,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(f38,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,[],[f37]) ).
fof(f39,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,[],[f38]) ).
fof(f40,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ( ~ subset(sK3(X0),X0)
& member(sK3(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,[sK3]),skolemize(X1,sK3(X0))],[f39]) ).
fof(f41,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,[],[f26]) ).
fof(f42,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,[],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK4(X0,X1),X1)
& member(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f42]) ).
fof(f44,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,[],[f29]) ).
fof(f45,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,[],[f44]) ).
fof(f46,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,[],[f45]) ).
fof(f47,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))],[f46]) ).
fof(f48,plain,
! [X0,X1] :
( ( apply(member_predicate,X0,X1)
| ~ member(X0,X1) )
& ( member(X0,X1)
| ~ apply(member_predicate,X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f52,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,[],[f35]) ).
fof(f53,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,[],[f52]) ).
fof(f54,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,[],[f53]) ).
fof(f55,plain,
! [X0,X1] :
( ( strict_order(X0,X1)
| ( apply(X0,sK11(X0,X1),sK12(X0,X1))
& apply(X0,sK12(X0,X1),sK11(X0,X1))
& member(sK11(X0,X1),X1)
& member(sK12(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,[sK11,sK12]),skolemize(X2,sK11(X0,X1)),skolemize(X3,sK12(X0,X1))],[f54]) ).
fof(f60,plain,
member(sK2,on),
inference(cnf_transformation,[],[f36]) ).
fof(f61,plain,
member(sK1,on),
inference(cnf_transformation,[],[f36]) ).
fof(f62,plain,
member(sK2,sK1),
inference(cnf_transformation,[],[f36]) ).
fof(f63,plain,
member(sK1,sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f64,plain,
! [X2,X0] :
( subset(X2,X0)
| ~ member(X2,X0)
| ~ member(X0,on) ),
inference(cnf_transformation,[],[f40]) ).
fof(f65,plain,
! [X0] :
( strict_well_order(member_predicate,X0)
| ~ member(X0,on) ),
inference(cnf_transformation,[],[f40]) ).
fof(f69,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f74,plain,
! [X0,X1] :
( strict_order(X0,X1)
| ~ strict_well_order(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f79,plain,
! [X0,X1] :
( apply(member_predicate,X0,X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f88,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,[],[f55]) ).
fof(f201,plain,
! [X2,X0,X1] :
( ~ apply(X0,X1,X1)
| ~ member(X1,X2)
| ~ member(X1,X2)
| ~ strict_order(X0,X2) ),
inference(factoring,[],[f88]) ).
fof(f202,plain,
! [X2,X0,X1] :
( ~ apply(X0,X1,X1)
| ~ member(X1,X2)
| ~ strict_order(X0,X2) ),
inference(duplicate_literal_removal,[],[f201]) ).
fof(f205,plain,
! [X0,X1] :
( ~ strict_order(member_predicate,X1)
| ~ member(X0,X1)
| ~ member(X0,X0) ),
inference(resolution,[],[f202,f79]) ).
fof(f207,plain,
! [X0,X1] :
( ~ strict_well_order(member_predicate,X1)
| ~ member(X0,X0)
| ~ member(X0,X1) ),
inference(resolution,[],[f205,f74]) ).
fof(f214,plain,
! [X0,X1] :
( ~ member(X1,on)
| ~ member(X0,X1)
| ~ member(X0,X0) ),
inference(resolution,[],[f207,f65]) ).
fof(f219,plain,
! [X0] :
( ~ member(X0,sK2)
| ~ member(X0,X0) ),
inference(resolution,[],[f214,f60]) ).
fof(f234,plain,
~ member(sK1,sK1),
inference(resolution,[],[f219,f63]) ).
fof(f249,plain,
! [X0] :
( ~ member(sK1,X0)
| ~ subset(X0,sK1) ),
inference(resolution,[],[f234,f69]) ).
fof(f266,plain,
~ subset(sK2,sK1),
inference(resolution,[],[f249,f63]) ).
fof(f269,plain,
( ~ member(sK2,sK1)
| ~ member(sK1,on) ),
inference(resolution,[],[f266,f64]) ).
fof(f270,plain,
~ member(sK1,on),
inference(forward_subsumption_resolution,[],[f269,f62]) ).
fof(f271,plain,
$false,
inference(forward_subsumption_resolution,[],[f270,f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET810+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n018.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 02:55:57 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.17/1.15 % (2947999)Detected formulas, will run a generic FOF schedule.
% 2.17/1.15 % (2948008)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2267498339:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.17/1.15 % (2948008)First to succeed.
% 2.17/1.15 % (2948008)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2947999"
% 2.17/1.15 % (2948005)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=1363348480:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.17/1.15 % (2948004)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=1959750126:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.17/1.15 % (2948006)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=749826103:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.17/1.15 % (2948010)dis-21_1_sil=8000:lcm=predicate:random_seed=2127490502: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.17/1.15 % (2948007)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1379724650:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.17/1.15 % (2948009)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=493972960:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.17/1.15 % (2948007)Refutation not found, incomplete strategy
% 2.17/1.15 % (2948007)------------------------------
% 2.17/1.15 % (2948007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.17/1.15 % (2948007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/1.15 % (2948007)CaDiCaL version: 2.1.3
% 2.17/1.15 % (2948007)Termination reason: Refutation not found, incomplete strategy
% 2.17/1.15 % (2948007)Time elapsed: 0.001 s
% 2.17/1.15 % (2948007)Peak memory usage: 88 MB
% 2.17/1.15 % (2948010)Also succeeded, but the first one will report.
% 2.17/1.15 % (2948009)Instruction limit reached!
% 2.17/1.15 % (2948009)------------------------------
% 2.17/1.15 % (2948009)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.17/1.15 % (2948009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/1.15 % (2948009)CaDiCaL version: 2.1.3
% 2.17/1.15 % (2948009)Termination reason: Instruction limit
% 2.17/1.15 % (2948009)Termination phase: Saturation
% 2.17/1.15 % (2948009)Time elapsed: 0.092 s
% 2.17/1.15 % (2948009)Peak memory usage: 89 MB
% 2.17/1.15 % (2948009)Instructions burned: 139 (million)
% 2.17/1.15 % (2948008)Refutation found. Thanks to Tanya!
% 2.17/1.15 % SZS status Theorem for theBenchmark
% 2.17/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 2.73/1.34 % (2948008)------------------------------
% 2.73/1.34 % (2948008)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.34 % (2948008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.34 % (2948008)CaDiCaL version: 2.1.3
% 2.73/1.34 % (2948008)Termination reason: Refutation
% 2.73/1.34 % (2948008)Time elapsed: 0.005 s
% 2.73/1.34 % (2948008)Peak memory usage: 88 MB
% 2.73/1.34 % (2948008)Instructions burned: 10 (million)
% 2.73/1.34 % (2948008)------------------------------
% 2.73/1.34 % (2948008)------------------------------
% 2.73/1.34 % (2947999)Success in time 0.304 s
% 2.73/1.34 % Vampire exiting
%------------------------------------------------------------------------------