%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM018+4 : 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 : n015.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 1.70s 0.76s
% Output : Refutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 14 unt; 4 def)
% Number of atoms : 360 ( 23 equ)
% Maximal formula atoms : 30 ( 7 avg)
% Number of connectives : 424 ( 112 ~; 139 |; 162 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 4 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 57 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0] :
( ( aRewritingSystem0(X0)
& isTerminating0(X0) )
=> ! [X1] :
( aElement0(X1)
=> ? [X2] : aNormalFormOfIn0(X2,X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermNF) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(f16,axiom,
( ! [X0,X1,X2] :
( ( aElement0(X0)
& aElement0(X1)
& aElement0(X2)
& aReductOfIn0(X1,X0,xR)
& aReductOfIn0(X2,X0,xR) )
=> ? [X3] :
( aElement0(X3)
& ( X1 = X3
| ( ( aReductOfIn0(X3,X1,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X1,xR,X3) ) )
& sdtmndtasgtdt0(X1,xR,X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X2,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3) ) )
& isLocallyConfluent0(xR)
& ! [X0,X1] :
( ( aElement0(X0)
& aElement0(X1) )
=> ( ( aReductOfIn0(X1,X0,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,X0,xR)
& sdtmndtplgtdt0(X2,xR,X1) )
| sdtmndtplgtdt0(X0,xR,X1) )
=> iLess0(X1,X0) ) )
& isTerminating0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
fof(f22,axiom,
( aElement0(xw)
& ( xu = xw
| ( ( aReductOfIn0(xw,xu,xR)
| ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xu,xR)
& sdtmndtplgtdt0(X0,xR,xw) ) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& sdtmndtasgtdt0(xu,xR,xw)
& ( xv = xw
| ( ( aReductOfIn0(xw,xv,xR)
| ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xv,xR)
& sdtmndtplgtdt0(X0,xR,xw) ) )
& sdtmndtplgtdt0(xv,xR,xw) ) )
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).
fof(f23,conjecture,
? [X0] :
( ( aElement0(X0)
& ( xw = X0
| aReductOfIn0(X0,xw,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xw,xR)
& sdtmndtplgtdt0(X1,xR,X0) )
| sdtmndtplgtdt0(xw,xR,X0)
| sdtmndtasgtdt0(xw,xR,X0) )
& ~ ? [X1] : aReductOfIn0(X1,X0,xR) )
| aNormalFormOfIn0(X0,xw,xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f24,negated_conjecture,
~ ? [X0] :
( ( aElement0(X0)
& ( xw = X0
| aReductOfIn0(X0,xw,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xw,xR)
& sdtmndtplgtdt0(X1,xR,X0) )
| sdtmndtplgtdt0(xw,xR,X0)
| sdtmndtasgtdt0(xw,xR,X0) )
& ~ ? [X1] : aReductOfIn0(X1,X0,xR) )
| aNormalFormOfIn0(X0,xw,xR) ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f29,plain,
( ! [X0,X1,X2] :
( ( aElement0(X0)
& aElement0(X1)
& aElement0(X2)
& aReductOfIn0(X1,X0,xR)
& aReductOfIn0(X2,X0,xR) )
=> ? [X3] :
( aElement0(X3)
& ( X1 = X3
| ( ( aReductOfIn0(X3,X1,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X1,xR,X3) ) )
& sdtmndtasgtdt0(X1,xR,X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X2,xR)
& sdtmndtplgtdt0(X5,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3) ) )
& isLocallyConfluent0(xR)
& ! [X6,X7] :
( ( aElement0(X6)
& aElement0(X7) )
=> ( ( aReductOfIn0(X7,X6,xR)
| ? [X8] :
( aElement0(X8)
& aReductOfIn0(X8,X6,xR)
& sdtmndtplgtdt0(X8,xR,X7) )
| sdtmndtplgtdt0(X6,xR,X7) )
=> iLess0(X7,X6) ) )
& isTerminating0(xR) ),
inference(rectify,[],[f16]) ).
fof(f32,plain,
( aElement0(xw)
& ( xu = xw
| ( ( aReductOfIn0(xw,xu,xR)
| ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xu,xR)
& sdtmndtplgtdt0(X0,xR,xw) ) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& sdtmndtasgtdt0(xu,xR,xw)
& ( xv = xw
| ( ( aReductOfIn0(xw,xv,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xv,xR)
& sdtmndtplgtdt0(X1,xR,xw) ) )
& sdtmndtplgtdt0(xv,xR,xw) ) )
& sdtmndtasgtdt0(xv,xR,xw) ),
inference(rectify,[],[f22]) ).
fof(f33,plain,
~ ? [X0] :
( ( aElement0(X0)
& ( xw = X0
| aReductOfIn0(X0,xw,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xw,xR)
& sdtmndtplgtdt0(X1,xR,X0) )
| sdtmndtplgtdt0(xw,xR,X0)
| sdtmndtasgtdt0(xw,xR,X0) )
& ~ ? [X2] : aReductOfIn0(X2,X0,xR) )
| aNormalFormOfIn0(X0,xw,xR) ),
inference(rectify,[],[f24]) ).
fof(f52,plain,
! [X0] :
( ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) )
| ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) )
| ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
( ! [X0,X1,X2] :
( ? [X3] :
( aElement0(X3)
& ( X1 = X3
| ( ( aReductOfIn0(X3,X1,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X1,xR,X3) ) )
& sdtmndtasgtdt0(X1,xR,X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X2,xR)
& sdtmndtplgtdt0(X5,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3) )
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X0,xR)
| ~ aReductOfIn0(X2,X0,xR) )
& isLocallyConfluent0(xR)
& ! [X6,X7] :
( iLess0(X7,X6)
| ( ~ aReductOfIn0(X7,X6,xR)
& ! [X8] :
( ~ aElement0(X8)
| ~ aReductOfIn0(X8,X6,xR)
| ~ sdtmndtplgtdt0(X8,xR,X7) )
& ~ sdtmndtplgtdt0(X6,xR,X7) )
| ~ aElement0(X6)
| ~ aElement0(X7) )
& isTerminating0(xR) ),
inference(ennf_transformation,[],[f29]) ).
fof(f55,plain,
( ! [X0,X1,X2] :
( ? [X3] :
( aElement0(X3)
& ( X1 = X3
| ( ( aReductOfIn0(X3,X1,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X1,xR,X3) ) )
& sdtmndtasgtdt0(X1,xR,X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X2,xR)
& sdtmndtplgtdt0(X5,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3) )
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X0,xR)
| ~ aReductOfIn0(X2,X0,xR) )
& isLocallyConfluent0(xR)
& ! [X6,X7] :
( iLess0(X7,X6)
| ( ~ aReductOfIn0(X7,X6,xR)
& ! [X8] :
( ~ aElement0(X8)
| ~ aReductOfIn0(X8,X6,xR)
| ~ sdtmndtplgtdt0(X8,xR,X7) )
& ~ sdtmndtplgtdt0(X6,xR,X7) )
| ~ aElement0(X6)
| ~ aElement0(X7) )
& isTerminating0(xR) ),
inference(flattening,[],[f54]) ).
fof(f58,plain,
! [X0] :
( ( ~ aElement0(X0)
| ( xw != X0
& ~ aReductOfIn0(X0,xw,xR)
& ! [X1] :
( ~ aElement0(X1)
| ~ aReductOfIn0(X1,xw,xR)
| ~ sdtmndtplgtdt0(X1,xR,X0) )
& ~ sdtmndtplgtdt0(xw,xR,X0)
& ~ sdtmndtasgtdt0(xw,xR,X0) )
| ? [X2] : aReductOfIn0(X2,X0,xR) )
& ~ aNormalFormOfIn0(X0,xw,xR) ),
inference(ennf_transformation,[],[f33]) ).
fof(f65,definition,
! [X3,X2] :
( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X2,xR)
& sdtmndtplgtdt0(X5,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) )
| ~ sP4(X3,X2) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f66,plain,
( ! [X0,X1,X2] :
( ? [X3] :
( aElement0(X3)
& ( X1 = X3
| ( ( aReductOfIn0(X3,X1,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X1,xR,X3) ) )
& sdtmndtasgtdt0(X1,xR,X3)
& sP4(X3,X2)
& sdtmndtasgtdt0(X2,xR,X3) )
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X0,xR)
| ~ aReductOfIn0(X2,X0,xR) )
& isLocallyConfluent0(xR)
& ! [X6,X7] :
( iLess0(X7,X6)
| ( ~ aReductOfIn0(X7,X6,xR)
& ! [X8] :
( ~ aElement0(X8)
| ~ aReductOfIn0(X8,X6,xR)
| ~ sdtmndtplgtdt0(X8,xR,X7) )
& ~ sdtmndtplgtdt0(X6,xR,X7) )
| ~ aElement0(X6)
| ~ aElement0(X7) )
& isTerminating0(xR) ),
inference(definition_folding,[],[f55,f65]) ).
fof(f92,plain,
! [X0] :
( ! [X1] :
( aNormalFormOfIn0(sK20(X0,X1),X1,X0)
| ~ aElement0(X1) )
| ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(X2,sK20(X0,X1))],[f53]) ).
fof(f96,plain,
( ! [X0,X1,X2] :
( ? [X3] :
( aElement0(X3)
& ( X1 = X3
| ( ( aReductOfIn0(X3,X1,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X1,xR,X3) ) )
& sdtmndtasgtdt0(X1,xR,X3)
& sP4(X3,X2)
& sdtmndtasgtdt0(X2,xR,X3) )
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X0,xR)
| ~ aReductOfIn0(X2,X0,xR) )
& isLocallyConfluent0(xR)
& ! [X5,X6] :
( iLess0(X6,X5)
| ( ~ aReductOfIn0(X6,X5,xR)
& ! [X7] :
( ~ aElement0(X7)
| ~ aReductOfIn0(X7,X5,xR)
| ~ sdtmndtplgtdt0(X7,xR,X6) )
& ~ sdtmndtplgtdt0(X5,xR,X6) )
| ~ aElement0(X5)
| ~ aElement0(X6) )
& isTerminating0(xR) ),
inference(rectify,[],[f66]) ).
fof(f97,plain,
( ! [X0,X1,X2] :
( ( aElement0(sK22(X1,X2))
& ( sK22(X1,X2) = X1
| ( ( aReductOfIn0(sK22(X1,X2),X1,xR)
| ( aElement0(sK23(X1,X2))
& aReductOfIn0(sK23(X1,X2),X1,xR)
& sdtmndtplgtdt0(sK23(X1,X2),xR,sK22(X1,X2)) ) )
& sdtmndtplgtdt0(X1,xR,sK22(X1,X2)) ) )
& sdtmndtasgtdt0(X1,xR,sK22(X1,X2))
& sP4(sK22(X1,X2),X2)
& sdtmndtasgtdt0(X2,xR,sK22(X1,X2)) )
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X0,xR)
| ~ aReductOfIn0(X2,X0,xR) )
& isLocallyConfluent0(xR)
& ! [X5,X6] :
( iLess0(X6,X5)
| ( ~ aReductOfIn0(X6,X5,xR)
& ! [X7] :
( ~ aElement0(X7)
| ~ aReductOfIn0(X7,X5,xR)
| ~ sdtmndtplgtdt0(X7,xR,X6) )
& ~ sdtmndtplgtdt0(X5,xR,X6) )
| ~ aElement0(X5)
| ~ aElement0(X6) )
& isTerminating0(xR) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK22,sK23]),skolemize(X3,sK22(X1,X2)),skolemize(X4,sK23(X1,X2))],[f96]) ).
fof(f109,plain,
( aElement0(xw)
& ( xu = xw
| ( ( aReductOfIn0(xw,xu,xR)
| ( aElement0(sK31)
& aReductOfIn0(sK31,xu,xR)
& sdtmndtplgtdt0(sK31,xR,xw) ) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& sdtmndtasgtdt0(xu,xR,xw)
& ( xv = xw
| ( ( aReductOfIn0(xw,xv,xR)
| ( aElement0(sK32)
& aReductOfIn0(sK32,xv,xR)
& sdtmndtplgtdt0(sK32,xR,xw) ) )
& sdtmndtplgtdt0(xv,xR,xw) ) )
& sdtmndtasgtdt0(xv,xR,xw) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f32]) ).
fof(f110,plain,
! [X0] :
( ( ~ aElement0(X0)
| ( xw != X0
& ~ aReductOfIn0(X0,xw,xR)
& ! [X1] :
( ~ aElement0(X1)
| ~ aReductOfIn0(X1,xw,xR)
| ~ sdtmndtplgtdt0(X1,xR,X0) )
& ~ sdtmndtplgtdt0(xw,xR,X0)
& ~ sdtmndtasgtdt0(xw,xR,X0) )
| aReductOfIn0(sK33(X0),X0,xR) )
& ~ aNormalFormOfIn0(X0,xw,xR) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK33]),skolemize(X2,sK33(X0))],[f58]) ).
fof(f155,plain,
! [X0,X1] :
( aNormalFormOfIn0(sK20(X0,X1),X1,X0)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f156,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f161,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f97]) ).
fof(f231,plain,
aElement0(xw),
inference(cnf_transformation,[],[f109]) ).
fof(f232,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(cnf_transformation,[],[f110]) ).
fof(f284,definition,
( spl35_2
<=> aElement0(xw) ),
introduced(definition,[new_symbols(definition,[spl35_2])],[avatar_definition]) ).
fof(f285,plain,
( ~ aElement0(xw)
| spl35_2 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f405,plain,
( $false
| spl35_2 ),
inference(resolution,[],[f231,f285]) ).
fof(f406,plain,
spl35_2,
inference(avatar_contradiction_clause,[],[f405]) ).
fof(f430,definition,
( spl35_39
<=> aRewritingSystem0(xR) ),
introduced(definition,[new_symbols(definition,[spl35_39])],[avatar_definition]) ).
fof(f431,plain,
( ~ aRewritingSystem0(xR)
| spl35_39 ),
inference(avatar_component_clause,[],[f430]) ).
fof(f436,plain,
( $false
| spl35_39 ),
inference(resolution,[],[f431,f156]) ).
fof(f437,plain,
spl35_39,
inference(avatar_contradiction_clause,[],[f436]) ).
fof(f466,plain,
( ~ aElement0(xw)
| ~ aRewritingSystem0(xR)
| ~ isTerminating0(xR) ),
inference(resolution,[],[f155,f232]) ).
fof(f474,definition,
( spl35_44
<=> isTerminating0(xR) ),
introduced(definition,[new_symbols(definition,[spl35_44])],[avatar_definition]) ).
fof(f475,plain,
( ~ isTerminating0(xR)
| spl35_44 ),
inference(avatar_component_clause,[],[f474]) ).
fof(f476,plain,
( ~ spl35_44
| ~ spl35_39
| ~ spl35_2 ),
inference(avatar_split_clause,[],[f466,f284,f430,f474]) ).
fof(f477,plain,
( $false
| spl35_44 ),
inference(resolution,[],[f475,f161]) ).
fof(f482,plain,
spl35_44,
inference(avatar_contradiction_clause,[],[f477]) ).
cnf(s24,plain,
spl35_2,
inference(sat_conversion,[],[f406]) ).
cnf(s28,plain,
spl35_39,
inference(sat_conversion,[],[f437]) ).
cnf(s32,plain,
( ~ spl35_2
| ~ spl35_39
| ~ spl35_44 ),
inference(sat_conversion,[],[f476]) ).
cnf(s33,plain,
spl35_44,
inference(sat_conversion,[],[f482]) ).
cnf(s38,plain,
( ~ spl35_2
| ~ spl35_39 ),
inference(rat,[],[s32,s33]) ).
cnf(s39,plain,
~ spl35_2,
inference(rat,[],[s38,s28]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s24,s39]) ).
fof(f499,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM018+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 % Computer : n015.cluster.edu
% 0.08/0.22 % Model : x86_64 x86_64
% 0.08/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22 % Memory : 8046.5625MB
% 0.08/0.22 % OS : Linux 6.8.0-71-generic
% 0.08/0.22 % CPULimit : 300
% 0.08/0.22 % WCLimit : 300
% 0.08/0.22 % DateTime : Mon Sep 28 21:49:47 UTC 2026
% 0.08/0.22 % CPUTime :
% 0.08/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.26 Running first-order theorem proving
% 0.08/0.26 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
% 1.70/0.76 % (3067294)Detected formulas, will run a generic FOF schedule.
% 1.70/0.76 % (3067347)dis-21_1_sil=8000:lcm=predicate:random_seed=4196612306: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)
% 1.70/0.76 % (3067347)First to succeed.
% 1.70/0.76 % (3067347)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3067294"
% 1.70/0.76 % (3067341)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=3186281096:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.70/0.76 % (3067344)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3924634821:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.70/0.76 % (3067345)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1881909429:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.70/0.76 % (3067346)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2899787876:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.70/0.76 % (3067342)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=275537844:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.70/0.76 % (3067343)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=1992577547:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.70/0.76 % (3067346)Also succeeded, but the first one will report.
% 1.70/0.76 % (3067344)Also succeeded, but the first one will report.
% 1.70/0.76 % (3067345)Also succeeded, but the first one will report.
% 1.70/0.76 % (3067347)Refutation found. Thanks to Tanya!
% 1.70/0.76 % SZS status Theorem for theBenchmark
% 1.70/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 2.23/0.88 % (3067347)------------------------------
% 2.23/0.88 % (3067347)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.23/0.88 % (3067347)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.23/0.88 % (3067347)CaDiCaL version: 2.1.3
% 2.23/0.88 % (3067347)Termination reason: Refutation
% 2.23/0.88 % (3067347)Time elapsed: 0.004 s
% 2.23/0.88 % (3067347)Peak memory usage: 89 MB
% 2.23/0.88 % (3067347)Instructions burned: 10 (million)
% 2.23/0.88 % (3067347)------------------------------
% 2.23/0.88 % (3067347)------------------------------
% 2.23/0.88 % (3067294)Success in time 0.258 s
% 2.23/0.88 % Vampire exiting
%------------------------------------------------------------------------------