%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ANA115^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 : n020.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:56 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 120 ( 43 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 334 ( 22 ~; 13 |; 0 &; 296 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 4 con; 0-4 aty)
% Number of variables : 87 ( 22 ^; 59 !; 6 ?; 87 :)
% 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' ).
thf(func_def_11,type,
sK1: 'type/nums/num' > 'type/nums/num' ).
thf(func_def_12,type,
sK2: 'type/nums/num' ).
thf(func_def_13,type,
sK3: 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
thf(f1,axiom,
! [X0: $tType,X2: X0 > $o,X1: X0 > 'type/nums/num'] :
( ( '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/sandbox2/benchmark/theBenchmark.p','thm/iterate/REAL_OF_NUM_SUM_') ).
thf(f2,axiom,
! [X1: 'type/nums/num',X0: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/FINITE_NUMSEG_') ).
thf(f3,conjecture,
! [X1: 'type/nums/num',X0: 'type/nums/num' > '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/sandbox2/benchmark/theBenchmark.p','thm/iterate/REAL_OF_NUM_SUM_NUMSEG_') ).
thf(f4,negated_conjecture,
~ ! [X1: 'type/nums/num',X0: 'type/nums/num' > '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: 'type/nums/num',X1: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f6,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X0 ) )
= $true ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > 'type/nums/num'] :
( ( 'const/sets/FINITE' @ X0 @ X1 )
=> ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X2 ) )
= ( 'const/iterate/sum' @ X0 @ X1
@ ^ [X3: X0] : ( 'const/realax/real_of_num' @ ( X2 @ X3 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
=> ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X2 ) )
= ( 'const/iterate/sum' @ X0 @ X1
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X2 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 ) @ X1 ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 )
@ ^ [X3: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ! [X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num',X0: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) )
= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 ) @ X1 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: $tType,X2: X0 > 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X2 ) )
= ( 'const/iterate/sum' @ X0 @ X1
@ ^ [Y0: X0] : ( 'const/realax/real_of_num' @ ( X2 @ Y0 ) ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f12,plain,
? [X2: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num',X0: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) )
!= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 ) @ X1 ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f13,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(rectify,[],[f11]) ).
thf(f14,plain,
? [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X0 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X1 @ Y0 ) ) )
!= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X0 ) @ X1 ) ) ),
inference(rectify,[],[f12]) ).
thf(f15,plain,
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK0 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK1 @ Y0 ) ) )
!= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK0 ) @ sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f14]) ).
thf(f16,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X0 ) )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f17,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,[],[f13]) ).
thf(f18,plain,
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK0 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK1 @ Y0 ) ) )
!= ( 'const/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK0 ) @ sK1 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f21,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,[],[f17,f16]) ).
thf(f22,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,[],[f21]) ).
thf(f24,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/realax/real_of_num' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK0 ) @ sK1 ) ) )
| ( ( 'const/iterate/..' @ X0 @ X1 )
!= ( 'const/iterate/..' @ sK2 @ sK0 ) )
| ( ( ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( X2 @ Y0 ) ) ) ) ),
inference(constrained_superposition,[],[f18,f22]) ).
thf(f25,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/iterate/..' @ X0 @ X1 )
!= ( 'const/iterate/..' @ sK2 @ sK0 ) )
| ( ( ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK1 @ Y0 ) ) ) )
| ( ( 'const/iterate/..' @ X0 @ X1 )
!= ( 'const/iterate/..' @ sK2 @ sK0 ) ) ),
inference(equality_resolution,[],[f24]) ).
thf(f26,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_of_num' @ ( sK1 @ Y0 ) ) ) )
| ( ( 'const/iterate/..' @ X0 @ X1 )
!= ( 'const/iterate/..' @ sK2 @ sK0 ) ) ),
inference(duplicate_literal_removal,[],[f25]) ).
thf(f27,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/iterate/..' @ X0 @ X1 )
!= ( 'const/iterate/..' @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f26]) ).
thf(f28,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/iterate/..' @ X0 @ X1 @ ( sK3 @ X1 @ X0 ) )
!= ( 'const/iterate/..' @ sK2 @ sK0 @ ( sK3 @ X1 @ X0 ) ) ),
inference(negative_extensionality,[],[f27]) ).
thf(f29,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/iterate/..' @ X0 @ X1 @ ( sK3 @ X1 @ X0 ) )
= $true )
| ( ( 'const/iterate/..' @ sK2 @ sK0 @ ( sK3 @ X1 @ X0 ) )
= $true ) ),
inference(xor_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( $false
= ( 'const/iterate/..' @ sK2 @ sK0 @ ( sK3 @ X1 @ X0 ) ) )
| ( $false
= ( 'const/iterate/..' @ X0 @ X1 @ ( sK3 @ X1 @ X0 ) ) ) ),
inference(xor_proxy_clausification,[],[f28]) ).
thf(f32,plain,
( ( ( 'const/iterate/..' @ sK2 @ sK0 @ ( sK3 @ sK0 @ sK2 ) )
= $true )
| ( $true != $true ) ),
inference(equality_factoring,[],[f29]) ).
thf(f33,plain,
( ( 'const/iterate/..' @ sK2 @ sK0 @ ( sK3 @ sK0 @ sK2 ) )
= $true ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f36,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(constrained_superposition,[],[f30,f33]) ).
thf(f43,plain,
$false = $true,
inference(duplicate_literal_removal,[],[f36]) ).
thf(f44,plain,
$false,
inference(trivial_inequality_removal,[],[f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA115^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n020.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:43:04 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 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.22/0.29 % (1376048)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (1376056)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=4180283957: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.22/0.29 % (1376056)Refutation not found, incomplete strategy
% 0.22/0.29 % (1376056)------------------------------
% 0.22/0.29 % (1376056)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1376056)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1376056)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1376056)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.29 % (1376056)Time elapsed: 0.001 s
% 0.22/0.29 % (1376056)Peak memory usage: 12 MB
% 0.22/0.29 % (1376056)Instructions burned: 2 (million)
% 0.22/0.29 % (1376056)------------------------------
% 0.22/0.29 % (1376056)------------------------------
% 0.22/0.29 % (1376059)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.29 % (1376059)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.22/0.29 % (1376053)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=832809700:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.29 % (1376054)lrs+10_16_si=on:nwc=1.5:random_seed=3151117107:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.29 % (1376057)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3342485993:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.29 % (1376055)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4047803769:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.29 % (1376058)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4077172436:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.29 % (1376059)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=1549429860:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.29 % (1376053)Refutation not found, incomplete strategy
% 0.22/0.29 % (1376053)------------------------------
% 0.22/0.29 % (1376053)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1376053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1376053)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1376053)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.29 % (1376053)Time elapsed: 0.002 s
% 0.22/0.29 % (1376057)Refutation not found, incomplete strategy
% 0.22/0.29 % (1376057)------------------------------
% 0.22/0.29 % (1376057)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1376053)Peak memory usage: 12 MB
% 0.22/0.29 % (1376053)Instructions burned: 1 (million)
% 0.22/0.29 % (1376057)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1376057)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1376057)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.29 % (1376057)Time elapsed: 0.001 s
% 0.22/0.29 % (1376057)Peak memory usage: 12 MB
% 0.22/0.29 % (1376057)Instructions burned: 1 (million)
% 0.22/0.29 % (1376055)Refutation not found, incomplete strategy
% 0.22/0.29 % (1376055)------------------------------
% 0.22/0.29 % (1376055)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1376055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1376055)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1376055)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.29 % (1376055)Time elapsed: 0.001 s
% 0.22/0.29 % (1376055)Peak memory usage: 12 MB
% 0.22/0.29 % (1376055)Instructions burned: 1 (million)
% 0.22/0.29 % (1376053)------------------------------
% 0.22/0.29 % (1376053)------------------------------
% 0.22/0.29 % (1376057)------------------------------
% 0.22/0.29 % (1376057)------------------------------
% 0.22/0.29 % (1376055)------------------------------
% 0.22/0.29 % (1376055)------------------------------
% 0.22/0.29 % (1376059)Refutation not found, incomplete strategy
% 0.22/0.29 % (1376059)------------------------------
% 0.22/0.29 % (1376059)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1376059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1376059)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1376059)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.29 % (1376059)Time elapsed: 0.002 s
% 0.22/0.29 % (1376059)Peak memory usage: 12 MB
% 0.22/0.29 % (1376059)Instructions burned: 2 (million)
% 0.22/0.29 % (1376054) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1376048-1376054"...
% 0.22/0.29 % (1376059)------------------------------
% 0.22/0.29 % (1376059)------------------------------
% 0.22/0.29 % (1376061)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2904839231:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.22/0.29 % (1376054)...printing done.
% 0.22/0.29 % (1376061)Instruction limit reached!
% 0.22/0.29 % (1376061)------------------------------
% 0.22/0.29 % (1376061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1376061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1376061)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1376061)Termination reason: Instruction limit
% 0.22/0.29 % (1376061)Termination phase: Saturation
% 0.22/0.29 % (1376061)Time elapsed: 0.001 s
% 0.22/0.29 % (1376061)Peak memory usage: 12 MB
% 0.22/0.29 % (1376054)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (1376054)------------------------------
% 0.22/0.29 % (1376054)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1376054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1376054)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1376054)Termination reason: Refutation
% 0.22/0.29 % (1376054)Time elapsed: 0.005 s
% 0.22/0.29 % (1376054)Peak memory usage: 12 MB
% 0.22/0.29 % (1376054)Instructions burned: 7 (million)
% 0.22/0.29 % (1376048)Success in time 0.043 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------