%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM487+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:15:24 PM UTC 2026
% Result : Theorem 2.65s 1.29s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of formulae : 82 ( 17 unt; 0 def)
% Number of atoms : 334 ( 117 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 434 ( 182 ~; 171 |; 62 &)
% ( 9 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 109 ( 101 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(f6,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> sdtpldt0(X0,X1) = sdtpldt0(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(f8,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtpldt0(X0,sz00) = X0
& X0 = sdtpldt0(sz00,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( sdtpldt0(X0,X1) = sdtpldt0(X0,X2)
| sdtpldt0(X1,X0) = sdtpldt0(X2,X0) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddCanc) ).
fof(f18,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).
fof(f19,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X0,X1)
=> ! [X2] :
( X2 = sdtmndt0(X1,X0)
<=> ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(f37,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( isPrime0(X0)
<=> ( X0 != sz00
& X0 != sz10
& ! [X1] :
( ( aNaturalNumber0(X1)
& doDivides0(X1,X0) )
=> ( X1 = sz10
| X1 = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrime) ).
fof(f39,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
fof(f41,axiom,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1860) ).
fof(f42,axiom,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1870) ).
fof(f43,axiom,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1883) ).
fof(f44,conjecture,
( xr != xn
& sdtlseqdt0(xr,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f45,negated_conjecture,
~ ( xr != xn
& sdtlseqdt0(xr,xn) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f50,plain,
( xn = xr
| ~ sdtlseqdt0(xr,xn) ),
inference(ennf_transformation,[],[f45]) ).
fof(f53,plain,
! [X0,X1] :
( ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f54,plain,
! [X0,X1] :
( ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f53]) ).
fof(f57,plain,
! [X0,X1,X2] :
( X1 = X2
| ( sdtpldt0(X0,X1) != sdtpldt0(X0,X2)
& sdtpldt0(X1,X0) != sdtpldt0(X2,X0) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f58,plain,
! [X0,X1,X2] :
( X1 = X2
| ( sdtpldt0(X0,X1) != sdtpldt0(X0,X2)
& sdtpldt0(X1,X0) != sdtpldt0(X2,X0) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(flattening,[],[f57]) ).
fof(f61,plain,
! [X0] :
( ( sdtpldt0(X0,sz00) = X0
& X0 = sdtpldt0(sz00,X0) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f64,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f65,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f67,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f66]) ).
fof(f93,plain,
! [X0] :
( ( isPrime0(X0)
<=> ( X0 != sz00
& X0 != sz10
& ! [X1] :
( X1 = sz10
| X1 = X0
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X0) ) ) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f94,plain,
! [X0] :
( ( isPrime0(X0)
<=> ( X0 != sz00
& X0 != sz10
& ! [X1] :
( X1 = sz10
| X1 = X0
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X0) ) ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f93]) ).
fof(f106,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtmndt0(X1,X0)
<=> ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f107,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtmndt0(X1,X0)
<=> ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f106]) ).
fof(f111,plain,
! [X0,X1] :
( ( ( sdtlseqdt0(X0,X1)
| ! [X2] :
( ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 ) )
& ( ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
| ~ sdtlseqdt0(X0,X1) ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(nnf_transformation,[],[f54]) ).
fof(f112,plain,
! [X0,X1] :
( ( ( sdtlseqdt0(X0,X1)
| ! [X2] :
( ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 ) )
& ( ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X0,X3) = X1 )
| ~ sdtlseqdt0(X0,X1) ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(rectify,[],[f111]) ).
fof(f113,plain,
! [X0,X1] :
( ( ( sdtlseqdt0(X0,X1)
| ! [X2] :
( ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 ) )
& ( ( aNaturalNumber0(sK0(X0,X1))
& sdtpldt0(X0,sK0(X0,X1)) = X1 )
| ~ sdtlseqdt0(X0,X1) ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f112]) ).
fof(f118,plain,
! [X0] :
( ( ( isPrime0(X0)
| sz00 = X0
| sz10 = X0
| ? [X1] :
( sz10 != X1
& X0 != X1
& aNaturalNumber0(X1)
& doDivides0(X1,X0) ) )
& ( ( X0 != sz00
& X0 != sz10
& ! [X1] :
( X1 = sz10
| X1 = X0
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X0) ) )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f94]) ).
fof(f119,plain,
! [X0] :
( ( ( isPrime0(X0)
| sz00 = X0
| sz10 = X0
| ? [X1] :
( sz10 != X1
& X0 != X1
& aNaturalNumber0(X1)
& doDivides0(X1,X0) ) )
& ( ( X0 != sz00
& X0 != sz10
& ! [X1] :
( X1 = sz10
| X1 = X0
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X0) ) )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f118]) ).
fof(f120,plain,
! [X0] :
( ( ( isPrime0(X0)
| sz00 = X0
| sz10 = X0
| ? [X1] :
( sz10 != X1
& X0 != X1
& aNaturalNumber0(X1)
& doDivides0(X1,X0) ) )
& ( ( X0 != sz00
& X0 != sz10
& ! [X2] :
( sz10 = X2
| X0 = X2
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X0) ) )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f119]) ).
fof(f121,plain,
! [X0] :
( ( ( isPrime0(X0)
| sz00 = X0
| sz10 = X0
| ( sz10 != sK3(X0)
& sK3(X0) != X0
& aNaturalNumber0(sK3(X0))
& doDivides0(sK3(X0),X0) ) )
& ( ( X0 != sz00
& X0 != sz10
& ! [X2] :
( sz10 = X2
| X0 = X2
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X0) ) )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X1,sK3(X0))],[f120]) ).
fof(f122,plain,
! [X0,X1] :
( ! [X2] :
( ( X2 = sdtmndt0(X1,X0)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 )
& ( ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
| sdtmndt0(X1,X0) != X2 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(nnf_transformation,[],[f107]) ).
fof(f123,plain,
! [X0,X1] :
( ! [X2] :
( ( X2 = sdtmndt0(X1,X0)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 )
& ( ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
| sdtmndt0(X1,X0) != X2 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f122]) ).
fof(f124,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f126,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f129,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f41]) ).
fof(f130,plain,
sdtlseqdt0(xp,xn),
inference(cnf_transformation,[],[f42]) ).
fof(f131,plain,
xr = sdtmndt0(xn,xp),
inference(cnf_transformation,[],[f43]) ).
fof(f132,plain,
( ~ sdtlseqdt0(xr,xn)
| xn = xr ),
inference(cnf_transformation,[],[f50]) ).
fof(f139,plain,
! [X2,X0,X1] :
( sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f142,plain,
! [X2,X0,X1] :
( sdtpldt0(X1,X0) != sdtpldt0(X2,X0)
| X1 = X2
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f146,plain,
! [X0] :
( sdtpldt0(sz00,X0) = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f149,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f150,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f172,plain,
! [X0] :
( sz00 != X0
| ~ isPrime0(X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f187,plain,
! [X2,X0,X1] :
( sdtpldt0(X0,X2) = X1
| sdtmndt0(X1,X0) != X2
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f188,plain,
! [X2,X0,X1] :
( aNaturalNumber0(X2)
| sdtmndt0(X1,X0) != X2
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f190,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f197,plain,
! [X2,X0] :
( sdtlseqdt0(X0,sdtpldt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sdtpldt0(X0,X2)) ),
inference(equality_resolution,[],[f139]) ).
fof(f199,plain,
( ~ isPrime0(sz00)
| ~ aNaturalNumber0(sz00) ),
inference(equality_resolution,[],[f172]) ).
fof(f203,plain,
! [X0,X1] :
( aNaturalNumber0(sdtmndt0(X1,X0))
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(equality_resolution,[],[f188]) ).
fof(f204,plain,
! [X0,X1] :
( sdtpldt0(X0,sdtmndt0(X1,X0)) = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f207,plain,
~ isPrime0(sz00),
inference(forward_subsumption_resolution,[],[f199,f190]) ).
fof(f285,plain,
( aNaturalNumber0(xr)
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(superposition,[],[f203,f131]) ).
fof(f286,plain,
( aNaturalNumber0(xr)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f285,f130]) ).
fof(f287,plain,
( aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f286,f124]) ).
fof(f288,plain,
aNaturalNumber0(xr),
inference(forward_subsumption_resolution,[],[f287,f126]) ).
fof(f354,plain,
! [X2,X0] :
( sdtlseqdt0(X0,sdtpldt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X0) ),
inference(forward_subsumption_resolution,[],[f197,f150]) ).
fof(f359,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(superposition,[],[f354,f149]) ).
fof(f360,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(duplicate_literal_removal,[],[f359]) ).
fof(f463,plain,
( xn = sdtpldt0(xp,xr)
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(superposition,[],[f204,f131]) ).
fof(f481,plain,
( xn = sdtpldt0(xp,xr)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f463,f130]) ).
fof(f484,plain,
( xn = sdtpldt0(xp,xr)
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f481,f124]) ).
fof(f485,plain,
xn = sdtpldt0(xp,xr),
inference(forward_subsumption_resolution,[],[f484,f126]) ).
fof(f494,plain,
( sdtlseqdt0(xr,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr) ),
inference(superposition,[],[f360,f485]) ).
fof(f495,plain,
( sdtlseqdt0(xr,xn)
| ~ aNaturalNumber0(xr) ),
inference(forward_subsumption_resolution,[],[f494,f124]) ).
fof(f502,plain,
sdtlseqdt0(xr,xn),
inference(forward_subsumption_resolution,[],[f495,f288]) ).
fof(f509,plain,
xn = xr,
inference(resolution,[],[f502,f132]) ).
fof(f612,plain,
! [X0] :
( xn != sdtpldt0(X0,xr)
| xp = X0
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[],[f142,f485]) ).
fof(f627,plain,
! [X0] :
( xn != sdtpldt0(X0,xr)
| xp = X0
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(xp) ),
inference(forward_subsumption_resolution,[],[f612,f288]) ).
fof(f637,plain,
! [X0] :
( xn != sdtpldt0(X0,xr)
| xp = X0
| ~ aNaturalNumber0(X0) ),
inference(forward_subsumption_resolution,[],[f627,f124]) ).
fof(f639,plain,
! [X0] :
( xr != sdtpldt0(X0,xr)
| xp = X0
| ~ aNaturalNumber0(X0) ),
inference(forward_demodulation,[],[f637,f509]) ).
fof(f1870,plain,
( xr != xr
| sz00 = xp
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(xr) ),
inference(superposition,[],[f639,f146]) ).
fof(f1874,plain,
( sz00 = xp
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(xr) ),
inference(trivial_inequality_removal,[],[f1870]) ).
fof(f1878,plain,
( sz00 = xp
| ~ aNaturalNumber0(xr) ),
inference(forward_subsumption_resolution,[],[f1874,f190]) ).
fof(f1882,plain,
sz00 = xp,
inference(forward_subsumption_resolution,[],[f1878,f288]) ).
fof(f1889,plain,
~ isPrime0(xp),
inference(superposition,[],[f207,f1882]) ).
fof(f1894,plain,
$false,
inference(forward_subsumption_resolution,[],[f1889,f129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM487+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 20:05:06 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.65/1.29 % (2902760)Detected formulas, will run a generic FOF schedule.
% 2.65/1.29 % (2902765)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=3596786158:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.65/1.29 % (2902766)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=1319806170:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.65/1.29 % (2902770)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=249913404:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.65/1.29 % (2902769)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3237268750:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.65/1.29 % (2902768)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=779369511:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.65/1.29 % (2902767)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=1614761686:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.65/1.29 % (2902771)dis-21_1_sil=8000:lcm=predicate:random_seed=2819102348: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.65/1.29 % (2902769)First to succeed.
% 2.65/1.29 % (2902769)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2902760"
% 2.65/1.29 % (2902768)Instruction limit reached!
% 2.65/1.29 % (2902768)------------------------------
% 2.65/1.29 % (2902768)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.29 % (2902768)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.29 % (2902768)CaDiCaL version: 2.1.3
% 2.65/1.29 % (2902768)Termination reason: Instruction limit
% 2.65/1.29 % (2902768)Termination phase: Saturation
% 2.65/1.29 % (2902768)Time elapsed: 0.061 s
% 2.65/1.29 % (2902768)Peak memory usage: 89 MB
% 2.65/1.29 % (2902768)Instructions burned: 110 (million)
% 2.65/1.29 % (2902770)Also succeeded, but the first one will report.
% 2.65/1.29 % (2902771)Instruction limit reached!
% 2.65/1.29 % (2902771)------------------------------
% 2.65/1.29 % (2902771)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.29 % (2902771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.29 % (2902771)CaDiCaL version: 2.1.3
% 2.65/1.29 % (2902771)Termination reason: Instruction limit
% 2.65/1.29 % (2902771)Termination phase: Saturation
% 2.65/1.29 % (2902771)Time elapsed: 0.084 s
% 2.65/1.29 % (2902771)Peak memory usage: 90 MB
% 2.65/1.29 % (2902771)Instructions burned: 130 (million)
% 2.65/1.29 % (2902779)lrs+10_1_sil=8000:sp=occurrence:random_seed=1499004702:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.65/1.29 % (2902780)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1710688530:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.65/1.29 % (2902780)Refutation not found, incomplete strategy
% 2.65/1.29 % (2902780)------------------------------
% 2.65/1.29 % (2902780)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.29 % (2902780)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.29 % (2902780)CaDiCaL version: 2.1.3
% 2.65/1.29 % (2902780)Termination reason: Refutation not found, incomplete strategy
% 2.65/1.29 % (2902780)Time elapsed: 0.002 s
% 2.65/1.29 % (2902780)Peak memory usage: 89 MB
% 2.65/1.29 % (2902780)Instructions burned: 2 (million)
% 2.65/1.29 % (2902769)Refutation found. Thanks to Tanya!
% 2.65/1.29 % SZS status Theorem for theBenchmark
% 2.65/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.57/1.39 % (2902769)------------------------------
% 3.57/1.39 % (2902769)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.39 % (2902769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.39 % (2902769)CaDiCaL version: 2.1.3
% 3.57/1.39 % (2902769)Termination reason: Refutation
% 3.57/1.39 % (2902769)Time elapsed: 0.032 s
% 3.57/1.39 % (2902769)Peak memory usage: 88 MB
% 3.57/1.39 % (2902769)Instructions burned: 54 (million)
% 3.57/1.39 % (2902769)------------------------------
% 3.57/1.39 % (2902769)------------------------------
% 3.57/1.39 % (2902760)Success in time 0.443 s
% 3.57/1.39 % Vampire exiting
%------------------------------------------------------------------------------