%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV487+3 : 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 : n010.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 1.88s 0.50s
% Output : Refutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of formulae : 102 ( 30 unt; 5 def)
% Number of atoms : 319 ( 70 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 368 ( 151 ~; 143 |; 51 &)
% ( 7 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn 117 !; 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(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(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/sandbox2/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/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 ) )
& ! [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/sandbox2/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/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_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] :
( 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(f19,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(f20,plain,
! [X0,X1,X2,X3] :
( int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_less(X0,X1)
| ~ int_leq(X2,X3) ),
inference(flattening,[],[f19]) ).
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] :
( 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(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] :
( 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,[],[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(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(f41,plain,
! [X2,X3,X0,X1] :
( ~ int_less(X0,X1)
| int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_leq(X2,X3) ),
inference(cnf_transformation,[],[f20]) ).
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(f50,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(f51,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f31]) ).
fof(f52,plain,
int_less(sK2,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
int_leq(int_one,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
real_zero != a(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f55,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f33]) ).
fof(f58,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,[],[f50]) ).
fof(f60,definition,
sF3 = a(sK1,sK2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f61,plain,
a(sK1,sK2) = sF3,
inference(reorient_equations,[],[f60]) ).
fof(f62,plain,
real_zero != sF3,
inference(definition_folding,[],[f54,f61]) ).
fof(f70,plain,
int_leq(sK2,sK1),
inference(resolution,[],[f34,f52]) ).
fof(f76,plain,
int_less(int_zero,sK2),
inference(resolution,[],[f46,f53]) ).
fof(f83,plain,
! [X0] : plus(int_zero,X0) = X0,
inference(superposition,[],[f40,f39]) ).
fof(f84,plain,
int_less(int_zero,sK0(sK2,sK1)),
inference(resolution,[],[f42,f52]) ).
fof(f86,plain,
int_less(int_zero,sK0(int_zero,sK2)),
inference(resolution,[],[f42,f76]) ).
fof(f96,plain,
int_leq(int_one,sK0(int_zero,sK2)),
inference(resolution,[],[f86,f45]) ).
fof(f103,plain,
( n = sK1
| int_less(sK1,n) ),
inference(resolution,[],[f32,f51]) ).
fof(f106,definition,
( spl4_3
<=> int_less(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f108,plain,
( int_less(sK1,n)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f110,definition,
( spl4_4
<=> n = sK1 ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f112,plain,
( n = sK1
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f113,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f103,f110,f106]) ).
fof(f131,plain,
! [X0] :
( ~ int_less(X0,sK2)
| int_less(X0,sK1) ),
inference(resolution,[],[f35,f52]) ).
fof(f137,plain,
sK2 = plus(int_zero,sK0(int_zero,sK2)),
inference(resolution,[],[f43,f76]) ).
fof(f142,plain,
sK1 = plus(sK2,sK0(sK2,sK1)),
inference(resolution,[],[f43,f52]) ).
fof(f145,plain,
sK2 = sK0(int_zero,sK2),
inference(forward_demodulation,[],[f137,f83]) ).
fof(f165,plain,
! [X0,X1] :
( int_leq(plus(sK2,X0),plus(sK1,X1))
| ~ int_leq(X0,X1) ),
inference(resolution,[],[f41,f52]) ).
fof(f238,plain,
int_less(int_zero,sK1),
inference(resolution,[],[f131,f76]) ).
fof(f241,plain,
int_leq(int_one,sK1),
inference(resolution,[],[f238,f45]) ).
fof(f250,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,[],[f58,f142]) ).
fof(f258,plain,
! [X0] :
( int_leq(sK2,plus(sK1,X0))
| ~ int_leq(int_zero,X0) ),
inference(superposition,[],[f165,f40]) ).
fof(f273,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,[],[f250,f51]) ).
fof(f275,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,[],[f273,f84]) ).
fof(f277,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,[],[f275,f241]) ).
fof(f279,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,[],[f277,f53]) ).
fof(f282,definition,
( spl4_14
<=> int_leq(sK2,n) ),
introduced(definition,[new_symbols(definition,[spl4_14])],[avatar_definition]) ).
fof(f286,definition,
( spl4_15
<=> ! [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_15])],[avatar_definition]) ).
fof(f287,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| ~ int_leq(X0,sK2) )
| ~ spl4_15 ),
inference(avatar_component_clause,[],[f286]) ).
fof(f288,plain,
( ~ spl4_14
| spl4_15 ),
inference(avatar_split_clause,[],[f279,f286,f282]) ).
fof(f568,plain,
( int_leq(sK2,n)
| ~ spl4_4 ),
inference(superposition,[],[f70,f112]) ).
fof(f693,plain,
( n = plus(sK1,sK0(sK1,n))
| ~ spl4_3 ),
inference(resolution,[],[f108,f43]) ).
fof(f695,plain,
( int_less(int_zero,sK0(sK1,n))
| ~ spl4_3 ),
inference(resolution,[],[f108,f42]) ).
fof(f707,plain,
( int_leq(int_zero,sK0(sK1,n))
| ~ spl4_3 ),
inference(resolution,[],[f695,f34]) ).
fof(f1137,plain,
( int_leq(sK2,n)
| ~ int_leq(int_zero,sK0(sK1,n))
| ~ spl4_3 ),
inference(superposition,[],[f258,f693]) ).
fof(f1143,plain,
( int_leq(sK2,n)
| ~ spl4_3 ),
inference(forward_subsumption_resolution,[],[f1137,f707]) ).
fof(f1509,plain,
( real_zero = a(plus(sK0(int_zero,sK2),sK0(sK2,sK1)),sK0(int_zero,sK2))
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_15 ),
inference(resolution,[],[f287,f96]) ).
fof(f1536,plain,
( real_zero = a(plus(sK2,sK0(sK2,sK1)),sK2)
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_15 ),
inference(forward_demodulation,[],[f1509,f145]) ).
fof(f1720,plain,
( spl4_14
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f568,f110,f282]) ).
fof(f1844,plain,
( real_zero = a(sK1,sK2)
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_15 ),
inference(forward_demodulation,[],[f1536,f142]) ).
fof(f1899,plain,
( real_zero = sF3
| ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_15 ),
inference(forward_demodulation,[],[f1844,f61]) ).
fof(f1950,plain,
( ~ int_leq(sK0(int_zero,sK2),sK2)
| ~ spl4_15 ),
inference(forward_subsumption_resolution,[],[f1899,f62]) ).
fof(f1963,plain,
( ~ int_leq(sK2,sK2)
| ~ spl4_15 ),
inference(forward_demodulation,[],[f1950,f145]) ).
fof(f1965,plain,
( $false
| ~ spl4_15 ),
inference(forward_subsumption_resolution,[],[f1963,f55]) ).
fof(f1966,plain,
~ spl4_15,
inference(avatar_contradiction_clause,[],[f1965]) ).
fof(f1967,plain,
( spl4_14
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f1143,f106,f282]) ).
cnf(s2,plain,
( spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f113]) ).
cnf(s12,plain,
( ~ spl4_14
| spl4_15 ),
inference(sat_conversion,[],[f288]) ).
cnf(s59,plain,
( ~ spl4_4
| spl4_14 ),
inference(sat_conversion,[],[f1720]) ).
cnf(s68,plain,
~ spl4_15,
inference(sat_conversion,[],[f1966]) ).
cnf(s69,plain,
( ~ spl4_3
| spl4_14 ),
inference(sat_conversion,[],[f1967]) ).
cnf(s78,plain,
~ spl4_14,
inference(rat,[],[s12,s68]) ).
cnf(s81,plain,
~ spl4_3,
inference(rat,[],[s69,s78]) ).
cnf(s82,plain,
~ spl4_4,
inference(rat,[],[s59,s78]) ).
cnf(s84,plain,
$false,
inference(rat,[],[s2,s82,s81]) ).
fof(f2010,plain,
$false,
inference(avatar_sat_refutation,[],[s84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV487+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16 % Computer : n010.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 11:14:22 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 Running first-order model finding
% 0.10/0.20 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
% 1.88/0.50 % (1857105)Will run a generic schedule for satisfiability detection.
% 1.88/0.50 % (1857113)dis+10_1_sil=32000:sp=arity:random_seed=1213211581:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.88/0.50 % (1857111)% WARNING: option uhcvi not known.
% 1.88/0.50 % (1857111)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2747796204:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.88/0.50 % (1857110)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=251701005_2999 on theBenchmark for (2999ds/0Mi)
% 1.88/0.50 % (1857112)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1487837659:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.88/0.50 % (1857114)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2855625447:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.88/0.50 % (1857115)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=877508242:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.88/0.50 % (1857116)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4018201903:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.88/0.50 % TRYING [1]
% 1.88/0.50 % TRYING [2]
% 1.88/0.50 % TRYING [3]
% 1.88/0.50 % TRYING [4]
% 1.88/0.50 % TRYING [5]
% 1.88/0.50 % TRYING [6]
% 1.88/0.50 % (1857113)Instruction limit reached!
% 1.88/0.50 % (1857113)------------------------------
% 1.88/0.50 % (1857113)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857113)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857113)Termination reason: Instruction limit
% 1.88/0.50 % (1857113)Termination phase: Saturation
% 1.88/0.50 % (1857113)Time elapsed: 0.036 s
% 1.88/0.50 % (1857113)Peak memory usage: 12 MB
% 1.88/0.50 % (1857113)Instructions burned: 106 (million)
% 1.88/0.50 % TRYING [7]
% 1.88/0.50 % (1857124)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=451711836:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.88/0.50 % TRYING [1]
% 1.88/0.50 % TRYING [2]
% 1.88/0.50 % TRYING [3]
% 1.88/0.50 % TRYING [4]
% 1.88/0.50 % TRYING [5]
% 1.88/0.50 % TRYING [6]
% 1.88/0.50 % TRYING [7]
% 1.88/0.50 % TRYING [8]
% 1.88/0.50 % (1857114)Instruction limit reached!
% 1.88/0.50 % (1857114)------------------------------
% 1.88/0.50 % (1857114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857114)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857114)Termination reason: Instruction limit
% 1.88/0.50 % (1857114)Termination phase: Saturation
% 1.88/0.50 % (1857114)Time elapsed: 0.073 s
% 1.88/0.50 % (1857114)Peak memory usage: 12 MB
% 1.88/0.50 % (1857114)Instructions burned: 117 (million)
% 1.88/0.50 % (1857115)Instruction limit reached!
% 1.88/0.50 % (1857115)------------------------------
% 1.88/0.50 % (1857115)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857115)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857115)Termination reason: Instruction limit
% 1.88/0.50 % (1857115)Termination phase: Saturation
% 1.88/0.50 % (1857115)Time elapsed: 0.080 s
% 1.88/0.50 % (1857115)Peak memory usage: 12 MB
% 1.88/0.50 % (1857115)Instructions burned: 131 (million)
% 1.88/0.50 % (1857126)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=29488525:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.88/0.50 % (1857127)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=691468978:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.88/0.50 % (1857116)Instruction limit reached!
% 1.88/0.50 % (1857116)------------------------------
% 1.88/0.50 % (1857116)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857116)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857116)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857116)Termination reason: Instruction limit
% 1.88/0.50 % (1857116)Termination phase: Saturation
% 1.88/0.50 % (1857116)Time elapsed: 0.105 s
% 1.88/0.50 % (1857116)Peak memory usage: 14 MB
% 1.88/0.50 % (1857116)Instructions burned: 159 (million)
% 1.88/0.50 % TRYING [8]
% 1.88/0.50 % (1857130)ott-21_1_sil=16000:fs=off:random_seed=2924737316:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.88/0.50 % TRYING [9]
% 1.88/0.50 % (1857126)Instruction limit reached!
% 1.88/0.50 % (1857126)------------------------------
% 1.88/0.50 % (1857126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857126)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857126)Termination reason: Instruction limit
% 1.88/0.50 % (1857126)Termination phase: Saturation
% 1.88/0.50 % (1857126)Time elapsed: 0.089 s
% 1.88/0.50 % (1857126)Peak memory usage: 12 MB
% 1.88/0.50 % (1857126)Instructions burned: 131 (million)
% 1.88/0.50 % (1857132)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3093996309:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.88/0.50 % TRYING [9]
% 1.88/0.50 % (1857130)Instruction limit reached!
% 1.88/0.50 % (1857130)------------------------------
% 1.88/0.50 % (1857130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857130)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857130)Termination reason: Instruction limit
% 1.88/0.50 % (1857130)Termination phase: Saturation
% 1.88/0.50 % (1857130)Time elapsed: 0.091 s
% 1.88/0.50 % (1857130)Peak memory usage: 12 MB
% 1.88/0.50 % (1857130)Instructions burned: 181 (million)
% 1.88/0.50 % (1857124)Instruction limit reached!
% 1.88/0.50 % (1857124)------------------------------
% 1.88/0.50 % (1857124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857124)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857124)Termination reason: Instruction limit
% 1.88/0.50 % (1857124)Termination phase: Finite model building constraint generation
% 1.88/0.50 % (1857124)Time elapsed: 0.187 s
% 1.88/0.50 % (1857124)Peak memory usage: 19 MB
% 1.88/0.50 % (1857124)Instructions burned: 714 (million)
% 1.88/0.50 % (1857134)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2250919846:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.88/0.50 % (1857135)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=311169275:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.88/0.50 % TRYING [1]
% 1.88/0.50 % TRYING [2]
% 1.88/0.50 % TRYING [3]
% 1.88/0.50 % TRYING [4]
% 1.88/0.50 % TRYING [5]
% 1.88/0.50 % (1857135) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1857105-1857135"...
% 1.88/0.50 % (1857135)...printing done.
% 1.88/0.50 % (1857135)Refutation found. Thanks to Tanya!
% 1.88/0.50 % SZS status Theorem for theBenchmark
% 1.88/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 1.88/0.50 % (1857135)------------------------------
% 1.88/0.50 % (1857135)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.50 % (1857135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.50 % (1857135)CaDiCaL version: 2.1.3
% 1.88/0.50 % (1857135)Termination reason: Refutation
% 1.88/0.50 % (1857135)Time elapsed: 0.027 s
% 1.88/0.50 % (1857135)Peak memory usage: 13 MB
% 1.88/0.50 % (1857135)Instructions burned: 75 (million)
% 1.88/0.50 % (1857105)Success in time 0.296 s
% 1.88/0.50 % Vampire exiting
%------------------------------------------------------------------------------