%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN050^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 : n014.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 08:20:03 AM UTC 2026
% Result : Theorem 0.09s 0.29s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 98 ( 29 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 467 ( 10 ~; 3 |; 4 &; 447 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 26 ( 23 usr; 5 con; 0-5 aty)
% Number of variables : 40 ( 0 ^; 37 !; 3 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
'type/nums/num': $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
'const/nums/SUC': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_1,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_2,type,
'const/nums/_0': 'type/nums/num' ).
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/neutral':
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_5,type,
'const/iterate/monoidal':
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_6,type,
'const/iterate/iterate':
!>[X0: $tType,X1: $tType] : ( ( X1 > X1 > X1 ) > ( X0 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_7,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_8,type,
'const/class/COND':
!>[X0: $tType] : ( $o > X0 > X0 > X0 ) ).
thf(func_def_9,type,
'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
thf(func_def_10,type,
'const/arith/<=': 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_15,type,
sK0: 'type/nums/num' > 'type/nums/num' ).
thf(func_def_16,type,
sK1: 'type/nums/num' ).
thf(func_def_17,type,
sK2: 'type/nums/num' ).
thf(func_def_18,type,
vNOT: $o > $o ).
thf(func_def_20,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_21,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_22,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_23,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_24,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_25,type,
db4:
!>[X0: $tType] : X0 ).
thf(f1,axiom,
! [X0: $tType] :
( 'const/iterate/nsum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/nums/num' @ 'const/arith/+' ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/nsum_') ).
thf(f3,axiom,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( 'const/iterate/monoidal' @ X0 @ X2 )
=> ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X3: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 )
= ( 'const/class/COND' @ X0
@ ( X3
= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/ITERATE_CLAUSES_NUMSEG_') ).
thf(f4,axiom,
'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+',
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/MONOIDAL_ADD_') ).
thf(f5,conjecture,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/SUC' @ X2 ) ) @ X0 )
= ( 'const/class/COND' @ 'type/nums/num' @ ( 'const/arith/<=' @ X1 @ ( 'const/nums/SUC' @ X2 ) ) @ ( 'const/arith/+' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) @ ( X0 @ ( 'const/nums/SUC' @ X2 ) ) ) @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/NSUM_CLAUSES_NUMSEG_1') ).
thf(f6,negated_conjecture,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/SUC' @ X2 ) ) @ X0 )
= ( 'const/class/COND' @ 'type/nums/num' @ ( 'const/arith/<=' @ X1 @ ( 'const/nums/SUC' @ X2 ) ) @ ( 'const/arith/+' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) @ ( X0 @ ( 'const/nums/SUC' @ X2 ) ) ) @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( 'const/iterate/monoidal' @ X0 @ X2 )
=> ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X5: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X5 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 )
= ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X5 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f8,plain,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( ( 'const/iterate/monoidal' @ X0 @ X2 )
= $true )
=> ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X5: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X5 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 )
= ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X5 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+',
inference(rectify,[],[f4]) ).
thf(f10,plain,
( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X5: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X5 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 )
= ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X5 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) ) ) )
| ( ( 'const/iterate/monoidal' @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f12,plain,
? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/SUC' @ X2 ) ) @ X0 )
!= ( 'const/class/COND' @ 'type/nums/num' @ ( 'const/arith/<=' @ X1 @ ( 'const/nums/SUC' @ X2 ) ) @ ( 'const/arith/+' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) @ ( X0 @ ( 'const/nums/SUC' @ X2 ) ) ) @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f13,plain,
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ sK0 )
!= ( 'const/class/COND' @ 'type/nums/num' @ ( 'const/arith/<=' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ ( 'const/arith/+' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) @ ( sK0 @ ( 'const/nums/SUC' @ sK2 ) ) ) @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ) ),
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] :
( 'const/iterate/nsum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/nums/num' @ 'const/arith/+' ) ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f17,plain,
! [X0: $tType,X2: X0 > X0 > X0,X3: 'type/nums/num',X1: 'type/nums/num' > X0,X4: 'type/nums/num'] :
( ( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
| ( ( 'const/iterate/monoidal' @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f18,plain,
( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f19,plain,
( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ sK0 )
!= ( 'const/class/COND' @ 'type/nums/num' @ ( 'const/arith/<=' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ ( 'const/arith/+' @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) @ ( sK0 @ ( 'const/nums/SUC' @ sK2 ) ) ) @ ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f22,plain,
( ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/nums/num' @ 'const/arith/+' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ sK0 )
!= ( 'const/class/COND' @ 'type/nums/num' @ ( 'const/arith/<=' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ ( 'const/arith/+' @ ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/nums/num' @ 'const/arith/+' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) @ ( sK0 @ ( 'const/nums/SUC' @ sK2 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/nums/num' @ 'const/arith/+' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ) ),
inference(definition_unfolding,[],[f19,f14,f14,f14]) ).
thf(f87,plain,
( ( ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/nums/num' @ 'const/arith/+' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ sK0 )
!= ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/nums/num' @ 'const/arith/+' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/SUC' @ sK2 ) ) @ sK0 ) )
| ( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
!= $true ) ),
inference(constrained_superposition,[],[f22,f17]) ).
thf(f88,plain,
( ( 'const/iterate/monoidal' @ 'type/nums/num' @ 'const/arith/+' )
!= $true ),
inference(trivial_inequality_removal,[],[f87]) ).
thf(f162,plain,
$false,
inference(forward_subsumption_resolution,[],[f88,f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN050^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.09/0.20 % Computer : n014.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 13:07:15 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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.09/0.29 % (2623394)Will run a generic schedule for satisfiability detection.
% 0.09/0.29 % (2623403)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=138212170:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.29 % (2623403)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.29 % (2623400)% WARNING: option uhcvi not known.
% 0.09/0.29 % (2623402)dis+10_1_sil=32000:sp=arity:random_seed=696665610:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.29 % (2623399)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=363170902_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.29 % (2623401)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1975488430:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.29 % (2623400)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2234023800:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.29 % (2623404)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1785445652:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.29 % (2623405)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=653008316:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.29 % (2623400)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.29 % Exception at run slice level
% 0.09/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.29 % (2623400)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.09/0.29 % (2623403) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2623394-2623403"...
% 0.09/0.29 % (2623403)...printing done.
% 0.09/0.29 % (2623403)Refutation found. Thanks to Tanya!
% 0.09/0.29 % SZS status Theorem for theBenchmark
% 0.09/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.29 % (2623403)------------------------------
% 0.09/0.29 % (2623403)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.29 % (2623403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.29 % (2623403)CaDiCaL version: 2.1.3
% 0.09/0.29 % (2623403)Termination reason: Refutation
% 0.09/0.29 % (2623403)Time elapsed: 0.012 s
% 0.09/0.29 % (2623403)Peak memory usage: 12 MB
% 0.09/0.29 % (2623403)Instructions burned: 41 (million)
% 0.09/0.29 % (2623394)Success in time 0.041 s
% 0.09/0.29 % Vampire exiting
%------------------------------------------------------------------------------