%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV486+2 : 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 : n016.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.64s 0.56s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 95 ( 23 unt; 5 def)
% Number of atoms : 311 ( 65 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 363 ( 147 ~; 142 |; 51 &)
% ( 7 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn 112 !; 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(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) = lu(plus(X3,X2),X3) ) )
& ! [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',qil) ).
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/sandbox2/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) = lu(plus(X3,X2),X3) ) )
& ! [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) = lu(plus(X3,X2),X3)
| ~ 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) = lu(plus(X3,X2),X3)
| ~ 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,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,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,sK1)
& int_less(sK1,sK2)
& int_leq(sK2,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(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(f48,plain,
! [X0,X1,X6,X5] :
( 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(cnf_transformation,[],[f22]) ).
fof(f51,plain,
int_leq(sK2,n),
inference(cnf_transformation,[],[f31]) ).
fof(f52,plain,
int_less(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
int_leq(int_one,sK1),
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(f59,plain,
! [X0,X6,X5] :
( ~ int_leq(plus(X0,X5),n)
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0)
| ~ int_less(int_zero,X5)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,plus(X0,X5))
| real_zero = a(X6,plus(X6,X5)) ),
inference(equality_resolution,[],[f48]) ).
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(sK1,sK2),
inference(resolution,[],[f34,f52]) ).
fof(f76,plain,
int_less(int_zero,sK1),
inference(resolution,[],[f46,f53]) ).
fof(f84,plain,
int_less(int_zero,sK0(sK1,sK2)),
inference(resolution,[],[f42,f52]) ).
fof(f104,plain,
( n = sK2
| int_less(sK2,n) ),
inference(resolution,[],[f32,f51]) ).
fof(f106,definition,
( spl4_3
<=> int_less(sK2,n) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f108,plain,
( int_less(sK2,n)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f110,definition,
( spl4_4
<=> n = sK2 ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f112,plain,
( n = sK2
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f113,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f104,f110,f106]) ).
fof(f130,plain,
! [X0] :
( ~ int_less(X0,sK1)
| int_less(X0,sK2) ),
inference(resolution,[],[f35,f52]) ).
fof(f141,plain,
sK2 = plus(sK1,sK0(sK1,sK2)),
inference(resolution,[],[f43,f52]) ).
fof(f164,plain,
! [X0,X1] :
( int_leq(plus(sK1,X0),plus(sK2,X1))
| ~ int_leq(X0,X1) ),
inference(resolution,[],[f41,f52]) ).
fof(f238,plain,
int_less(int_zero,sK2),
inference(resolution,[],[f130,f76]) ).
fof(f241,plain,
int_leq(int_one,sK2),
inference(resolution,[],[f238,f45]) ).
fof(f250,plain,
! [X0] :
( ~ int_leq(sK2,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(superposition,[],[f59,f141]) ).
fof(f258,plain,
! [X0] :
( int_leq(sK1,plus(sK2,X0))
| ~ int_leq(int_zero,X0) ),
inference(superposition,[],[f164,f40]) ).
fof(f273,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(forward_subsumption_resolution,[],[f250,f51]) ).
fof(f275,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(forward_subsumption_resolution,[],[f273,f84]) ).
fof(f277,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(forward_subsumption_resolution,[],[f275,f53]) ).
fof(f279,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_leq(sK1,n)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(forward_subsumption_resolution,[],[f277,f241]) ).
fof(f282,definition,
( spl4_14
<=> int_leq(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl4_14])],[avatar_definition]) ).
fof(f284,plain,
( ~ int_leq(sK1,n)
| spl4_14 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f286,definition,
( spl4_15
<=> ! [X0] :
( ~ int_leq(int_one,X0)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| ~ int_leq(X0,sK1) ) ),
introduced(definition,[new_symbols(definition,[spl4_15])],[avatar_definition]) ).
fof(f287,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| ~ int_leq(X0,sK1) )
| ~ 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(sK1,n)
| ~ spl4_4 ),
inference(superposition,[],[f70,f112]) ).
fof(f1520,plain,
( real_zero = a(sK1,plus(sK1,sK0(sK1,sK2)))
| ~ int_leq(sK1,sK1)
| ~ spl4_15 ),
inference(resolution,[],[f287,f53]) ).
fof(f1539,plain,
( real_zero = a(sK1,plus(sK1,sK0(sK1,sK2)))
| ~ spl4_15 ),
inference(forward_subsumption_resolution,[],[f1520,f55]) ).
fof(f1555,plain,
( real_zero = a(sK1,sK2)
| ~ spl4_15 ),
inference(forward_demodulation,[],[f1539,f141]) ).
fof(f1791,plain,
( spl4_14
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f568,f110,f282]) ).
fof(f2127,plain,
( n = plus(sK2,sK0(sK2,n))
| ~ spl4_3 ),
inference(resolution,[],[f108,f43]) ).
fof(f2129,plain,
( int_less(int_zero,sK0(sK2,n))
| ~ spl4_3 ),
inference(resolution,[],[f108,f42]) ).
fof(f2190,plain,
( int_leq(int_zero,sK0(sK2,n))
| ~ spl4_3 ),
inference(resolution,[],[f2129,f34]) ).
fof(f2266,plain,
( int_leq(sK1,n)
| ~ int_leq(int_zero,sK0(sK2,n))
| ~ spl4_3 ),
inference(superposition,[],[f258,f2127]) ).
fof(f2320,plain,
( real_zero = sF3
| ~ spl4_15 ),
inference(superposition,[],[f1555,f61]) ).
fof(f2324,plain,
( $false
| ~ spl4_15 ),
inference(forward_subsumption_resolution,[],[f2320,f62]) ).
fof(f2325,plain,
~ spl4_15,
inference(avatar_contradiction_clause,[],[f2324]) ).
fof(f2339,plain,
( ~ int_leq(int_zero,sK0(sK2,n))
| ~ spl4_3
| spl4_14 ),
inference(forward_subsumption_resolution,[],[f2266,f284]) ).
fof(f2342,plain,
( $false
| ~ spl4_3
| spl4_14 ),
inference(forward_subsumption_resolution,[],[f2339,f2190]) ).
fof(f2343,plain,
( ~ spl4_3
| spl4_14 ),
inference(avatar_contradiction_clause,[],[f2342]) ).
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,[],[f1791]) ).
cnf(s73,plain,
~ spl4_15,
inference(sat_conversion,[],[f2325]) ).
cnf(s81,plain,
( ~ spl4_3
| spl4_14 ),
inference(sat_conversion,[],[f2343]) ).
cnf(s82,plain,
~ spl4_14,
inference(rat,[],[s12,s73]) ).
cnf(s83,plain,
~ spl4_3,
inference(rat,[],[s81,s82]) ).
cnf(s86,plain,
~ spl4_4,
inference(rat,[],[s59,s82]) ).
cnf(s88,plain,
$false,
inference(rat,[],[s2,s86,s83]) ).
fof(f2344,plain,
$false,
inference(avatar_sat_refutation,[],[s88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV486+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n016.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 11:19:03 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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
% 1.64/0.56 % (3563319)Will run a generic schedule for satisfiability detection.
% 1.64/0.56 % (3563334)dis+10_1_sil=32000:sp=arity:random_seed=1474367296:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.64/0.56 % (3563332)% WARNING: option uhcvi not known.
% 1.64/0.56 % (3563331)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=257257460_2999 on theBenchmark for (2999ds/0Mi)
% 1.64/0.56 % (3563332)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=653208436:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.64/0.56 % (3563333)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1461531332:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.64/0.56 % (3563337)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=929625216:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.64/0.56 % (3563336)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3278697153:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.64/0.56 % (3563338)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=513860373:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.64/0.56 % TRYING [1]
% 1.64/0.56 % TRYING [2]
% 1.64/0.56 % TRYING [3]
% 1.64/0.56 % TRYING [4]
% 1.64/0.56 % TRYING [5]
% 1.64/0.56 % TRYING [6]
% 1.64/0.56 % (3563334)Instruction limit reached!
% 1.64/0.56 % (3563334)------------------------------
% 1.64/0.56 % (3563334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563334)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563334)Termination reason: Instruction limit
% 1.64/0.56 % (3563334)Termination phase: Saturation
% 1.64/0.56 % (3563334)Time elapsed: 0.037 s
% 1.64/0.56 % (3563334)Peak memory usage: 12 MB
% 1.64/0.56 % (3563334)Instructions burned: 105 (million)
% 1.64/0.56 % (3563359)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2444775640:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.64/0.56 % TRYING [1]
% 1.64/0.56 % TRYING [2]
% 1.64/0.56 % TRYING [7]
% 1.64/0.56 % TRYING [3]
% 1.64/0.56 % TRYING [4]
% 1.64/0.56 % TRYING [5]
% 1.64/0.56 % TRYING [6]
% 1.64/0.56 % TRYING [7]
% 1.64/0.56 % (3563336)Instruction limit reached!
% 1.64/0.56 % (3563336)------------------------------
% 1.64/0.56 % (3563336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563336)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563336)Termination reason: Instruction limit
% 1.64/0.56 % (3563336)Termination phase: Saturation
% 1.64/0.56 % (3563336)Time elapsed: 0.073 s
% 1.64/0.56 % (3563336)Peak memory usage: 12 MB
% 1.64/0.56 % (3563336)Instructions burned: 117 (million)
% 1.64/0.56 % (3563337)Instruction limit reached!
% 1.64/0.56 % (3563337)------------------------------
% 1.64/0.56 % (3563337)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563337)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563337)Termination reason: Instruction limit
% 1.64/0.56 % (3563337)Termination phase: Saturation
% 1.64/0.56 % (3563337)Time elapsed: 0.083 s
% 1.64/0.56 % (3563337)Peak memory usage: 12 MB
% 1.64/0.56 % (3563337)Instructions burned: 131 (million)
% 1.64/0.56 % TRYING [8]
% 1.64/0.56 % (3563380)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3664110811:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.64/0.56 % (3563385)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=1021130739:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.64/0.56 % (3563338)Instruction limit reached!
% 1.64/0.56 % (3563338)------------------------------
% 1.64/0.56 % (3563338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563338)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563338)Termination reason: Instruction limit
% 1.64/0.56 % (3563338)Termination phase: Saturation
% 1.64/0.56 % (3563338)Time elapsed: 0.111 s
% 1.64/0.56 % (3563338)Peak memory usage: 13 MB
% 1.64/0.56 % (3563338)Instructions burned: 160 (million)
% 1.64/0.56 % TRYING [8]
% 1.64/0.56 % (3563404)ott-21_1_sil=16000:fs=off:random_seed=2894864705:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.64/0.56 % (3563380)Instruction limit reached!
% 1.64/0.56 % (3563380)------------------------------
% 1.64/0.56 % (3563380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563380)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563380)Termination reason: Instruction limit
% 1.64/0.56 % (3563380)Termination phase: Saturation
% 1.64/0.56 % (3563380)Time elapsed: 0.093 s
% 1.64/0.56 % (3563380)Peak memory usage: 13 MB
% 1.64/0.56 % (3563380)Instructions burned: 132 (million)
% 1.64/0.56 % TRYING [9]
% 1.64/0.56 % (3563424)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=755369202:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.64/0.56 % (3563404)Instruction limit reached!
% 1.64/0.56 % (3563404)------------------------------
% 1.64/0.56 % (3563404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563404)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563404)Termination reason: Instruction limit
% 1.64/0.56 % (3563404)Termination phase: Saturation
% 1.64/0.56 % (3563404)Time elapsed: 0.102 s
% 1.64/0.56 % (3563404)Peak memory usage: 12 MB
% 1.64/0.56 % (3563404)Instructions burned: 180 (million)
% 1.64/0.56 % (3563359)Instruction limit reached!
% 1.64/0.56 % (3563359)------------------------------
% 1.64/0.56 % (3563359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563359)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563359)Termination reason: Instruction limit
% 1.64/0.56 % (3563359)Termination phase: Finite model building SAT solving
% 1.64/0.56 % (3563359)Time elapsed: 0.200 s
% 1.64/0.56 % (3563359)Peak memory usage: 21 MB
% 1.64/0.56 % (3563359)Instructions burned: 715 (million)
% 1.64/0.56 % (3563432)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3060231510:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.64/0.56 % (3563431)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1693005258:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.64/0.56 % TRYING [1]
% 1.64/0.56 % TRYING [2]
% 1.64/0.56 % TRYING [3]
% 1.64/0.56 % TRYING [4]
% 1.64/0.56 % TRYING [5]
% 1.64/0.56 % (3563432) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3563319-3563432"...
% 1.64/0.56 % (3563432)...printing done.
% 1.64/0.56 % (3563432)Refutation found. Thanks to Tanya!
% 1.64/0.56 % SZS status Theorem for theBenchmark
% 1.64/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.64/0.56 % (3563432)------------------------------
% 1.64/0.56 % (3563432)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.64/0.56 % (3563432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/0.56 % (3563432)CaDiCaL version: 2.1.3
% 1.64/0.56 % (3563432)Termination reason: Refutation
% 1.64/0.56 % (3563432)Time elapsed: 0.032 s
% 1.64/0.56 % (3563432)Peak memory usage: 13 MB
% 1.64/0.56 % (3563432)Instructions burned: 91 (million)
% 1.64/0.56 % (3563319)Success in time 0.328 s
% 1.64/0.56 % Vampire exiting
%------------------------------------------------------------------------------