%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL775_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 : n016.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:33 PM UTC 2026
% Result : Theorem 0.82s 0.60s
% Output : Refutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 9 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 67 ( 67 usr; 9 con; 0-5 aty)
% Number of variables : 43 ( 43 !; 0 ?; 43 :)
% 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,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_size: dB > nat ).
tff(func_def_7,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_8,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_9,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_12,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_13,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_17,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_18,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_19,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_20,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_21,type,
fFalse: bool ).
tff(func_def_22,type,
fTrue: bool ).
tff(func_def_23,type,
i: nat ).
tff(func_def_24,type,
r: dB ).
tff(func_def_25,type,
s: dB ).
tff(func_def_26,type,
ss: list(dB) ).
tff(func_def_27,type,
sK0: dB > dB ).
tff(func_def_28,type,
sK1: dB > dB ).
tff(func_def_29,type,
sK2: dB > list(dB) ).
tff(func_def_30,type,
sK3: dB > dB ).
tff(func_def_31,type,
sK4: dB > list(dB) ).
tff(func_def_32,type,
sK5: dB > nat ).
tff(func_def_33,type,
sK6: ( dB * dB ) > dB ).
tff(func_def_34,type,
sK7: ( dB * dB * dB ) > dB ).
tff(func_def_35,type,
sK8: ( dB * dB * dB ) > dB ).
tff(func_def_36,type,
sK9: ( dB * dB * dB ) > dB ).
tff(func_def_37,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_38,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_39,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_40,type,
sK13: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_41,type,
sK14: ( dB * list(dB) * dB ) > dB ).
tff(func_def_42,type,
sK15: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_43,type,
sK16: ( dB * list(dB) * dB ) > dB ).
tff(func_def_44,type,
sK17: ( dB * list(dB) * dB ) > dB ).
tff(func_def_45,type,
sK18: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_46,type,
sK19:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_47,type,
sK20:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_48,type,
sK21:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_49,type,
sK22:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK23:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_51,type,
sK24:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_52,type,
sK25:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_53,type,
sK26:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_54,type,
sK27: ( list(dB) * dB * dB * dB ) > list(dB) ).
tff(func_def_55,type,
sK28:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_56,type,
sK29:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_57,type,
sK30:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_58,type,
sK31:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_59,type,
sK32:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_60,type,
sK33:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_61,type,
sK34:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_62,type,
sK35:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_63,type,
sK36:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_64,type,
sK37:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_5,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_6,type,
pp: bool > $o ).
tff(f3,axiom,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0)))
=> ( pp(aa(dB,bool,it,X1))
=> pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_Beta) ).
tff(f59,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_58_foldl__Cons) ).
tff(f95,axiom,
! [X0: dB,X1: list(dB),X2: dB] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_94_app__last) ).
tff(f99,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1] :
( ( rotate1(X0,nil(X0)) = nil(X0) )
& ( rotate1(X1,cons(X1,X3,X2)) = append(X1,X2,cons(X1,X3,nil(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_98_rotate__simps) ).
tff(f104,axiom,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f105,axiom,
pp(aa(dB,bool,it,s)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2) ).
tff(f107,conjecture,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).
tff(f108,negated_conjecture,
~ pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
inference(negated_conjecture,[status(cth)],[f107]) ).
tff(f112,plain,
~ pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
inference(flattening,[],[f108]) ).
tff(f115,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(ennf_transformation,[],[f3]) ).
tff(f116,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(flattening,[],[f115]) ).
tff(f153,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0)))
| ~ pp(aa(dB,bool,it,X1))
| pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0))) ),
inference(cnf_transformation,[],[f116]) ).
tff(f263,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(cnf_transformation,[],[f59]) ).
tff(f347,plain,
! [X2: dB,X0: dB,X1: list(dB)] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
inference(cnf_transformation,[],[f95]) ).
tff(f352,plain,
! [X1: $tType,X2: list(X1),X3: X1] : ( rotate1(X1,cons(X1,X3,X2)) = append(X1,X2,cons(X1,X3,nil(X1))) ),
inference(cnf_transformation,[],[f99]) ).
tff(f358,plain,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
inference(cnf_transformation,[],[f104]) ).
tff(f359,plain,
pp(aa(dB,bool,it,s)),
inference(cnf_transformation,[],[f105]) ).
tff(f361,plain,
~ pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
inference(cnf_transformation,[],[f112]) ).
tff(f1052,plain,
! [X2: dB,X0: dB,X1: list(dB)] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,rotate1(dB,cons(dB,X0,X1))) ),
inference(forward_demodulation,[],[f347,f352]) ).
tff(f1068,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),rotate1(dB,cons(dB,var(i),ss))))),
inference(superposition,[],[f361,f1052]) ).
tff(f1069,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),rotate1(dB,cons(dB,var(i),ss))))),
inference(superposition,[],[f358,f1052]) ).
tff(f1082,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,rotate1(dB,cons(dB,var(i),ss)))))),
inference(forward_demodulation,[],[f1068,f263]) ).
tff(f1291,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0)))
| pp(aa(dB,bool,it,foldl(dB,dB,app,abs(X2),cons(dB,X1,X0))))
| ~ pp(aa(dB,bool,it,X1)) ),
inference(forward_demodulation,[],[f153,f263]) ).
tff(f2380,plain,
( pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,rotate1(dB,cons(dB,var(i),ss))))))
| ~ pp(aa(dB,bool,it,s)) ),
inference(resolution,[],[f1069,f1291]) ).
tff(f2385,plain,
~ pp(aa(dB,bool,it,s)),
inference(forward_subsumption_resolution,[],[f2380,f1082]) ).
tff(f2387,plain,
$false,
inference(forward_subsumption_resolution,[],[f2385,f359]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL775_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.41 % Computer : n016.cluster.edu
% 0.12/0.41 % Model : x86_64 x86_64
% 0.12/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.41 % Memory : 8046.5625MB
% 0.12/0.41 % OS : Linux 6.8.0-71-generic
% 0.12/0.41 % CPULimit : 300
% 0.12/0.41 % WCLimit : 300
% 0.12/0.41 % DateTime : Sun Sep 27 16:51:48 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 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.82/0.60 % (2840109)Will run a generic schedule for satisfiability detection.
% 0.82/0.60 % (2840120)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=254598747:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.82/0.60 % (2840115)% WARNING: option uhcvi not known.
% 0.82/0.60 % (2840116)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3267654799:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.82/0.60 % (2840114)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1431846411_2999 on theBenchmark for (2999ds/0Mi)
% 0.82/0.60 % (2840115)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=356793550:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.82/0.60 % (2840117)dis+10_1_sil=32000:sp=arity:random_seed=2856093431:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.82/0.60 % (2840118)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=871087698:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.82/0.60 % (2840119)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1258154492:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.82/0.60 % Exception at run slice level
% 0.82/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.82/0.60 % (2840128)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2062881801:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.82/0.60 % Exception at run slice level
% 0.82/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.82/0.60 % (2840120)Instruction limit reached!
% 0.82/0.60 % (2840120)------------------------------
% 0.82/0.60 % (2840120)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.60 % (2840120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.60 % (2840120)CaDiCaL version: 2.1.3
% 0.82/0.60 % (2840120)Termination reason: Instruction limit
% 0.82/0.60 % (2840120)Termination phase: Saturation
% 0.82/0.60 % (2840120)Time elapsed: 0.052 s
% 0.82/0.60 % (2840120)Peak memory usage: 13 MB
% 0.82/0.60 % (2840120)Instructions burned: 159 (million)
% 0.82/0.60 % (2840130)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3170145973:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.82/0.60 % (2840131)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=1682769551:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.82/0.60 % (2840117)Instruction limit reached!
% 0.82/0.60 % (2840117)------------------------------
% 0.82/0.60 % (2840117)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.60 % (2840117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.60 % (2840117)CaDiCaL version: 2.1.3
% 0.82/0.60 % (2840117)Termination reason: Instruction limit
% 0.82/0.60 % (2840117)Termination phase: Saturation
% 0.82/0.60 % (2840117)Time elapsed: 0.062 s
% 0.82/0.60 % (2840117)Peak memory usage: 12 MB
% 0.82/0.60 % (2840117)Instructions burned: 103 (million)
% 0.82/0.60 % (2840118)Instruction limit reached!
% 0.82/0.60 % (2840118)------------------------------
% 0.82/0.60 % (2840118)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.60 % (2840118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.60 % (2840118)CaDiCaL version: 2.1.3
% 0.82/0.60 % (2840118)Termination reason: Instruction limit
% 0.82/0.60 % (2840118)Termination phase: Saturation
% 0.82/0.60 % (2840118)Time elapsed: 0.065 s
% 0.82/0.60 % (2840118)Peak memory usage: 12 MB
% 0.82/0.60 % (2840118)Instructions burned: 116 (million)
% 0.82/0.60 % (2840119)Instruction limit reached!
% 0.82/0.60 % (2840119)------------------------------
% 0.82/0.60 % (2840119)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.60 % (2840119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.60 % (2840119)CaDiCaL version: 2.1.3
% 0.82/0.60 % (2840119)Termination reason: Instruction limit
% 0.82/0.60 % (2840119)Termination phase: Saturation
% 0.82/0.60 % (2840119)Time elapsed: 0.079 s
% 0.82/0.60 % (2840119)Peak memory usage: 13 MB
% 0.82/0.60 % (2840119)Instructions burned: 132 (million)
% 0.82/0.60 % (2840134)ott-21_1_sil=16000:fs=off:random_seed=1800754854:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.82/0.60 % (2840135)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1405138389:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 0.82/0.60 % (2840136)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2764286930:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.82/0.60 % Exception at run slice level
% 0.82/0.60 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.82/0.60 % (2840115) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2840109-2840115"...
% 0.82/0.60 % (2840115)...printing done.
% 0.82/0.60 % (2840115)Refutation found. Thanks to Tanya!
% 0.82/0.60 % SZS status Theorem for theBenchmark
% 0.82/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.82/0.60 % (2840115)------------------------------
% 0.82/0.60 % (2840115)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.60 % (2840115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.60 % (2840115)CaDiCaL version: 2.1.3
% 0.82/0.60 % (2840115)Termination reason: Refutation
% 0.82/0.60 % (2840115)Time elapsed: 0.117 s
% 0.82/0.60 % (2840115)Peak memory usage: 13 MB
% 0.82/0.60 % (2840115)Instructions burned: 193 (million)
% 0.82/0.60 % (2840109)Success in time 0.153 s
% 0.82/0.60 % Vampire exiting
%------------------------------------------------------------------------------