%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM017+1 : TPTP v9.3.1. Released v4.0.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 09:39:24 AM UTC 2026
% Result : Theorem 0.83s 0.96s
% Output : Refutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 12 unt; 2 def)
% Number of atoms : 297 ( 0 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 458 ( 213 ~; 190 |; 48 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 94 ( 80 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0] :
( aRewritingSystem0(X0)
=> ( isLocallyConfluent0(X0)
<=> ! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& aReductOfIn0(X2,X1,X0)
& aReductOfIn0(X3,X1,X0) )
=> ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,X0,X4)
& sdtmndtasgtdt0(X3,X0,X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mWCRDef) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(f16,axiom,
( isLocallyConfluent0(xR)
& isTerminating0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
fof(f17,axiom,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).
fof(f20,axiom,
( aElement0(xu)
& aReductOfIn0(xu,xa,xR)
& sdtmndtasgtdt0(xu,xR,xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__755) ).
fof(f21,axiom,
( aElement0(xv)
& aReductOfIn0(xv,xa,xR)
& sdtmndtasgtdt0(xv,xR,xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__779) ).
fof(f22,conjecture,
? [X0] :
( aElement0(X0)
& sdtmndtasgtdt0(xu,xR,X0)
& sdtmndtasgtdt0(xv,xR,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f23,negated_conjecture,
~ ? [X0] :
( aElement0(X0)
& sdtmndtasgtdt0(xu,xR,X0)
& sdtmndtasgtdt0(xv,xR,X0) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f30,plain,
! [X0] :
( ~ aElement0(X0)
| ~ sdtmndtasgtdt0(xu,xR,X0)
| ~ sdtmndtasgtdt0(xv,xR,X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f31,plain,
! [X0] :
( ( isLocallyConfluent0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,X0,X4)
& sdtmndtasgtdt0(X3,X0,X4) )
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aReductOfIn0(X3,X1,X0) ) )
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f32,plain,
! [X0] :
( ( isLocallyConfluent0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,X0,X4)
& sdtmndtasgtdt0(X3,X0,X4) )
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aReductOfIn0(X3,X1,X0) ) )
| ~ aRewritingSystem0(X0) ),
inference(flattening,[],[f31]) ).
fof(f43,definition,
! [X0] :
( sP0(X0)
<=> ! [X1,X2,X3] :
( ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,X0,X4)
& sdtmndtasgtdt0(X3,X0,X4) )
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aReductOfIn0(X3,X1,X0) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f44,definition,
! [X0] :
( ( isLocallyConfluent0(X0)
<=> sP0(X0) )
| ~ sP1(X0) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f45,plain,
! [X0] :
( sP1(X0)
| ~ aRewritingSystem0(X0) ),
inference(definition_folding,[],[f32,f44,f43]) ).
fof(f47,plain,
! [X0] :
( ( ( isLocallyConfluent0(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ isLocallyConfluent0(X0) ) )
| ~ sP1(X0) ),
inference(nnf_transformation,[],[f44]) ).
fof(f48,plain,
! [X0] :
( ( sP0(X0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ aElement0(X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ sdtmndtasgtdt0(X3,X0,X4) )
& aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& aReductOfIn0(X2,X1,X0)
& aReductOfIn0(X3,X1,X0) ) )
& ( ! [X1,X2,X3] :
( ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,X0,X4)
& sdtmndtasgtdt0(X3,X0,X4) )
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aReductOfIn0(X2,X1,X0)
| ~ aReductOfIn0(X3,X1,X0) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f49,plain,
! [X0] :
( ( sP0(X0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ aElement0(X4)
| ~ sdtmndtasgtdt0(X2,X0,X4)
| ~ sdtmndtasgtdt0(X3,X0,X4) )
& aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& aReductOfIn0(X2,X1,X0)
& aReductOfIn0(X3,X1,X0) ) )
& ( ! [X5,X6,X7] :
( ? [X8] :
( aElement0(X8)
& sdtmndtasgtdt0(X6,X0,X8)
& sdtmndtasgtdt0(X7,X0,X8) )
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aReductOfIn0(X7,X5,X0) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f48]) ).
fof(f50,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X4] :
( ~ aElement0(X4)
| ~ sdtmndtasgtdt0(sK4(X0),X0,X4)
| ~ sdtmndtasgtdt0(sK5(X0),X0,X4) )
& aElement0(sK3(X0))
& aElement0(sK4(X0))
& aElement0(sK5(X0))
& aReductOfIn0(sK4(X0),sK3(X0),X0)
& aReductOfIn0(sK5(X0),sK3(X0),X0) ) )
& ( ! [X5,X6,X7] :
( ( aElement0(sK6(X0,X6,X7))
& sdtmndtasgtdt0(X6,X0,sK6(X0,X6,X7))
& sdtmndtasgtdt0(X7,X0,sK6(X0,X6,X7)) )
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aReductOfIn0(X7,X5,X0) )
| ~ sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X1,sK3(X0)),skolemize(X2,sK4(X0)),skolemize(X3,sK5(X0)),skolemize(X8,sK6(X0,X6,X7))],[f49]) ).
fof(f58,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f60,plain,
isLocallyConfluent0(xR),
inference(cnf_transformation,[],[f16]) ).
fof(f63,plain,
aElement0(xa),
inference(cnf_transformation,[],[f17]) ).
fof(f70,plain,
aReductOfIn0(xu,xa,xR),
inference(cnf_transformation,[],[f20]) ).
fof(f71,plain,
aElement0(xu),
inference(cnf_transformation,[],[f20]) ).
fof(f73,plain,
aReductOfIn0(xv,xa,xR),
inference(cnf_transformation,[],[f21]) ).
fof(f74,plain,
aElement0(xv),
inference(cnf_transformation,[],[f21]) ).
fof(f75,plain,
! [X0] :
( ~ sdtmndtasgtdt0(xv,xR,X0)
| ~ sdtmndtasgtdt0(xu,xR,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f76,plain,
! [X0] :
( sP0(X0)
| ~ isLocallyConfluent0(X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f78,plain,
! [X0,X6,X7,X5] :
( sdtmndtasgtdt0(X7,X0,sK6(X0,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aReductOfIn0(X7,X5,X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f79,plain,
! [X0,X6,X7,X5] :
( sdtmndtasgtdt0(X6,X0,sK6(X0,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aReductOfIn0(X7,X5,X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f80,plain,
! [X0,X6,X7,X5] :
( aElement0(sK6(X0,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aReductOfIn0(X6,X5,X0)
| ~ aReductOfIn0(X7,X5,X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f87,plain,
! [X0] :
( sP1(X0)
| ~ aRewritingSystem0(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f323,plain,
! [X0,X1] :
( ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(xv)
| ~ aReductOfIn0(X1,X0,xR)
| ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ sdtmndtasgtdt0(xu,xR,sK6(xR,X1,xv))
| ~ aElement0(sK6(xR,X1,xv)) ),
inference(resolution,[],[f78,f75]) ).
fof(f325,plain,
! [X0,X1] :
( ~ sdtmndtasgtdt0(xu,xR,sK6(xR,X1,xv))
| ~ aElement0(X1)
| ~ aReductOfIn0(X1,X0,xR)
| ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aElement0(sK6(xR,X1,xv)) ),
inference(forward_subsumption_resolution,[],[f323,f74]) ).
fof(f379,plain,
! [X0,X1] :
( ~ aElement0(xu)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aElement0(sK6(xR,xu,xv))
| ~ aElement0(X1)
| ~ aElement0(xu)
| ~ aElement0(xv)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ sP0(xR) ),
inference(resolution,[],[f325,f79]) ).
fof(f382,plain,
! [X0,X1] :
( ~ aElement0(xu)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aElement0(sK6(xR,xu,xv))
| ~ aElement0(X1)
| ~ aElement0(xv)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR) ),
inference(duplicate_literal_removal,[],[f379]) ).
fof(f384,plain,
! [X0,X1] :
( ~ aReductOfIn0(xu,X0,xR)
| ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aElement0(sK6(xR,xu,xv))
| ~ aElement0(X1)
| ~ aElement0(xv)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR) ),
inference(forward_subsumption_resolution,[],[f382,f71]) ).
fof(f386,plain,
! [X0,X1] :
( ~ aElement0(sK6(xR,xu,xv))
| ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR) ),
inference(forward_subsumption_resolution,[],[f384,f74]) ).
fof(f675,plain,
! [X2,X0,X1] :
( ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ aElement0(X2)
| ~ aElement0(xu)
| ~ aElement0(xv)
| ~ aReductOfIn0(xu,X2,xR)
| ~ aReductOfIn0(xv,X2,xR)
| ~ sP0(xR) ),
inference(resolution,[],[f386,f80]) ).
fof(f678,plain,
! [X2,X0,X1] :
( ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ aElement0(X2)
| ~ aElement0(xu)
| ~ aElement0(xv)
| ~ aReductOfIn0(xu,X2,xR)
| ~ aReductOfIn0(xv,X2,xR) ),
inference(duplicate_literal_removal,[],[f675]) ).
fof(f679,plain,
! [X2,X0,X1] :
( ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ aElement0(X2)
| ~ aElement0(xv)
| ~ aReductOfIn0(xu,X2,xR)
| ~ aReductOfIn0(xv,X2,xR) ),
inference(forward_subsumption_resolution,[],[f678,f71]) ).
fof(f680,plain,
! [X2,X0,X1] :
( ~ aReductOfIn0(xv,X2,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ aElement0(X2)
| ~ aReductOfIn0(xu,X2,xR)
| ~ aReductOfIn0(xv,X0,xR) ),
inference(forward_subsumption_resolution,[],[f679,f74]) ).
fof(f1583,plain,
! [X0,X1] :
( ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR) ),
inference(factoring,[],[f680]) ).
fof(f1584,plain,
! [X0,X1] :
( ~ aReductOfIn0(xv,X1,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X0,xR) ),
inference(duplicate_literal_removal,[],[f1583]) ).
fof(f1589,plain,
! [X0] :
( ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR) ),
inference(factoring,[],[f1584]) ).
fof(f1590,plain,
! [X0] :
( ~ aReductOfIn0(xv,X0,xR)
| ~ sP0(xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(xu,X0,xR) ),
inference(duplicate_literal_removal,[],[f1589]) ).
fof(f1593,plain,
( ~ sP0(xR)
| ~ aElement0(xa)
| ~ aReductOfIn0(xu,xa,xR) ),
inference(resolution,[],[f1590,f73]) ).
fof(f1594,plain,
( ~ sP0(xR)
| ~ aReductOfIn0(xu,xa,xR) ),
inference(forward_subsumption_resolution,[],[f1593,f63]) ).
fof(f1595,plain,
~ sP0(xR),
inference(forward_subsumption_resolution,[],[f1594,f70]) ).
fof(f1596,plain,
( ~ isLocallyConfluent0(xR)
| ~ sP1(xR) ),
inference(resolution,[],[f1595,f76]) ).
fof(f1597,plain,
~ sP1(xR),
inference(forward_subsumption_resolution,[],[f1596,f60]) ).
fof(f1627,plain,
~ aRewritingSystem0(xR),
inference(resolution,[],[f1597,f87]) ).
fof(f1628,plain,
$false,
inference(forward_subsumption_resolution,[],[f1627,f58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM017+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n017.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 21:41:07 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 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
% 0.83/0.96 % (4066271)Detected formulas, will run a generic FOF schedule.
% 0.83/0.96 % (4066280)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3497329268:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.83/0.96 % (4066280)First to succeed.
% 0.83/0.96 % (4066280)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4066271"
% 0.83/0.96 % (4066278)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=548527867:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.83/0.96 % (4066279)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3894492045:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.83/0.96 % (4066282)dis-21_1_sil=8000:lcm=predicate:random_seed=640594751: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)
% 0.83/0.96 % (4066276)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=3387812374:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.83/0.96 % (4066277)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=3800242466:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.83/0.96 % (4066279)Also succeeded, but the first one will report.
% 0.83/0.96 % (4066281)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2202031319:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.83/0.96 % (4066282)Instruction limit reached!
% 0.83/0.96 % (4066282)------------------------------
% 0.83/0.96 % (4066282)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.83/0.96 % (4066282)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.96 % (4066282)CaDiCaL version: 2.1.3
% 0.83/0.96 % (4066282)Termination reason: Instruction limit
% 0.83/0.96 % (4066282)Termination phase: Saturation
% 0.83/0.96 % (4066282)Time elapsed: 0.074 s
% 0.83/0.96 % (4066282)Peak memory usage: 89 MB
% 0.83/0.96 % (4066282)Instructions burned: 130 (million)
% 0.83/0.96 % (4066281)Instruction limit reached!
% 0.83/0.96 % (4066281)------------------------------
% 0.83/0.96 % (4066281)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.83/0.96 % (4066281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.96 % (4066281)CaDiCaL version: 2.1.3
% 0.83/0.96 % (4066281)Termination reason: Instruction limit
% 0.83/0.96 % (4066281)Termination phase: Saturation
% 0.83/0.96 % (4066281)Time elapsed: 0.093 s
% 0.83/0.96 % (4066281)Peak memory usage: 90 MB
% 0.83/0.96 % (4066281)Instructions burned: 140 (million)
% 0.83/0.96 % (4066280)Refutation found. Thanks to Tanya!
% 0.83/0.96 % SZS status Theorem for theBenchmark
% 0.83/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 2.78/1.15 % (4066280)------------------------------
% 2.78/1.15 % (4066280)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.78/1.15 % (4066280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.78/1.15 % (4066280)CaDiCaL version: 2.1.3
% 2.78/1.15 % (4066280)Termination reason: Refutation
% 2.78/1.15 % (4066280)Time elapsed: 0.022 s
% 2.78/1.15 % (4066280)Peak memory usage: 88 MB
% 2.78/1.15 % (4066280)Instructions burned: 70 (million)
% 2.78/1.15 % (4066280)------------------------------
% 2.78/1.15 % (4066280)------------------------------
% 2.78/1.15 % (4066271)Success in time 0.3 s
% 2.78/1.15 % Vampire exiting
%------------------------------------------------------------------------------