%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ANA096^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:46:03 AM UTC 2026
% Result : Theorem 0.18s 0.30s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 223 ( 77 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 630 ( 28 ~; 21 |; 13 &; 558 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 61 ( 61 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 2 con; 0-5 aty)
% Number of variables : 97 ( 0 ^; 89 !; 8 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
'type/realax/real': $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_7,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/SUBSET':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_1,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/DIFF':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_3,type,
'const/realax/real_sub': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_4,type,
'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_5,type,
'const/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_6,type,
'const/iterate/monoidal':
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_7,type,
'const/iterate/iterate':
!>[X0: $tType,X1: $tType] : ( ( X1 > X1 > X1 ) > ( X0 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_11,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_12,type,
sK1: sK0 > 'type/realax/real' ).
thf(func_def_13,type,
sK2: sK0 > $o ).
thf(func_def_14,type,
sK3: sK0 > $o ).
thf(func_def_15,type,
vNOT: $o > $o ).
thf(f1,axiom,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/sum_') ).
thf(f2,axiom,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( 'const/iterate/monoidal' @ X1 @ X2 )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X5 @ X4 )
& ( 'const/sets/FINITE' @ X0 @ X4 ) )
=> ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DIFF' @ X0 @ X4 @ X5 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/ITERATE_DIFF_') ).
thf(f3,axiom,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/MONOIDAL_REAL_ADD_') ).
thf(f4,axiom,
! [X0: 'type/realax/real',X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( X0
= ( 'const/realax/real_sub' @ X1 @ X2 ) )
= ( ( 'const/realax/real_add' @ X0 @ X2 )
= X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/real/REAL_EQ_SUB_LADD_') ).
thf(f5,conjecture,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X3 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_DIFF_') ).
thf(f6,negated_conjecture,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X3 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( 'const/iterate/monoidal' @ X1 @ X2 )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X5 @ X4 )
& ( 'const/sets/FINITE' @ X0 @ X4 ) )
=> ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DIFF' @ X0 @ X4 @ X5 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
= $true )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X5 @ X4 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true ) )
=> ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DIFF' @ X0 @ X4 @ X5 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
inference(rectify,[],[f3]) ).
thf(f10,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( ( 'const/realax/real_sub' @ X1 @ X2 )
= X0 )
= ( ( 'const/realax/real_add' @ X0 @ X2 )
= X1 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f12,plain,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X3 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f13,plain,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X3 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DIFF' @ X0 @ X4 @ X5 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X5 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true ) )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f15,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DIFF' @ X0 @ X4 @ X5 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X5 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true ) )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true ) ),
inference(flattening,[],[f14]) ).
thf(f16,plain,
? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X2 @ X3 ) @ X1 )
!= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) )
& ( ( 'const/sets/SUBSET' @ X0 @ X3 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f17,plain,
? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X2 @ X3 ) @ X1 )
!= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) )
& ( ( 'const/sets/SUBSET' @ X0 @ X3 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
( ( ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ sK3 ) @ sK1 )
!= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) ) )
& ( $true
= ( 'const/sets/SUBSET' @ sK0 @ sK3 @ sK2 ) )
& ( $true
= ( 'const/sets/FINITE' @ sK0 @ sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f17]) ).
thf(f19,plain,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f20,plain,
! [X1: $tType,X0: $tType,X2: X1 > X1 > X1,X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/SUBSET' @ X0 @ X5 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true )
| ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/DIFF' @ X0 @ X4 @ X5 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f21,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f22,plain,
! [X2: 'type/realax/real',X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/realax/real_sub' @ X1 @ X2 )
= X0 )
= ( ( 'const/realax/real_add' @ X0 @ X2 )
= X1 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f23,plain,
( $true
= ( 'const/sets/FINITE' @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f24,plain,
( $true
= ( 'const/sets/SUBSET' @ sK0 @ sK3 @ sK2 ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f25,plain,
( ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ sK3 ) @ sK1 )
!= ( 'const/realax/real_sub' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f28,plain,
( ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ sK3 ) @ sK1 )
!= ( 'const/realax/real_sub' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK1 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK3 @ sK1 ) ) ),
inference(definition_unfolding,[],[f25,f19,f19,f19]) ).
thf(f29,plain,
! [X2: 'type/realax/real',X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( $true
= ( ( 'const/realax/real_sub' @ X1 @ X2 )
= X0 ) )
| ( ( ( 'const/realax/real_add' @ X0 @ X2 )
= X1 )
= $false ) ),
inference(iff_proxy_clausification,[],[f22]) ).
thf(f33,plain,
! [X2: 'type/realax/real',X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/realax/real_sub' @ X1 @ X2 )
= X0 )
| ( ( ( 'const/realax/real_add' @ X0 @ X2 )
= X1 )
= $false ) ),
inference(equality_proxy_clausification,[],[f29]) ).
thf(f34,plain,
! [X2: 'type/realax/real',X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/realax/real_add' @ X0 @ X2 )
!= X1 )
| ( ( 'const/realax/real_sub' @ X1 @ X2 )
= X0 ) ),
inference(equality_proxy_clausification,[],[f33]) ).
thf(f44,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/realax/real_sub' @ ( 'const/realax/real_add' @ X0 @ X1 ) @ X1 )
= X0 ),
inference(equality_resolution,[],[f34]) ).
thf(f137,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > 'type/realax/real',X1: X0 > $o] :
( ( $true != $true )
| ( $true
!= ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ X0 @ X2 @ X1 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' @ X1 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' @ X2 @ X3 ) ) ),
inference(constrained_superposition,[],[f20,f21]) ).
thf(f140,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > 'type/realax/real',X1: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( $true
!= ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 ) )
| ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ X0 @ X2 @ X1 ) @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' @ X1 @ X3 ) )
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' @ X2 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f137]) ).
thf(f243,plain,
! [X0: sK0 > $o,X1: sK0 > 'type/realax/real'] :
( ( $true != $true )
| ( $true
!= ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK2 ) )
| ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ X0 ) @ X1 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ X0 @ X1 ) )
= ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ X1 ) ) ),
inference(constrained_superposition,[],[f140,f23]) ).
thf(f246,plain,
! [X0: sK0 > $o,X1: sK0 > 'type/realax/real'] :
( ( $true
!= ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK2 ) )
| ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ X0 ) @ X1 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ X0 @ X1 ) )
= ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f243]) ).
thf(f247,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( $true != $true )
| ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ sK3 ) @ X0 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK3 @ X0 ) )
= ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ X0 ) ) ),
inference(constrained_superposition,[],[f246,f24]) ).
thf(f250,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ sK3 ) @ X0 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK3 @ X0 ) )
= ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ X0 ) ),
inference(trivial_inequality_removal,[],[f247]) ).
thf(f264,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/DIFF' @ sK0 @ sK2 @ sK3 ) @ X0 )
= ( 'const/realax/real_sub' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ X0 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK3 @ X0 ) ) ),
inference(constrained_superposition,[],[f44,f250]) ).
thf(f269,plain,
( ( 'const/realax/real_sub' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK1 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK3 @ sK1 ) )
!= ( 'const/realax/real_sub' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK1 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK3 @ sK1 ) ) ),
inference(constrained_superposition,[],[f28,f264]) ).
thf(f280,plain,
$false,
inference(trivial_inequality_removal,[],[f269]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA096^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n005.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 17:41:16 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.30 % (1983643)Will run a generic schedule for satisfiability detection.
% 0.18/0.30 % (1983666)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1301280621:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.30 % (1983666)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.30 % (1983663)% WARNING: option uhcvi not known.
% 0.18/0.30 % (1983662)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3858080680_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.30 % (1983664)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1998438195:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.30 % (1983663)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1721320085:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.30 % (1983665)dis+10_1_sil=32000:sp=arity:random_seed=3760732323:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.30 % (1983667)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2513328589:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.30 % (1983668)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4200166584:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.30 % (1983663)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.30 % Exception at run slice level
% 0.18/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.30 % (1983663)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.18/0.30 % (1983679)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=915219683:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.30 % Exception at run slice level
% 0.18/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.30 % (1983666)Instruction limit reached!
% 0.18/0.30 % (1983666)------------------------------
% 0.18/0.30 % (1983666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.30 % (1983666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.30 % (1983666)CaDiCaL version: 2.1.3
% 0.18/0.30 % (1983666)Termination reason: Instruction limit
% 0.18/0.30 % (1983666)Termination phase: Saturation
% 0.18/0.30 % (1983666)Time elapsed: 0.032 s
% 0.18/0.30 % (1983666)Peak memory usage: 13 MB
% 0.18/0.30 % (1983666)Instructions burned: 117 (million)
% 0.18/0.30 % (1983668) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1983643-1983668"...
% 0.18/0.30 % (1983668)...printing done.
% 0.18/0.30 % (1983668)Refutation found. Thanks to Tanya!
% 0.18/0.30 % SZS status Theorem for theBenchmark
% 0.18/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.30 % (1983668)------------------------------
% 0.18/0.30 % (1983668)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.30 % (1983668)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.30 % (1983668)CaDiCaL version: 2.1.3
% 0.18/0.30 % (1983668)Termination reason: Refutation
% 0.18/0.30 % (1983668)Time elapsed: 0.027 s
% 0.18/0.30 % (1983668)Peak memory usage: 13 MB
% 0.18/0.30 % (1983668)Instructions burned: 52 (million)
% 0.18/0.30 % (1983643)Success in time 0.077 s
% 0.18/0.30 % Vampire exiting
%------------------------------------------------------------------------------