%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM016+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 : n007.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:23 AM UTC 2026
% Result : Theorem 2.96s 1.13s
% Output : Refutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of formulae : 54 ( 9 unt; 0 def)
% Number of atoms : 255 ( 8 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 362 ( 161 ~; 156 |; 37 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 83 ( 75 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1,X2] :
( ( aElement0(X0)
& aRewritingSystem0(X1)
& aElement0(X2) )
=> ( sdtmndtplgtdt0(X0,X1,X2)
<=> ( aReductOfIn0(X2,X0,X1)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X0,X1)
& sdtmndtplgtdt0(X3,X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( aElement0(X0)
& aRewritingSystem0(X1)
& aElement0(X2) )
=> ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( X0 = X2
| sdtmndtplgtdt0(X0,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(f17,axiom,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).
fof(f19,axiom,
( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731_02) ).
fof(f20,conjecture,
? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xa,xR)
& sdtmndtasgtdt0(X0,xR,xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f21,negated_conjecture,
~ ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xa,xR)
& sdtmndtasgtdt0(X0,xR,xb) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( sdtmndtplgtdt0(X0,X1,X2)
<=> ( aReductOfIn0(X2,X0,X1)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X0,X1)
& sdtmndtplgtdt0(X3,X1,X2) ) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( sdtmndtplgtdt0(X0,X1,X2)
<=> ( aReductOfIn0(X2,X0,X1)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X0,X1)
& sdtmndtplgtdt0(X3,X1,X2) ) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(flattening,[],[f28]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( X0 = X2
| sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( X0 = X2
| sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(flattening,[],[f32]) ).
fof(f48,plain,
! [X0] :
( ~ aElement0(X0)
| ~ aReductOfIn0(X0,xa,xR)
| ~ sdtmndtasgtdt0(X0,xR,xb) ),
inference(ennf_transformation,[],[f21]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ~ aReductOfIn0(X2,X0,X1)
& ! [X3] :
( ~ aElement0(X3)
| ~ aReductOfIn0(X3,X0,X1)
| ~ sdtmndtplgtdt0(X3,X1,X2) ) ) )
& ( aReductOfIn0(X2,X0,X1)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X0,X1)
& sdtmndtplgtdt0(X3,X1,X2) )
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(nnf_transformation,[],[f29]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ~ aReductOfIn0(X2,X0,X1)
& ! [X3] :
( ~ aElement0(X3)
| ~ aReductOfIn0(X3,X0,X1)
| ~ sdtmndtplgtdt0(X3,X1,X2) ) ) )
& ( aReductOfIn0(X2,X0,X1)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X0,X1)
& sdtmndtplgtdt0(X3,X1,X2) )
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ~ aReductOfIn0(X2,X0,X1)
& ! [X3] :
( ~ aElement0(X3)
| ~ aReductOfIn0(X3,X0,X1)
| ~ sdtmndtplgtdt0(X3,X1,X2) ) ) )
& ( aReductOfIn0(X2,X0,X1)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X0,X1)
& sdtmndtplgtdt0(X4,X1,X2) )
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(rectify,[],[f56]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ~ aReductOfIn0(X2,X0,X1)
& ! [X3] :
( ~ aElement0(X3)
| ~ aReductOfIn0(X3,X0,X1)
| ~ sdtmndtplgtdt0(X3,X1,X2) ) ) )
& ( aReductOfIn0(X2,X0,X1)
| ( aElement0(sK4(X0,X1,X2))
& aReductOfIn0(sK4(X0,X1,X2),X0,X1)
& sdtmndtplgtdt0(sK4(X0,X1,X2),X1,X2) )
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X4,sK4(X0,X1,X2))],[f57]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ( ( sdtmndtasgtdt0(X0,X1,X2)
| ( X0 != X2
& ~ sdtmndtplgtdt0(X0,X1,X2) ) )
& ( X0 = X2
| sdtmndtplgtdt0(X0,X1,X2)
| ~ sdtmndtasgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(nnf_transformation,[],[f33]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( ( sdtmndtasgtdt0(X0,X1,X2)
| ( X0 != X2
& ~ sdtmndtplgtdt0(X0,X1,X2) ) )
& ( X0 = X2
| sdtmndtplgtdt0(X0,X1,X2)
| ~ sdtmndtasgtdt0(X0,X1,X2) ) )
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(flattening,[],[f59]) ).
fof(f79,plain,
! [X2,X0,X1] :
( sdtmndtplgtdt0(sK4(X0,X1,X2),X1,X2)
| aReductOfIn0(X2,X0,X1)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ aRewritingSystem0(X1)
| aReductOfIn0(sK4(X0,X1,X2),X0,X1)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X0)
| aReductOfIn0(X2,X0,X1)
| ~ aElement0(X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f81,plain,
! [X2,X0,X1] :
( aElement0(sK4(X0,X1,X2))
| aReductOfIn0(X2,X0,X1)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ~ aRewritingSystem0(X1)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X0)
| sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X2) ),
inference(cnf_transformation,[],[f60]) ).
fof(f87,plain,
! [X2,X0,X1] :
( sdtmndtasgtdt0(X0,X1,X2)
| X0 != X2
| ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(cnf_transformation,[],[f60]) ).
fof(f123,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f127,plain,
aElement0(xb),
inference(cnf_transformation,[],[f17]) ).
fof(f128,plain,
aElement0(xa),
inference(cnf_transformation,[],[f17]) ).
fof(f133,plain,
sdtmndtplgtdt0(xa,xR,xb),
inference(cnf_transformation,[],[f19]) ).
fof(f134,plain,
! [X0] :
( ~ sdtmndtasgtdt0(X0,xR,xb)
| ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f135,plain,
! [X2,X1] :
( sdtmndtasgtdt0(X2,X1,X2)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(equality_resolution,[],[f87]) ).
fof(f136,plain,
! [X2,X1] :
( ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| sdtmndtasgtdt0(X2,X1,X2) ),
inference(duplicate_literal_removal,[],[f135]) ).
fof(f137,plain,
! [X0] :
( sdtmndtasgtdt0(X0,xR,X0)
| ~ aElement0(X0) ),
inference(resolution,[],[f136,f123]) ).
fof(f138,plain,
( ~ aElement0(xb)
| ~ aReductOfIn0(xb,xa,xR)
| ~ aElement0(xb) ),
inference(resolution,[],[f137,f134]) ).
fof(f139,plain,
( ~ aElement0(xb)
| ~ aReductOfIn0(xb,xa,xR) ),
inference(duplicate_literal_removal,[],[f138]) ).
fof(f140,plain,
~ aReductOfIn0(xb,xa,xR),
inference(forward_subsumption_resolution,[],[f139,f127]) ).
fof(f144,plain,
! [X0,X1] :
( sdtmndtasgtdt0(X0,xR,X1)
| ~ aElement0(X0)
| ~ sdtmndtplgtdt0(X0,xR,X1)
| ~ aElement0(X1) ),
inference(resolution,[],[f86,f123]) ).
fof(f159,plain,
! [X0] :
( ~ aElement0(X0)
| ~ sdtmndtplgtdt0(X0,xR,xb)
| ~ aElement0(xb)
| ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0) ),
inference(resolution,[],[f144,f134]) ).
fof(f160,plain,
! [X0] :
( ~ aElement0(X0)
| ~ sdtmndtplgtdt0(X0,xR,xb)
| ~ aElement0(xb)
| ~ aReductOfIn0(X0,xa,xR) ),
inference(duplicate_literal_removal,[],[f159]) ).
fof(f161,plain,
! [X0] :
( ~ aReductOfIn0(X0,xa,xR)
| ~ sdtmndtplgtdt0(X0,xR,xb)
| ~ aElement0(X0) ),
inference(forward_subsumption_resolution,[],[f160,f127]) ).
fof(f162,plain,
! [X0,X1] :
( aReductOfIn0(sK4(X0,xR,X1),X0,xR)
| ~ sdtmndtplgtdt0(X0,xR,X1)
| ~ aElement0(X0)
| aReductOfIn0(X1,X0,xR)
| ~ aElement0(X1) ),
inference(resolution,[],[f80,f123]) ).
fof(f184,plain,
! [X0] :
( ~ sdtmndtplgtdt0(xa,xR,X0)
| ~ aElement0(xa)
| aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ sdtmndtplgtdt0(sK4(xa,xR,X0),xR,xb)
| ~ aElement0(sK4(xa,xR,X0)) ),
inference(resolution,[],[f162,f161]) ).
fof(f185,plain,
! [X0] :
( ~ aElement0(sK4(xa,xR,X0))
| aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ sdtmndtplgtdt0(sK4(xa,xR,X0),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,X0) ),
inference(forward_subsumption_resolution,[],[f184,f128]) ).
fof(f191,plain,
! [X0] :
( aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ sdtmndtplgtdt0(sK4(xa,xR,X0),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,X0)
| aReductOfIn0(X0,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,X0)
| ~ aElement0(xa)
| ~ aRewritingSystem0(xR)
| ~ aElement0(X0) ),
inference(resolution,[],[f185,f81]) ).
fof(f194,plain,
! [X0] :
( aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ sdtmndtplgtdt0(sK4(xa,xR,X0),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,X0)
| ~ aElement0(xa)
| ~ aRewritingSystem0(xR) ),
inference(duplicate_literal_removal,[],[f191]) ).
fof(f195,plain,
! [X0] :
( aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ sdtmndtplgtdt0(sK4(xa,xR,X0),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,X0)
| ~ aRewritingSystem0(xR) ),
inference(forward_subsumption_resolution,[],[f194,f128]) ).
fof(f196,plain,
! [X0] :
( aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0)
| ~ sdtmndtplgtdt0(sK4(xa,xR,X0),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,X0) ),
inference(forward_subsumption_resolution,[],[f195,f123]) ).
fof(f388,plain,
( ~ aElement0(xb)
| ~ sdtmndtplgtdt0(sK4(xa,xR,xb),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(resolution,[],[f196,f140]) ).
fof(f393,plain,
( ~ sdtmndtplgtdt0(sK4(xa,xR,xb),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(forward_subsumption_resolution,[],[f388,f127]) ).
fof(f394,plain,
~ sdtmndtplgtdt0(sK4(xa,xR,xb),xR,xb),
inference(forward_subsumption_resolution,[],[f393,f133]) ).
fof(f395,plain,
( aReductOfIn0(xb,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ aElement0(xa)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xb) ),
inference(resolution,[],[f394,f79]) ).
fof(f404,plain,
( ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ aElement0(xa)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xb) ),
inference(forward_subsumption_resolution,[],[f395,f140]) ).
fof(f417,plain,
( ~ aElement0(xa)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xb) ),
inference(forward_subsumption_resolution,[],[f404,f133]) ).
fof(f435,plain,
( ~ aRewritingSystem0(xR)
| ~ aElement0(xb) ),
inference(forward_subsumption_resolution,[],[f417,f128]) ).
fof(f436,plain,
~ aElement0(xb),
inference(forward_subsumption_resolution,[],[f435,f123]) ).
fof(f437,plain,
$false,
inference(forward_subsumption_resolution,[],[f436,f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM016+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n007.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 21:44:10 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 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
% 2.96/1.13 % (2881890)Detected formulas, will run a generic FOF schedule.
% 2.96/1.13 % (2881897)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=1295470708:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.96/1.13 % (2881896)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=2700034397:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.96/1.13 % (2881899)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2048631615:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.96/1.13 % (2881898)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2749164614:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.96/1.13 % (2881895)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=1154393093:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.96/1.13 % (2881900)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1986301453:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.96/1.13 % (2881901)dis-21_1_sil=8000:lcm=predicate:random_seed=2147933710: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.96/1.13 % (2881900)First to succeed.
% 2.96/1.13 % (2881900)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2881890"
% 2.96/1.13 % (2881899)Instruction limit reached!
% 2.96/1.13 % (2881899)------------------------------
% 2.96/1.13 % (2881899)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/1.13 % (2881899)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/1.13 % (2881899)CaDiCaL version: 2.1.3
% 2.96/1.13 % (2881899)Termination reason: Instruction limit
% 2.96/1.13 % (2881899)Termination phase: Saturation
% 2.96/1.13 % (2881899)Time elapsed: 0.045 s
% 2.96/1.13 % (2881899)Peak memory usage: 87 MB
% 2.96/1.13 % (2881899)Instructions burned: 121 (million)
% 2.96/1.13 % (2881898)Instruction limit reached!
% 2.96/1.13 % (2881898)------------------------------
% 2.96/1.13 % (2881898)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/1.13 % (2881898)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/1.13 % (2881898)CaDiCaL version: 2.1.3
% 2.96/1.13 % (2881898)Termination reason: Instruction limit
% 2.96/1.13 % (2881898)Termination phase: Saturation
% 2.96/1.13 % (2881898)Time elapsed: 0.051 s
% 2.96/1.13 % (2881898)Peak memory usage: 88 MB
% 2.96/1.13 % (2881898)Instructions burned: 109 (million)
% 2.96/1.13 % (2881901)Instruction limit reached!
% 2.96/1.13 % (2881901)------------------------------
% 2.96/1.13 % (2881901)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/1.13 % (2881901)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/1.13 % (2881901)CaDiCaL version: 2.1.3
% 2.96/1.13 % (2881901)Termination reason: Instruction limit
% 2.96/1.13 % (2881901)Termination phase: Saturation
% 2.96/1.13 % (2881901)Time elapsed: 0.078 s
% 2.96/1.13 % (2881901)Peak memory usage: 90 MB
% 2.96/1.13 % (2881901)Instructions burned: 129 (million)
% 2.96/1.13 % (2881910)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1467253597:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.96/1.13 % (2881909)lrs+10_1_sil=8000:sp=occurrence:random_seed=1401699321:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.96/1.13 % (2881910)Also succeeded, but the first one will report.
% 2.96/1.13 % (2881909)Also succeeded, but the first one will report.
% 2.96/1.13 % (2881911)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3552592204:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.96/1.13 % (2881911)Also succeeded, but the first one will report.
% 2.96/1.13 % (2881900)Refutation found. Thanks to Tanya!
% 2.96/1.13 % SZS status Theorem for theBenchmark
% 2.96/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.78/1.23 % (2881900)------------------------------
% 3.78/1.23 % (2881900)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.78/1.23 % (2881900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.78/1.23 % (2881900)CaDiCaL version: 2.1.3
% 3.78/1.23 % (2881900)Termination reason: Refutation
% 3.78/1.23 % (2881900)Time elapsed: 0.010 s
% 3.78/1.23 % (2881900)Peak memory usage: 89 MB
% 3.78/1.23 % (2881900)Instructions burned: 13 (million)
% 3.78/1.23 % (2881900)------------------------------
% 3.78/1.23 % (2881900)------------------------------
% 3.78/1.23 % (2881890)Success in time 0.458 s
% 3.78/1.23 % Vampire exiting
%------------------------------------------------------------------------------