%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET774+4 : 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 : n017.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:53 PM UTC 2026
% Result : Theorem 2.60s 1.28s
% Output : Refutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of formulae : 60 ( 5 unt; 1 def)
% Number of atoms : 289 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 391 ( 162 ~; 162 |; 49 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 181 ( 166 !; 15 ?)
% 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(f16,axiom,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,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',pre_order) ).
fof(f17,conjecture,
! [X0,X1,X2] :
( ( pre_order(X2,X0)
& subset(X1,X0) )
=> pre_order(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIII10) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( ( pre_order(X2,X0)
& subset(X1,X0) )
=> pre_order(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X4,X5] :
( ( member(X3,X1)
& member(X4,X1)
& member(X5,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X4,X5) )
=> apply(X0,X3,X5) ) ) ) ),
inference(rectify,[],[f16]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ~ pre_order(X2,X1)
& pre_order(X2,X0)
& subset(X1,X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
? [X0,X1,X2] :
( ~ pre_order(X2,X1)
& pre_order(X2,X0)
& subset(X1,X0) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f24,plain,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4,X5] :
( apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X1) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f25,plain,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4,X5] :
( apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X1) ) ) ),
inference(flattening,[],[f24]) ).
fof(f26,definition,
! [X0,X1] :
( sP0(X0,X1)
<=> ! [X3,X4,X5] :
( apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X1) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f27,plain,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& sP0(X0,X1) ) ),
inference(definition_folding,[],[f25,f26]) ).
fof(f28,plain,
( ~ pre_order(sK3,sK2)
& pre_order(sK3,sK1)
& subset(sK2,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f22]) ).
fof(f29,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ? [X3,X4,X5] :
( ~ apply(X0,X3,X5)
& apply(X0,X3,X4)
& apply(X0,X4,X5)
& member(X3,X1)
& member(X4,X1)
& member(X5,X1) ) )
& ( ! [X3,X4,X5] :
( apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X1) )
| ~ sP0(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ? [X2,X3,X4] :
( ~ apply(X0,X2,X4)
& apply(X0,X2,X3)
& apply(X0,X3,X4)
& member(X2,X1)
& member(X3,X1)
& member(X4,X1) ) )
& ( ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
& apply(X0,sK4(X0,X1),sK5(X0,X1))
& apply(X0,sK5(X0,X1),sK6(X0,X1))
& member(sK4(X0,X1),X1)
& member(sK5(X0,X1),X1)
& member(sK6(X0,X1),X1) ) )
& ( ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) )
| ~ sP0(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X2,sK4(X0,X1)),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1))],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ( pre_order(X0,X1)
| ? [X2] :
( ~ apply(X0,X2,X2)
& member(X2,X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& sP0(X0,X1) )
| ~ pre_order(X0,X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f33,plain,
! [X0,X1] :
( ( pre_order(X0,X1)
| ? [X2] :
( ~ apply(X0,X2,X2)
& member(X2,X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& sP0(X0,X1) )
| ~ pre_order(X0,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( pre_order(X0,X1)
| ? [X2] :
( ~ apply(X0,X2,X2)
& member(X2,X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X3] :
( apply(X0,X3,X3)
| ~ member(X3,X1) )
& sP0(X0,X1) )
| ~ pre_order(X0,X1) ) ),
inference(rectify,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( pre_order(X0,X1)
| ( ~ apply(X0,sK7(X0,X1),sK7(X0,X1))
& member(sK7(X0,X1),X1) )
| ~ sP0(X0,X1) )
& ( ( ! [X3] :
( apply(X0,X3,X3)
| ~ member(X3,X1) )
& sP0(X0,X1) )
| ~ pre_order(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f34]) ).
fof(f36,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f37,plain,
pre_order(sK3,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f38,plain,
~ pre_order(sK3,sK2),
inference(cnf_transformation,[],[f28]) ).
fof(f39,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
! [X0,X1,X6,X7,X5] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f41,plain,
! [X0,X1] :
( member(sK6(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f42,plain,
! [X0,X1] :
( member(sK5(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f43,plain,
! [X0,X1] :
( member(sK4(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f44,plain,
! [X0,X1] :
( apply(X0,sK5(X0,X1),sK6(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f45,plain,
! [X0,X1] :
( apply(X0,sK4(X0,X1),sK5(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f46,plain,
! [X0,X1] :
( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f47,plain,
! [X0,X1] :
( sP0(X0,X1)
| ~ pre_order(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f48,plain,
! [X3,X0,X1] :
( apply(X0,X3,X3)
| ~ member(X3,X1)
| ~ pre_order(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f49,plain,
! [X0,X1] :
( member(sK7(X0,X1),X1)
| pre_order(X0,X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f50,plain,
! [X0,X1] :
( ~ apply(X0,sK7(X0,X1),sK7(X0,X1))
| pre_order(X0,X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ member(sK7(X0,X1),X2)
| ~ sP0(X0,X1)
| pre_order(X0,X1)
| ~ pre_order(X0,X2) ),
inference(resolution,[],[f50,f48]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( ~ member(sK7(X0,X1),X3)
| pre_order(X0,X1)
| ~ pre_order(X0,X2)
| ~ sP0(X0,X1)
| ~ subset(X3,X2) ),
inference(resolution,[],[f51,f39]) ).
fof(f55,plain,
! [X2,X0,X1] :
( pre_order(X0,X1)
| ~ pre_order(X0,X2)
| ~ sP0(X0,X1)
| ~ subset(X1,X2)
| pre_order(X0,X1)
| ~ sP0(X0,X1) ),
inference(resolution,[],[f53,f49]) ).
fof(f57,plain,
! [X2,X0,X1] :
( pre_order(X0,X1)
| ~ pre_order(X0,X2)
| ~ sP0(X0,X1)
| ~ subset(X1,X2) ),
inference(duplicate_literal_removal,[],[f55]) ).
fof(f58,plain,
! [X2,X3,X0,X1] :
( ~ apply(X0,sK4(X0,X1),X2)
| ~ apply(X0,X2,sK6(X0,X1))
| ~ member(sK4(X0,X1),X3)
| ~ member(X2,X3)
| ~ member(sK6(X0,X1),X3)
| ~ sP0(X0,X3)
| sP0(X0,X1) ),
inference(resolution,[],[f40,f46]) ).
fof(f61,plain,
! [X0] :
( ~ sP0(sK3,sK2)
| ~ pre_order(sK3,X0)
| ~ subset(sK2,X0) ),
inference(resolution,[],[f57,f38]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ~ apply(X0,sK5(X0,X1),sK6(X0,X1))
| ~ member(sK4(X0,X1),X2)
| ~ member(sK5(X0,X1),X2)
| ~ member(sK6(X0,X1),X2)
| ~ sP0(X0,X2)
| sP0(X0,X1)
| sP0(X0,X1) ),
inference(resolution,[],[f58,f45]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ apply(X0,sK5(X0,X1),sK6(X0,X1))
| ~ member(sK4(X0,X1),X2)
| ~ member(sK5(X0,X1),X2)
| ~ member(sK6(X0,X1),X2)
| ~ sP0(X0,X2)
| sP0(X0,X1) ),
inference(duplicate_literal_removal,[],[f71]) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ member(sK6(X0,X1),X2)
| ~ member(sK5(X0,X1),X2)
| ~ member(sK4(X0,X1),X2)
| ~ sP0(X0,X2)
| sP0(X0,X1) ),
inference(forward_subsumption_resolution,[],[f75,f44]) ).
fof(f79,plain,
! [X2,X3,X0,X1] :
( ~ member(sK6(X0,X1),X3)
| ~ member(sK4(X0,X1),X2)
| ~ sP0(X0,X2)
| sP0(X0,X1)
| ~ member(sK5(X0,X1),X2)
| ~ subset(X3,X2) ),
inference(resolution,[],[f76,f39]) ).
fof(f103,plain,
! [X2,X0,X1] :
( ~ member(sK4(X0,X1),X2)
| ~ sP0(X0,X2)
| sP0(X0,X1)
| ~ member(sK5(X0,X1),X2)
| ~ subset(X1,X2)
| sP0(X0,X1) ),
inference(resolution,[],[f79,f41]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ member(sK5(X0,X1),X2)
| ~ sP0(X0,X2)
| sP0(X0,X1)
| ~ member(sK4(X0,X1),X2)
| ~ subset(X1,X2) ),
inference(duplicate_literal_removal,[],[f103]) ).
fof(f112,plain,
! [X2,X3,X0,X1] :
( ~ member(sK5(X0,X2),X3)
| sP0(X0,X2)
| ~ member(sK4(X0,X2),X1)
| ~ subset(X2,X1)
| ~ sP0(X0,X1)
| ~ subset(X3,X1) ),
inference(resolution,[],[f105,f39]) ).
fof(f123,plain,
! [X2,X0,X1] :
( sP0(X0,X1)
| ~ member(sK4(X0,X1),X2)
| ~ subset(X1,X2)
| ~ sP0(X0,X2)
| ~ subset(X1,X2)
| sP0(X0,X1) ),
inference(resolution,[],[f112,f42]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ member(sK4(X0,X1),X2)
| sP0(X0,X1)
| ~ subset(X1,X2)
| ~ sP0(X0,X2) ),
inference(duplicate_literal_removal,[],[f123]) ).
fof(f127,plain,
! [X2,X3,X0,X1] :
( ~ member(sK4(X0,X1),X3)
| ~ subset(X1,X2)
| ~ sP0(X0,X2)
| sP0(X0,X1)
| ~ subset(X3,X2) ),
inference(resolution,[],[f125,f39]) ).
fof(f140,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ sP0(X2,X1)
| sP0(X2,X0)
| ~ subset(X0,X1)
| sP0(X2,X0) ),
inference(resolution,[],[f127,f43]) ).
fof(f142,plain,
! [X2,X0,X1] :
( sP0(X2,X0)
| ~ sP0(X2,X1)
| ~ subset(X0,X1) ),
inference(duplicate_literal_removal,[],[f140]) ).
fof(f148,plain,
! [X0,X1] :
( ~ sP0(sK3,X0)
| ~ subset(sK2,X0)
| ~ pre_order(sK3,X1)
| ~ subset(sK2,X1) ),
inference(resolution,[],[f142,f61]) ).
fof(f150,plain,
! [X0,X1] :
( ~ pre_order(sK3,X1)
| ~ subset(sK2,X0)
| ~ subset(sK2,X1)
| ~ pre_order(sK3,X0) ),
inference(resolution,[],[f148,f47]) ).
fof(f164,plain,
! [X0] :
( ~ pre_order(sK3,X0)
| ~ subset(sK2,X0)
| ~ subset(sK2,X0) ),
inference(factoring,[],[f150]) ).
fof(f165,plain,
! [X0] :
( ~ pre_order(sK3,X0)
| ~ subset(sK2,X0) ),
inference(duplicate_literal_removal,[],[f164]) ).
fof(f175,plain,
~ subset(sK2,sK1),
inference(resolution,[],[f165,f37]) ).
fof(f179,plain,
$false,
inference(forward_subsumption_resolution,[],[f175,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET774+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n017.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 02:41:21 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.60/1.28 % (3162481)Detected formulas, will run a generic FOF schedule.
% 2.60/1.28 % (3162488)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=1183732015:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.60/1.28 % (3162489)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2751355100:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.60/1.28 % (3162492)dis-21_1_sil=8000:lcm=predicate:random_seed=1910335067: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.60/1.28 % (3162490)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=742227248:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.60/1.28 % (3162487)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=1017310187:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.60/1.28 % (3162486)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=1343923977:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.60/1.28 % (3162491)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3098046678:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.60/1.28 % (3162489)Refutation not found, incomplete strategy
% 2.60/1.28 % (3162489)------------------------------
% 2.60/1.28 % (3162489)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.28 % (3162489)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.28 % (3162489)CaDiCaL version: 2.1.3
% 2.60/1.28 % (3162489)Termination reason: Refutation not found, incomplete strategy
% 2.60/1.28 % (3162489)Time elapsed: 0.002 s
% 2.60/1.28 % (3162489)Peak memory usage: 88 MB
% 2.60/1.28 % (3162489)Instructions burned: 1 (million)
% 2.60/1.28 % (3162490)First to succeed.
% 2.60/1.28 % (3162490)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3162481"
% 2.60/1.28 % (3162492)Instruction limit reached!
% 2.60/1.28 % (3162492)------------------------------
% 2.60/1.28 % (3162492)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.28 % (3162492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.28 % (3162492)CaDiCaL version: 2.1.3
% 2.60/1.28 % (3162492)Termination reason: Instruction limit
% 2.60/1.28 % (3162492)Termination phase: Saturation
% 2.60/1.28 % (3162492)Time elapsed: 0.081 s
% 2.60/1.28 % (3162492)Peak memory usage: 89 MB
% 2.60/1.28 % (3162492)Instructions burned: 130 (million)
% 2.60/1.28 % (3162491)Instruction limit reached!
% 2.60/1.28 % (3162491)------------------------------
% 2.60/1.28 % (3162491)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.28 % (3162491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.28 % (3162491)CaDiCaL version: 2.1.3
% 2.60/1.28 % (3162491)Termination reason: Instruction limit
% 2.60/1.28 % (3162491)Termination phase: Saturation
% 2.60/1.28 % (3162491)Time elapsed: 0.094 s
% 2.60/1.28 % (3162491)Peak memory usage: 89 MB
% 2.60/1.28 % (3162491)Instructions burned: 140 (million)
% 2.60/1.28 % (3162500)lrs+10_1_sil=8000:sp=occurrence:random_seed=1561987765:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.60/1.28 % (3162501)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3795245113:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.60/1.28 % (3162501)Refutation not found, incomplete strategy
% 2.60/1.28 % (3162501)------------------------------
% 2.60/1.28 % (3162501)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.28 % (3162501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.28 % (3162501)CaDiCaL version: 2.1.3
% 2.60/1.28 % (3162501)Termination reason: Refutation not found, incomplete strategy
% 2.60/1.28 % (3162501)Time elapsed: 0.002 s
% 2.60/1.28 % (3162501)Peak memory usage: 88 MB
% 2.60/1.28 % (3162501)Instructions burned: 1 (million)
% 2.60/1.28 % (3162489)------------------------------
% 2.60/1.28 % (3162489)------------------------------
% 2.60/1.28 % (3162490)Refutation found. Thanks to Tanya!
% 2.60/1.28 % SZS status Theorem for theBenchmark
% 2.60/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.39/1.37 % (3162490)------------------------------
% 3.39/1.37 % (3162490)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.39/1.37 % (3162490)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.39/1.37 % (3162490)CaDiCaL version: 2.1.3
% 3.39/1.37 % (3162490)Termination reason: Refutation
% 3.39/1.37 % (3162490)Time elapsed: 0.007 s
% 3.39/1.37 % (3162490)Peak memory usage: 88 MB
% 3.39/1.37 % (3162490)Instructions burned: 9 (million)
% 3.39/1.37 % (3162490)------------------------------
% 3.39/1.37 % (3162490)------------------------------
% 3.39/1.37 % (3162481)Success in time 0.411 s
% 3.39/1.37 % Vampire exiting
%------------------------------------------------------------------------------