%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV487+3 : 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 0.81s 0.95s
% Output : Refutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 11
% Syntax : Number of formulae : 89 ( 19 unt; 0 def)
% Number of atoms : 321 ( 74 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 408 ( 176 ~; 161 |; 51 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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; 7 con; 0-2 aty)
% Number of variables : 147 ( 140 !; 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) = real_zero ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,X3) = real_one )
& ! [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',qii) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(int_one,X1)
& int_less(X1,X0)
& int_leq(X0,n) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ut) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(int_one,X1)
& int_less(X1,X0)
& int_leq(X0,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) = real_zero ) )
& ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X1) )
=> real_one = a(X4,X4) )
& ! [X5] :
( ( int_less(int_zero,X5)
& plus(X0,X5) = X1 )
=> ! [X6] :
( ( int_leq(int_one,X6)
& int_leq(X6,X0) )
=> real_zero = a(X6,plus(X6,X5)) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = real_zero
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
& ! [X5] :
( ! [X6] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0) )
| ~ int_less(int_zero,X5)
| plus(X0,X5) != 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) = real_zero
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
& ! [X5] :
( ! [X6] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0) )
| ~ int_less(int_zero,X5)
| plus(X0,X5) != 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,X1)
& int_less(X1,X0)
& int_leq(X0,n) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X1)
& int_less(X1,X0)
& int_leq(X0,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,sK1)
& int_less(sK1,sK0)
& int_leq(sK0,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(f34,plain,
! [X2,X3,X0,X1] :
( real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1)
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(cnf_transformation,[],[f17]) ).
fof(f35,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
int_less(sK1,sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f40,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f41,plain,
! [X0,X1] :
( plus(X0,sK2(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f43,plain,
! [X0] : plus(X0,int_zero) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f44,plain,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X1,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f45,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f47,plain,
! [X0,X1] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f48,plain,
! [X0] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f49,plain,
! [X0] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
! [X2,X0,X1] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f52,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(f53,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f55,plain,
! [X2,X3,X1] :
( real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1)
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,plus(X1,X2))
| ~ int_leq(plus(X1,X2),n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(equality_resolution,[],[f34]) ).
fof(f57,plain,
! [X1] : ~ int_less(X1,X1),
inference(equality_resolution,[],[f39]) ).
fof(f59,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f46]) ).
fof(f62,plain,
! [X0] : plus(int_zero,X0) = X0,
inference(superposition,[],[f53,f43]) ).
fof(f79,plain,
! [X0,X1] :
( ~ int_less(X1,X0)
| ~ int_less(X0,X1) ),
inference(resolution,[],[f51,f57]) ).
fof(f81,plain,
~ int_less(sK0,sK1),
inference(resolution,[],[f79,f36]) ).
fof(f93,plain,
! [X0] :
( ~ int_less(sK0,X0)
| ~ int_less(X0,sK1) ),
inference(resolution,[],[f81,f51]) ).
fof(f94,plain,
( ~ int_leq(sK0,sK1)
| sK0 = sK1 ),
inference(resolution,[],[f81,f45]) ).
fof(f101,plain,
! [X2,X0,X1] :
( int_leq(plus(X1,X2),X0)
| ~ int_less(X1,X0)
| ~ int_leq(X2,int_zero) ),
inference(superposition,[],[f52,f43]) ).
fof(f107,plain,
! [X0] :
( ~ int_less(X0,sK1)
| sK0 = X0
| ~ int_leq(sK0,X0) ),
inference(resolution,[],[f93,f45]) ).
fof(f108,plain,
! [X0] :
( int_leq(X0,sK0)
| ~ int_less(X0,sK1) ),
inference(resolution,[],[f93,f44]) ).
fof(f114,plain,
! [X2,X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_less(int_zero,sK2(X1,X0))
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f55,f41]) ).
fof(f116,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,plus(X2,sK2(X1,X0)))
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f114,f40]) ).
fof(f160,plain,
! [X0,X1] :
( int_leq(X0,X1)
| ~ int_less(int_zero,X1)
| ~ int_leq(X0,int_zero) ),
inference(superposition,[],[f101,f62]) ).
fof(f181,plain,
! [X0] :
( int_leq(sK1,X0)
| ~ int_leq(sK0,X0)
| sK0 = X0 ),
inference(resolution,[],[f107,f44]) ).
fof(f248,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_less(X1,X0)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f116,f41]) ).
fof(f252,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(X1,n)
| ~ int_less(X1,X0) ),
inference(duplicate_literal_removal,[],[f248]) ).
fof(f253,plain,
! [X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(X1,n)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f252,f59]) ).
fof(f367,plain,
( ~ int_less(int_zero,sK1)
| ~ int_leq(sK0,int_zero)
| sK0 = sK1 ),
inference(resolution,[],[f160,f94]) ).
fof(f371,plain,
( ~ int_leq(sK0,int_zero)
| sK0 = sK1
| ~ int_leq(int_one,sK1) ),
inference(resolution,[],[f367,f49]) ).
fof(f375,plain,
( ~ int_leq(sK0,int_zero)
| sK0 = sK1 ),
inference(forward_subsumption_resolution,[],[f371,f37]) ).
fof(f689,plain,
( real_zero != real_zero
| ~ int_leq(int_one,sK1)
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK0) ),
inference(superposition,[],[f38,f253]) ).
fof(f692,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK0) ),
inference(trivial_inequality_removal,[],[f689]) ).
fof(f694,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f692,f37]) ).
fof(f695,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f694,f35]) ).
fof(f696,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK0) ),
inference(forward_subsumption_resolution,[],[f695,f36]) ).
fof(f698,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| n = sK0 ),
inference(resolution,[],[f696,f181]) ).
fof(f704,plain,
( ~ int_less(sK1,n)
| ~ int_leq(int_one,sK0) ),
inference(resolution,[],[f696,f47]) ).
fof(f705,plain,
( ~ int_leq(int_one,sK0)
| n = sK0 ),
inference(forward_subsumption_resolution,[],[f698,f35]) ).
fof(f744,plain,
( ~ int_less(int_zero,sK0)
| n = sK0 ),
inference(resolution,[],[f705,f48]) ).
fof(f792,plain,
( int_leq(sK0,int_zero)
| n = sK0 ),
inference(resolution,[],[f744,f44]) ).
fof(f833,plain,
( sK0 = sK1
| n = sK0 ),
inference(resolution,[],[f792,f375]) ).
fof(f898,plain,
( int_leq(int_one,sK0)
| n = sK0 ),
inference(superposition,[],[f37,f833]) ).
fof(f924,plain,
n = sK0,
inference(forward_subsumption_resolution,[],[f898,f705]) ).
fof(f936,plain,
( ~ int_less(sK1,sK0)
| ~ int_leq(int_one,sK0) ),
inference(superposition,[],[f704,f924]) ).
fof(f939,plain,
~ int_leq(int_one,sK0),
inference(forward_subsumption_resolution,[],[f936,f36]) ).
fof(f944,plain,
~ int_less(int_one,sK1),
inference(resolution,[],[f939,f108]) ).
fof(f955,plain,
~ int_less(int_one,sK0),
inference(resolution,[],[f939,f47]) ).
fof(f968,plain,
( int_one = sK1
| ~ int_leq(int_one,sK1) ),
inference(resolution,[],[f944,f45]) ).
fof(f971,plain,
int_one = sK1,
inference(forward_subsumption_resolution,[],[f968,f37]) ).
fof(f1056,plain,
~ int_less(sK1,sK0),
inference(superposition,[],[f955,f971]) ).
fof(f1058,plain,
$false,
inference(forward_subsumption_resolution,[],[f1056,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV487+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % 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:13:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/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
% 0.81/0.95 % (287949)Detected formulas, will run a generic FOF schedule.
% 0.81/0.95 % (287958)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3369537827:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.81/0.95 % (287958)First to succeed.
% 0.81/0.95 % (287958)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-287949"
% 0.81/0.95 % (287960)dis-21_1_sil=8000:lcm=predicate:random_seed=910851009: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)
% 0.81/0.95 % (287954)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=3391966825:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.81/0.95 % (287957)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=521598364:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.81/0.95 % (287955)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=793993360:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.81/0.95 % (287959)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2365328463:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.81/0.95 % (287956)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=2614723129:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.81/0.95 % (287957)Also succeeded, but the first one will report.
% 0.81/0.95 % (287960)Instruction limit reached!
% 0.81/0.95 % (287960)------------------------------
% 0.81/0.95 % (287960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.81/0.95 % (287960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.81/0.95 % (287960)CaDiCaL version: 2.1.3
% 0.81/0.95 % (287960)Termination reason: Instruction limit
% 0.81/0.95 % (287960)Termination phase: Saturation
% 0.81/0.95 % (287960)Time elapsed: 0.081 s
% 0.81/0.95 % (287960)Peak memory usage: 89 MB
% 0.81/0.95 % (287960)Instructions burned: 130 (million)
% 0.81/0.95 % (287959)Instruction limit reached!
% 0.81/0.95 % (287959)------------------------------
% 0.81/0.95 % (287959)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.81/0.95 % (287959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.81/0.95 % (287959)CaDiCaL version: 2.1.3
% 0.81/0.95 % (287959)Termination reason: Instruction limit
% 0.81/0.95 % (287959)Termination phase: Saturation
% 0.81/0.95 % (287959)Time elapsed: 0.097 s
% 0.81/0.95 % (287959)Peak memory usage: 90 MB
% 0.81/0.95 % (287959)Instructions burned: 139 (million)
% 0.81/0.95 % (287958)Refutation found. Thanks to Tanya!
% 0.81/0.95 % SZS status Theorem for theBenchmark
% 0.81/0.95 % SZS output start Proof for theBenchmark
% See solution above
% 2.71/1.15 % (287958)------------------------------
% 2.71/1.15 % (287958)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.15 % (287958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.15 % (287958)CaDiCaL version: 2.1.3
% 2.71/1.15 % (287958)Termination reason: Refutation
% 2.71/1.15 % (287958)Time elapsed: 0.019 s
% 2.71/1.15 % (287958)Peak memory usage: 88 MB
% 2.71/1.15 % (287958)Instructions burned: 53 (million)
% 2.71/1.15 % (287958)------------------------------
% 2.71/1.15 % (287958)------------------------------
% 2.71/1.15 % (287949)Success in time 0.293 s
% 2.71/1.15 % Vampire exiting
%------------------------------------------------------------------------------