%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV491+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 : n002.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:26 PM UTC 2026
% Result : Theorem 0.38s 0.37s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 22
% Syntax : Number of formulae : 172 ( 27 unt; 12 def)
% Number of atoms : 602 ( 110 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 654 ( 224 ~; 343 |; 50 &)
% ( 15 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 13 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 177 ( 0 sgn 172 !; 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(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(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',qih) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ( int_less(X0,X1)
=> a(X0,X1) = real_zero )
& ( int_less(X1,X0)
=> a(X0,X1) = real_zero )
& ( X0 = X1
=> a(X0,X1) = real_one ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diag) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ( int_less(X0,X1)
=> a(X0,X1) = real_zero )
& ( int_less(X1,X0)
=> a(X0,X1) = real_zero )
& ( X0 = X1
=> a(X0,X1) = real_one ) ) ),
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(f18,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
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_less(X0,X1) )
| ( real_zero != a(X0,X1)
& int_less(X1,X0) )
| ( real_one != a(X0,X1)
& X0 = X1 ) )
& int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) ),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
? [X0,X1] :
( ( ( real_zero != a(X0,X1)
& int_less(X0,X1) )
| ( real_zero != a(X0,X1)
& int_less(X1,X0) )
| ( real_one != a(X0,X1)
& X0 = X1 ) )
& int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,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(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(f32,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f33,plain,
! [X0] : plus(X0,int_zero) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f34,plain,
! [X2,X3,X0,X1] :
( ~ int_leq(X2,X3)
| ~ int_less(X0,X1)
| int_leq(plus(X0,X2),plus(X1,X3)) ),
inference(cnf_transformation,[],[f20]) ).
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] :
( ~ int_less(X0,X1)
| plus(X0,sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != 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(f41,plain,
! [X2,X3,X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| plus(X1,X2) != X0
| ~ int_less(int_zero,X2)
| ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| real_zero = a(plus(X3,X2),X3) ),
inference(cnf_transformation,[],[f22]) ).
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(f43,plain,
! [X0,X1,X4] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4)
| real_one = a(X4,X4) ),
inference(cnf_transformation,[],[f22]) ).
fof(f45,plain,
( sK1 = sK2
| real_zero != a(sK1,sK2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
( real_one != a(sK1,sK2)
| real_zero != a(sK1,sK2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f50,plain,
( real_one != a(sK1,sK2)
| int_less(sK2,sK1)
| int_less(sK1,sK2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f52,plain,
int_leq(sK2,n),
inference(cnf_transformation,[],[f24]) ).
fof(f53,plain,
int_leq(int_one,sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f54,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f24]) ).
fof(f55,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f24]) ).
fof(f56,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f26]) ).
fof(f57,plain,
! [X1] : ~ int_less(X1,X1),
inference(equality_resolution,[],[f29]) ).
fof(f58,plain,
! [X2,X0] :
( ~ int_less(int_zero,X2)
| int_less(X0,plus(X0,X2)) ),
inference(equality_resolution,[],[f37]) ).
fof(f59,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(f60,plain,
! [X2,X3,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(plus(X1,X2),n)
| ~ int_leq(int_one,plus(X1,X2))
| ~ int_less(int_zero,X2)
| ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| real_zero = a(plus(X3,X2),X3) ),
inference(equality_resolution,[],[f41]) ).
fof(f61,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| ~ int_leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f27]) ).
fof(f62,plain,
! [X1] : ~ int_leq(X1,X1),
inference(consistent_polarity_flipping,[],[f56]) ).
fof(f63,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| int_leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f64,plain,
! [X0,X1] :
( ~ int_leq(X1,X0)
| int_less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X2,X3)
| ~ int_leq(plus(X0,X2),plus(X1,X3)) ),
inference(consistent_polarity_flipping,[],[f34]) ).
fof(f66,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(consistent_polarity_flipping,[],[f39]) ).
fof(f67,plain,
! [X0] :
( int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(consistent_polarity_flipping,[],[f38]) ).
fof(f68,plain,
! [X0,X1,X4] :
( int_leq(X1,n)
| int_leq(int_one,X1)
| int_leq(X0,n)
| int_leq(int_one,X0)
| int_leq(X4,X1)
| int_leq(int_one,X4)
| real_one = a(X4,X4) ),
inference(consistent_polarity_flipping,[],[f43]) ).
fof(f69,plain,
! [X0,X6,X5] :
( ~ int_less(int_zero,X5)
| int_leq(int_one,plus(X0,X5))
| int_leq(X0,n)
| int_leq(int_one,X0)
| int_leq(plus(X0,X5),n)
| int_leq(X6,X0)
| int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) ),
inference(consistent_polarity_flipping,[],[f59]) ).
fof(f70,plain,
! [X2,X3,X1] :
( ~ int_less(int_zero,X2)
| int_leq(int_one,X1)
| int_leq(plus(X1,X2),n)
| int_leq(int_one,plus(X1,X2))
| int_leq(X1,n)
| int_leq(X3,X1)
| int_leq(int_one,X3)
| real_zero = a(plus(X3,X2),X3) ),
inference(consistent_polarity_flipping,[],[f60]) ).
fof(f71,plain,
~ int_leq(int_one,sK1),
inference(consistent_polarity_flipping,[],[f55]) ).
fof(f72,plain,
~ int_leq(sK1,n),
inference(consistent_polarity_flipping,[],[f54]) ).
fof(f73,plain,
~ int_leq(int_one,sK2),
inference(consistent_polarity_flipping,[],[f53]) ).
fof(f74,plain,
~ int_leq(sK2,n),
inference(consistent_polarity_flipping,[],[f52]) ).
fof(f76,definition,
( spl3_1
<=> int_less(sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f77,plain,
( ~ int_less(sK1,sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f78,plain,
( int_less(sK1,sK2)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f80,definition,
( spl3_2
<=> real_zero = a(sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f82,plain,
( real_zero != a(sK1,sK2)
| spl3_2 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f84,definition,
( spl3_3
<=> sK1 = sK2 ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f85,plain,
( sK1 != sK2
| spl3_3 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f86,plain,
( sK1 = sK2
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f88,plain,
( ~ spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f45,f84,f80]) ).
fof(f90,definition,
( spl3_4
<=> int_less(sK2,sK1) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f92,plain,
( int_less(sK2,sK1)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f96,definition,
( spl3_5
<=> real_one = a(sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f98,plain,
( real_one != a(sK1,sK2)
| spl3_5 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f100,plain,
( ~ spl3_2
| ~ spl3_5 ),
inference(avatar_split_clause,[],[f49,f96,f80]) ).
fof(f101,plain,
( spl3_1
| spl3_4
| ~ spl3_5 ),
inference(avatar_split_clause,[],[f50,f96,f90,f76]) ).
fof(f104,definition,
( spl3_6
<=> ! [X0] :
( int_leq(X0,n)
| int_leq(int_one,X0) ) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
fof(f105,plain,
( ! [X0] :
( int_leq(X0,n)
| int_leq(int_one,X0) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f107,definition,
( spl3_7
<=> ! [X4,X1] :
( int_leq(X1,n)
| real_one = a(X4,X4)
| int_leq(int_one,X4)
| int_leq(X4,X1)
| int_leq(int_one,X1) ) ),
introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).
fof(f108,plain,
( ! [X1,X4] :
( int_leq(X1,n)
| int_leq(int_one,X4)
| int_leq(X4,X1)
| int_leq(int_one,X1)
| real_one = a(X4,X4) )
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f109,plain,
( spl3_6
| spl3_7 ),
inference(avatar_split_clause,[],[f68,f107,f104]) ).
fof(f113,plain,
( real_one != a(sK1,sK1)
| ~ spl3_3
| spl3_5 ),
inference(forward_demodulation,[],[f98,f86]) ).
fof(f115,plain,
( int_leq(sK1,n)
| ~ spl3_6 ),
inference(resolution,[],[f105,f71]) ).
fof(f119,plain,
( $false
| ~ spl3_6 ),
inference(forward_subsumption_resolution,[],[f115,f72]) ).
fof(f120,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f119]) ).
fof(f127,plain,
! [X0] : plus(int_zero,X0) = X0,
inference(superposition,[],[f32,f33]) ).
fof(f131,plain,
! [X0,X1] :
( ~ int_leq(int_one,sK0(X0,X1))
| ~ int_less(X0,X1) ),
inference(resolution,[],[f35,f66]) ).
fof(f135,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| int_less(X0,plus(X0,sK0(X1,X2))) ),
inference(resolution,[],[f58,f35]) ).
fof(f149,plain,
! [X2,X0,X1] :
( int_leq(X0,X1)
| ~ int_leq(plus(int_zero,X0),plus(X2,X1))
| int_leq(int_one,X2) ),
inference(resolution,[],[f65,f67]) ).
fof(f158,plain,
( ! [X0] :
( int_leq(X0,n)
| int_leq(sK1,X0)
| int_leq(int_one,X0)
| real_one = a(sK1,sK1) )
| ~ spl3_7 ),
inference(resolution,[],[f108,f71]) ).
fof(f185,plain,
( ! [X0] :
( int_leq(X0,n)
| int_leq(int_one,X0)
| int_leq(sK1,X0) )
| ~ spl3_3
| spl3_5
| ~ spl3_7 ),
inference(forward_subsumption_resolution,[],[f158,f113]) ).
fof(f207,plain,
( int_leq(sK2,n)
| int_leq(sK1,sK2)
| ~ spl3_3
| spl3_5
| ~ spl3_7 ),
inference(resolution,[],[f185,f73]) ).
fof(f209,plain,
( int_leq(sK1,sK2)
| ~ spl3_3
| spl3_5
| ~ spl3_7 ),
inference(forward_subsumption_resolution,[],[f207,f74]) ).
fof(f212,plain,
( int_leq(sK1,sK1)
| ~ spl3_3
| spl3_5
| ~ spl3_7 ),
inference(forward_demodulation,[],[f209,f86]) ).
fof(f216,plain,
( $false
| ~ spl3_3
| spl3_5
| ~ spl3_7 ),
inference(forward_subsumption_resolution,[],[f212,f62]) ).
fof(f217,plain,
( ~ spl3_3
| spl3_5
| ~ spl3_7 ),
inference(avatar_contradiction_clause,[],[f216]) ).
fof(f241,plain,
( sK2 = plus(sK1,sK0(sK1,sK2))
| ~ spl3_1 ),
inference(resolution,[],[f78,f36]) ).
fof(f248,plain,
! [X2,X0,X1] :
( int_leq(plus(X0,X1),n)
| int_leq(X2,X0)
| int_leq(int_one,X2)
| int_leq(int_one,plus(X0,X1))
| int_leq(X0,n)
| int_leq(int_one,X0)
| real_zero = a(X2,plus(X2,X1))
| int_zero = X1
| int_leq(int_zero,X1) ),
inference(resolution,[],[f69,f63]) ).
fof(f251,plain,
! [X2,X0,X1] :
( int_leq(int_one,X0)
| int_leq(plus(X0,X1),n)
| int_leq(int_one,plus(X0,X1))
| int_leq(X0,n)
| int_leq(X2,X0)
| int_leq(int_one,X2)
| real_zero = a(plus(X2,X1),X2)
| int_leq(int_one,X1) ),
inference(resolution,[],[f70,f67]) ).
fof(f387,plain,
( ! [X0] : int_less(X0,plus(X0,sK0(sK1,sK2)))
| ~ spl3_1 ),
inference(resolution,[],[f135,f78]) ).
fof(f513,plain,
( sK1 = sK2
| int_leq(sK1,sK2)
| spl3_1 ),
inference(resolution,[],[f77,f63]) ).
fof(f514,plain,
( int_leq(sK1,sK2)
| spl3_1
| spl3_3 ),
inference(forward_subsumption_resolution,[],[f513,f85]) ).
fof(f516,plain,
( sK1 = plus(sK2,sK0(sK2,sK1))
| ~ spl3_4 ),
inference(resolution,[],[f92,f36]) ).
fof(f523,plain,
( int_less(sK2,sK1)
| spl3_1
| spl3_3 ),
inference(resolution,[],[f514,f64]) ).
fof(f553,plain,
! [X2,X0,X1] :
( ~ int_leq(X0,plus(X2,X1))
| int_leq(X0,X1)
| int_leq(int_one,X2) ),
inference(forward_demodulation,[],[f149,f127]) ).
fof(f835,definition,
( spl3_36
<=> ! [X0] :
( int_leq(X0,sK1)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| int_leq(int_one,X0) ) ),
introduced(definition,[new_symbols(definition,[spl3_36])],[avatar_definition]) ).
fof(f836,plain,
( ! [X0] :
( int_leq(X0,sK1)
| int_leq(int_one,X0)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) )
| ~ spl3_36 ),
inference(avatar_component_clause,[],[f835]) ).
fof(f840,plain,
! [X2,X0,X1] :
( int_leq(plus(X0,X1),n)
| int_leq(X2,X0)
| int_leq(int_one,X2)
| int_leq(int_one,X0)
| int_leq(X0,n)
| real_zero = a(plus(X2,X1),X2)
| int_leq(int_one,X1) ),
inference(forward_subsumption_resolution,[],[f251,f553]) ).
fof(f896,plain,
( ! [X0] :
( int_leq(sK2,n)
| int_leq(X0,sK1)
| int_leq(int_one,X0)
| int_leq(int_one,sK2)
| int_leq(sK1,n)
| int_leq(int_one,sK1)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| int_zero = sK0(sK1,sK2)
| int_leq(int_zero,sK0(sK1,sK2)) )
| ~ spl3_1 ),
inference(superposition,[],[f248,f241]) ).
fof(f899,plain,
( ! [X0] :
( int_leq(X0,sK1)
| int_leq(int_one,X0)
| int_leq(int_one,sK2)
| int_leq(sK1,n)
| int_leq(int_one,sK1)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| int_zero = sK0(sK1,sK2)
| int_leq(int_zero,sK0(sK1,sK2)) )
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f896,f74]) ).
fof(f900,plain,
( ! [X0] :
( int_leq(X0,sK1)
| int_leq(int_one,X0)
| int_leq(sK1,n)
| int_leq(int_one,sK1)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| int_zero = sK0(sK1,sK2)
| int_leq(int_zero,sK0(sK1,sK2)) )
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f899,f73]) ).
fof(f901,plain,
( ! [X0] :
( int_leq(X0,sK1)
| int_leq(int_one,X0)
| int_leq(int_one,sK1)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| int_zero = sK0(sK1,sK2)
| int_leq(int_zero,sK0(sK1,sK2)) )
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f900,f72]) ).
fof(f902,plain,
( ! [X0] :
( int_leq(X0,sK1)
| int_leq(int_one,X0)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| int_zero = sK0(sK1,sK2)
| int_leq(int_zero,sK0(sK1,sK2)) )
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f901,f71]) ).
fof(f904,definition,
( spl3_38
<=> int_leq(int_zero,sK0(sK1,sK2)) ),
introduced(definition,[new_symbols(definition,[spl3_38])],[avatar_definition]) ).
fof(f908,definition,
( spl3_39
<=> int_zero = sK0(sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_39])],[avatar_definition]) ).
fof(f910,plain,
( int_zero = sK0(sK1,sK2)
| ~ spl3_39 ),
inference(avatar_component_clause,[],[f908]) ).
fof(f911,plain,
( spl3_38
| spl3_39
| spl3_36
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f902,f76,f835,f908,f904]) ).
fof(f1000,plain,
( int_less(int_zero,sK0(sK1,sK2))
| ~ spl3_1 ),
inference(superposition,[],[f387,f127]) ).
fof(f1311,plain,
( ~ int_leq(int_zero,sK0(sK1,sK2))
| ~ spl3_1 ),
inference(resolution,[],[f1000,f61]) ).
fof(f1323,plain,
( ~ spl3_38
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f1311,f76,f904]) ).
fof(f1562,plain,
( ! [X0] : int_less(X0,plus(X0,int_zero))
| ~ spl3_1
| ~ spl3_39 ),
inference(superposition,[],[f387,f910]) ).
fof(f1577,plain,
( ! [X0] : int_less(X0,X0)
| ~ spl3_1
| ~ spl3_39 ),
inference(forward_demodulation,[],[f1562,f33]) ).
fof(f1583,plain,
( $false
| ~ spl3_1
| ~ spl3_39 ),
inference(forward_subsumption_resolution,[],[f1577,f57]) ).
fof(f1584,plain,
( ~ spl3_1
| ~ spl3_39 ),
inference(avatar_contradiction_clause,[],[f1583]) ).
fof(f3328,plain,
( int_leq(sK1,sK1)
| real_zero = a(sK1,plus(sK1,sK0(sK1,sK2)))
| ~ spl3_36 ),
inference(resolution,[],[f836,f71]) ).
fof(f3333,plain,
( real_zero = a(sK1,plus(sK1,sK0(sK1,sK2)))
| ~ spl3_36 ),
inference(forward_subsumption_resolution,[],[f3328,f62]) ).
fof(f3334,plain,
( real_zero = a(sK1,sK2)
| ~ spl3_1
| ~ spl3_36 ),
inference(forward_demodulation,[],[f3333,f241]) ).
fof(f3335,plain,
( $false
| ~ spl3_1
| spl3_2
| ~ spl3_36 ),
inference(forward_subsumption_resolution,[],[f3334,f82]) ).
fof(f3336,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_36 ),
inference(avatar_contradiction_clause,[],[f3335]) ).
fof(f3338,plain,
( spl3_4
| spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f523,f84,f76,f90]) ).
fof(f3390,plain,
( ! [X0] :
( int_leq(sK1,n)
| int_leq(X0,sK2)
| int_leq(int_one,X0)
| int_leq(int_one,sK2)
| int_leq(sK2,n)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| int_leq(int_one,sK0(sK2,sK1)) )
| ~ spl3_4 ),
inference(superposition,[],[f840,f516]) ).
fof(f3391,plain,
( ! [X0] :
( int_leq(X0,sK2)
| int_leq(int_one,X0)
| int_leq(int_one,sK2)
| int_leq(sK2,n)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| int_leq(int_one,sK0(sK2,sK1)) )
| ~ spl3_4 ),
inference(forward_subsumption_resolution,[],[f3390,f72]) ).
fof(f3396,plain,
( ! [X0] :
( int_leq(X0,sK2)
| int_leq(int_one,X0)
| int_leq(sK2,n)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| int_leq(int_one,sK0(sK2,sK1)) )
| ~ spl3_4 ),
inference(forward_subsumption_resolution,[],[f3391,f73]) ).
fof(f3400,plain,
( ! [X0] :
( int_leq(X0,sK2)
| int_leq(int_one,X0)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| int_leq(int_one,sK0(sK2,sK1)) )
| ~ spl3_4 ),
inference(forward_subsumption_resolution,[],[f3396,f74]) ).
fof(f3405,definition,
( spl3_132
<=> int_leq(int_one,sK0(sK2,sK1)) ),
introduced(definition,[new_symbols(definition,[spl3_132])],[avatar_definition]) ).
fof(f3407,plain,
( int_leq(int_one,sK0(sK2,sK1))
| ~ spl3_132 ),
inference(avatar_component_clause,[],[f3405]) ).
fof(f3409,definition,
( spl3_133
<=> ! [X0] :
( int_leq(X0,sK2)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0)
| int_leq(int_one,X0) ) ),
introduced(definition,[new_symbols(definition,[spl3_133])],[avatar_definition]) ).
fof(f3410,plain,
( ! [X0] :
( int_leq(X0,sK2)
| int_leq(int_one,X0)
| real_zero = a(plus(X0,sK0(sK2,sK1)),X0) )
| ~ spl3_133 ),
inference(avatar_component_clause,[],[f3409]) ).
fof(f3411,plain,
( spl3_132
| spl3_133
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f3400,f90,f3409,f3405]) ).
fof(f3484,plain,
( ~ int_less(sK2,sK1)
| ~ spl3_132 ),
inference(resolution,[],[f3407,f131]) ).
fof(f3486,plain,
( $false
| ~ spl3_4
| ~ spl3_132 ),
inference(forward_subsumption_resolution,[],[f3484,f92]) ).
fof(f3487,plain,
( ~ spl3_4
| ~ spl3_132 ),
inference(avatar_contradiction_clause,[],[f3486]) ).
fof(f4095,plain,
( int_leq(sK2,sK2)
| real_zero = a(plus(sK2,sK0(sK2,sK1)),sK2)
| ~ spl3_133 ),
inference(resolution,[],[f3410,f73]) ).
fof(f4099,plain,
( real_zero = a(plus(sK2,sK0(sK2,sK1)),sK2)
| ~ spl3_133 ),
inference(forward_subsumption_resolution,[],[f4095,f62]) ).
fof(f4101,plain,
( real_zero = a(sK1,sK2)
| ~ spl3_4
| ~ spl3_133 ),
inference(forward_demodulation,[],[f4099,f516]) ).
fof(f4102,plain,
( $false
| spl3_2
| ~ spl3_4
| ~ spl3_133 ),
inference(forward_subsumption_resolution,[],[f4101,f82]) ).
fof(f4103,plain,
( spl3_2
| ~ spl3_4
| ~ spl3_133 ),
inference(avatar_contradiction_clause,[],[f4102]) ).
cnf(s2,plain,
( ~ spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f88]) ).
cnf(s6,plain,
( ~ spl3_2
| ~ spl3_5 ),
inference(sat_conversion,[],[f100]) ).
cnf(s7,plain,
( spl3_1
| spl3_4
| ~ spl3_5 ),
inference(sat_conversion,[],[f101]) ).
cnf(s9,plain,
( spl3_6
| spl3_7 ),
inference(sat_conversion,[],[f109]) ).
cnf(s11,plain,
~ spl3_6,
inference(sat_conversion,[],[f120]) ).
cnf(s19,plain,
( ~ spl3_3
| spl3_5
| ~ spl3_7 ),
inference(sat_conversion,[],[f217]) ).
cnf(s48,plain,
( ~ spl3_1
| spl3_36
| spl3_38
| spl3_39 ),
inference(sat_conversion,[],[f911]) ).
cnf(s79,plain,
( ~ spl3_1
| ~ spl3_38 ),
inference(sat_conversion,[],[f1323]) ).
cnf(s92,plain,
( ~ spl3_1
| ~ spl3_39 ),
inference(sat_conversion,[],[f1584]) ).
cnf(s194,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_36 ),
inference(sat_conversion,[],[f3336]) ).
cnf(s195,plain,
( spl3_1
| spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f3338]) ).
cnf(s199,plain,
( ~ spl3_4
| spl3_132
| spl3_133 ),
inference(sat_conversion,[],[f3411]) ).
cnf(s204,plain,
( ~ spl3_4
| ~ spl3_132 ),
inference(sat_conversion,[],[f3487]) ).
cnf(s302,plain,
( spl3_2
| ~ spl3_4
| ~ spl3_133 ),
inference(sat_conversion,[],[f4103]) ).
cnf(s311,plain,
spl3_7,
inference(rat,[],[s9,s11]) ).
cnf(s314,plain,
( ~ spl3_4
| spl3_2 ),
inference(rat,[],[s199,s204,s302]) ).
cnf(s315,plain,
( spl3_4
| spl3_1 ),
inference(rat,[],[s19,s195,s7,s311]) ).
cnf(s316,plain,
~ spl3_2,
inference(rat,[],[s19,s2,s6,s311]) ).
cnf(s317,plain,
~ spl3_4,
inference(rat,[],[s314,s316]) ).
cnf(s318,plain,
spl3_1,
inference(rat,[],[s315,s317]) ).
cnf(s322,plain,
~ spl3_39,
inference(rat,[],[s92,s318]) ).
cnf(s323,plain,
~ spl3_38,
inference(rat,[],[s79,s318]) ).
cnf(s325,plain,
spl3_36,
inference(rat,[],[s48,s322,s323,s318]) ).
cnf(s329,plain,
$false,
inference(rat,[],[s194,s316,s318,s325]) ).
fof(f4104,plain,
$false,
inference(avatar_sat_refutation,[],[s329]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV491+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.16 % Computer : n002.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Mon Sep 28 11:17:22 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 Running first-order model finding
% 0.09/0.19 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
% 0.38/0.37 % (291955)Will run a generic schedule for satisfiability detection.
% 0.38/0.37 % (291964)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3831677688:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.38/0.37 % (291961)% WARNING: option uhcvi not known.
% 0.38/0.37 % (291960)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2616103547_2999 on theBenchmark for (2999ds/0Mi)
% 0.38/0.37 % (291966)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1825221668:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.38/0.37 % (291962)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=955885671:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.38/0.37 % (291963)dis+10_1_sil=32000:sp=arity:random_seed=2110273745:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.38/0.37 % (291965)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3641608383:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.38/0.37 % (291961)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4222362516:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.38/0.37 % TRYING [1]
% 0.38/0.37 % TRYING [2]
% 0.38/0.37 % TRYING [3]
% 0.38/0.37 % TRYING [4]
% 0.38/0.37 % TRYING [5]
% 0.38/0.37 % TRYING [6]
% 0.38/0.37 % (291964)Instruction limit reached!
% 0.38/0.37 % (291964)------------------------------
% 0.38/0.37 % (291964)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.37 % (291964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.37 % (291964)CaDiCaL version: 2.1.3
% 0.38/0.37 % (291964)Termination reason: Instruction limit
% 0.38/0.37 % (291964)Termination phase: Saturation
% 0.38/0.37 % (291964)Time elapsed: 0.041 s
% 0.38/0.37 % (291964)Peak memory usage: 12 MB
% 0.38/0.37 % (291964)Instructions burned: 118 (million)
% 0.38/0.37 % TRYING [7]
% 0.38/0.37 % (291974)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=218534306:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.38/0.37 % TRYING [1]
% 0.38/0.37 % TRYING [2]
% 0.38/0.37 % TRYING [3]
% 0.38/0.37 % TRYING [4]
% 0.38/0.37 % TRYING [5]
% 0.38/0.37 % TRYING [6]
% 0.38/0.37 % TRYING [7]
% 0.38/0.37 % (291963)Instruction limit reached!
% 0.38/0.37 % (291963)------------------------------
% 0.38/0.37 % (291963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.37 % (291963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.37 % (291963)CaDiCaL version: 2.1.3
% 0.38/0.37 % (291963)Termination reason: Instruction limit
% 0.38/0.37 % (291963)Termination phase: Saturation
% 0.38/0.37 % (291963)Time elapsed: 0.070 s
% 0.38/0.37 % (291963)Peak memory usage: 12 MB
% 0.38/0.37 % (291963)Instructions burned: 103 (million)
% 0.38/0.37 % TRYING [8]
% 0.38/0.37 % (291965)Instruction limit reached!
% 0.38/0.37 % (291965)------------------------------
% 0.38/0.37 % (291965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.37 % (291965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.37 % (291965)CaDiCaL version: 2.1.3
% 0.38/0.37 % (291965)Termination reason: Instruction limit
% 0.38/0.37 % (291965)Termination phase: Saturation
% 0.38/0.37 % (291965)Time elapsed: 0.085 s
% 0.38/0.37 % (291965)Peak memory usage: 13 MB
% 0.38/0.37 % (291965)Instructions burned: 131 (million)
% 0.38/0.37 % (291976)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1249628862:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.38/0.37 % TRYING [8]
% 0.38/0.37 % (291966)Instruction limit reached!
% 0.38/0.37 % (291966)------------------------------
% 0.38/0.37 % (291966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.37 % (291966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.37 % (291966)CaDiCaL version: 2.1.3
% 0.38/0.37 % (291966)Termination reason: Instruction limit
% 0.38/0.37 % (291966)Termination phase: Saturation
% 0.38/0.37 % (291966)Time elapsed: 0.109 s
% 0.38/0.37 % (291966)Peak memory usage: 14 MB
% 0.38/0.37 % (291966)Instructions burned: 161 (million)
% 0.38/0.37 % (291977)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=2819217537:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.38/0.37 % (291961) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-291955-291961"...
% 0.38/0.37 % (291979)ott-21_1_sil=16000:fs=off:random_seed=3672308172:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.38/0.37 % (291961)...printing done.
% 0.38/0.37 % (291961)Refutation found. Thanks to Tanya!
% 0.38/0.37 % SZS status Theorem for theBenchmark
% 0.38/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.38/0.38 % (291961)------------------------------
% 0.38/0.38 % (291961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.38 % (291961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.38 % (291961)CaDiCaL version: 2.1.3
% 0.38/0.38 % (291961)Termination reason: Refutation
% 0.38/0.38 % (291961)Time elapsed: 0.117 s
% 0.38/0.38 % (291961)Peak memory usage: 14 MB
% 0.38/0.38 % (291961)Instructions burned: 194 (million)
% 0.38/0.38 % (291955)Success in time 0.172 s
% 0.38/0.38 % Vampire exiting
%------------------------------------------------------------------------------