%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV292^5 : TPTP v9.3.1. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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 : Wed Sep 30 08:38:12 AM UTC 2026
% Result : Theorem 0.23s 0.31s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 17 unt; 0 typ; 4 def)
% Number of atoms : 406 ( 77 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 526 ( 66 ~; 74 |; 23 &; 303 @)
% ( 4 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 245 ( 245 >; 0 *; 0 +; 0 <<)
% Number of symbols : 28 ( 24 usr; 7 con; 0-4 aty)
% ( 22 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 90 ( 0 sgn 45 !; 4 ?; 90 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cP: ( ( $i > $o ) > $o ) > $o ).
thf(func_def_1,type,
cONE: ( $i > $o ) > $o ).
thf(func_def_2,type,
cSUCC: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_3,type,
cZERO: ( $i > $o ) > $o ).
thf(func_def_4,type,
c_less__eq_: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(func_def_6,type,
vNOT: $o > $o ).
thf(func_def_7,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
vAND: $o > $o > $o ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_14,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_15,type,
vIMP: $o > $o > $o ).
thf(func_def_19,type,
sK1: ( $i > $o ) > $i ).
thf(func_def_20,type,
sK2: ( ( $i > $o ) > $o ) > ( $i > $o ) > $i ).
thf(func_def_21,type,
sK3: ( ( ( $i > $o ) > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_22,type,
sK4: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(f3,axiom,
( cONE
= ( cSUCC @ cZERO ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cONE_def) ).
thf(f4,axiom,
( c_less__eq_
= ( ^ [X0: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
! [X2: ( ( $i > $o ) > $o ) > $o] :
( ( ( X2 @ X0 )
& ! [X3: ( $i > $o ) > $o] :
( ( X2 @ X3 )
=> ( X2 @ ( cSUCC @ X3 ) ) ) )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_less__eq__def) ).
thf(f5,conjecture,
( ( cP @ cONE )
=> ? [X0: ( $i > $o ) > $o] :
( ( c_less__eq_ @ cZERO @ X0 )
& ( c_less__eq_ @ X0 @ ( cSUCC @ cONE ) )
& ( cP @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE7A) ).
thf(f6,negated_conjecture,
~ ( ( cP @ cONE )
=> ? [X0: ( $i > $o ) > $o] :
( ( c_less__eq_ @ cZERO @ X0 )
& ( c_less__eq_ @ X0 @ ( cSUCC @ cONE ) )
& ( cP @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f11,plain,
( c_less__eq_
= ( ^ [X0: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
! [X2: ( ( $i > $o ) > $o ) > $o] :
( ( ( X2 @ X0 )
& ! [X3: ( $i > $o ) > $o] :
( ( X2 @ X3 )
=> ( X2 @ ( cSUCC @ X3 ) ) ) )
=> ( X2 @ X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f12,plain,
( c_less__eq_
= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y2: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y3: ( $i > $o ) > $o] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cSUCC @ Y3 ) ) ) )
& ( Y2 @ Y0 ) )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
~ ( ( cP @ cONE )
=> ? [X0: ( $i > $o ) > $o] :
( ( c_less__eq_ @ cZERO @ X0 )
& ( c_less__eq_ @ X0 @ ( cSUCC @ cONE ) )
& ( cP @ X0 ) ) ),
inference(rectify,[],[f6]) ).
thf(f14,plain,
~ ( ( ( cP @ cONE )
= $true )
=> ? [X0: ( $i > $o ) > $o] :
( ( ( c_less__eq_ @ X0 @ ( cSUCC @ cONE ) )
= $true )
& ( ( c_less__eq_ @ cZERO @ X0 )
= $true )
& ( ( cP @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
( ( ( cP @ cONE )
= $true )
& ! [X0: ( $i > $o ) > $o] :
( ( ( c_less__eq_ @ cZERO @ X0 )
!= $true )
| ( ( c_less__eq_ @ X0 @ ( cSUCC @ cONE ) )
!= $true )
| ( ( cP @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f16,plain,
( cONE
= ( cSUCC @ cZERO ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f19,plain,
( c_less__eq_
= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y2: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y3: ( $i > $o ) > $o] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cSUCC @ Y3 ) ) ) )
& ( Y2 @ Y0 ) )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f20,plain,
! [X0: ( $i > $o ) > $o] :
( ( ( cP @ X0 )
!= $true )
| ( ( c_less__eq_ @ X0 @ ( cSUCC @ cONE ) )
!= $true )
| ( ( c_less__eq_ @ cZERO @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f21,plain,
( ( cP @ cONE )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f25,definition,
( spl0_1
<=> ( ( cP @ cONE )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f27,plain,
( ( ( cP @ cONE )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f28,plain,
spl0_1,
inference(avatar_split_clause,[],[f21,f25]) ).
thf(f30,definition,
( spl0_2
<=> ( c_less__eq_
= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y2: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y3: ( $i > $o ) > $o] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cSUCC @ Y3 ) ) ) )
& ( Y2 @ Y0 ) )
=> ( Y2 @ Y1 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f32,plain,
( ( c_less__eq_
= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y2: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y3: ( $i > $o ) > $o] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cSUCC @ Y3 ) ) ) )
& ( Y2 @ Y0 ) )
=> ( Y2 @ Y1 ) ) ) ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f33,plain,
spl0_2,
inference(avatar_split_clause,[],[f19,f30]) ).
thf(f35,definition,
( spl0_3
<=> ( cONE
= ( cSUCC @ cZERO ) ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f37,plain,
( ( cONE
= ( cSUCC @ cZERO ) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f38,plain,
spl0_3,
inference(avatar_split_clause,[],[f16,f35]) ).
thf(f50,plain,
( ( $true
= ( cP @ ( cSUCC @ cZERO ) ) )
| ~ spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f27,f37]) ).
thf(f54,definition,
( spl0_6
<=> ( $true
= ( cP @ ( cSUCC @ cZERO ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
thf(f56,plain,
( ( $true
= ( cP @ ( cSUCC @ cZERO ) ) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f57,plain,
( spl0_6
| ~ spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f50,f35,f25,f54]) ).
thf(f58,plain,
( ! [X0: ( $i > $o ) > $o] :
( ( ( c_less__eq_ @ X0 @ ( cSUCC @ ( cSUCC @ cZERO ) ) )
!= $true )
| ( ( cP @ X0 )
!= $true )
| ( ( c_less__eq_ @ cZERO @ X0 )
!= $true ) )
| ~ spl0_3 ),
inference(forward_demodulation,[],[f20,f37]) ).
thf(f72,plain,
( ! [X1: ( $i > $o ) > $o] :
( ( c_less__eq_ @ X1 )
= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y2: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y3: ( $i > $o ) > $o] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cSUCC @ Y3 ) ) ) )
& ( Y2 @ Y0 ) )
=> ( Y2 @ Y1 ) ) )
@ X1 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f32]) ).
thf(f73,plain,
( ! [X1: ( $i > $o ) > $o] :
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) )
& ( Y1 @ X1 ) )
=> ( Y1 @ Y0 ) ) ) )
= ( c_less__eq_ @ X1 ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f72]) ).
thf(f86,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( c_less__eq_ @ X1 @ X2 )
= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) )
& ( Y1 @ X1 ) )
=> ( Y1 @ Y0 ) ) )
@ X2 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f73]) ).
thf(f87,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $false
= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) )
& ( Y1 @ X1 ) )
=> ( Y1 @ Y0 ) ) )
@ X2 ) )
| ( $true
= ( c_less__eq_ @ X1 @ X2 ) ) )
| ~ spl0_2 ),
inference(iff_proxy_clausification,[],[f86]) ).
thf(f98,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( $false
= ( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y0: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y1: ( $i > $o ) > $o] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cSUCC @ Y1 ) ) ) )
& ( Y0 @ X1 ) )
=> ( Y0 @ X2 ) ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f87]) ).
thf(f99,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( $false
= ( ^ [Y0: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y1: ( $i > $o ) > $o] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cSUCC @ Y1 ) ) ) )
& ( Y0 @ X1 ) )
=> ( Y0 @ X2 ) )
@ ( sK4 @ X1 @ X2 ) ) ) )
| ~ spl0_2 ),
inference(sigma_proxy_clausification,[],[f98]) ).
thf(f100,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( $false
= ( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( sK4 @ X1 @ X2 @ Y0 )
=> ( sK4 @ X1 @ X2 @ ( cSUCC @ Y0 ) ) ) )
& ( sK4 @ X1 @ X2 @ X1 ) )
=> ( sK4 @ X1 @ X2 @ X2 ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f99]) ).
thf(f101,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( sK4 @ X1 @ X2 @ X2 )
= $false )
| ( $true
= ( c_less__eq_ @ X1 @ X2 ) ) )
| ~ spl0_2 ),
inference(imp_proxy_clausification,[],[f100]) ).
thf(f102,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( sK4 @ X1 @ X2 @ Y0 )
=> ( sK4 @ X1 @ X2 @ ( cSUCC @ Y0 ) ) ) )
& ( sK4 @ X1 @ X2 @ X1 ) )
= $true ) )
| ~ spl0_2 ),
inference(imp_proxy_clausification,[],[f100]) ).
thf(f103,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( sK4 @ X1 @ X2 @ X1 ) )
| ( $true
= ( c_less__eq_ @ X1 @ X2 ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f102]) ).
thf(f104,plain,
( ! [X2: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( $true
= ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( sK4 @ X1 @ X2 @ Y0 )
=> ( sK4 @ X1 @ X2 @ ( cSUCC @ Y0 ) ) ) ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f102]) ).
thf(f105,plain,
( ! [X2: ( $i > $o ) > $o,X3: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( $true
= ( ^ [Y0: ( $i > $o ) > $o] :
( ( sK4 @ X1 @ X2 @ Y0 )
=> ( sK4 @ X1 @ X2 @ ( cSUCC @ Y0 ) ) )
@ X3 ) ) )
| ~ spl0_2 ),
inference(pi_proxy_clausification,[],[f104]) ).
thf(f106,plain,
( ! [X2: ( $i > $o ) > $o,X3: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( $true
= ( ( sK4 @ X1 @ X2 @ X3 )
=> ( sK4 @ X1 @ X2 @ ( cSUCC @ X3 ) ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f105]) ).
thf(f107,plain,
( ! [X2: ( $i > $o ) > $o,X3: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( sK4 @ X1 @ X2 @ ( cSUCC @ X3 ) )
= $true )
| ( $true
= ( c_less__eq_ @ X1 @ X2 ) )
| ( $false
= ( sK4 @ X1 @ X2 @ X3 ) ) )
| ~ spl0_2 ),
inference(imp_proxy_clausification,[],[f106]) ).
thf(f126,plain,
( ! [X0: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $false = $true )
| ( ( c_less__eq_ @ X0 @ ( cSUCC @ X1 ) )
= $true )
| ( ( c_less__eq_ @ X0 @ ( cSUCC @ X1 ) )
= $true )
| ( $false
= ( sK4 @ X0 @ ( cSUCC @ X1 ) @ X1 ) ) )
| ~ spl0_2 ),
inference(superposition,[],[f101,f107]) ).
thf(f127,plain,
( ! [X0: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $false
= ( sK4 @ X0 @ ( cSUCC @ X1 ) @ X1 ) )
| ( $false = $true )
| ( ( c_less__eq_ @ X0 @ ( cSUCC @ X1 ) )
= $true ) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f126]) ).
thf(f128,plain,
( ! [X0: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $false
= ( sK4 @ X0 @ ( cSUCC @ X1 ) @ X1 ) )
| ( ( c_less__eq_ @ X0 @ ( cSUCC @ X1 ) )
= $true ) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f127]) ).
thf(f134,plain,
( ! [X0: ( $i > $o ) > $o] :
( ( $false = $true )
| ( $true
= ( c_less__eq_ @ X0 @ ( cSUCC @ X0 ) ) )
| ( $true
= ( c_less__eq_ @ X0 @ ( cSUCC @ X0 ) ) ) )
| ~ spl0_2 ),
inference(superposition,[],[f103,f128]) ).
thf(f135,plain,
( ! [X0: ( $i > $o ) > $o] :
( ( $true
= ( c_less__eq_ @ X0 @ ( cSUCC @ X0 ) ) )
| ( $false = $true ) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f134]) ).
thf(f136,plain,
( ! [X0: ( $i > $o ) > $o] :
( $true
= ( c_less__eq_ @ X0 @ ( cSUCC @ X0 ) ) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f135]) ).
thf(f143,plain,
( ( $true != $true )
| ( $true
!= ( c_less__eq_ @ cZERO @ ( cSUCC @ cZERO ) ) )
| ( $true
!= ( cP @ ( cSUCC @ cZERO ) ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(superposition,[],[f58,f136]) ).
thf(f144,plain,
( ( $true
!= ( c_less__eq_ @ cZERO @ ( cSUCC @ cZERO ) ) )
| ( $true
!= ( cP @ ( cSUCC @ cZERO ) ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f143]) ).
thf(f145,plain,
( ( $true
!= ( cP @ ( cSUCC @ cZERO ) ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f144,f136]) ).
thf(f146,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f145,f56]) ).
thf(f147,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f146]) ).
cnf(s1,plain,
spl0_1,
inference(sat_conversion,[],[f28]) ).
cnf(s2,plain,
spl0_2,
inference(sat_conversion,[],[f33]) ).
cnf(s3,plain,
spl0_3,
inference(sat_conversion,[],[f38]) ).
cnf(s6,plain,
( ~ spl0_1
| ~ spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f57]) ).
cnf(s8,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_6 ),
inference(sat_conversion,[],[f147]) ).
cnf(s9,plain,
~ spl0_6,
inference(rat,[],[s8,s3,s2]) ).
cnf(s10,plain,
~ spl0_1,
inference(rat,[],[s6,s3,s9]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s10]) ).
thf(f148,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV292^5 : TPTP v9.3.1. Bugfixed v6.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n016.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 15:36:35 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running higher-order theorem proving
% 0.10/0.26 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.31 % (488678)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.31 % (488686)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=747622911:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.23/0.31 % (488683)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1198728974:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.23/0.31 % (488685)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2381082252:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.23/0.31 % (488684)lrs+10_16_si=on:nwc=1.5:random_seed=1916669179:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.23/0.31 % (488685)Instruction limit reached!
% 0.23/0.31 % (488685)------------------------------
% 0.23/0.31 % (488685)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (488685)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (488685)CaDiCaL version: 2.1.3
% 0.23/0.31 % (488685)Termination reason: Instruction limit
% 0.23/0.31 % (488685)Termination phase: Saturation
% 0.23/0.31 % (488685)Time elapsed: 0.002 s
% 0.23/0.31 % (488685)Peak memory usage: 11 MB
% 0.23/0.31 % (488685)Instructions burned: 3 (million)
% 0.23/0.31 % (488686) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-488678-488686"...
% 0.23/0.31 % (488686)...printing done.
% 0.23/0.31 % (488686)Refutation found. Thanks to Tanya!
% 0.23/0.31 % SZS status Theorem for theBenchmark
% 0.23/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.31 % (488686)------------------------------
% 0.23/0.31 % (488686)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (488686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (488686)CaDiCaL version: 2.1.3
% 0.23/0.31 % (488686)Termination reason: Refutation
% 0.23/0.31 % (488686)Time elapsed: 0.008 s
% 0.23/0.31 % (488686)Peak memory usage: 13 MB
% 0.23/0.31 % (488686)Instructions burned: 12 (million)
% 0.23/0.31 % (488678)Success in time 0.043 s
% 0.23/0.31 % Vampire exiting
%------------------------------------------------------------------------------