%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ANA126^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 07:45:58 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 71 ( 21 unt; 0 typ; 4 def)
% Number of atoms : 215 ( 56 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 395 ( 86 ~; 65 |; 0 &; 237 @)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 21 usr; 9 con; 0-4 aty)
% Number of variables : 76 ( 0 sgn 41 !; 1 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
'type/realax/real': $tType ).
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
'const/realax/real_of_num': 'type/nums/num' > 'type/realax/real' ).
thf(func_def_1,type,
'const/realax/real_neg': 'type/realax/real' > 'type/realax/real' ).
thf(func_def_2,type,
'const/realax/real_mul': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_3,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_4,type,
'const/nums/BIT1': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_5,type,
'const/nums/_0': 'type/nums/num' ).
thf(func_def_6,type,
'const/iterate/polynomial_function': ( 'type/realax/real' > 'type/realax/real' ) > $o ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_12,type,
sK0: 'type/realax/real' > 'type/realax/real' ).
thf(func_def_14,type,
sK2: 'type/realax/real' ).
thf(func_def_15,type,
sK3: 'type/realax/real' > 'type/realax/real' ).
thf(func_def_16,type,
sK4: 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_17,type,
sK5: 'type/realax/real' ).
thf(func_def_18,type,
sK6: 'type/realax/real' > 'type/realax/real' ).
thf(func_def_19,type,
sK7: 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(f1,axiom,
! [X0: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ X0 )
= X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/realax/REAL_MUL_LID_') ).
thf(f2,axiom,
! [X1: 'type/realax/real',X0: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_neg' @ X0 ) @ X1 )
= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/calc_int/REAL_MUL_LNEG_') ).
thf(f3,axiom,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_LMUL_') ).
thf(f4,axiom,
! [X0: 'type/realax/real'] :
( ( 'const/realax/real_neg' @ ( 'const/realax/real_neg' @ X0 ) )
= X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/calc_int/REAL_NEG_NEG_') ).
thf(f5,conjecture,
! [X0: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
= ( 'const/iterate/polynomial_function'
@ ^ [X1: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_NEG_') ).
thf(f6,negated_conjecture,
~ ! [X0: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
= ( 'const/iterate/polynomial_function'
@ ^ [X1: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
~ ! [X0: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
= ( 'const/iterate/polynomial_function'
@ ^ [X1: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X0 @ X1 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
~ ! [X0: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f10,plain,
! [X1: 'type/realax/real',X0: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function' @ X0 )
= $true )
=> ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X1: 'type/realax/real',X0: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_neg' @ X1 ) @ X0 )
= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X1 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f12,plain,
? [X0: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
!= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f13,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ Y0 ) ) ) )
| ( ( 'const/iterate/polynomial_function' @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f14,plain,
( ( 'const/iterate/polynomial_function' @ sK0 )
!= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f12]) ).
thf(f15,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_neg' @ X0 ) @ X1 )
= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X0 @ X1 ) ) ),
inference(rectify,[],[f11]) ).
thf(f16,plain,
( ( 'const/iterate/polynomial_function' @ sK0 )
!= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f17,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_neg' @ X0 ) @ X1 )
= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f18,plain,
! [X0: 'type/realax/real'] :
( ( 'const/realax/real_neg' @ ( 'const/realax/real_neg' @ X0 ) )
= X0 ),
inference(cnf_transformation,[],[f4]) ).
thf(f19,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function' @ X0 )
!= $true )
| ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f20,plain,
! [X0: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ X0 )
= X0 ),
inference(cnf_transformation,[],[f1]) ).
thf(f23,plain,
( ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) )
| ( ( 'const/iterate/polynomial_function' @ sK0 )
= $true ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f24,plain,
( ( ( 'const/iterate/polynomial_function' @ sK0 )
= $false )
| ( $false
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f26,definition,
( spl1_1
<=> ( $false
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
thf(f27,plain,
( ( $false
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f29,definition,
( spl1_2
<=> ( ( 'const/iterate/polynomial_function' @ sK0 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
thf(f30,plain,
( ( ( 'const/iterate/polynomial_function' @ sK0 )
= $false )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f31,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f24,f29,f26]) ).
thf(f33,definition,
( spl1_3
<=> ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
thf(f34,plain,
( ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f36,definition,
( spl1_4
<=> ( ( 'const/iterate/polynomial_function' @ sK0 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
thf(f37,plain,
( ( ( 'const/iterate/polynomial_function' @ sK0 )
= $true )
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f38,plain,
( spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f23,f36,f33]) ).
thf(f48,plain,
( ! [X0: 'type/realax/real'] :
( ( $true != $true )
| ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] :
( 'const/realax/real_mul' @ X0
@ ( ^ [Y1: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y1 ) )
@ Y0 ) ) ) ) )
| ~ spl1_3 ),
inference(constrained_superposition,[],[f19,f34]) ).
thf(f49,plain,
( ! [X0: 'type/realax/real'] :
( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] :
( 'const/realax/real_mul' @ X0
@ ( ^ [Y1: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y1 ) )
@ Y0 ) ) ) )
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f50,plain,
( ! [X0: 'type/realax/real'] :
( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) ) )
| ~ spl1_3 ),
inference(beta-eta_normalization,[],[f49]) ).
thf(f52,plain,
( ! [X0: 'type/realax/real'] :
( ( $true = $false )
| ( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) )
!= sK0 ) )
| ~ spl1_2
| ~ spl1_3 ),
inference(constrained_superposition,[],[f30,f50]) ).
thf(f56,plain,
( ! [X0: 'type/realax/real'] :
( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) ) )
!= sK0 )
| ~ spl1_2
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f58,plain,
( ! [X0: 'type/realax/real'] :
( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) )
@ ( sK3 @ X0 ) )
!= ( sK0 @ ( sK3 @ X0 ) ) )
| ~ spl1_2
| ~ spl1_3 ),
inference(negative_extensionality,[],[f56]) ).
thf(f59,plain,
( ! [X0: 'type/realax/real'] :
( ( sK0 @ ( sK3 @ X0 ) )
!= ( 'const/realax/real_mul' @ X0 @ ( 'const/realax/real_neg' @ ( sK0 @ ( sK3 @ X0 ) ) ) ) )
| ~ spl1_2
| ~ spl1_3 ),
inference(beta-eta_normalization,[],[f58]) ).
thf(f67,plain,
( ! [X0: 'type/realax/real'] :
( ( sK0 @ ( sK3 @ ( 'const/realax/real_neg' @ X0 ) ) )
!= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X0 @ ( 'const/realax/real_neg' @ ( sK0 @ ( sK3 @ ( 'const/realax/real_neg' @ X0 ) ) ) ) ) ) )
| ~ spl1_2
| ~ spl1_3 ),
inference(constrained_superposition,[],[f59,f17]) ).
thf(f73,plain,
( ( ( sK0 @ ( sK3 @ ( 'const/realax/real_neg' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) ) )
!= ( 'const/realax/real_neg' @ ( 'const/realax/real_neg' @ ( sK0 @ ( sK3 @ ( 'const/realax/real_neg' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) ) ) ) ) )
| ~ spl1_2
| ~ spl1_3 ),
inference(constrained_superposition,[],[f67,f20]) ).
thf(f76,plain,
( $false
| ~ spl1_2
| ~ spl1_3 ),
inference(forward_subsumption_resolution,[],[f73,f18]) ).
thf(f77,plain,
( ~ spl1_2
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f76]) ).
thf(f80,plain,
( ( $true = $false )
| ~ spl1_1
| ~ spl1_3 ),
inference(backward_demodulation,[],[f34,f27]) ).
thf(f81,plain,
( $false
| ~ spl1_1
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f82,plain,
( ~ spl1_1
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f81]) ).
thf(f83,plain,
( ( $true = $false )
| ~ spl1_2
| ~ spl1_4 ),
inference(backward_demodulation,[],[f37,f30]) ).
thf(f84,plain,
( $false
| ~ spl1_2
| ~ spl1_4 ),
inference(trivial_inequality_removal,[],[f83]) ).
thf(f85,plain,
( ~ spl1_2
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f84]) ).
thf(f86,plain,
( ! [X0: 'type/realax/real'] :
( ( $true != $true )
| ( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( sK0 @ Y0 ) ) ) ) )
| ~ spl1_4 ),
inference(constrained_superposition,[],[f19,f37]) ).
thf(f87,plain,
( ! [X0: 'type/realax/real'] :
( $true
= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( sK0 @ Y0 ) ) ) )
| ~ spl1_4 ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f98,plain,
( ! [X0: 'type/realax/real'] :
( ( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( sK0 @ Y0 ) ) ) )
| ( $true = $false ) )
| ~ spl1_1
| ~ spl1_4 ),
inference(constrained_superposition,[],[f27,f87]) ).
thf(f99,plain,
( ! [X0: 'type/realax/real'] :
( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( sK0 @ Y0 ) ) ) )
| ~ spl1_1
| ~ spl1_4 ),
inference(trivial_inequality_removal,[],[f98]) ).
thf(f103,plain,
( ! [X0: 'type/realax/real'] :
( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( sK0 @ Y0 ) )
@ ( sK6 @ X0 ) )
!= ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( sK0 @ Y0 ) )
@ ( sK6 @ X0 ) ) )
| ~ spl1_1
| ~ spl1_4 ),
inference(negative_extensionality,[],[f99]) ).
thf(f104,plain,
( ! [X0: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X0 @ ( sK0 @ ( sK6 @ X0 ) ) )
!= ( 'const/realax/real_neg' @ ( sK0 @ ( sK6 @ X0 ) ) ) )
| ~ spl1_1
| ~ spl1_4 ),
inference(beta-eta_normalization,[],[f103]) ).
thf(f112,plain,
( ! [X0: 'type/realax/real'] :
( ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X0 @ ( sK0 @ ( sK6 @ ( 'const/realax/real_neg' @ X0 ) ) ) ) )
!= ( 'const/realax/real_neg' @ ( sK0 @ ( sK6 @ ( 'const/realax/real_neg' @ X0 ) ) ) ) )
| ~ spl1_1
| ~ spl1_4 ),
inference(constrained_superposition,[],[f104,f17]) ).
thf(f118,plain,
( ( ( 'const/realax/real_neg' @ ( sK0 @ ( sK6 @ ( 'const/realax/real_neg' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) ) ) )
!= ( 'const/realax/real_neg' @ ( sK0 @ ( sK6 @ ( 'const/realax/real_neg' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) ) ) ) )
| ~ spl1_1
| ~ spl1_4 ),
inference(constrained_superposition,[],[f112,f20]) ).
thf(f119,plain,
( $false
| ~ spl1_1
| ~ spl1_4 ),
inference(trivial_inequality_removal,[],[f118]) ).
thf(f120,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f119]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f31]) ).
cnf(s2,plain,
( spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f38]) ).
cnf(s3,plain,
( ~ spl1_2
| ~ spl1_3 ),
inference(sat_conversion,[],[f77]) ).
cnf(s4,plain,
( ~ spl1_1
| ~ spl1_3 ),
inference(sat_conversion,[],[f82]) ).
cnf(s5,plain,
( ~ spl1_2
| ~ spl1_4 ),
inference(sat_conversion,[],[f85]) ).
cnf(s6,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(sat_conversion,[],[f120]) ).
cnf(s7,plain,
~ spl1_2,
inference(rat,[],[s2,s3,s5]) ).
cnf(s8,plain,
spl1_1,
inference(rat,[],[s1,s7]) ).
cnf(s9,plain,
~ spl1_4,
inference(rat,[],[s6,s8]) ).
cnf(s10,plain,
~ spl1_3,
inference(rat,[],[s4,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s2,s9,s10]) ).
thf(f125,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA126^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n009.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 : Tue Sep 29 17:45:00 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.25 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.20/0.30 % (127788)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.30 % (127796)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=133481849: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.20/0.30 % (127796)Refutation not found, incomplete strategy
% 0.20/0.30 % (127796)------------------------------
% 0.20/0.30 % (127796)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (127796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (127796)CaDiCaL version: 2.1.3
% 0.20/0.30 % (127796)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.30 % (127796)Time elapsed: 0.001 s
% 0.20/0.30 % (127796)Peak memory usage: 12 MB
% 0.20/0.30 % (127796)Instructions burned: 2 (million)
% 0.20/0.30 % (127796)------------------------------
% 0.20/0.30 % (127796)------------------------------
% 0.20/0.30 % (127799)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.30 % (127799)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.20/0.30 % (127793)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3376972073:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.30 % (127798)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1622948939:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.30 % (127794)lrs+10_16_si=on:nwc=1.5:random_seed=2320114820:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.30 % (127795)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=410286206:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.30 % (127797)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=23648742:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.30 % (127799)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=997434021:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.30 % (127795)Refutation not found, incomplete strategy
% 0.20/0.30 % (127795)------------------------------
% 0.20/0.30 % (127795)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (127795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (127795)CaDiCaL version: 2.1.3
% 0.20/0.30 % (127795)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.30 % (127795)Time elapsed: 0.001 s
% 0.20/0.30 % (127795)Peak memory usage: 12 MB
% 0.20/0.30 % (127795)Instructions burned: 1 (million)
% 0.20/0.30 % (127797)Refutation not found, incomplete strategy
% 0.20/0.30 % (127797)------------------------------
% 0.20/0.30 % (127797)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (127797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (127797)CaDiCaL version: 2.1.3
% 0.20/0.30 % (127797)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.30 % (127797)Time elapsed: 0.002 s
% 0.20/0.30 % (127797)Peak memory usage: 12 MB
% 0.20/0.30 % (127797)Instructions burned: 2 (million)
% 0.20/0.30 % (127795)------------------------------
% 0.20/0.30 % (127795)------------------------------
% 0.20/0.30 % (127797)------------------------------
% 0.20/0.30 % (127797)------------------------------
% 0.20/0.30 % (127799)Refutation not found, incomplete strategy
% 0.20/0.30 % (127799)------------------------------
% 0.20/0.30 % (127799)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (127799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (127799)CaDiCaL version: 2.1.3
% 0.20/0.30 % (127799)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.30 % (127799)Time elapsed: 0.003 s
% 0.20/0.30 % (127799)Peak memory usage: 12 MB
% 0.20/0.30 % (127799)Instructions burned: 3 (million)
% 0.20/0.30 % (127799)------------------------------
% 0.20/0.30 % (127799)------------------------------
% 0.20/0.30 % (127801)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=291538958:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.30 % (127798) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-127788-127798"...
% 0.20/0.30 % (127794) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-127788-127794"...
% 0.20/0.30 % (127801)Instruction limit reached!
% 0.20/0.30 % (127801)------------------------------
% 0.20/0.30 % (127801)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (127801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (127801)CaDiCaL version: 2.1.3
% 0.20/0.30 % (127801)Termination reason: Instruction limit
% 0.20/0.30 % (127801)Termination phase: Saturation
% 0.20/0.30 % (127801)Time elapsed: 0.002 s
% 0.20/0.30 % (127801)Peak memory usage: 12 MB
% 0.20/0.30 % (127801)Instructions burned: 5 (million)
% 0.20/0.30 % (127798)...printing done.
% 0.20/0.30 % (127794)...printing done.
% 0.20/0.30 % (127798)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.31 % (127798)------------------------------
% 0.20/0.31 % (127798)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (127798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (127798)CaDiCaL version: 2.1.3
% 0.20/0.31 % (127798)Termination reason: Refutation
% 0.20/0.31 % (127798)Time elapsed: 0.009 s
% 0.20/0.31 % (127798)Peak memory usage: 13 MB
% 0.20/0.31 % (127798)Instructions burned: 12 (million)
% 0.20/0.31 % (127788)Success in time 0.051 s
% 0.20/0.31 % Vampire exiting
%------------------------------------------------------------------------------