%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM817^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:18:58 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 18 unt; 0 typ; 2 def)
% Number of atoms : 317 ( 110 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 471 ( 84 ~; 80 |; 22 &; 231 @)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 18 usr; 6 con; 0-4 aty)
% ( 18 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 114 ( 0 sgn 68 !; 4 ?; 114 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
cS: $i > $i ).
thf(func_def_2,type,
cEVEN1: $i > $o ).
thf(func_def_3,type,
cODD1: $i > $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $o > $o ).
thf(func_def_7,type,
vAND: $o > $o > $o ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_13,type,
vNOT: $o > $o ).
thf(func_def_15,type,
inv_cS_1: $i > $i ).
thf(func_def_16,type,
sK2: ( $i > $o ) > $i ).
thf(func_def_17,type,
sK3: $i > $i > $o ).
thf(func_def_18,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f1,axiom,
( cEVEN1
= ( ^ [X0: $i] :
! [X1: $i > $o] :
( ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ ( cS @ X2 ) ) ) )
& ( X1 @ c0 ) )
=> ( X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEVEN1_def) ).
thf(f2,axiom,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cODD1_def) ).
thf(f3,conjecture,
( ( ! [X0: $i] :
( ( cS @ X0 )
!= c0 )
& ! [X1: $i,X2: $i] :
( ( ( cS @ X1 )
= ( cS @ X2 ) )
=> ( X1 = X2 ) ) )
=> ? [X3: $i] : ( cODD1 @ X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM405) ).
thf(f4,negated_conjecture,
~ ( ( ! [X0: $i] :
( ( cS @ X0 )
!= c0 )
& ! [X1: $i,X2: $i] :
( ( ( cS @ X1 )
= ( cS @ X2 ) )
=> ( X1 = X2 ) ) )
=> ? [X3: $i] : ( cODD1 @ X3 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( cEVEN1
= ( ^ [X0: $i] :
! [X1: $i > $o] :
( ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ ( cS @ X2 ) ) ) )
& ( X1 @ c0 ) )
=> ( X1 @ X0 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( cEVEN1
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
~ ( ( ! [X0: $i] :
( ( cS @ X0 )
!= c0 )
& ! [X1: $i,X2: $i] :
( ( ( cS @ X1 )
= ( cS @ X2 ) )
=> ( X1 = X2 ) ) )
=> ? [X3: $i] : ( cODD1 @ X3 ) ),
inference(rectify,[],[f4]) ).
thf(f8,plain,
~ ( ( ! [X1: $i,X2: $i] :
( ( ( cS @ X2 )
= ( cS @ X1 ) )
=> ( X1 = X2 ) )
& ! [X0: $i] :
( c0
!= ( cS @ X0 ) ) )
=> ? [X3: $i] :
( ( cODD1 @ X3 )
= $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ! [X3: $i] :
( ( cODD1 @ X3 )
!= $true )
& ! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ( ( cS @ X2 )
!= ( cS @ X1 ) ) )
& ! [X0: $i] :
( c0
!= ( cS @ X0 ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f12,plain,
( ! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ( ( cS @ X2 )
!= ( cS @ X1 ) ) )
& ! [X3: $i] :
( ( cODD1 @ X3 )
!= $true )
& ! [X0: $i] :
( c0
!= ( cS @ X0 ) ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( cS @ X0 )
!= ( cS @ X1 ) ) )
& ! [X2: $i] :
( $true
!= ( cODD1 @ X2 ) )
& ! [X3: $i] :
( c0
!= ( cS @ X3 ) ) ),
inference(rectify,[],[f12]) ).
thf(f14,plain,
! [X3: $i] :
( c0
!= ( cS @ X3 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f15,plain,
! [X2: $i] :
( $true
!= ( cODD1 @ X2 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
! [X0: $i,X1: $i] :
( ( ( cS @ X0 )
!= ( cS @ X1 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f18,plain,
( cEVEN1
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f21,definition,
( spl0_1
<=> ( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f23,plain,
( ( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f24,plain,
spl0_1,
inference(avatar_split_clause,[],[f17,f21]) ).
thf(f26,definition,
( spl0_2
<=> ( cEVEN1
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f28,plain,
( ( cEVEN1
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f29,plain,
spl0_2,
inference(avatar_split_clause,[],[f18,f26]) ).
thf(f30,plain,
! [X0: $i] :
( ( inv_cS_1 @ ( cS @ X0 ) )
= X0 ),
inference(injectivity,[],[f16]) ).
thf(f32,plain,
( ! [X1: $i] :
( ( cODD1 @ X1 )
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 )
@ X1 ) )
| ~ spl0_1 ),
inference(argument_congruence,[],[f23]) ).
thf(f33,plain,
( ! [X1: $i] :
( ( $true
= ( cODD1 @ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 )
@ X1 ) ) )
| ~ spl0_1 ),
inference(iff_proxy_clausification,[],[f32]) ).
thf(f37,plain,
( ! [X1: $i] :
( ( $true
= ( cODD1 @ X1 ) )
| ( $false
= ( ~ ( cEVEN1 @ X1 ) ) ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f38,plain,
( ! [X1: $i] :
( ( $true
= ( cODD1 @ X1 ) )
| ( $true
= ( cEVEN1 @ X1 ) ) )
| ~ spl0_1 ),
inference(not_proxy_clausification,[],[f37]) ).
thf(f41,plain,
( ! [X1: $i] :
( ( cEVEN1 @ X1 )
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) )
@ X1 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f28]) ).
thf(f43,plain,
( ! [X1: $i] :
( ( $false
= ( cEVEN1 @ X1 ) )
| ( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) )
@ X1 ) ) )
| ~ spl0_2 ),
inference(iff_proxy_clausification,[],[f41]) ).
thf(f44,plain,
( ! [X1: $i] :
( ( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X1 ) ) ) )
| ( $false
= ( cEVEN1 @ X1 ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f43]) ).
thf(f45,plain,
( ! [X2: $i > $o,X1: $i] :
( ( ( ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X1 ) )
@ X2 )
= $true )
| ( $false
= ( cEVEN1 @ X1 ) ) )
| ~ spl0_2 ),
inference(pi_proxy_clausification,[],[f44]) ).
thf(f46,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $false
= ( cEVEN1 @ X1 ) )
| ( $true
= ( ( ( X2 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X2 @ Y0 )
=> ( X2 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
=> ( X2 @ X1 ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f45]) ).
thf(f47,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $true
= ( X2 @ X1 ) )
| ( $false
= ( ( X2 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X2 @ Y0 )
=> ( X2 @ ( cS @ ( cS @ Y0 ) ) ) ) ) ) )
| ( $false
= ( cEVEN1 @ X1 ) ) )
| ~ spl0_2 ),
inference(imp_proxy_clausification,[],[f46]) ).
thf(f48,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $true
= ( X2 @ X1 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( X2 @ Y0 )
=> ( X2 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
| ( $false
= ( cEVEN1 @ X1 ) )
| ( $false
= ( X2 @ c0 ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f47]) ).
thf(f49,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $false
= ( cEVEN1 @ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( X2 @ Y0 )
=> ( X2 @ ( cS @ ( cS @ Y0 ) ) ) )
@ ( sK2 @ X2 ) ) )
| ( $false
= ( X2 @ c0 ) )
| ( $true
= ( X2 @ X1 ) ) )
| ~ spl0_2 ),
inference(sigma_proxy_clausification,[],[f48]) ).
thf(f50,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $true
= ( X2 @ X1 ) )
| ( $false
= ( X2 @ c0 ) )
| ( $false
= ( ( X2 @ ( sK2 @ X2 ) )
=> ( X2 @ ( cS @ ( cS @ ( sK2 @ X2 ) ) ) ) ) )
| ( $false
= ( cEVEN1 @ X1 ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f49]) ).
thf(f51,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $true
= ( X2 @ X1 ) )
| ( $false
= ( X2 @ ( cS @ ( cS @ ( sK2 @ X2 ) ) ) ) )
| ( $false
= ( X2 @ c0 ) )
| ( $false
= ( cEVEN1 @ X1 ) ) )
| ~ spl0_2 ),
inference(imp_proxy_clausification,[],[f50]) ).
thf(f122,plain,
( ! [X0: $i] :
( ( ( cEVEN1 @ X0 )
= $true )
| ( $true != $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f15,f38]) ).
thf(f125,plain,
( ! [X0: $i] :
( ( cEVEN1 @ X0 )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f122]) ).
thf(f173,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $true = $false )
| ( $false
= ( X2 @ c0 ) )
| ( $true
= ( X2 @ X1 ) )
| ( $false
= ( X2 @ ( cS @ ( cS @ ( sK2 @ X2 ) ) ) ) ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_demodulation,[],[f51,f125]) ).
thf(f174,plain,
( ! [X2: $i > $o,X1: $i] :
( ( $false
= ( X2 @ ( cS @ ( cS @ ( sK2 @ X2 ) ) ) ) )
| ( $true
= ( X2 @ X1 ) )
| ( $false
= ( X2 @ c0 ) ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f173]) ).
thf(f175,plain,
( ! [X0: $i] :
( ( $false
= ( ^ [Y0: $i] : ( Y0 != X0 )
@ c0 ) )
| ( ( cS
@ ( cS
@ ( sK2
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(leibniz_equality_elimination,[],[f174]) ).
thf(f192,plain,
( ! [X0: $i] :
( ( $false
= ( c0 != X0 ) )
| ( ( cS
@ ( cS
@ ( sK2
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f175]) ).
thf(f193,plain,
( ! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK2
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( $true
= ( c0 = X0 ) ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(not_proxy_clausification,[],[f192]) ).
thf(f194,plain,
( ! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK2
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( c0 = X0 ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(equality_proxy_clausification,[],[f193]) ).
thf(f234,plain,
( ! [X0: $i] :
( ( ( inv_cS_1 @ X0 )
= ( cS
@ ( sK2
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
| ( c0 = X0 ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(superposition,[],[f30,f194]) ).
thf(f292,plain,
( ! [X0: $i] :
( ( c0
!= ( inv_cS_1 @ X0 ) )
| ( c0 = X0 ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(superposition,[],[f14,f234]) ).
thf(f304,plain,
( ! [X0: $i] :
( ( c0 != X0 )
| ( c0
= ( cS @ X0 ) ) )
| ~ spl0_1
| ~ spl0_2 ),
inference(superposition,[],[f292,f30]) ).
thf(f305,plain,
( ! [X0: $i] : ( c0 != X0 )
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f304,f14]) ).
thf(f310,plain,
( $false
| ~ spl0_1
| ~ spl0_2 ),
inference(equality_resolution,[],[f305]) ).
thf(f313,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_contradiction_clause,[],[f310]) ).
cnf(s1,plain,
spl0_1,
inference(sat_conversion,[],[f24]) ).
cnf(s2,plain,
spl0_2,
inference(sat_conversion,[],[f29]) ).
cnf(s14,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f313]) ).
cnf(s15,plain,
~ spl0_1,
inference(rat,[],[s14,s2]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s1,s15]) ).
thf(f314,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM817^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:02:25 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.27 % (675437)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (675445)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=1509853980: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.20/0.27 % (675448)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.27 % (675448)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.20/0.27 % (675445) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-675437-675445"...
% 0.20/0.27 % (675445)...printing done.
% 0.20/0.27 % (675442)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2423960798:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.27 % (675443)lrs+10_16_si=on:nwc=1.5:random_seed=1669974654:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.27 % (675444)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4209805798:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.27 % (675447)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1310668567:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.27 % (675445)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (675445)------------------------------
% 0.20/0.27 % (675445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (675445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (675445)CaDiCaL version: 2.1.3
% 0.20/0.27 % (675445)Termination reason: Refutation
% 0.20/0.27 % (675445)Time elapsed: 0.006 s
% 0.20/0.27 % (675445)Peak memory usage: 13 MB
% 0.20/0.27 % (675445)Instructions burned: 16 (million)
% 0.20/0.27 % (675437)Success in time 0.031 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------