%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV486+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 : n004.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 01:16:01 PM UTC 2026
% Result : Theorem 2.93s 1.11s
% Output : Refutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 11
% Syntax : Number of formulae : 89 ( 19 unt; 0 def)
% Number of atoms : 309 ( 70 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 392 ( 172 ~; 157 |; 45 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 143 ( 136 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( int_less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( int_less(X0,X1)
& int_less(X1,X2) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f3,axiom,
! [X0,X1] :
( int_less(X0,X1)
=> X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive) ).
fof(f4,axiom,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_total) ).
fof(f6,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_commutative) ).
fof(f7,axiom,
! [X0] : plus(X0,int_zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_zero) ).
fof(f8,axiom,
! [X0,X1,X2,X3] :
( ( int_less(X0,X1)
& int_leq(X2,X3) )
=> int_leq(plus(X0,X2),plus(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_order1) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( plus(X0,X2) = X1
& int_less(int_zero,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ! [X2] :
( ( int_less(int_zero,X2)
& X0 = plus(X1,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(plus(X3,X2),X3) = qr(plus(X3,X2),X3) ) )
& ! [X2] :
( ( int_less(int_zero,X2)
& X1 = plus(X0,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X0) )
=> a(X3,plus(X3,X2)) = real_zero ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qih) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lt) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) )
=> a(X0,X1) = real_zero ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ! [X2] :
( ( int_less(int_zero,X2)
& X0 = plus(X1,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(plus(X3,X2),X3) = qr(plus(X3,X2),X3) ) )
& ! [X4] :
( ( int_less(int_zero,X4)
& plus(X0,X4) = X1 )
=> ! [X5] :
( ( int_leq(int_one,X5)
& int_leq(X5,X0) )
=> real_zero = a(X5,plus(X5,X4)) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = qr(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( ! [X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_less(int_zero,X4)
| plus(X0,X4) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = qr(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( ! [X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_less(int_zero,X4)
| plus(X0,X4) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f21,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f22,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2,X3] :
( int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_less(X0,X1)
| ~ int_leq(X2,X3) ),
inference(ennf_transformation,[],[f8]) ).
fof(f24,plain,
! [X0,X1,X2,X3] :
( int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_less(X0,X1)
| ~ int_leq(X2,X3) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
( real_zero != a(sK0,sK1)
& int_leq(int_one,sK0)
& int_less(sK0,sK1)
& int_leq(sK1,n) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f19]) ).
fof(f26,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ? [X2] :
( plus(X0,X2) = X1
& int_less(int_zero,X2) )
| ~ int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f27,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ? [X3] :
( plus(X0,X3) = X1
& int_less(int_zero,X3) )
| ~ int_less(X0,X1) ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ( plus(X0,sK2(X0,X1)) = X1
& int_less(int_zero,sK2(X0,X1)) )
| ~ int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1))],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( ~ int_less(X0,X1)
& X0 != X1 ) )
& ( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f30,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( ~ int_less(X0,X1)
& X0 != X1 ) )
& ( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) )
& ( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f32,plain,
! [X0,X1,X4,X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0)
| ~ int_less(int_zero,X4)
| plus(X0,X4) != X1
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
int_less(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f39,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f40,plain,
! [X0,X1] :
( plus(X0,sK2(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f42,plain,
! [X0] : plus(X0,int_zero) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f43,plain,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X1,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f44,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f45,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0,X1] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f47,plain,
! [X0] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f48,plain,
! [X0] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f50,plain,
! [X2,X0,X1] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f51,plain,
! [X2,X3,X0,X1] :
( int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_less(X0,X1)
| ~ int_leq(X2,X3) ),
inference(cnf_transformation,[],[f24]) ).
fof(f52,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f54,plain,
! [X0,X4,X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0)
| ~ int_less(int_zero,X4)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,plus(X0,X4))
| ~ int_leq(plus(X0,X4),n) ),
inference(equality_resolution,[],[f32]) ).
fof(f55,plain,
! [X1] : ~ int_less(X1,X1),
inference(equality_resolution,[],[f38]) ).
fof(f57,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f45]) ).
fof(f62,plain,
! [X0] : plus(int_zero,X0) = X0,
inference(superposition,[],[f52,f42]) ).
fof(f77,plain,
! [X0,X1] :
( ~ int_less(X1,X0)
| ~ int_less(X0,X1) ),
inference(resolution,[],[f50,f55]) ).
fof(f79,plain,
~ int_less(sK1,sK0),
inference(resolution,[],[f77,f35]) ).
fof(f88,plain,
! [X0] :
( ~ int_less(sK1,X0)
| ~ int_less(X0,sK0) ),
inference(resolution,[],[f79,f50]) ).
fof(f89,plain,
( ~ int_leq(sK1,sK0)
| sK0 = sK1 ),
inference(resolution,[],[f79,f44]) ).
fof(f99,plain,
! [X2,X0,X1] :
( int_leq(plus(X1,X2),X0)
| ~ int_less(X1,X0)
| ~ int_leq(X2,int_zero) ),
inference(superposition,[],[f51,f42]) ).
fof(f105,plain,
! [X0] :
( ~ int_less(X0,sK0)
| sK1 = X0
| ~ int_leq(sK1,X0) ),
inference(resolution,[],[f88,f44]) ).
fof(f106,plain,
! [X0] :
( int_leq(X0,sK1)
| ~ int_less(X0,sK0) ),
inference(resolution,[],[f88,f43]) ).
fof(f112,plain,
! [X2,X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_less(int_zero,sK2(X1,X0))
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f54,f40]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| real_zero = a(X1,X0)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f112,f39]) ).
fof(f155,plain,
! [X0,X1] :
( int_leq(X0,X1)
| ~ int_less(int_zero,X1)
| ~ int_leq(X0,int_zero) ),
inference(superposition,[],[f99,f62]) ).
fof(f179,plain,
! [X0] :
( int_leq(sK0,X0)
| ~ int_leq(sK1,X0)
| sK1 = X0 ),
inference(resolution,[],[f105,f43]) ).
fof(f236,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_less(X1,X0)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f114,f40]) ).
fof(f240,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_less(X1,X0) ),
inference(duplicate_literal_removal,[],[f236]) ).
fof(f241,plain,
! [X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f240,f57]) ).
fof(f365,plain,
( ~ int_less(int_zero,sK0)
| ~ int_leq(sK1,int_zero)
| sK0 = sK1 ),
inference(resolution,[],[f155,f89]) ).
fof(f369,plain,
( ~ int_leq(sK1,int_zero)
| sK0 = sK1
| ~ int_leq(int_one,sK0) ),
inference(resolution,[],[f365,f48]) ).
fof(f373,plain,
( ~ int_leq(sK1,int_zero)
| sK0 = sK1 ),
inference(forward_subsumption_resolution,[],[f369,f36]) ).
fof(f681,plain,
( real_zero != real_zero
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(superposition,[],[f37,f241]) ).
fof(f686,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(trivial_inequality_removal,[],[f681]) ).
fof(f689,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f686,f36]) ).
fof(f690,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f689,f34]) ).
fof(f691,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1) ),
inference(forward_subsumption_resolution,[],[f690,f35]) ).
fof(f693,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| n = sK1 ),
inference(resolution,[],[f691,f179]) ).
fof(f699,plain,
( ~ int_less(sK0,n)
| ~ int_leq(int_one,sK1) ),
inference(resolution,[],[f691,f46]) ).
fof(f700,plain,
( ~ int_leq(int_one,sK1)
| n = sK1 ),
inference(forward_subsumption_resolution,[],[f693,f34]) ).
fof(f746,plain,
( ~ int_less(int_zero,sK1)
| n = sK1 ),
inference(resolution,[],[f700,f47]) ).
fof(f777,plain,
( int_leq(sK1,int_zero)
| n = sK1 ),
inference(resolution,[],[f746,f43]) ).
fof(f833,plain,
( sK0 = sK1
| n = sK1 ),
inference(resolution,[],[f777,f373]) ).
fof(f898,plain,
( int_less(sK0,sK0)
| n = sK1 ),
inference(superposition,[],[f35,f833]) ).
fof(f949,plain,
n = sK1,
inference(forward_subsumption_resolution,[],[f898,f55]) ).
fof(f960,plain,
( ~ int_less(sK0,sK1)
| ~ int_leq(int_one,sK1) ),
inference(superposition,[],[f699,f949]) ).
fof(f963,plain,
~ int_leq(int_one,sK1),
inference(forward_subsumption_resolution,[],[f960,f35]) ).
fof(f966,plain,
~ int_less(int_one,sK0),
inference(resolution,[],[f963,f106]) ).
fof(f977,plain,
~ int_less(int_one,sK1),
inference(resolution,[],[f963,f46]) ).
fof(f1001,plain,
( int_one = sK0
| ~ int_leq(int_one,sK0) ),
inference(resolution,[],[f966,f44]) ).
fof(f1003,plain,
int_one = sK0,
inference(forward_subsumption_resolution,[],[f1001,f36]) ).
fof(f1100,plain,
~ int_less(sK0,sK1),
inference(superposition,[],[f977,f1003]) ).
fof(f1102,plain,
$false,
inference(forward_subsumption_resolution,[],[f1100,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV486+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.08/0.19 % Computer : n004.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 11:14:22 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 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.93/1.11 % (288782)Detected formulas, will run a generic FOF schedule.
% 2.93/1.11 % (288787)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=1868756285:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.93/1.11 % (288790)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3854633880:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.93/1.11 % (288788)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=2061329936:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.93/1.11 % (288791)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1392353286:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.93/1.11 % (288789)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=1081188860:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.93/1.11 % (288793)dis-21_1_sil=8000:lcm=predicate:random_seed=3962317432: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.93/1.11 % (288792)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1466832656:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.93/1.11 % (288791)First to succeed.
% 2.93/1.11 % (288791)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-288782"
% 2.93/1.11 % (288790)Also succeeded, but the first one will report.
% 2.93/1.11 % (288793)Instruction limit reached!
% 2.93/1.11 % (288793)------------------------------
% 2.93/1.11 % (288793)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.93/1.11 % (288793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.93/1.11 % (288793)CaDiCaL version: 2.1.3
% 2.93/1.11 % (288793)Termination reason: Instruction limit
% 2.93/1.11 % (288793)Termination phase: Saturation
% 2.93/1.11 % (288793)Time elapsed: 0.080 s
% 2.93/1.11 % (288793)Peak memory usage: 89 MB
% 2.93/1.11 % (288793)Instructions burned: 130 (million)
% 2.93/1.11 % (288792)Instruction limit reached!
% 2.93/1.11 % (288792)------------------------------
% 2.93/1.11 % (288792)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.93/1.11 % (288792)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.93/1.11 % (288792)CaDiCaL version: 2.1.3
% 2.93/1.11 % (288792)Termination reason: Instruction limit
% 2.93/1.11 % (288792)Termination phase: Saturation
% 2.93/1.11 % (288792)Time elapsed: 0.095 s
% 2.93/1.11 % (288792)Peak memory usage: 90 MB
% 2.93/1.11 % (288792)Instructions burned: 140 (million)
% 2.93/1.11 % (288801)lrs+10_1_sil=8000:sp=occurrence:random_seed=4261929911:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.93/1.11 % (288802)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1536412662:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.93/1.11 % (288801)Also succeeded, but the first one will report.
% 2.93/1.11 % (288791)Refutation found. Thanks to Tanya!
% 2.93/1.11 % SZS status Theorem for theBenchmark
% 2.93/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 3.67/1.21 % (288791)------------------------------
% 3.67/1.21 % (288791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.21 % (288791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.21 % (288791)CaDiCaL version: 2.1.3
% 3.67/1.21 % (288791)Termination reason: Refutation
% 3.67/1.21 % (288791)Time elapsed: 0.035 s
% 3.67/1.21 % (288791)Peak memory usage: 88 MB
% 3.67/1.21 % (288791)Instructions burned: 56 (million)
% 3.67/1.21 % (288791)------------------------------
% 3.67/1.21 % (288791)------------------------------
% 3.67/1.21 % (288782)Success in time 0.437 s
% 3.67/1.21 % Vampire exiting
%------------------------------------------------------------------------------