%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV487+1 : 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 : n009.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:24:25 PM UTC 2026
% Result : Theorem 3.34s 0.78s
% Output : Refutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 111 ( 32 unt; 6 def)
% Number of atoms : 323 ( 68 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 364 ( 152 ~; 146 |; 44 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 113 ( 0 sgn 106 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( int_less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f3,axiom,
! [X0,X1] :
( int_less(X0,X1)
=> X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_irreflexive) ).
fof(f4,axiom,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_total) ).
fof(f6,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_commutative) ).
fof(f7,axiom,
! [X0] : plus(X0,int_zero) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_zero) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( plus(X0,X2) = X1
& int_less(int_zero,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox2/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 ) )
& ! [X2] :
( ( int_leq(int_zero,X2)
& X1 = plus(X0,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X0) )
=> a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qiu) ).
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/sandbox2/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_zero,X4)
& plus(X0,X4) = X1 )
=> ! [X5] :
( ( int_leq(int_one,X5)
& int_leq(X5,X0) )
=> a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f21,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] :
( ! [X5] :
( a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_leq(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(f22,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] :
( ! [X5] :
( a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_leq(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,[],[f21]) ).
fof(f23,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(f24,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X1)
& int_less(X1,X0)
& int_leq(X0,n) ),
inference(flattening,[],[f23]) ).
fof(f25,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(f26,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,[],[f25]) ).
fof(f27,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(f28,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,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ( plus(X0,sK0(X0,X1)) = X1
& int_less(int_zero,sK0(X0,X1)) )
| ~ int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f28]) ).
fof(f30,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(f31,plain,
( real_zero != a(sK1,sK2)
& int_leq(int_one,sK2)
& int_less(sK2,sK1)
& int_leq(sK1,n) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f24]) ).
fof(f32,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f33,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f34,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f36,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f37,plain,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X1,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f39,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f40,plain,
! [X0] : plus(X0,int_zero) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f42,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_less(int_zero,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f29]) ).
fof(f43,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| plus(X0,sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f45,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f49,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,[],[f22]) ).
fof(f50,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
int_less(sK2,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f52,plain,
int_leq(int_one,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
real_zero != a(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f33]) ).
fof(f55,plain,
! [X1] : ~ int_less(X1,X1),
inference(equality_resolution,[],[f36]) ).
fof(f57,plain,
! [X2,X3,X1] :
( ~ int_leq(plus(X1,X2),n)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1)
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,plus(X1,X2))
| real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(equality_resolution,[],[f49]) ).
fof(f59,definition,
sF3 = a(sK1,sK2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f60,plain,
a(sK1,sK2) = sF3,
inference(reorient_equations,[],[f59]) ).
fof(f61,plain,
real_zero != sF3,
inference(definition_folding,[],[f53,f60]) ).
fof(f62,plain,
int_leq(sK2,sK1),
inference(resolution,[],[f34,f51]) ).
fof(f68,plain,
int_less(int_zero,sK2),
inference(resolution,[],[f46,f52]) ).
fof(f75,plain,
! [X0] : plus(int_zero,X0) = X0,
inference(superposition,[],[f40,f39]) ).
fof(f76,plain,
int_less(int_zero,sK0(sK2,sK1)),
inference(resolution,[],[f42,f51]) ).
fof(f78,plain,
int_less(int_zero,sK0(int_zero,sK2)),
inference(resolution,[],[f42,f68]) ).
fof(f88,plain,
int_leq(int_one,sK0(int_zero,sK2)),
inference(resolution,[],[f78,f45]) ).
fof(f95,plain,
( n = sK1
| int_less(sK1,n) ),
inference(resolution,[],[f32,f50]) ).
fof(f98,definition,
( spl4_1
<=> int_less(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f100,plain,
( int_less(sK1,n)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f102,definition,
( spl4_2
<=> n = sK1 ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f104,plain,
( n = sK1
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f105,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f95,f102,f98]) ).
fof(f116,plain,
( int_leq(sK2,n)
| ~ spl4_2 ),
inference(superposition,[],[f62,f104]) ).
fof(f120,plain,
! [X0] :
( ~ int_less(X0,sK2)
| int_less(X0,sK1) ),
inference(resolution,[],[f35,f51]) ).
fof(f133,plain,
sK2 = plus(int_zero,sK0(int_zero,sK2)),
inference(resolution,[],[f43,f68]) ).
fof(f137,plain,
sK1 = plus(sK2,sK0(sK2,sK1)),
inference(resolution,[],[f43,f51]) ).
fof(f141,plain,
sK2 = sK0(int_zero,sK2),
inference(forward_demodulation,[],[f133,f75]) ).
fof(f200,plain,
( ! [X0] :
( ~ int_less(X0,sK1)
| int_less(X0,n) )
| ~ spl4_1 ),
inference(resolution,[],[f100,f35]) ).
fof(f205,plain,
int_less(int_zero,sK1),
inference(resolution,[],[f120,f68]) ).
fof(f208,plain,
int_leq(int_one,sK1),
inference(resolution,[],[f205,f45]) ).
fof(f217,plain,
! [X0] :
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| ~ int_less(int_zero,sK0(sK2,sK1))
| ~ int_leq(int_one,sK1)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK2,n) ),
inference(superposition,[],[f57,f137]) ).
fof(f218,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| ~ int_less(int_zero,sK0(sK2,sK1))
| ~ int_leq(int_one,sK1)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK2,n) ),
inference(forward_subsumption_resolution,[],[f217,f50]) ).
fof(f220,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| ~ int_leq(int_one,sK1)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK2,n) ),
inference(forward_subsumption_resolution,[],[f218,f76]) ).
fof(f222,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK2,n) ),
inference(forward_subsumption_resolution,[],[f220,f208]) ).
fof(f224,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(sK2,n) ),
inference(forward_subsumption_resolution,[],[f222,f52]) ).
fof(f227,definition,
( spl4_9
<=> int_leq(sK2,n) ),
introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition]) ).
fof(f229,plain,
( ~ int_leq(sK2,n)
| spl4_9 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f231,definition,
( spl4_10
<=> ! [X0] :
( ~ int_leq(int_one,X0)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(X0,sK2) ) ),
introduced(definition,[new_symbols(definition,[spl4_10])],[avatar_definition]) ).
fof(f232,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(X0,sK2) )
| ~ spl4_10 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f233,plain,
( ~ spl4_9
| spl4_10 ),
inference(avatar_split_clause,[],[f224,f231,f227]) ).
fof(f340,definition,
( spl4_16
<=> int_less(n,sK2) ),
introduced(definition,[new_symbols(definition,[spl4_16])],[avatar_definition]) ).
fof(f341,plain,
( ~ int_less(n,sK2)
| spl4_16 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f342,plain,
( int_less(n,sK2)
| ~ spl4_16 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f385,plain,
( int_less(n,sK1)
| ~ spl4_16 ),
inference(resolution,[],[f342,f120]) ).
fof(f579,plain,
( int_less(n,n)
| ~ spl4_1
| ~ spl4_16 ),
inference(resolution,[],[f200,f385]) ).
fof(f582,plain,
( $false
| ~ spl4_1
| ~ spl4_16 ),
inference(forward_subsumption_resolution,[],[f579,f55]) ).
fof(f583,plain,
( ~ spl4_1
| ~ spl4_16 ),
inference(avatar_contradiction_clause,[],[f582]) ).
fof(f585,plain,
( $false
| ~ spl4_2
| spl4_9 ),
inference(forward_subsumption_resolution,[],[f116,f229]) ).
fof(f586,plain,
( ~ spl4_2
| spl4_9 ),
inference(avatar_contradiction_clause,[],[f585]) ).
fof(f689,plain,
( int_leq(sK2,n)
| spl4_16 ),
inference(resolution,[],[f341,f37]) ).
fof(f1608,plain,
( real_zero = a(plus(sK0(int_zero,sK2),sK0(sK2,sK1)),sK0(int_zero,sK2))
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_10 ),
inference(resolution,[],[f232,f88]) ).
fof(f1633,plain,
( real_zero = a(plus(sK2,sK0(sK2,sK1)),sK2)
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_10 ),
inference(forward_demodulation,[],[f1608,f141]) ).
fof(f1840,plain,
( real_zero = a(sK1,sK2)
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_10 ),
inference(forward_demodulation,[],[f1633,f137]) ).
fof(f1896,plain,
( real_zero = sF3
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_10 ),
inference(forward_demodulation,[],[f1840,f60]) ).
fof(f1907,plain,
( ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_10 ),
inference(forward_subsumption_resolution,[],[f1896,f61]) ).
fof(f1908,plain,
( ~ int_leq(sK2,sK2)
| ~ spl4_10 ),
inference(forward_demodulation,[],[f1907,f141]) ).
fof(f1909,plain,
( $false
| ~ spl4_10 ),
inference(forward_subsumption_resolution,[],[f1908,f54]) ).
fof(f1910,plain,
~ spl4_10,
inference(avatar_contradiction_clause,[],[f1909]) ).
fof(f1914,plain,
( $false
| spl4_9
| spl4_16 ),
inference(forward_subsumption_resolution,[],[f689,f229]) ).
fof(f1915,plain,
( spl4_9
| spl4_16 ),
inference(avatar_contradiction_clause,[],[f1914]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f105]) ).
cnf(s5,plain,
( ~ spl4_9
| spl4_10 ),
inference(sat_conversion,[],[f233]) ).
cnf(s17,plain,
( ~ spl4_1
| ~ spl4_16 ),
inference(sat_conversion,[],[f583]) ).
cnf(s19,plain,
( ~ spl4_2
| spl4_9 ),
inference(sat_conversion,[],[f586]) ).
cnf(s58,plain,
~ spl4_10,
inference(sat_conversion,[],[f1910]) ).
cnf(s61,plain,
( spl4_9
| spl4_16 ),
inference(sat_conversion,[],[f1915]) ).
cnf(s66,plain,
~ spl4_9,
inference(rat,[],[s5,s58]) ).
cnf(s67,plain,
spl4_16,
inference(rat,[],[s61,s66]) ).
cnf(s70,plain,
~ spl4_2,
inference(rat,[],[s19,s66]) ).
cnf(s71,plain,
~ spl4_1,
inference(rat,[],[s17,s67]) ).
cnf(s72,plain,
$false,
inference(rat,[],[s1,s70,s71]) ).
fof(f2076,plain,
$false,
inference(avatar_sat_refutation,[],[s72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV487+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n009.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 11:14:00 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.22 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
% 3.34/0.78 % (2970188)Will run a generic schedule for satisfiability detection.
% 3.34/0.78 % (2970195)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=436775512:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.34/0.78 % (2970194)% WARNING: option uhcvi not known.
% 3.34/0.78 % (2970193)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1935058249_2999 on theBenchmark for (2999ds/0Mi)
% 3.34/0.78 % (2970194)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1590469711:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.34/0.78 % (2970196)dis+10_1_sil=32000:sp=arity:random_seed=1733637508:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.34/0.78 % (2970198)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1152093824:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.34/0.78 % (2970197)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1235803715:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.34/0.78 % (2970199)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3166398682:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.34/0.78 % TRYING [1]
% 3.34/0.78 % TRYING [2]
% 3.34/0.78 % TRYING [3]
% 3.34/0.78 % TRYING [4]
% 3.34/0.78 % TRYING [5]
% 3.34/0.78 % TRYING [6]
% 3.34/0.78 % TRYING [7]
% 3.34/0.78 % (2970196)Instruction limit reached!
% 3.34/0.78 % (2970196)------------------------------
% 3.34/0.78 % (2970196)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970196)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970196)Termination reason: Instruction limit
% 3.34/0.78 % (2970196)Termination phase: Saturation
% 3.34/0.78 % (2970196)Time elapsed: 0.068 s
% 3.34/0.78 % (2970196)Peak memory usage: 12 MB
% 3.34/0.78 % (2970196)Instructions burned: 103 (million)
% 3.34/0.78 % (2970197)Instruction limit reached!
% 3.34/0.78 % (2970197)------------------------------
% 3.34/0.78 % (2970197)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970197)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970197)Termination reason: Instruction limit
% 3.34/0.78 % (2970197)Termination phase: Saturation
% 3.34/0.78 % (2970197)Time elapsed: 0.073 s
% 3.34/0.78 % (2970197)Peak memory usage: 12 MB
% 3.34/0.78 % (2970197)Instructions burned: 117 (million)
% 3.34/0.78 % TRYING [8]
% 3.34/0.78 % (2970198)Instruction limit reached!
% 3.34/0.78 % (2970198)------------------------------
% 3.34/0.78 % (2970198)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970198)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970198)Termination reason: Instruction limit
% 3.34/0.78 % (2970198)Termination phase: Saturation
% 3.34/0.78 % (2970198)Time elapsed: 0.083 s
% 3.34/0.78 % (2970198)Peak memory usage: 12 MB
% 3.34/0.78 % (2970198)Instructions burned: 132 (million)
% 3.34/0.78 % (2970207)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=917971346:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 3.34/0.78 % (2970208)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3012427596:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.34/0.78 % TRYING [1]
% 3.34/0.78 % TRYING [2]
% 3.34/0.78 % TRYING [3]
% 3.34/0.78 % TRYING [4]
% 3.34/0.78 % TRYING [5]
% 3.34/0.78 % (2970209)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2573174703:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.34/0.78 % (2970199)Instruction limit reached!
% 3.34/0.78 % (2970199)------------------------------
% 3.34/0.78 % (2970199)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970199)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970199)Termination reason: Instruction limit
% 3.34/0.78 % (2970199)Termination phase: Saturation
% 3.34/0.78 % (2970199)Time elapsed: 0.108 s
% 3.34/0.78 % (2970199)Peak memory usage: 13 MB
% 3.34/0.78 % (2970199)Instructions burned: 159 (million)
% 3.34/0.78 % TRYING [6]
% 3.34/0.78 % (2970213)ott-21_1_sil=16000:fs=off:random_seed=3124522372:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.34/0.78 % TRYING [7]
% 3.34/0.78 % (2970208)Instruction limit reached!
% 3.34/0.78 % (2970208)------------------------------
% 3.34/0.78 % (2970208)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970208)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970208)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970208)Termination reason: Instruction limit
% 3.34/0.78 % (2970208)Termination phase: Saturation
% 3.34/0.78 % (2970208)Time elapsed: 0.091 s
% 3.34/0.78 % (2970208)Peak memory usage: 13 MB
% 3.34/0.78 % (2970208)Instructions burned: 132 (million)
% 3.34/0.78 % TRYING [9]
% 3.34/0.78 % (2970215)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2783651171:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 3.34/0.78 % (2970213)Instruction limit reached!
% 3.34/0.78 % (2970213)------------------------------
% 3.34/0.78 % (2970213)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970213)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970213)Termination reason: Instruction limit
% 3.34/0.78 % (2970213)Termination phase: Saturation
% 3.34/0.78 % (2970213)Time elapsed: 0.094 s
% 3.34/0.78 % (2970213)Peak memory usage: 12 MB
% 3.34/0.78 % (2970213)Instructions burned: 180 (million)
% 3.34/0.78 % (2970217)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3714614222:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 3.34/0.78 % TRYING [1]
% 3.34/0.78 % TRYING [2]
% 3.34/0.78 % TRYING [3]
% 3.34/0.78 % TRYING [4]
% 3.34/0.78 % TRYING [8]
% 3.34/0.78 % TRYING [5]
% 3.34/0.78 % TRYING [6]
% 3.34/0.78 % TRYING [7]
% 3.34/0.78 % TRYING [10]
% 3.34/0.78 % TRYING [8]
% 3.34/0.78 % (2970207)Instruction limit reached!
% 3.34/0.78 % (2970207)------------------------------
% 3.34/0.78 % (2970207)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970207)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970207)Termination reason: Instruction limit
% 3.34/0.78 % (2970207)Termination phase: Finite model building SAT solving
% 3.34/0.78 % (2970207)Time elapsed: 0.357 s
% 3.34/0.78 % (2970207)Peak memory usage: 22 MB
% 3.34/0.78 % (2970207)Instructions burned: 714 (million)
% 3.34/0.78 % (2970219)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2089483981:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.34/0.78 % (2970219) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2970188-2970219"...
% 3.34/0.78 % (2970219)...printing done.
% 3.34/0.78 % (2970219)Refutation found. Thanks to Tanya!
% 3.34/0.78 % SZS status Theorem for theBenchmark
% 3.34/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 3.34/0.78 % (2970219)------------------------------
% 3.34/0.78 % (2970219)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.34/0.78 % (2970219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/0.78 % (2970219)CaDiCaL version: 2.1.3
% 3.34/0.78 % (2970219)Termination reason: Refutation
% 3.34/0.78 % (2970219)Time elapsed: 0.050 s
% 3.34/0.78 % (2970219)Peak memory usage: 13 MB
% 3.34/0.78 % (2970219)Instructions burned: 75 (million)
% 3.34/0.78 % (2970188)Success in time 0.559 s
% 3.34/0.78 % Vampire exiting
%------------------------------------------------------------------------------