%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV486+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.68s 0.54s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 114 ( 21 unt; 7 def)
% Number of atoms : 341 ( 52 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 373 ( 146 ~; 165 |; 36 &)
% ( 10 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn 114 !; 5 ?)
% 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(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,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) = 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(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] :
( 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,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] :
( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( X0 != X1
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f27,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
! [X0,X1] :
( int_leq(X1,X0)
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f35,plain,
! [X0,X1] :
( int_less(int_zero,sK0(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0,X1] :
( plus(X0,sK0(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f38,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f39,plain,
! [X0] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f42,plain,
! [X0,X1,X6,X5] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| plus(X0,X5) != X1
| ~ int_less(int_zero,X5)
| ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f44,plain,
int_leq(sK2,n),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
int_less(sK1,sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f46,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f24]) ).
fof(f47,plain,
real_zero != a(sK1,sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f48,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f26]) ).
fof(f49,plain,
! [X1] : ~ int_less(X1,X1),
inference(equality_resolution,[],[f29]) ).
fof(f51,plain,
! [X0,X6,X5] :
( ~ int_leq(plus(X0,X5),n)
| ~ int_leq(int_one,plus(X0,X5))
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,X5)
| ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) ),
inference(equality_resolution,[],[f42]) ).
fof(f53,plain,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f27]) ).
fof(f54,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f55,plain,
! [X2,X0,X1] :
( ~ int_less(X0,X2)
| int_less(X0,X1)
| int_less(X1,X2) ),
inference(consistent_polarity_flipping,[],[f28]) ).
fof(f56,plain,
! [X1] : int_less(X1,X1),
inference(consistent_polarity_flipping,[],[f49]) ).
fof(f57,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X1,X0) ),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f61,plain,
! [X0,X1] :
( int_less(X0,X1)
| plus(X0,sK0(X0,X1)) = X1 ),
inference(consistent_polarity_flipping,[],[f36]) ).
fof(f62,plain,
! [X0,X1] :
( ~ int_less(int_zero,sK0(X0,X1))
| int_less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f35]) ).
fof(f63,plain,
! [X0] :
( int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(consistent_polarity_flipping,[],[f39]) ).
fof(f64,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(consistent_polarity_flipping,[],[f38]) ).
fof(f65,plain,
! [X0,X6,X5] :
( ~ int_leq(int_one,X6)
| ~ int_leq(int_one,plus(X0,X5))
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| int_less(int_zero,X5)
| ~ int_leq(X6,X0)
| ~ int_leq(plus(X0,X5),n)
| real_zero = a(X6,plus(X6,X5)) ),
inference(consistent_polarity_flipping,[],[f51]) ).
fof(f67,plain,
~ int_less(sK1,sK2),
inference(consistent_polarity_flipping,[],[f45]) ).
fof(f75,plain,
int_leq(sK1,sK2),
inference(resolution,[],[f53,f67]) ).
fof(f98,plain,
! [X0,X1] :
( int_less(X0,X1)
| int_less(X1,X0) ),
inference(resolution,[],[f55,f56]) ).
fof(f99,plain,
! [X2,X0,X1] :
( int_less(X0,X1)
| int_less(X1,X2)
| int_leq(X0,X2) ),
inference(resolution,[],[f55,f53]) ).
fof(f100,plain,
! [X0,X1] :
( int_less(int_zero,X0)
| int_less(X0,X1)
| int_leq(int_one,X1) ),
inference(resolution,[],[f55,f63]) ).
fof(f101,plain,
sK2 = plus(sK1,sK0(sK1,sK2)),
inference(resolution,[],[f61,f67]) ).
fof(f127,definition,
( spl3_5
<=> int_leq(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f129,plain,
( ~ int_leq(sK1,n)
| spl3_5 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f134,plain,
! [X0,X1] :
( ~ int_leq(sK1,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| int_less(int_zero,X1)
| ~ int_leq(int_one,plus(X0,X1))
| ~ int_leq(plus(X0,X1),n)
| real_zero = a(sK1,plus(sK1,X1)) ),
inference(resolution,[],[f65,f46]) ).
fof(f156,plain,
! [X0] :
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| int_less(int_zero,X0)
| ~ int_leq(int_one,plus(sK1,X0))
| ~ int_leq(plus(sK1,X0),n)
| real_zero = a(sK1,plus(sK1,X0)) ),
inference(resolution,[],[f134,f48]) ).
fof(f162,definition,
( spl3_8
<=> int_leq(int_one,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_8])],[avatar_definition]) ).
fof(f163,plain,
( int_leq(int_one,sK2)
| ~ spl3_8 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f291,definition,
( spl3_10
<=> int_less(int_zero,sK1) ),
introduced(definition,[new_symbols(definition,[spl3_10])],[avatar_definition]) ).
fof(f293,plain,
( int_less(int_zero,sK1)
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f351,plain,
! [X0] :
( int_less(X0,sK1)
| int_leq(X0,sK2) ),
inference(resolution,[],[f99,f67]) ).
fof(f367,plain,
( int_less(int_zero,sK1)
| int_leq(int_one,sK2) ),
inference(resolution,[],[f100,f67]) ).
fof(f372,plain,
( spl3_8
| spl3_10 ),
inference(avatar_split_clause,[],[f367,f291,f162]) ).
fof(f374,definition,
( spl3_14
<=> int_less(int_zero,sK0(sK1,sK2)) ),
introduced(definition,[new_symbols(definition,[spl3_14])],[avatar_definition]) ).
fof(f376,plain,
( int_less(int_zero,sK0(sK1,sK2))
| ~ spl3_14 ),
inference(avatar_component_clause,[],[f374]) ).
fof(f482,definition,
( spl3_16
<=> n = sK2 ),
introduced(definition,[new_symbols(definition,[spl3_16])],[avatar_definition]) ).
fof(f483,plain,
( n != sK2
| spl3_16 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f484,plain,
( n = sK2
| ~ spl3_16 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f520,plain,
! [X0] :
( ~ int_leq(sK1,n)
| int_less(int_zero,X0)
| ~ int_leq(int_one,plus(sK1,X0))
| ~ int_leq(plus(sK1,X0),n)
| real_zero = a(sK1,plus(sK1,X0)) ),
inference(forward_subsumption_resolution,[],[f156,f46]) ).
fof(f523,definition,
( spl3_24
<=> ! [X0] :
( int_less(int_zero,X0)
| real_zero = a(sK1,plus(sK1,X0))
| ~ int_leq(plus(sK1,X0),n)
| ~ int_leq(int_one,plus(sK1,X0)) ) ),
introduced(definition,[new_symbols(definition,[spl3_24])],[avatar_definition]) ).
fof(f524,plain,
( ! [X0] :
( ~ int_leq(plus(sK1,X0),n)
| real_zero = a(sK1,plus(sK1,X0))
| int_less(int_zero,X0)
| ~ int_leq(int_one,plus(sK1,X0)) )
| ~ spl3_24 ),
inference(avatar_component_clause,[],[f523]) ).
fof(f525,plain,
( spl3_24
| ~ spl3_5 ),
inference(avatar_split_clause,[],[f520,f127,f523]) ).
fof(f584,plain,
( ~ int_leq(int_one,sK1)
| ~ spl3_10 ),
inference(resolution,[],[f293,f64]) ).
fof(f597,plain,
( $false
| ~ spl3_10 ),
inference(forward_subsumption_resolution,[],[f584,f46]) ).
fof(f598,plain,
~ spl3_10,
inference(avatar_contradiction_clause,[],[f597]) ).
fof(f649,plain,
! [X0] :
( int_leq(X0,sK2)
| int_leq(sK1,X0) ),
inference(resolution,[],[f351,f57]) ).
fof(f672,definition,
( spl3_33
<=> int_less(sK2,n) ),
introduced(definition,[new_symbols(definition,[spl3_33])],[avatar_definition]) ).
fof(f673,plain,
( int_less(sK2,n)
| ~ spl3_33 ),
inference(avatar_component_clause,[],[f672]) ).
fof(f674,plain,
( ~ int_less(sK2,n)
| spl3_33 ),
inference(avatar_component_clause,[],[f672]) ).
fof(f720,plain,
( int_less(n,sK2)
| spl3_33 ),
inference(resolution,[],[f674,f98]) ).
fof(f795,plain,
( int_leq(sK1,n)
| ~ spl3_16 ),
inference(superposition,[],[f75,f484]) ).
fof(f815,plain,
( spl3_5
| ~ spl3_16 ),
inference(avatar_split_clause,[],[f795,f482,f127]) ).
fof(f964,plain,
( ~ int_leq(sK2,n)
| real_zero = a(sK1,sK2)
| int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,sK2)
| ~ spl3_24 ),
inference(superposition,[],[f524,f101]) ).
fof(f970,plain,
( real_zero = a(sK1,sK2)
| int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,sK2)
| ~ spl3_24 ),
inference(forward_subsumption_resolution,[],[f964,f44]) ).
fof(f972,plain,
( int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,sK2)
| ~ spl3_24 ),
inference(forward_subsumption_resolution,[],[f970,f47]) ).
fof(f982,plain,
( int_less(int_zero,sK0(sK1,sK2))
| ~ spl3_8
| ~ spl3_24 ),
inference(forward_subsumption_resolution,[],[f972,f163]) ).
fof(f983,plain,
( spl3_14
| ~ spl3_8
| ~ spl3_24 ),
inference(avatar_split_clause,[],[f982,f523,f162,f374]) ).
fof(f985,plain,
( n = sK2
| ~ int_leq(sK2,n)
| ~ spl3_33 ),
inference(resolution,[],[f673,f54]) ).
fof(f987,plain,
( ~ int_leq(sK2,n)
| spl3_16
| ~ spl3_33 ),
inference(forward_subsumption_resolution,[],[f985,f483]) ).
fof(f988,plain,
( $false
| spl3_16
| ~ spl3_33 ),
inference(forward_subsumption_resolution,[],[f987,f44]) ).
fof(f989,plain,
( spl3_16
| ~ spl3_33 ),
inference(avatar_contradiction_clause,[],[f988]) ).
fof(f1077,plain,
( n = sK2
| ~ int_leq(n,sK2)
| spl3_33 ),
inference(resolution,[],[f720,f54]) ).
fof(f1079,plain,
( ~ int_leq(n,sK2)
| spl3_16
| spl3_33 ),
inference(forward_subsumption_resolution,[],[f1077,f483]) ).
fof(f5242,plain,
( int_less(sK1,sK2)
| ~ spl3_14 ),
inference(resolution,[],[f376,f62]) ).
fof(f5258,plain,
( $false
| ~ spl3_14 ),
inference(forward_subsumption_resolution,[],[f5242,f67]) ).
fof(f5259,plain,
~ spl3_14,
inference(avatar_contradiction_clause,[],[f5258]) ).
fof(f9295,plain,
( int_leq(n,sK2)
| spl3_5 ),
inference(resolution,[],[f649,f129]) ).
fof(f9345,plain,
( $false
| spl3_5
| spl3_16
| spl3_33 ),
inference(forward_subsumption_resolution,[],[f9295,f1079]) ).
fof(f9346,plain,
( spl3_5
| spl3_16
| spl3_33 ),
inference(avatar_contradiction_clause,[],[f9345]) ).
cnf(s9,plain,
( spl3_8
| spl3_10 ),
inference(sat_conversion,[],[f372]) ).
cnf(s17,plain,
( ~ spl3_5
| spl3_24 ),
inference(sat_conversion,[],[f525]) ).
cnf(s24,plain,
~ spl3_10,
inference(sat_conversion,[],[f598]) ).
cnf(s47,plain,
( spl3_5
| ~ spl3_16 ),
inference(sat_conversion,[],[f815]) ).
cnf(s74,plain,
( ~ spl3_8
| spl3_14
| ~ spl3_24 ),
inference(sat_conversion,[],[f983]) ).
cnf(s75,plain,
( spl3_16
| ~ spl3_33 ),
inference(sat_conversion,[],[f989]) ).
cnf(s516,plain,
~ spl3_14,
inference(sat_conversion,[],[f5259]) ).
cnf(s1196,plain,
( spl3_5
| spl3_16
| spl3_33 ),
inference(sat_conversion,[],[f9346]) ).
cnf(s1355,plain,
( ~ spl3_8
| ~ spl3_24 ),
inference(rat,[],[s74,s516]) ).
cnf(s1376,plain,
spl3_8,
inference(rat,[],[s9,s24]) ).
cnf(s1382,plain,
~ spl3_24,
inference(rat,[],[s1355,s1376]) ).
cnf(s1386,plain,
~ spl3_5,
inference(rat,[],[s17,s1382]) ).
cnf(s1390,plain,
~ spl3_16,
inference(rat,[],[s47,s1386]) ).
cnf(s1392,plain,
spl3_33,
inference(rat,[],[s1196,s1386,s1390]) ).
cnf(s1395,plain,
$false,
inference(rat,[],[s75,s1392,s1390]) ).
fof(f9376,plain,
$false,
inference(avatar_sat_refutation,[],[s1395]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV486+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n010.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 11:14:33 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.68/0.54 % (1857700)Will run a generic schedule for satisfiability detection.
% 1.68/0.54 % (1857711)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4263848866:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.68/0.54 % (1857706)% WARNING: option uhcvi not known.
% 1.68/0.54 % (1857706)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1300848944:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.68/0.54 % (1857705)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=568193371_2999 on theBenchmark for (2999ds/0Mi)
% 1.68/0.54 % (1857708)dis+10_1_sil=32000:sp=arity:random_seed=1221698271:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.68/0.54 % (1857707)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2933467391:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.68/0.54 % (1857709)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2205317755:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.68/0.54 % (1857710)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=564381966:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.68/0.54 % TRYING [1]
% 1.68/0.54 % TRYING [2]
% 1.68/0.54 % TRYING [3]
% 1.68/0.54 % TRYING [4]
% 1.68/0.54 % TRYING [5]
% 1.68/0.54 % TRYING [6]
% 1.68/0.54 % TRYING [7]
% 1.68/0.54 % (1857711)Instruction limit reached!
% 1.68/0.54 % (1857711)------------------------------
% 1.68/0.54 % (1857711)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857711)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857711)Termination reason: Instruction limit
% 1.68/0.54 % (1857711)Termination phase: Saturation
% 1.68/0.54 % (1857711)Time elapsed: 0.058 s
% 1.68/0.54 % (1857711)Peak memory usage: 14 MB
% 1.68/0.54 % (1857711)Instructions burned: 159 (million)
% 1.68/0.54 % (1857719)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=209769379:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.68/0.54 % TRYING [1]
% 1.68/0.54 % TRYING [2]
% 1.68/0.54 % TRYING [3]
% 1.68/0.54 % TRYING [4]
% 1.68/0.54 % TRYING [5]
% 1.68/0.54 % (1857708)Instruction limit reached!
% 1.68/0.54 % (1857708)------------------------------
% 1.68/0.54 % (1857708)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857708)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857708)Termination reason: Instruction limit
% 1.68/0.54 % (1857708)Termination phase: Saturation
% 1.68/0.54 % (1857708)Time elapsed: 0.067 s
% 1.68/0.54 % (1857708)Peak memory usage: 12 MB
% 1.68/0.54 % (1857708)Instructions burned: 104 (million)
% 1.68/0.54 % TRYING [8]
% 1.68/0.54 % TRYING [6]
% 1.68/0.54 % (1857709)Instruction limit reached!
% 1.68/0.54 % (1857709)------------------------------
% 1.68/0.54 % (1857709)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857709)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857709)Termination reason: Instruction limit
% 1.68/0.54 % (1857709)Termination phase: Saturation
% 1.68/0.54 % (1857709)Time elapsed: 0.073 s
% 1.68/0.54 % (1857709)Peak memory usage: 12 MB
% 1.68/0.54 % (1857709)Instructions burned: 117 (million)
% 1.68/0.54 % TRYING [7]
% 1.68/0.54 % (1857710)Instruction limit reached!
% 1.68/0.54 % (1857710)------------------------------
% 1.68/0.54 % (1857710)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857710)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857710)Termination reason: Instruction limit
% 1.68/0.54 % (1857710)Termination phase: Saturation
% 1.68/0.54 % (1857710)Time elapsed: 0.085 s
% 1.68/0.54 % (1857710)Peak memory usage: 12 MB
% 1.68/0.54 % (1857710)Instructions burned: 131 (million)
% 1.68/0.54 % (1857721)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=600184683:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.68/0.54 % (1857722)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=1844561949:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.68/0.54 % (1857724)ott-21_1_sil=16000:fs=off:random_seed=1042068133:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.68/0.54 % TRYING [8]
% 1.68/0.54 % TRYING [9]
% 1.68/0.54 % (1857721)Instruction limit reached!
% 1.68/0.54 % (1857721)------------------------------
% 1.68/0.54 % (1857721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857721)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857721)Termination reason: Instruction limit
% 1.68/0.54 % (1857721)Termination phase: Saturation
% 1.68/0.54 % (1857721)Time elapsed: 0.093 s
% 1.68/0.54 % (1857721)Peak memory usage: 12 MB
% 1.68/0.54 % (1857721)Instructions burned: 134 (million)
% 1.68/0.54 % (1857727)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3614462077:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.68/0.54 % (1857724)Instruction limit reached!
% 1.68/0.54 % (1857724)------------------------------
% 1.68/0.54 % (1857724)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857724)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857724)Termination reason: Instruction limit
% 1.68/0.54 % (1857724)Termination phase: Saturation
% 1.68/0.54 % (1857724)Time elapsed: 0.091 s
% 1.68/0.54 % (1857724)Peak memory usage: 12 MB
% 1.68/0.54 % (1857724)Instructions burned: 182 (million)
% 1.68/0.54 % (1857729)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1780681356:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.68/0.54 % TRYING [1]
% 1.68/0.54 % TRYING [2]
% 1.68/0.54 % TRYING [3]
% 1.68/0.54 % TRYING [4]
% 1.68/0.54 % TRYING [9]
% 1.68/0.54 % TRYING [5]
% 1.68/0.54 % (1857719)Instruction limit reached!
% 1.68/0.54 % (1857719)------------------------------
% 1.68/0.54 % (1857719)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857719)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857719)Termination reason: Instruction limit
% 1.68/0.54 % (1857719)Termination phase: Finite model building constraint generation
% 1.68/0.54 % (1857719)Time elapsed: 0.189 s
% 1.68/0.54 % (1857719)Peak memory usage: 18 MB
% 1.68/0.54 % (1857719)Instructions burned: 717 (million)
% 1.68/0.54 % TRYING [6]
% 1.68/0.54 % (1857731)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1256773136:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.68/0.54 % (1857706) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1857700-1857706"...
% 1.68/0.54 % (1857706)...printing done.
% 1.68/0.54 % (1857706)Refutation found. Thanks to Tanya!
% 1.68/0.54 % SZS status Theorem for theBenchmark
% 1.68/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.68/0.54 % (1857706)------------------------------
% 1.68/0.54 % (1857706)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.68/0.54 % (1857706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.68/0.54 % (1857706)CaDiCaL version: 2.1.3
% 1.68/0.54 % (1857706)Termination reason: Refutation
% 1.68/0.54 % (1857706)Time elapsed: 0.279 s
% 1.68/0.54 % (1857706)Peak memory usage: 16 MB
% 1.68/0.54 % (1857706)Instructions burned: 452 (million)
% 1.68/0.54 % (1857700)Success in time 0.32 s
% 1.68/0.54 % Vampire exiting
%------------------------------------------------------------------------------