%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL834_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 : n011.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 12:00:47 PM UTC 2026
% Result : Theorem 1.03s 0.59s
% Output : Refutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 71 ( 71 usr; 19 con; 0-5 aty)
% Number of variables : 35 ( 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
type: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,X1),fun(fun(X2,X0),fun(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_4,type,
abs: dB > dB ).
tff(func_def_5,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_6,type,
var: nat > dB ).
tff(func_def_7,type,
dB_size: dB > nat ).
tff(func_def_8,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_9,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_12,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_13,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_15,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_16,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_17,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_18,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_19,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_20,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_21,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_22,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fTrue: bool ).
tff(func_def_26,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_27,type,
t1: type ).
tff(func_def_28,type,
t_a: type ).
tff(func_def_29,type,
t: type ).
tff(func_def_30,type,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
e: fun(nat,type) ).
tff(func_def_33,type,
ea: fun(nat,type) ).
tff(func_def_34,type,
i: nat ).
tff(func_def_35,type,
ia: nat ).
tff(func_def_36,type,
r: dB ).
tff(func_def_37,type,
t2: dB ).
tff(func_def_38,type,
u: dB ).
tff(func_def_39,type,
ua: dB ).
tff(func_def_40,type,
sK1: ( dB * dB ) > dB ).
tff(func_def_41,type,
sK2: ( dB * dB * dB ) > dB ).
tff(func_def_42,type,
sK3: ( dB * dB * dB ) > dB ).
tff(func_def_43,type,
sK4: ( dB * dB * dB ) > dB ).
tff(func_def_44,type,
sK5: ( dB * fun(nat,type) ) > type ).
tff(func_def_45,type,
sK6: ( dB * fun(nat,type) ) > type ).
tff(func_def_46,type,
sK7: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_47,type,
sK8: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK9: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_50,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_51,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_52,type,
sK13: ( dB * list(dB) * dB ) > dB ).
tff(func_def_53,type,
sK14: ( dB * list(dB) * dB ) > dB ).
tff(func_def_54,type,
sK15: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_55,type,
sK16: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_56,type,
sK17: ( dB * list(dB) * dB ) > dB ).
tff(func_def_57,type,
sK18:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_58,type,
sK19:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_59,type,
sK20:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_60,type,
sK21:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_61,type,
sK22:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_62,type,
sK23:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_63,type,
sK24: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_64,type,
sK25: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_65,type,
sK26:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_66,type,
sK27: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_67,type,
sK28: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_68,type,
sK29: ( dB * list(dB) * nat ) > list(dB) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
it: dB > $o ).
tff(pred_def_3,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: ( dB * list(dB) * dB ) > $o ).
tff(f4,axiom,
! [X0: dB,X1: dB] : pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X0)),subst(X1,X0,zero_zero(nat)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_beta) ).
tff(f11,axiom,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X1))
=> pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,X2,X0)),foldl(dB,dB,app,X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_10_apps__preserves__beta) ).
tff(f104,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f110,conjecture,
pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f111,negated_conjecture,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(negated_conjecture,[status(cth)],[f110]) ).
tff(f113,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(flattening,[],[f111]) ).
tff(f117,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,X2,X0)),foldl(dB,dB,app,X1,X0)))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X1)) ),
inference(ennf_transformation,[],[f11]) ).
tff(f222,plain,
! [X0: dB,X1: dB] : pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X0)),subst(X1,X0,zero_zero(nat)))),
inference(cnf_transformation,[],[f4]) ).
tff(f232,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,X2,X0)),foldl(dB,dB,app,X1,X0)))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X1)) ),
inference(cnf_transformation,[],[f117]) ).
tff(f376,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f104]) ).
tff(f382,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(cnf_transformation,[],[f113]) ).
tff(f463,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( pp(aa(dB,bool,combc(dB,dB,bool,beta,foldl(dB,dB,app,X1,X0)),foldl(dB,dB,app,X2,X0)))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X1)) ),
inference(forward_demodulation,[],[f232,f376]) ).
tff(f468,plain,
! [X0: dB,X1: dB] : pp(aa(dB,bool,combc(dB,dB,bool,beta,subst(X1,X0,zero_zero(nat))),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X0))),
inference(forward_demodulation,[],[f222,f376]) ).
tff(f490,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( pp(aa(dB,bool,combc(dB,dB,bool,beta,foldl(dB,dB,app,X1,X0)),foldl(dB,dB,app,X2,X0)))
| ~ pp(aa(dB,bool,combc(dB,dB,bool,beta,X1),X2)) ),
inference(forward_demodulation,[],[f463,f376]) ).
tff(f495,plain,
! [X0: dB,X1: dB] : pp(aa(dB,bool,combc(dB,dB,bool,beta,subst(X1,X0,zero_zero(nat))),aa(dB,dB,combc(dB,dB,dB,app,X0),abs(X1)))),
inference(forward_demodulation,[],[f468,f376]) ).
tff(f1524,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,combc(dB,dB,dB,app,a),abs(r)),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(superposition,[],[f382,f376]) ).
tff(f1526,plain,
~ pp(aa(dB,bool,combc(dB,dB,bool,beta,foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),foldl(dB,dB,app,aa(dB,dB,combc(dB,dB,dB,app,a),abs(r)),as))),
inference(forward_demodulation,[],[f1524,f376]) ).
tff(f2497,plain,
~ pp(aa(dB,bool,combc(dB,dB,bool,beta,subst(r,a,zero_zero(nat))),aa(dB,dB,combc(dB,dB,dB,app,a),abs(r)))),
inference(resolution,[],[f490,f1526]) ).
tff(f2533,plain,
$false,
inference(resolution,[],[f2497,f495]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL834_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.12/0.37 % Computer : n011.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 16:58:46 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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
% 1.03/0.59 % (2620236)Will run a generic schedule for satisfiability detection.
% 1.03/0.59 % (2620247)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3010201089:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.03/0.59 % (2620242)% WARNING: option uhcvi not known.
% 1.03/0.59 % (2620241)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=767023636_2999 on theBenchmark for (2999ds/0Mi)
% 1.03/0.59 % (2620243)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=491520590:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.03/0.59 % (2620242)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1164715974:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.03/0.59 % (2620244)dis+10_1_sil=32000:sp=arity:random_seed=2198415266:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.03/0.59 % (2620245)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=278457878:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.03/0.59 % (2620246)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1142203232:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.03/0.59 % Exception at run slice level
% 1.03/0.59 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.03/0.59 % (2620255)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1704680240:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.03/0.59 % Exception at run slice level
% 1.03/0.59 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.03/0.59 % (2620247)Instruction limit reached!
% 1.03/0.59 % (2620247)------------------------------
% 1.03/0.59 % (2620247)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.59 % (2620247)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.59 % (2620247)CaDiCaL version: 2.1.3
% 1.03/0.59 % (2620247)Termination reason: Instruction limit
% 1.03/0.59 % (2620247)Termination phase: Saturation
% 1.03/0.59 % (2620247)Time elapsed: 0.050 s
% 1.03/0.59 % (2620247)Peak memory usage: 13 MB
% 1.03/0.59 % (2620247)Instructions burned: 161 (million)
% 1.03/0.59 % (2620257)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2161583311:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.03/0.59 % (2620258)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=1078602950:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.03/0.59 % (2620244)Instruction limit reached!
% 1.03/0.59 % (2620244)------------------------------
% 1.03/0.59 % (2620244)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.59 % (2620244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.59 % (2620244)CaDiCaL version: 2.1.3
% 1.03/0.59 % (2620244)Termination reason: Instruction limit
% 1.03/0.59 % (2620244)Termination phase: Saturation
% 1.03/0.59 % (2620244)Time elapsed: 0.055 s
% 1.03/0.59 % (2620244)Peak memory usage: 12 MB
% 1.03/0.59 % (2620244)Instructions burned: 105 (million)
% 1.03/0.59 % (2620245)Instruction limit reached!
% 1.03/0.59 % (2620245)------------------------------
% 1.03/0.59 % (2620245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.59 % (2620245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.59 % (2620245)CaDiCaL version: 2.1.3
% 1.03/0.59 % (2620245)Termination reason: Instruction limit
% 1.03/0.59 % (2620245)Termination phase: Saturation
% 1.03/0.59 % (2620245)Time elapsed: 0.057 s
% 1.03/0.59 % (2620245)Peak memory usage: 12 MB
% 1.03/0.59 % (2620245)Instructions burned: 118 (million)
% 1.03/0.59 % (2620261)ott-21_1_sil=16000:fs=off:random_seed=1419807092:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 1.03/0.59 % (2620262)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3632733024:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 1.03/0.59 % (2620246)Instruction limit reached!
% 1.03/0.59 % (2620246)------------------------------
% 1.03/0.59 % (2620246)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.59 % (2620246)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.59 % (2620246)CaDiCaL version: 2.1.3
% 1.03/0.59 % (2620246)Termination reason: Instruction limit
% 1.03/0.59 % (2620246)Termination phase: Saturation
% 1.03/0.59 % (2620246)Time elapsed: 0.083 s
% 1.03/0.59 % (2620246)Peak memory usage: 13 MB
% 1.03/0.59 % (2620246)Instructions burned: 131 (million)
% 1.03/0.59 % (2620265)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3195548514:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.03/0.59 % Exception at run slice level
% 1.03/0.59 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.03/0.59 % (2620267)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2588497112:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.03/0.59 % (2620261) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2620236-2620261"...
% 1.03/0.59 % (2620261)...printing done.
% 1.03/0.59 % (2620257)Instruction limit reached!
% 1.03/0.59 % (2620257)------------------------------
% 1.03/0.59 % (2620257)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.59 % (2620257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.59 % (2620257)CaDiCaL version: 2.1.3
% 1.03/0.59 % (2620257)Termination reason: Instruction limit
% 1.03/0.59 % (2620257)Termination phase: Saturation
% 1.03/0.59 % (2620257)Time elapsed: 0.082 s
% 1.03/0.59 % (2620257)Peak memory usage: 13 MB
% 1.03/0.59 % (2620257)Instructions burned: 131 (million)
% 1.03/0.59 % (2620261)Refutation found. Thanks to Tanya!
% 1.03/0.59 % SZS status Theorem for theBenchmark
% 1.03/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.03/0.59 % (2620261)------------------------------
% 1.03/0.59 % (2620261)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.59 % (2620261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.59 % (2620261)CaDiCaL version: 2.1.3
% 1.03/0.59 % (2620261)Termination reason: Refutation
% 1.03/0.59 % (2620261)Time elapsed: 0.055 s
% 1.03/0.59 % (2620261)Peak memory usage: 12 MB
% 1.03/0.59 % (2620261)Instructions burned: 99 (million)
% 1.03/0.59 % (2620236)Success in time 0.175 s
% 1.03/0.59 % Vampire exiting
%------------------------------------------------------------------------------