%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ANA112^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 : n002.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.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 110 ( 31 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 411 ( 16 ~; 10 |; 3 &; 379 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 134 ( 51 ^; 78 !; 5 ?; 134 :)
% 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/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_2,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
sK0: 'type/nums/num' ).
thf(func_def_10,type,
sK1: 'type/nums/num' ).
thf(func_def_11,type,
sK2: 'type/nums/num' ).
thf(func_def_12,type,
sK3: 'type/nums/num' ).
thf(func_def_13,type,
sK4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real' ).
thf(f1,axiom,
! [X0: $tType,X1: $tType,X2: X0 > X1 > 'type/realax/real',X3: X0 > $o,X4: X1 > $o] :
( ( ( 'const/sets/FINITE' @ X1 @ X4 )
& ( 'const/sets/FINITE' @ X0 @ X3 ) )
=> ( ( 'const/iterate/sum' @ X0 @ X3
@ ^ [X5: X0] : ( 'const/iterate/sum' @ X1 @ X4 @ ( X2 @ X5 ) ) )
= ( 'const/iterate/sum' @ X1 @ X4
@ ^ [X5: X1] :
( 'const/iterate/sum' @ X0 @ X3
@ ^ [X6: X0] : ( X2 @ X6 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_SWAP_') ).
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',X1: 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num',X4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [X5: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ ( X4 @ X5 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [X5: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [X6: 'type/nums/num'] : ( X4 @ X6 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_SWAP_NUMSEG_') ).
thf(f4,negated_conjecture,
~ ! [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num',X4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [X5: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ ( X4 @ X5 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [X5: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [X6: 'type/nums/num'] : ( X4 @ X6 @ X5 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1 > 'type/realax/real',X3: X0 > $o,X4: X1 > $o] :
( ( ( 'const/sets/FINITE' @ X1 @ X4 )
& ( 'const/sets/FINITE' @ X0 @ X3 ) )
=> ( ( 'const/iterate/sum' @ X0 @ X3
@ ^ [X5: X0] : ( 'const/iterate/sum' @ X1 @ X4 @ ( X2 @ X5 ) ) )
= ( 'const/iterate/sum' @ X1 @ X4
@ ^ [X6: X1] :
( 'const/iterate/sum' @ X0 @ X3
@ ^ [X7: X0] : ( X2 @ X7 @ X6 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1 > 'type/realax/real',X3: X0 > $o,X4: X1 > $o] :
( ( ( ( 'const/sets/FINITE' @ X1 @ X4 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X3 )
= $true ) )
=> ( ( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y0: X0] : ( 'const/iterate/sum' @ X1 @ X4 @ ( X2 @ Y0 ) ) )
= ( 'const/iterate/sum' @ X1 @ X4
@ ^ [Y0: X1] :
( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y1: X0] : ( X2 @ Y1 @ 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',X1: 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num',X4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [X5: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ ( X4 @ X5 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [X6: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [X7: 'type/nums/num'] : ( X4 @ X7 @ X6 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ! [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num',X4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ ( X4 @ Y0 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y1: 'type/nums/num'] : ( X4 @ Y1 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1 > 'type/realax/real',X3: X0 > $o,X4: X1 > $o] :
( ( ( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y0: X0] : ( 'const/iterate/sum' @ X1 @ X4 @ ( X2 @ Y0 ) ) )
= ( 'const/iterate/sum' @ X1 @ X4
@ ^ [Y0: X1] :
( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y1: X0] : ( X2 @ Y1 @ Y0 ) ) ) )
| ( ( 'const/sets/FINITE' @ X1 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f12,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1 > 'type/realax/real',X3: X0 > $o,X4: X1 > $o] :
( ( ( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y0: X0] : ( 'const/iterate/sum' @ X1 @ X4 @ ( X2 @ Y0 ) ) )
= ( 'const/iterate/sum' @ X1 @ X4
@ ^ [Y0: X1] :
( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y1: X0] : ( X2 @ Y1 @ Y0 ) ) ) )
| ( ( 'const/sets/FINITE' @ X1 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
? [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num',X4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ ( X4 @ Y0 ) ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y1: 'type/nums/num'] : ( X4 @ Y1 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f14,plain,
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK0 @ sK1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) @ ( sK4 @ Y0 ) ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK0 @ sK1 )
@ ^ [Y1: 'type/nums/num'] : ( sK4 @ Y1 @ Y0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f13]) ).
thf(f15,plain,
! [X1: $tType,X0: $tType,X2: X0 > X1 > 'type/realax/real',X3: X0 > $o,X4: X1 > $o] :
( ( ( 'const/sets/FINITE' @ X1 @ X4 )
!= $true )
| ( ( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y0: X0] : ( 'const/iterate/sum' @ X1 @ X4 @ ( X2 @ Y0 ) ) )
= ( 'const/iterate/sum' @ X1 @ X4
@ ^ [Y0: X1] :
( 'const/iterate/sum' @ X0 @ X3
@ ^ [Y1: X0] : ( X2 @ Y1 @ Y0 ) ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f16,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(f17,plain,
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK0 @ sK1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) @ ( sK4 @ Y0 ) ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK0 @ sK1 )
@ ^ [Y1: 'type/nums/num'] : ( sK4 @ Y1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f28,plain,
! [X2: $tType,X3: X2 > $o,X0: 'type/nums/num',X1: 'type/nums/num',X4: X2 > 'type/nums/num' > 'type/realax/real'] :
( ( $true != $true )
| ( ( 'const/iterate/sum' @ X2 @ X3
@ ^ [Y0: X2] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) @ ( X4 @ Y0 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ X2 @ X3
@ ^ [Y1: X2] : ( X4 @ Y1 @ Y0 ) ) ) )
| ( $true
!= ( 'const/sets/FINITE' @ X2 @ X3 ) ) ),
inference(constrained_superposition,[],[f15,f16]) ).
thf(f29,plain,
! [X2: $tType,X3: X2 > $o,X0: 'type/nums/num',X1: 'type/nums/num',X4: X2 > 'type/nums/num' > 'type/realax/real'] :
( ( $true
!= ( 'const/sets/FINITE' @ X2 @ X3 ) )
| ( ( 'const/iterate/sum' @ X2 @ X3
@ ^ [Y0: X2] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) @ ( X4 @ Y0 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ X2 @ X3
@ ^ [Y1: X2] : ( X4 @ Y1 @ Y0 ) ) ) ) ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f36,plain,
! [X2: 'type/nums/num',X3: 'type/nums/num',X0: 'type/nums/num',X1: 'type/nums/num',X4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real'] :
( ( $true != $true )
| ( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ ( X4 @ Y0 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y1: 'type/nums/num'] : ( X4 @ Y1 @ Y0 ) ) ) ) ),
inference(constrained_superposition,[],[f29,f16]) ).
thf(f37,plain,
! [X2: 'type/nums/num',X3: 'type/nums/num',X0: 'type/nums/num',X1: 'type/nums/num',X4: 'type/nums/num' > 'type/nums/num' > 'type/realax/real'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y0: 'type/nums/num'] : ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ ( X4 @ Y0 ) ) )
= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
@ ^ [Y0: 'type/nums/num'] :
( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 )
@ ^ [Y1: 'type/nums/num'] : ( X4 @ Y1 @ Y0 ) ) ) ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f41,plain,
$false,
inference(backward_subsumption_resolution,[],[f17,f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA112^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.09/0.19 % Computer : n002.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:44:37 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/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.20/0.28 % (1627650)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (1627659)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1008179163:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (1627659)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (1627659)Refutation not found, incomplete strategy
% 0.20/0.28 % (1627659)------------------------------
% 0.20/0.28 % (1627659)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1627659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1627659)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1627659)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (1627659)Time elapsed: 0.001 s
% 0.20/0.28 % (1627659)Peak memory usage: 12 MB
% 0.20/0.28 % (1627659)Instructions burned: 2 (million)
% 0.20/0.28 % (1627659)------------------------------
% 0.20/0.28 % (1627659)------------------------------
% 0.20/0.28 % (1627656)% WARNING: option uhcvi not known.
% 0.20/0.28 % (1627655)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=457734690_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % (1627656)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=619993359:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (1627657)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2552796615:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (1627658)dis+10_1_sil=32000:sp=arity:random_seed=1221109146:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (1627656)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (1627656)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28 % (1627660)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=455756222:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (1627657)Refutation not found, incomplete strategy
% 0.20/0.28 % (1627657)------------------------------
% 0.20/0.28 % (1627657)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1627657)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1627657)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1627657)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (1627657)Time elapsed: 0.004 s
% 0.20/0.28 % (1627657)Peak memory usage: 12 MB
% 0.20/0.28 % (1627657)Instructions burned: 4 (million)
% 0.20/0.28 % (1627657)------------------------------
% 0.20/0.28 % (1627657)------------------------------
% 0.20/0.28 % (1627656) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1627650-1627656"...
% 0.20/0.28 % (1627656)...printing done.
% 0.20/0.28 % (1627656)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (1627656)------------------------------
% 0.20/0.28 % (1627656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1627656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1627656)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1627656)Termination reason: Refutation
% 0.20/0.28 % (1627656)Time elapsed: 0.008 s
% 0.20/0.28 % (1627656)Peak memory usage: 12 MB
% 0.20/0.28 % (1627656)Instructions burned: 11 (million)
% 0.20/0.28 % (1627650)Success in time 0.046 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------