%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ANA115^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 : n026.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:05 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 20 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 203 ( 9 ~; 3 |; 0 &; 188 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 58 ( 14 ^; 41 !; 3 ?; 58 :)
% 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/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_1,type,
'const/realax/real_of_num': 'type/nums/num' > 'type/realax/real' ).
thf(func_def_2,type,
'const/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_3,type,
'const/iterate/nsum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/nums/num' ) > 'type/nums/num' ) ).
thf(func_def_4,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $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_10,type,
sK0: 'type/nums/num' > 'type/nums/num' ).
thf(func_def_11,type,
sK1: 'type/nums/num' ).
thf(func_def_12,type,
sK2: 'type/nums/num' ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( 'const/sets/FINITE' @ X0 @ X2 )
=> ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [X3: X0] : ( 'const/realax/real_of_num' @ ( X1 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/REAL_OF_NUM_SUM_') ).
thf(f2,axiom,
! [X0: 'type/nums/num',X1: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/FINITE_NUMSEG_') ).
thf(f3,conjecture,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [X3: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/REAL_OF_NUM_SUM_NUMSEG_') ).
thf(f4,negated_conjecture,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [X3: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( 'const/sets/FINITE' @ X0 @ X2 )
=> ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [X3: X0] : ( 'const/realax/real_of_num' @ ( X1 @ X3 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
=> ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [X3: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ X3 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: $tType,X1: X0 > 'type/nums/num',X2: X0 > $o] :
( ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f12,plain,
? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f13,plain,
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK0 @ Y0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12]) ).
thf(f14,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X2 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X2
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f27,plain,
! [X2: 'type/nums/num' > 'type/nums/num',X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( $true != $true )
| ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) @ X2 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X2 @ Y0 ) ) ) ) ),
inference(constrained_superposition,[],[f14,f15]) ).
thf(f28,plain,
! [X2: 'type/nums/num' > 'type/nums/num',X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) @ X2 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X2 @ Y0 ) ) ) ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f64,plain,
$false,
inference(backward_subsumption_resolution,[],[f16,f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA115^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n026.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 17:44:57 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.25 % (933738)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (933744)% WARNING: option uhcvi not known.
% 0.08/0.25 % (933744)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2031386831:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.25 % (933744)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.25 % (933744)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.25 % (933744) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-933738-933744"...
% 0.08/0.25 % (933744)...printing done.
% 0.08/0.25 % (933744)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (933744)------------------------------
% 0.08/0.25 % (933744)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (933744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (933744)CaDiCaL version: 2.1.3
% 0.08/0.25 % (933744)Termination reason: Refutation
% 0.08/0.25 % (933744)Time elapsed: 0.003 s
% 0.08/0.25 % (933744)Peak memory usage: 12 MB
% 0.08/0.25 % (933744)Instructions burned: 7 (million)
% 0.08/0.25 % (933738)Success in time 0.029 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------