%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM081_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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 : Tue Sep 29 09:40:16 AM UTC 2026
% Result : Theorem 0.25s 0.37s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 9 unt; 0 typ; 3 def)
% Number of atoms : 66 ( 8 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 63 ( 29 ~; 22 |; 1 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-5 aty)
% Number of functors : 77 ( 77 usr; 7 con; 0-6 aty)
% Number of variables : 24 ( 0 sgn 16 !; 8 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
fm: $tType > $tType ).
tff(type_def_9,type,
nat: $tType ).
tff(type_def_10,type,
atom: $tType ).
tff(type_def_11,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_12,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(X1,fun(X0,X2)) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combk:
!>[X0: $tType,X1: $tType] : fun(X0,fun(X1,X0)) ).
tff(func_def_4,type,
n_lists:
!>[X0: $tType] : ( ( nat * list(X0) ) > list(list(X0)) ) ).
tff(func_def_5,type,
product:
!>[X0: $tType,X1: $tType] : ( ( list(X0) * list(X1) ) > list(product_prod(X0,X1)) ) ).
tff(func_def_6,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_7,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_8,type,
zipwith0:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * list(X0) * list(X1) ) > list(X2) ) ).
tff(func_def_9,type,
concat:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_10,type,
dropWhile:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_13,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_14,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) ) > fun(list(X1),X0) ) ).
tff(func_def_15,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : fun(fun(X0,X1),fun(list(X0),list(X1))) ).
tff(func_def_18,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_19,type,
remdups:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_20,type,
set:
!>[X0: $tType] : ( list(X0) > fun(X0,bool) ) ).
tff(func_def_21,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_22,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_23,type,
transpose:
!>[X0: $tType] : ( list(list(X0)) > list(list(X0)) ) ).
tff(func_def_24,type,
transpose_rel:
!>[X0: $tType] : fun(list(list(X0)),fun(list(list(X0)),bool)) ).
tff(func_def_25,type,
list_conj:
!>[X0: $tType] : ( list(fm(X0)) > fm(X0) ) ).
tff(func_def_26,type,
list_disj:
!>[X0: $tType] : ( list(fm(X0)) > fm(X0) ) ).
tff(func_def_27,type,
suc: nat > nat ).
tff(func_def_28,type,
i_Z: fun(atom,fun(list(int),bool)) ).
tff(func_def_29,type,
asubst: ( int * list(int) * atom ) > atom ).
tff(func_def_30,type,
divisor: atom > int ).
tff(func_def_31,type,
lbounds: list(atom) > list(product_prod(int,list(int))) ).
tff(func_def_32,type,
qEpres896714165pres_1: list(atom) > fm(atom) ).
tff(func_def_33,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_34,type,
fFalse: bool ).
tff(func_def_35,type,
fTrue: bool ).
tff(func_def_36,type,
as: list(atom) ).
tff(func_def_37,type,
xs: list(int) ).
tff(func_def_38,type,
sK0: int ).
tff(func_def_39,type,
sK1: int ).
tff(func_def_40,type,
sK2:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_41,type,
sK3:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_42,type,
sK4:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_43,type,
sK5:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_44,type,
sK6:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_45,type,
sK7:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_46,type,
sK8:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_47,type,
sK9: ( list(int) * list(fm(atom)) ) > fm(atom) ).
tff(func_def_48,type,
sK10:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) * X0 ) > X0 ) ).
tff(func_def_49,type,
sK11: ( list(int) * list(fm(atom)) ) > fm(atom) ).
tff(func_def_50,type,
sK12:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_51,type,
sK13:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_52,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * list(X1) * fun(X1,X0) ) > X1 ) ).
tff(func_def_53,type,
sK15:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_54,type,
sK16:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_55,type,
sK17:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * list(X0) ) > list(X1) ) ).
tff(func_def_56,type,
sK18:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * list(X0) ) > X0 ) ).
tff(func_def_57,type,
sK19:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * X0 ) > X1 ) ).
tff(func_def_58,type,
sK20:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) * list(X1) ) > X1 ) ).
tff(func_def_59,type,
sK21:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) * list(X1) ) > X1 ) ).
tff(func_def_60,type,
sK22:
!>[X0: $tType] : ( ( fun(X0,X0) * list(X0) ) > X0 ) ).
tff(func_def_61,type,
sK23:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_62,type,
sK24:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_63,type,
sK25:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_64,type,
sK26:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_65,type,
sK27:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_66,type,
sK28:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_67,type,
sK29:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_68,type,
sK30:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_69,type,
sK31:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_70,type,
sK32:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_71,type,
sK33:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_72,type,
sK34: int > atom ).
tff(pred_def_1,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
interpret:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(list(X1),bool)) * fm(X0) * list(X1) ) > $o ) ).
tff(pred_def_5,type,
accp:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * X0 ) > $o ) ).
tff(pred_def_6,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_7,type,
pp: bool > $o ).
tff(f1,axiom,
( ( lbounds(as) != nil(product_prod(int,list(int))) )
=> ? [X4: int] :
! [X5: atom] :
( member(atom,X5,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X5),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X4),xs))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__096lbounds_Aas_A_126_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096) ).
tff(f2,axiom,
( ( lbounds(as) = nil(product_prod(int,list(int))) )
=> ? [X0: int] :
! [X1: atom] :
( member(atom,X1,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__096lbounds_Aas_A_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096) ).
tff(f108,conjecture,
? [X0: int] :
! [X1: atom] :
( member(atom,X1,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f109,negated_conjecture,
~ ? [X0: int] :
! [X1: atom] :
( member(atom,X1,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))) ),
inference(negated_conjecture,[status(cth)],[f108]) ).
tff(f110,plain,
( ( lbounds(as) != nil(product_prod(int,list(int))) )
=> ? [X0: int] :
! [X1: atom] :
( member(atom,X1,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))) ) ),
inference(rectify,[],[f1]) ).
tff(f116,plain,
( ? [X0: int] :
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ( lbounds(as) = nil(product_prod(int,list(int))) ) ),
inference(ennf_transformation,[],[f110]) ).
tff(f117,plain,
( ? [X0: int] :
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ( lbounds(as) != nil(product_prod(int,list(int))) ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f166,plain,
! [X0: int] :
? [X1: atom] :
( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
& member(atom,X1,set(atom,as)) ),
inference(ennf_transformation,[],[f109]) ).
tff(f167,plain,
! [X1: atom] :
( ( lbounds(as) = nil(product_prod(int,list(int))) )
| ~ member(atom,X1,set(atom,as))
| pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK0),xs))) ),
inference(cnf_transformation,[],[f116]) ).
tff(f168,plain,
! [X1: atom] :
( ( lbounds(as) != nil(product_prod(int,list(int))) )
| ~ member(atom,X1,set(atom,as))
| pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK1),xs))) ),
inference(cnf_transformation,[],[f117]) ).
tff(f320,plain,
! [X0: int] : member(atom,sK34(X0),set(atom,as)),
inference(cnf_transformation,[],[f166]) ).
tff(f321,plain,
! [X0: int] : ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,sK34(X0)),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))),
inference(cnf_transformation,[],[f166]) ).
tff(f346,definition,
( spl35_1
<=> ! [X1: atom] :
( ~ member(atom,X1,set(atom,as))
| pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK1),xs))) ) ),
introduced(definition,[new_symbols(definition,[spl35_1])],[avatar_definition]) ).
tff(f347,plain,
( ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK1),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ~ spl35_1 ),
inference(avatar_component_clause,[],[f346]) ).
tff(f349,definition,
( spl35_2
<=> ( lbounds(as) = nil(product_prod(int,list(int))) ) ),
introduced(definition,[new_symbols(definition,[spl35_2])],[avatar_definition]) ).
tff(f352,plain,
( spl35_1
| ~ spl35_2 ),
inference(avatar_split_clause,[],[f168,f349,f346]) ).
tff(f354,definition,
( spl35_3
<=> ! [X1: atom] :
( ~ member(atom,X1,set(atom,as))
| pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK0),xs))) ) ),
introduced(definition,[new_symbols(definition,[spl35_3])],[avatar_definition]) ).
tff(f355,plain,
( ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK0),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ~ spl35_3 ),
inference(avatar_component_clause,[],[f354]) ).
tff(f356,plain,
( spl35_3
| spl35_2 ),
inference(avatar_split_clause,[],[f167,f349,f354]) ).
tff(f793,plain,
( ~ member(atom,sK34(sK0),set(atom,as))
| ~ spl35_3 ),
inference(resolution,[],[f355,f321]) ).
tff(f799,plain,
( $false
| ~ spl35_3 ),
inference(forward_subsumption_resolution,[],[f793,f320]) ).
tff(f800,plain,
~ spl35_3,
inference(avatar_contradiction_clause,[],[f799]) ).
tff(f836,plain,
( ~ member(atom,sK34(sK1),set(atom,as))
| ~ spl35_1 ),
inference(resolution,[],[f347,f321]) ).
tff(f842,plain,
( $false
| ~ spl35_1 ),
inference(forward_subsumption_resolution,[],[f836,f320]) ).
tff(f843,plain,
~ spl35_1,
inference(avatar_contradiction_clause,[],[f842]) ).
cnf(s1,plain,
( spl35_1
| ~ spl35_2 ),
inference(sat_conversion,[],[f352]) ).
cnf(s2,plain,
( spl35_2
| spl35_3 ),
inference(sat_conversion,[],[f356]) ).
cnf(s3,plain,
~ spl35_3,
inference(sat_conversion,[],[f800]) ).
cnf(s4,plain,
~ spl35_1,
inference(sat_conversion,[],[f843]) ).
cnf(s5,plain,
spl35_2,
inference(rat,[],[s2,s3]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s5,s4]) ).
tff(f844,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM081_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 % Computer : n006.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Mon Sep 28 21:52:55 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.28 Running first-order model finding
% 0.09/0.28 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.25/0.37 % (245496)Will run a generic schedule for satisfiability detection.
% 0.25/0.37 % (245507)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3782472045:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.37 % (245503)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2235330798_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.37 % (245504)% WARNING: option uhcvi not known.
% 0.25/0.37 % Exception at run slice level
% 0.25/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.37 % (245509)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1972811670:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.37 % (245506)dis+10_1_sil=32000:sp=arity:random_seed=1139966237:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.37 % (245508)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=589494604:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.37 % (245505)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2942889051:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.37 % (245504)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2349263663:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.37 % (245513)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=431775515:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.25/0.37 % Exception at run slice level
% 0.25/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.37 % (245507) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-245496-245507"...
% 0.25/0.37 % (245507)...printing done.
% 0.25/0.37 % (245507)Refutation found. Thanks to Tanya!
% 0.25/0.37 % SZS status Theorem for theBenchmark
% 0.25/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.37 % (245507)------------------------------
% 0.25/0.37 % (245507)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (245507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (245507)CaDiCaL version: 2.1.3
% 0.25/0.37 % (245507)Termination reason: Refutation
% 0.25/0.37 % (245507)Time elapsed: 0.043 s
% 0.25/0.37 % (245507)Peak memory usage: 13 MB
% 0.25/0.37 % (245507)Instructions burned: 84 (million)
% 0.25/0.37 % (245496)Success in time 0.076 s
% 0.25/0.37 % Vampire exiting
%------------------------------------------------------------------------------