%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM814^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:19:35 AM UTC 2026
% Result : Theorem 0.97s 0.38s
% Output : Refutation 0.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 54 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 259 ( 116 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 390 ( 37 ~; 19 |; 23 &; 239 @)
% ( 0 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 18 usr; 6 con; 0-4 aty)
% ( 33 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 116 ( 58 ^; 54 !; 4 ?; 116 :)
% 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,
cIND: $o ).
thf(func_def_4,type,
cODD1: $i > $o ).
thf(func_def_5,type,
cPEANO1: $o ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vIMP: $o > $o > $o ).
thf(func_def_9,type,
vAND: $o > $o > $o ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_13,type,
vNOT: $o > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_17,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_18,type,
sK1: ( $i > $o ) > $i ).
thf(func_def_19,type,
sK2: $i > $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/sandbox2/benchmark/theBenchmark.p',cEVEN1_def) ).
thf(f3,axiom,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cODD1_def) ).
thf(f4,axiom,
( ( cPEANO1 = cIND )
& ! [X1: $i,X2: $i] :
( ( ( cS @ X1 )
= ( cS @ X2 ) )
=> ( X1 = X2 ) )
& ! [X0: $i] :
( ( cS @ X0 )
!= c0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPEANO1_def) ).
thf(f5,conjecture,
( cPEANO1
=> ? [X0: $i] : ( cODD1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM404) ).
thf(f6,negated_conjecture,
~ ( cPEANO1
=> ? [X0: $i] : ( cODD1 @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( cEVEN1
= ( ^ [X0: $i] :
! [X1: $i > $o] :
( ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ ( cS @ X2 ) ) ) )
& ( X1 @ c0 ) )
=> ( X1 @ X0 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,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,[],[f7]) ).
thf(f11,plain,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( ( cPEANO1 = cIND )
& ! [X0: $i,X1: $i] :
( ( ( cS @ X1 )
= ( cS @ X0 ) )
=> ( X0 = X1 ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f14,plain,
( cPEANO1
= ( ( !! @ $i
@ ^ [Y0: $i] :
( c0
!= ( cS @ Y0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( cS @ Y0 )
= ( cS @ Y1 ) )
=> ( Y1 = Y0 ) ) ) )
& cIND ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ( cPEANO1
=> ? [X0: $i] : ( cODD1 @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
~ ( ( cPEANO1 = $true )
=> ? [X0: $i] :
( ( cODD1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( ! [X0: $i] :
( ( cODD1 @ X0 )
!= $true )
& ( cPEANO1 = $true ) ),
inference(ennf_transformation,[],[f16]) ).
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,[],[f8]) ).
thf(f20,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f21,plain,
( cPEANO1
= ( ( !! @ $i
@ ^ [Y0: $i] :
( c0
!= ( cS @ Y0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( cS @ Y0 )
= ( cS @ Y1 ) )
=> ( Y1 = Y0 ) ) ) )
& cIND ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f22,plain,
cPEANO1 = $true,
inference(cnf_transformation,[],[f17]) ).
thf(f23,plain,
! [X0: $i] :
( ( cODD1 @ X0 )
!= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f26,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y2 @ c0 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cS @ ( cS @ Y3 ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
@ Y0 ) ) ),
inference(definition_unfolding,[],[f20,f18]) ).
thf(f27,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( c0
!= ( cS @ Y0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( cS @ Y0 )
= ( cS @ Y1 ) )
=> ( Y1 = Y0 ) ) ) )
& cIND )
= $true ),
inference(definition_unfolding,[],[f21,f22]) ).
thf(f28,plain,
! [X0: $i] :
( $true
!= ( ^ [Y0: $i] :
~ ( ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y2 @ c0 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cS @ ( cS @ Y3 ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
@ Y0 )
@ X0 ) ),
inference(definition_unfolding,[],[f23,f26]) ).
thf(f29,plain,
! [X0: $i] :
( $true
!= ( ~ ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f28]) ).
thf(f30,plain,
! [X0: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X0 ) ) ) ),
inference(not_proxy_clausification,[],[f29]) ).
thf(f31,plain,
! [X0: $i,X1: $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X0: $i,X1: $i > $o] :
( $true
= ( ( ( X1 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
=> ( X1 @ X0 ) ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f33,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( ( X1 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) ) )
| ( ( X1 @ X0 )
= $true ) ),
inference(imp_proxy_clausification,[],[f32]) ).
thf(f34,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(and_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) )
@ ( sK0 @ X1 ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(sigma_proxy_clausification,[],[f34]) ).
thf(f36,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( ( X1 @ ( sK0 @ X1 ) )
=> ( X1 @ ( cS @ ( cS @ ( sK0 @ X1 ) ) ) ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( X1 @ ( cS @ ( cS @ ( sK0 @ X1 ) ) ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(imp_proxy_clausification,[],[f36]) ).
thf(f40,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( c0
!= ( cS @ Y0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( cS @ Y0 )
= ( cS @ Y1 ) )
=> ( Y1 = Y0 ) ) ) ) )
= $true ),
inference(and_proxy_clausification,[],[f27]) ).
thf(f41,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( cS @ Y0 )
= ( cS @ Y1 ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(and_proxy_clausification,[],[f40]) ).
thf(f42,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( c0
!= ( cS @ Y0 ) ) )
= $true ),
inference(and_proxy_clausification,[],[f40]) ).
thf(f43,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( c0
!= ( cS @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f42]) ).
thf(f44,plain,
! [X1: $i] :
( $true
= ( c0
!= ( cS @ X1 ) ) ),
inference(beta-eta_normalization,[],[f43]) ).
thf(f45,plain,
! [X1: $i] :
( $false
= ( c0
= ( cS @ X1 ) ) ),
inference(not_proxy_clausification,[],[f44]) ).
thf(f46,plain,
! [X1: $i] :
( c0
!= ( cS @ X1 ) ),
inference(equality_proxy_clausification,[],[f45]) ).
thf(f47,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( cS @ Y0 )
= ( cS @ Y1 ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f41]) ).
thf(f48,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( ( cS @ X1 )
= ( cS @ Y0 ) )
=> ( Y0 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f49,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( ( cS @ X1 )
= ( cS @ Y0 ) )
=> ( Y0 = X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f48]) ).
thf(f50,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( ( cS @ X1 )
= ( cS @ X2 ) )
=> ( X2 = X1 ) ) ),
inference(beta-eta_normalization,[],[f49]) ).
thf(f51,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( cS @ X1 )
= ( cS @ X2 ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f50]) ).
thf(f52,plain,
! [X2: $i,X1: $i] :
( ( ( cS @ X2 )
!= ( cS @ X1 ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(equality_proxy_clausification,[],[f51]) ).
thf(f53,plain,
! [X2: $i,X1: $i] :
( ( ( cS @ X2 )
!= ( cS @ X1 ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f52]) ).
thf(f175,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( $false
= ( ^ [Y0: $i] : ( Y0 != X0 )
@ c0 ) ) ),
inference(leibniz_equality_elimination,[],[f37]) ).
thf(f265,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( $false
= ( c0 != X0 ) ) ),
inference(beta-eta_normalization,[],[f175]) ).
thf(f266,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( $true
= ( c0 = X0 ) ) ),
inference(not_proxy_clausification,[],[f265]) ).
thf(f267,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( c0 = X0 ) ),
inference(equality_proxy_clausification,[],[f266]) ).
thf(f729,plain,
! [X0: $i,X1: $i] :
( ( ( cS @ X1 )
!= X0 )
| ( ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) )
= X1 )
| ( c0 = X0 ) ),
inference(constrained_superposition,[],[f53,f267]) ).
thf(f2133,plain,
! [X0: $i] :
( ( ( cS
@ ( sK0
@ ^ [Y0: $i] :
( Y0
!= ( cS @ X0 ) ) ) )
= X0 )
| ( c0
= ( cS @ X0 ) ) ),
inference(equality_resolution,[],[f729]) ).
thf(f2136,plain,
! [X0: $i] :
( ( cS
@ ( sK0
@ ^ [Y0: $i] :
( Y0
!= ( cS @ X0 ) ) ) )
= X0 ),
inference(forward_subsumption_resolution,[],[f2133,f46]) ).
thf(f3578,plain,
! [X0: $i] : ( c0 != X0 ),
inference(constrained_superposition,[],[f46,f2136]) ).
thf(f3647,plain,
$false,
inference(equality_resolution,[],[f3578]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM814^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n019.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 13:01:48 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.97/0.38 % (723611)Will run a generic schedule for satisfiability detection.
% 0.97/0.38 % (723619)dis+10_1_sil=32000:sp=arity:random_seed=251698880:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.97/0.38 % (723617)% WARNING: option uhcvi not known.
% 0.97/0.38 % (723616)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4015437130_2999 on theBenchmark for (2999ds/0Mi)
% 0.97/0.38 % (723618)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2800743004:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.97/0.38 % (723617)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1025444294:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.97/0.38 % (723620)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1695769517:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.97/0.38 % (723617)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.97/0.38 % Exception at run slice level
% 0.97/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.97/0.38 % (723620)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.97/0.38 % (723617)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.97/0.38 % (723622)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=834271597:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.97/0.38 % (723621)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4249717624:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.97/0.38 % (723619)Instruction limit reached!
% 0.97/0.38 % (723619)------------------------------
% 0.97/0.38 % (723619)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.97/0.38 % (723619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.97/0.38 % (723619)CaDiCaL version: 2.1.3
% 0.97/0.38 % (723619)Termination reason: Instruction limit
% 0.97/0.38 % (723619)Termination phase: Saturation
% 0.97/0.38 % (723619)Time elapsed: 0.027 s
% 0.97/0.38 % (723619)Peak memory usage: 12 MB
% 0.97/0.38 % (723619)Instructions burned: 104 (million)
% 0.97/0.38 % (723628)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=54836739:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.97/0.38 % Exception at run slice level
% 0.97/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.97/0.38 % (723632)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3962793325:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.97/0.38 % (723633)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=853135006:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.97/0.38 % (723633)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.97/0.38 % (723633)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.97/0.38 % (723620)Instruction limit reached!
% 0.97/0.38 % (723620)------------------------------
% 0.97/0.38 % (723620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.97/0.38 % (723620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.97/0.38 % (723620)CaDiCaL version: 2.1.3
% 0.97/0.38 % (723620)Termination reason: Instruction limit
% 0.97/0.38 % (723620)Termination phase: Saturation
% 0.97/0.38 % (723620)Time elapsed: 0.053 s
% 0.97/0.38 % (723620)Peak memory usage: 12 MB
% 0.97/0.38 % (723620)Instructions burned: 118 (million)
% 0.97/0.38 % (723632)Instruction limit reached!
% 0.97/0.38 % (723632)------------------------------
% 0.97/0.38 % (723632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.97/0.38 % (723632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.97/0.38 % (723632)CaDiCaL version: 2.1.3
% 0.97/0.38 % (723632)Termination reason: Instruction limit
% 0.97/0.38 % (723632)Termination phase: Saturation
% 0.97/0.38 % (723632)Time elapsed: 0.035 s
% 0.97/0.38 % (723632)Peak memory usage: 12 MB
% 0.97/0.38 % (723632)Instructions burned: 134 (million)
% 0.97/0.38 % (723622)Instruction limit reached!
% 0.97/0.38 % (723622)------------------------------
% 0.97/0.38 % (723622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.97/0.38 % (723622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.97/0.38 % (723622)CaDiCaL version: 2.1.3
% 0.97/0.38 % (723622)Termination reason: Instruction limit
% 0.97/0.38 % (723622)Termination phase: Saturation
% 0.97/0.38 % (723622)Time elapsed: 0.068 s
% 0.97/0.38 % (723622)Peak memory usage: 12 MB
% 0.97/0.38 % (723622)Instructions burned: 159 (million)
% 0.97/0.38 % (723637)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=663993462:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 0.97/0.38 % (723636)ott-21_1_sil=16000:fs=off:random_seed=1632285174:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.97/0.38 % (723638)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=516654473:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.97/0.38 % Exception at run slice level
% 0.97/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.97/0.38 % (723642)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3429239448:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 0.97/0.38 % (723617) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-723611-723617"...
% 0.97/0.38 % (723617)...printing done.
% 0.97/0.38 % (723617)Refutation found. Thanks to Tanya!
% 0.97/0.38 % SZS status Theorem for theBenchmark
% 0.97/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.97/0.39 % (723617)------------------------------
% 0.97/0.39 % (723617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.97/0.39 % (723617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.97/0.39 % (723617)CaDiCaL version: 2.1.3
% 0.97/0.39 % (723617)Termination reason: Refutation
% 0.97/0.39 % (723617)Time elapsed: 0.119 s
% 0.97/0.39 % (723617)Peak memory usage: 13 MB
% 0.97/0.39 % (723617)Instructions burned: 248 (million)
% 0.97/0.39 % (723611)Success in time 0.15 s
% 0.97/0.39 % Vampire exiting
%------------------------------------------------------------------------------