%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET600^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:23:40 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 73 ( 5 unt; 0 typ; 3 def)
% Number of atoms : 378 ( 100 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 292 ( 63 ~; 122 |; 11 &; 88 @)
% ( 7 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 8 con; 0-4 aty)
% Number of variables : 111 ( 61 sgn 23 !; 6 ?; 111 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vOR: $o > $o > $o ).
thf(func_def_2,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_3,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_6,type,
sK0: a > $o ).
thf(func_def_7,type,
sK1: a > $o ).
thf(func_def_9,type,
sK3: a ).
thf(func_def_10,type,
sK4: a ).
thf(func_def_11,type,
sK5: a ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X3: a] : $false ) )
<=> ( ( X1
= ( ^ [X3: a] : $false ) )
& ( X0
= ( ^ [X3: a] : $false ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_59_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X3: a] : $false ) )
<=> ( ( X1
= ( ^ [X3: a] : $false ) )
& ( X0
= ( ^ [X3: a] : $false ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X3: a] : $false ) )
<=> ( ( X1
= ( ^ [X4: a] : $false ) )
& ( X0
= ( ^ [X5: a] : $false ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
<=> ( ( ( ^ [Y0: a] : $false )
= X1 )
& ( ( ^ [Y0: a] : $false )
= X0 ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
<~> ( ( ( ^ [Y0: a] : $false )
= X1 )
& ( ( ^ [Y0: a] : $false )
= X0 ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= X1 )
| ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) ) )
& ( ( ( ( ^ [Y0: a] : $false )
= X1 )
& ( ( ^ [Y0: a] : $false )
= X0 ) )
| ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= X1 )
| ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) ) )
& ( ( ( ( ^ [Y0: a] : $false )
= X1 )
& ( ( ^ [Y0: a] : $false )
= X0 ) )
| ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
( ( ( ( ^ [Y0: a] : $false )
!= sK1 )
| ( ( ^ [Y0: a] : $false )
!= sK0 )
| ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) )
& ( ( ( ( ^ [Y0: a] : $false )
= sK1 )
& ( ( ^ [Y0: a] : $false )
= sK0 ) )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f7]) ).
thf(f9,plain,
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( ( ( ^ [Y0: a] : $false )
= sK1 )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( ( ( ^ [Y0: a] : $false )
!= sK1 )
| ( ( ^ [Y0: a] : $false )
!= sK0 )
| ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,definition,
( spl2_1
<=> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f16,plain,
( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
thf(f17,plain,
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
thf(f19,definition,
( spl2_2
<=> ( ( ^ [Y0: a] : $false )
= sK0 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
| spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f21,plain,
( ( ( ^ [Y0: a] : $false )
= sK0 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f22,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f9,f19,f15]) ).
thf(f24,definition,
( spl2_3
<=> ( ( ^ [Y0: a] : $false )
= sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f25,plain,
( ( ( ^ [Y0: a] : $false )
!= sK1 )
| spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f26,plain,
( ( ( ^ [Y0: a] : $false )
= sK1 )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f27,plain,
( spl2_1
| spl2_3 ),
inference(avatar_split_clause,[],[f10,f24,f15]) ).
thf(f28,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f11,f24,f19,f15]) ).
thf(f29,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( sK0 @ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f21]) ).
thf(f30,plain,
( ! [X1: a] :
( ( $true
= ( ^ [Y0: a] : $false
@ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f33,plain,
( ! [X1: a] :
( ( $false = $true )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f34,plain,
( ! [X1: a] :
( $false
= ( sK0 @ X1 ) )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f35,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( sK1 @ X1 ) )
| ~ spl2_3 ),
inference(argument_congruence,[],[f26]) ).
thf(f36,plain,
( ! [X1: a] :
( ( $true
= ( ^ [Y0: a] : $false
@ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_3 ),
inference(iff_proxy_clausification,[],[f35]) ).
thf(f39,plain,
( ! [X1: a] :
( ( $false = $true )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_3 ),
inference(beta-eta_normalization,[],[f36]) ).
thf(f40,plain,
( ! [X1: a] :
( $false
= ( sK1 @ X1 ) )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f41,plain,
( ( ( ^ [Y0: a] : $false
@ sK3 )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK3 ) )
| spl2_1 ),
inference(negative_extensionality,[],[f16]) ).
thf(f42,plain,
( ( $true
= ( ^ [Y0: a] : $false
@ sK3 ) )
| ( $true
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK3 ) )
| spl2_1 ),
inference(xor_proxy_clausification,[],[f41]) ).
thf(f47,plain,
( ( $false = $true )
| ( $true
= ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) ) )
| spl2_1 ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f48,plain,
( ( $false = $true )
| ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| spl2_1 ),
inference(or_proxy_clausification,[],[f47]) ).
thf(f49,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f50,plain,
( ( $false = $true )
| ( $true
= ( sK0 @ sK3 ) )
| spl2_1
| ~ spl2_3 ),
inference(forward_demodulation,[],[f49,f40]) ).
thf(f51,plain,
( ( $true
= ( sK0 @ sK3 ) )
| spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f52,plain,
( ( $false = $true )
| spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(forward_demodulation,[],[f51,f34]) ).
thf(f53,plain,
( $false
| spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f54,plain,
( spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f53]) ).
thf(f55,plain,
( ( ( ^ [Y0: a] : $false
@ sK4 )
!= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f20]) ).
thf(f56,plain,
( ( $true
= ( ^ [Y0: a] : $false
@ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f55]) ).
thf(f59,plain,
( ( $false = $true )
| ( $true
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f56]) ).
thf(f60,plain,
( ( $true
= ( sK0 @ sK4 ) )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f61,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f17]) ).
thf(f62,plain,
( ! [X1: a] :
( ( $true
= ( ^ [Y0: a] : $false
@ X1 ) )
| ( $false
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ X1 ) ) )
| ~ spl2_1 ),
inference(iff_proxy_clausification,[],[f61]) ).
thf(f66,plain,
( ! [X1: a] :
( ( $false = $true )
| ( $false
= ( ( sK0 @ X1 )
| ( sK1 @ X1 ) ) ) )
| ~ spl2_1 ),
inference(beta-eta_normalization,[],[f62]) ).
thf(f67,plain,
( ! [X1: a] :
( ( $false = $true )
| ( $false
= ( sK1 @ X1 ) ) )
| ~ spl2_1 ),
inference(or_proxy_clausification,[],[f66]) ).
thf(f68,plain,
( ! [X1: a] :
( ( $false = $true )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_1 ),
inference(or_proxy_clausification,[],[f66]) ).
thf(f69,plain,
( ! [X1: a] :
( $false
= ( sK0 @ X1 ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f68]) ).
thf(f70,plain,
( ! [X1: a] :
( $false
= ( sK1 @ X1 ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f67]) ).
thf(f80,plain,
( ( $false = $true )
| ~ spl2_1
| spl2_2 ),
inference(constrained_superposition,[],[f69,f60]) ).
thf(f86,plain,
( $false
| ~ spl2_1
| spl2_2 ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f87,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_contradiction_clause,[],[f86]) ).
thf(f96,plain,
( ( ( ^ [Y0: a] : $false
@ sK5 )
!= ( sK1 @ sK5 ) )
| spl2_3 ),
inference(negative_extensionality,[],[f25]) ).
thf(f97,plain,
( ( $true
= ( ^ [Y0: a] : $false
@ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| spl2_3 ),
inference(xor_proxy_clausification,[],[f96]) ).
thf(f100,plain,
( ( $false = $true )
| ( $true
= ( sK1 @ sK5 ) )
| spl2_3 ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f101,plain,
( ( $true
= ( sK1 @ sK5 ) )
| spl2_3 ),
inference(trivial_inequality_removal,[],[f100]) ).
thf(f102,plain,
( ( $false = $true )
| ~ spl2_1
| spl2_3 ),
inference(forward_demodulation,[],[f101,f70]) ).
thf(f103,plain,
( $false
| ~ spl2_1
| spl2_3 ),
inference(trivial_inequality_removal,[],[f102]) ).
thf(f104,plain,
( ~ spl2_1
| spl2_3 ),
inference(avatar_contradiction_clause,[],[f103]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f22]) ).
cnf(s2,plain,
( spl2_1
| spl2_3 ),
inference(sat_conversion,[],[f27]) ).
cnf(s3,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f28]) ).
cnf(s4,plain,
( spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f54]) ).
cnf(s6,plain,
( ~ spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f87]) ).
cnf(s7,plain,
( ~ spl2_1
| spl2_3 ),
inference(sat_conversion,[],[f104]) ).
cnf(s8,plain,
spl2_1,
inference(rat,[],[s4,s1,s2]) ).
cnf(s9,plain,
spl2_3,
inference(rat,[],[s7,s8]) ).
cnf(s10,plain,
spl2_2,
inference(rat,[],[s6,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s3,s9,s10,s8]) ).
thf(f105,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET600^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n015.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:41:33 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.22/0.29 % (3534803)Will run a generic schedule for satisfiability detection.
% 0.22/0.29 % (3534811)dis+10_1_sil=32000:sp=arity:random_seed=1118178246:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.29 % (3534811)Refutation not found, incomplete strategy
% 0.22/0.29 % (3534811)------------------------------
% 0.22/0.29 % (3534811)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (3534811)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (3534811)CaDiCaL version: 2.1.3
% 0.22/0.29 % (3534811)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.29 % (3534811)Time elapsed: 0.001 s
% 0.22/0.29 % (3534811)Peak memory usage: 12 MB
% 0.22/0.29 % (3534811)Instructions burned: 2 (million)
% 0.22/0.29 % (3534811)------------------------------
% 0.22/0.29 % (3534811)------------------------------
% 0.22/0.29 % (3534809)% WARNING: option uhcvi not known.
% 0.22/0.29 % (3534808)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3697818676_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.29 % (3534812)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1714546150:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.29 % (3534813)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4008557417:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.29 % (3534809)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2934628122:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.29 % (3534810)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3831483356:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.29 % (3534812)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.29 % (3534809)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.29 % Exception at run slice level
% 0.22/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.29 % (3534809)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.29 % (3534814)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3170371754:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.29 % (3534813) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3534803-3534813"...
% 0.22/0.29 % (3534812) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3534803-3534812"...
% 0.22/0.29 % (3534809) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3534803-3534809"...
% 0.22/0.29 % (3534814) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3534803-3534814"...
% 0.22/0.29 % (3534813)...printing done.
% 0.22/0.29 % (3534816)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3302296964:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.22/0.29 % (3534810) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3534803-3534810"...
% 0.22/0.29 % (3534812)...printing done.
% 0.22/0.29 % Exception at run slice level
% 0.22/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.29 % (3534813)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 % (3534813)------------------------------
% 0.22/0.29 % (3534813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (3534813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (3534813)CaDiCaL version: 2.1.3
% 0.22/0.29 % (3534813)Termination reason: Refutation
% 0.22/0.29 % (3534813)Time elapsed: 0.004 s
% 0.22/0.29 % (3534813)Peak memory usage: 12 MB
% 0.22/0.29 % (3534813)Instructions burned: 5 (million)
% 0.22/0.29 % (3534803)Success in time 0.046 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------