%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM476+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:24:28 PM UTC 2026
% Result : Theorem 0.15s 0.48s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 69 ( 15 unt; 4 def)
% Number of atoms : 273 ( 125 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 261 ( 57 ~; 52 |; 142 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 36 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtpldt0(X0,sz00) = X0
& X0 = sdtpldt0(sz00,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
fof(f12,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtasdt0(X0,sz00) = sz00
& sz00 = sdtasdt0(sz00,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(f34,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324) ).
fof(f35,axiom,
( ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0) )
& doDivides0(xl,xm)
& ? [X0] :
( aNaturalNumber0(X0)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X0) )
& doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324_04) ).
fof(f36,conjecture,
( ( xl != sz00
=> ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0)
& X0 = sdtsldt0(xm,xl)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& X1 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
& sdtlseqdt0(X0,X1)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1
& X2 = sdtmndt0(X1,X0)
& sdtpldt0(sdtasdt0(xl,X0),sdtasdt0(xl,X2)) = sdtpldt0(sdtasdt0(xl,X0),xn)
& xn = sdtasdt0(xl,X2) ) ) ) )
=> ( ? [X0] :
( aNaturalNumber0(X0)
& xn = sdtasdt0(xl,X0) )
| doDivides0(xl,xn) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f37,negated_conjecture,
~ ( ( xl != sz00
=> ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0)
& X0 = sdtsldt0(xm,xl)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& X1 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
& sdtlseqdt0(X0,X1)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1
& X2 = sdtmndt0(X1,X0)
& sdtpldt0(sdtasdt0(xl,X0),sdtasdt0(xl,X2)) = sdtpldt0(sdtasdt0(xl,X0),xn)
& xn = sdtasdt0(xl,X2) ) ) ) )
=> ( ? [X0] :
( aNaturalNumber0(X0)
& xn = sdtasdt0(xl,X0) )
| doDivides0(xl,xn) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f40,plain,
( ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
& doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(rectify,[],[f35]) ).
fof(f41,plain,
~ ( ( xl != sz00
=> ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0)
& X0 = sdtsldt0(xm,xl)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& X1 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
& sdtlseqdt0(X0,X1)
& ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X0,X3) = X1
& sdtmndt0(X1,X0) = X3
& sdtpldt0(sdtasdt0(xl,X0),xn) = sdtpldt0(sdtasdt0(xl,X0),sdtasdt0(xl,X3))
& xn = sdtasdt0(xl,X3) ) ) ) )
=> ( ? [X4] :
( aNaturalNumber0(X4)
& xn = sdtasdt0(xl,X4) )
| doDivides0(xl,xn) ) ),
inference(rectify,[],[f37]) ).
fof(f51,plain,
! [X0] :
( ( sdtpldt0(X0,sz00) = X0
& X0 = sdtpldt0(sz00,X0) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f57,plain,
! [X0] :
( ( sdtasdt0(X0,sz00) = sz00
& sz00 = sdtasdt0(sz00,X0) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f95,plain,
( ! [X4] :
( ~ aNaturalNumber0(X4)
| xn != sdtasdt0(xl,X4) )
& ~ doDivides0(xl,xn)
& ( ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0)
& X0 = sdtsldt0(xm,xl)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& X1 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
& sdtlseqdt0(X0,X1)
& ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X0,X3) = X1
& sdtmndt0(X1,X0) = X3
& sdtpldt0(sdtasdt0(xl,X0),xn) = sdtpldt0(sdtasdt0(xl,X0),sdtasdt0(xl,X3))
& xn = sdtasdt0(xl,X3) ) ) )
| sz00 = xl ) ),
inference(ennf_transformation,[],[f41]) ).
fof(f96,plain,
( ! [X4] :
( ~ aNaturalNumber0(X4)
| xn != sdtasdt0(xl,X4) )
& ~ doDivides0(xl,xn)
& ( ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0)
& X0 = sdtsldt0(xm,xl)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& X1 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
& sdtlseqdt0(X0,X1)
& ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X0,X3) = X1
& sdtmndt0(X1,X0) = X3
& sdtpldt0(sdtasdt0(xl,X0),xn) = sdtpldt0(sdtasdt0(xl,X0),sdtasdt0(xl,X3))
& xn = sdtasdt0(xl,X3) ) ) )
| sz00 = xl ) ),
inference(flattening,[],[f95]) ).
fof(f97,definition,
! [X1,X0] :
( ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X0,X3) = X1
& sdtmndt0(X1,X0) = X3
& sdtpldt0(sdtasdt0(xl,X0),xn) = sdtpldt0(sdtasdt0(xl,X0),sdtasdt0(xl,X3))
& xn = sdtasdt0(xl,X3) )
| ~ sP0(X1,X0) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f98,definition,
! [X0] :
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& X1 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
& sdtlseqdt0(X0,X1)
& sP0(X1,X0) )
| ~ sP1(X0) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f99,plain,
( ! [X4] :
( ~ aNaturalNumber0(X4)
| xn != sdtasdt0(xl,X4) )
& ~ doDivides0(xl,xn)
& ( ? [X0] :
( aNaturalNumber0(X0)
& xm = sdtasdt0(xl,X0)
& X0 = sdtsldt0(xm,xl)
& sP1(X0) )
| sz00 = xl ) ),
inference(definition_folding,[],[f96,f98,f97]) ).
fof(f110,plain,
( aNaturalNumber0(sK4)
& xm = sdtasdt0(xl,sK4)
& doDivides0(xl,xm)
& aNaturalNumber0(sK5)
& sdtpldt0(xm,xn) = sdtasdt0(xl,sK5)
& doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f40]) ).
fof(f111,plain,
! [X0] :
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& X1 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
& sdtlseqdt0(X0,X1)
& sP0(X1,X0) )
| ~ sP1(X0) ),
inference(nnf_transformation,[],[f98]) ).
fof(f112,plain,
! [X0] :
( ( aNaturalNumber0(sK6(X0))
& sdtpldt0(xm,xn) = sdtasdt0(xl,sK6(X0))
& sdtsldt0(sdtpldt0(xm,xn),xl) = sK6(X0)
& aNaturalNumber0(sK7(X0))
& sK6(X0) = sdtpldt0(X0,sK7(X0))
& sdtlseqdt0(X0,sK6(X0))
& sP0(sK6(X0),X0) )
| ~ sP1(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0))],[f111]) ).
fof(f113,plain,
! [X1,X0] :
( ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X0,X3) = X1
& sdtmndt0(X1,X0) = X3
& sdtpldt0(sdtasdt0(xl,X0),xn) = sdtpldt0(sdtasdt0(xl,X0),sdtasdt0(xl,X3))
& xn = sdtasdt0(xl,X3) )
| ~ sP0(X1,X0) ),
inference(nnf_transformation,[],[f97]) ).
fof(f114,plain,
! [X0,X1] :
( ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X1,X2) = X0
& sdtmndt0(X0,X1) = X2
& sdtpldt0(sdtasdt0(xl,X1),xn) = sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X2))
& xn = sdtasdt0(xl,X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f113]) ).
fof(f115,plain,
! [X0,X1] :
( ( aNaturalNumber0(sK8(X0,X1))
& sdtpldt0(X1,sK8(X0,X1)) = X0
& sdtmndt0(X0,X1) = sK8(X0,X1)
& sdtpldt0(sdtasdt0(xl,X1),xn) = sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,sK8(X0,X1)))
& xn = sdtasdt0(xl,sK8(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f114]) ).
fof(f116,plain,
( ! [X0] :
( ~ aNaturalNumber0(X0)
| xn != sdtasdt0(xl,X0) )
& ~ doDivides0(xl,xn)
& ( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1)
& sdtsldt0(xm,xl) = X1
& sP1(X1) )
| sz00 = xl ) ),
inference(rectify,[],[f99]) ).
fof(f117,plain,
( ! [X0] :
( ~ aNaturalNumber0(X0)
| xn != sdtasdt0(xl,X0) )
& ~ doDivides0(xl,xn)
& ( ( aNaturalNumber0(sK9)
& xm = sdtasdt0(xl,sK9)
& sdtsldt0(xm,xl) = sK9
& sP1(sK9) )
| sz00 = xl ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X1,sK9)],[f116]) ).
fof(f125,plain,
! [X0] :
( sdtpldt0(sz00,X0) = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f131,plain,
! [X0] :
( sz00 = sdtasdt0(sz00,X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f172,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f34]) ).
fof(f175,plain,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(cnf_transformation,[],[f110]) ).
fof(f179,plain,
xm = sdtasdt0(xl,sK4),
inference(cnf_transformation,[],[f110]) ).
fof(f180,plain,
aNaturalNumber0(sK4),
inference(cnf_transformation,[],[f110]) ).
fof(f181,plain,
! [X0] :
( sP0(sK6(X0),X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f188,plain,
! [X0,X1] :
( xn = sdtasdt0(xl,sK8(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f192,plain,
! [X0,X1] :
( aNaturalNumber0(sK8(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f193,plain,
( sP1(sK9)
| sz00 = xl ),
inference(cnf_transformation,[],[f117]) ).
fof(f197,plain,
~ doDivides0(xl,xn),
inference(cnf_transformation,[],[f117]) ).
fof(f198,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| xn != sdtasdt0(xl,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f216,plain,
! [X0] :
( aNaturalNumber0(X0)
| sdtpldt0(sz00,X0) = X0 ),
inference(consistent_polarity_flipping,[],[f125]) ).
fof(f222,plain,
! [X0] :
( aNaturalNumber0(X0)
| sz00 = sdtasdt0(sz00,X0) ),
inference(consistent_polarity_flipping,[],[f131]) ).
fof(f264,plain,
~ aNaturalNumber0(xn),
inference(consistent_polarity_flipping,[],[f172]) ).
fof(f265,plain,
~ aNaturalNumber0(sK4),
inference(consistent_polarity_flipping,[],[f180]) ).
fof(f273,plain,
! [X0] :
( sP1(X0)
| ~ sP0(sK6(X0),X0) ),
inference(consistent_polarity_flipping,[],[f181]) ).
fof(f274,plain,
! [X0,X1] :
( sP0(X0,X1)
| ~ aNaturalNumber0(sK8(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f192]) ).
fof(f278,plain,
! [X0,X1] :
( sP0(X0,X1)
| xn = sdtasdt0(xl,sK8(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f188]) ).
fof(f279,plain,
! [X0] :
( xn != sdtasdt0(xl,X0)
| aNaturalNumber0(X0) ),
inference(consistent_polarity_flipping,[],[f198]) ).
fof(f281,plain,
( ~ sP1(sK9)
| sz00 = xl ),
inference(consistent_polarity_flipping,[],[f193]) ).
fof(f284,definition,
( spl10_1
<=> sz00 = xl ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f286,plain,
( sz00 = xl
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f288,definition,
( spl10_2
<=> sP1(sK9) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f290,plain,
( ~ sP1(sK9)
| spl10_2 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f291,plain,
( spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f281,f288,f284]) ).
fof(f327,plain,
( ~ sP0(sK6(sK9),sK9)
| spl10_2 ),
inference(resolution,[],[f273,f290]) ).
fof(f352,plain,
xn = sdtpldt0(sz00,xn),
inference(resolution,[],[f216,f264]) ).
fof(f403,plain,
sz00 = sdtasdt0(sz00,sK4),
inference(resolution,[],[f222,f265]) ).
fof(f418,plain,
( ~ aNaturalNumber0(sK8(sK6(sK9),sK9))
| spl10_2 ),
inference(resolution,[],[f274,f327]) ).
fof(f573,plain,
( xn = sdtasdt0(xl,sK8(sK6(sK9),sK9))
| spl10_2 ),
inference(resolution,[],[f278,f327]) ).
fof(f575,plain,
( xn != xn
| aNaturalNumber0(sK8(sK6(sK9),sK9))
| spl10_2 ),
inference(superposition,[],[f279,f573]) ).
fof(f577,plain,
( aNaturalNumber0(sK8(sK6(sK9),sK9))
| spl10_2 ),
inference(trivial_inequality_removal,[],[f575]) ).
fof(f578,plain,
( $false
| spl10_2 ),
inference(resolution,[],[f577,f418]) ).
fof(f580,plain,
spl10_2,
inference(avatar_contradiction_clause,[],[f578]) ).
fof(f584,plain,
( xm = sdtasdt0(sz00,sK4)
| ~ spl10_1 ),
inference(superposition,[],[f179,f286]) ).
fof(f599,plain,
( sz00 = xm
| ~ spl10_1 ),
inference(superposition,[],[f403,f584]) ).
fof(f601,plain,
( doDivides0(xl,sdtpldt0(sz00,xn))
| ~ spl10_1 ),
inference(superposition,[],[f175,f599]) ).
fof(f622,plain,
( doDivides0(xl,xn)
| ~ spl10_1 ),
inference(superposition,[],[f601,f352]) ).
fof(f623,plain,
( $false
| ~ spl10_1 ),
inference(resolution,[],[f622,f197]) ).
fof(f625,plain,
~ spl10_1,
inference(avatar_contradiction_clause,[],[f623]) ).
cnf(s1,plain,
( spl10_1
| ~ spl10_2 ),
inference(sat_conversion,[],[f291]) ).
cnf(s10,plain,
spl10_2,
inference(sat_conversion,[],[f580]) ).
cnf(s11,plain,
~ spl10_1,
inference(sat_conversion,[],[f625]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s1,s10,s11]) ).
fof(f626,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM476+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n011.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 : Sun Sep 27 20:05:46 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.48 % (2724474)Will run a generic schedule for satisfiability detection.
% 0.15/0.48 % (2724485)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3376577073:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.48 % (2724480)% WARNING: option uhcvi not known.
% 0.15/0.48 % (2724485) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2724474-2724485"...
% 0.15/0.48 % (2724479)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3380527559_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.48 % (2724481)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=185038789:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.48 % (2724480)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1355843955:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.48 % (2724482)dis+10_1_sil=32000:sp=arity:random_seed=3462265284:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.48 % (2724483)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1072430716:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.48 % (2724484)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=970862859:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.48 % (2724485)...printing done.
% 0.15/0.48 % (2724485)Refutation found. Thanks to Tanya!
% 0.15/0.48 % SZS status Theorem for theBenchmark
% 0.15/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48 % (2724485)------------------------------
% 0.15/0.48 % (2724485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.48 % (2724485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.48 % (2724485)CaDiCaL version: 2.1.3
% 0.15/0.48 % (2724485)Termination reason: Refutation
% 0.15/0.48 % (2724485)Time elapsed: 0.008 s
% 0.15/0.48 % (2724485)Peak memory usage: 12 MB
% 0.15/0.48 % (2724485)Instructions burned: 20 (million)
% 0.15/0.48 % (2724474)Success in time 0.048 s
% 0.15/0.48 % Vampire exiting
%------------------------------------------------------------------------------