%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL835_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 11:56:48 AM UTC 2026
% Result : Theorem 3.17s 1.34s
% Output : Refutation 3.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 16 ~; 10 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 9 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 78 ( 78 usr; 19 con; 0-5 aty)
% Number of variables : 31 ( 31 !; 0 ?; 31 :)
% 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,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
it: fun(dB,bool) ).
tff(func_def_5,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_8,type,
var: nat > dB ).
tff(func_def_9,type,
dB_size: dB > nat ).
tff(func_def_10,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_11,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_12,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_15,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_17,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_18,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_22,type,
fun1: ( type * type ) > type ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_25,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_26,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_27,type,
fFalse: bool ).
tff(func_def_28,type,
fTrue: bool ).
tff(func_def_29,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_30,type,
t: type ).
tff(func_def_31,type,
t_a: type ).
tff(func_def_32,type,
t1: type ).
tff(func_def_33,type,
a: dB ).
tff(func_def_34,type,
as: list(dB) ).
tff(func_def_35,type,
e: fun(nat,type) ).
tff(func_def_36,type,
ea: fun(nat,type) ).
tff(func_def_37,type,
i: nat ).
tff(func_def_38,type,
ia: nat ).
tff(func_def_39,type,
r: dB ).
tff(func_def_40,type,
t2: dB ).
tff(func_def_41,type,
u: dB ).
tff(func_def_42,type,
ua: dB ).
tff(func_def_43,type,
sK2: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_44,type,
sK3: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_45,type,
sK4: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_46,type,
sK5: ( dB * dB ) > dB ).
tff(func_def_47,type,
sK6: ( dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK7: ( dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK8: ( dB * dB * dB ) > dB ).
tff(func_def_50,type,
sK9: ( dB * dB * dB ) > dB ).
tff(func_def_51,type,
sK10: ( dB * dB * dB ) > dB ).
tff(func_def_52,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_53,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_54,type,
sK13:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_55,type,
sK14: ( dB * list(dB) * dB ) > dB ).
tff(func_def_56,type,
sK15: ( dB * list(dB) * dB ) > dB ).
tff(func_def_57,type,
sK16: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_58,type,
sK17: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_59,type,
sK18: ( dB * list(dB) * dB ) > dB ).
tff(func_def_60,type,
sK19:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_61,type,
sK20: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_62,type,
sK21:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_63,type,
sK22:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_64,type,
sK23:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_65,type,
sK24:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_66,type,
sK25:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_67,type,
sK26:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_68,type,
sK27: dB > dB ).
tff(func_def_69,type,
sK28: dB > dB ).
tff(func_def_70,type,
sK29: dB > list(dB) ).
tff(func_def_71,type,
sK30: dB > list(dB) ).
tff(func_def_72,type,
sK31: dB > nat ).
tff(func_def_73,type,
sK32: dB > dB ).
tff(func_def_74,type,
sK33:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_75,type,
sK34:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > 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,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * 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(pred_def_7,type,
sP1: dB > $o ).
tff(pred_def_8,type,
sQ35_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f5,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_T) ).
tff(f26,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_25_beta) ).
tff(f30,axiom,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X2),X1))
=> ( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
=> pp(aa(type,bool,typing(X3,X0),X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_29_subject__reduction) ).
tff(f40,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_39_apps__preserves__beta) ).
tff(f111,conjecture,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f112,negated_conjecture,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(negated_conjecture,[status(cth)],[f111]) ).
tff(f115,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(flattening,[],[f112]) ).
tff(f132,plain,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(ennf_transformation,[],[f30]) ).
tff(f133,plain,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(flattening,[],[f132]) ).
tff(f144,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,[],[f40]) ).
tff(f229,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),t)),
inference(cnf_transformation,[],[f5]) ).
tff(f258,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,[],[f26]) ).
tff(f262,plain,
! [X2: dB,X3: fun(nat,type),X0: dB,X1: type] :
( pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(cnf_transformation,[],[f133]) ).
tff(f276,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,[],[f144]) ).
tff(f400,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(cnf_transformation,[],[f115]) ).
tff(f943,plain,
! [X0: dB] :
( ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X0),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)))
| ~ pp(aa(type,bool,typing(shift(type,e,i,t1),X0),t)) ),
inference(resolution,[],[f262,f400]) ).
tff(f1071,plain,
! [X0: dB] :
( ~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,X0,as)),t))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X0),subst(r,a,zero_zero(nat)))) ),
inference(resolution,[],[f276,f943]) ).
tff(f1073,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a)),subst(r,a,zero_zero(nat)))),
inference(resolution,[],[f1071,f229]) ).
tff(f1081,plain,
$false,
inference(resolution,[],[f1073,f258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL835_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n013.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 16:58:06 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.34 % (419456)Detected formulas, will run a generic FOF schedule.
% 3.17/1.34 % (419464)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=723924648:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.17/1.34 % (419464)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.17/1.34 % (419464)Refutation not found, incomplete strategy
% 3.17/1.34 % (419464)------------------------------
% 3.17/1.34 % (419464)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.17/1.34 % (419464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.17/1.34 % (419464)CaDiCaL version: 2.1.3
% 3.17/1.34 % (419464)Termination reason: Refutation not found, incomplete strategy
% 3.17/1.34 % (419464)Time elapsed: 0.002 s
% 3.17/1.34 % (419464)Peak memory usage: 88 MB
% 3.17/1.34 % (419464)Instructions burned: 3 (million)
% 3.17/1.34 % (419466)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1307564557:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.17/1.34 % (419467)dis-21_1_sil=8000:lcm=predicate:random_seed=3524453372:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.17/1.34 % (419463)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=226551893:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.17/1.34 % (419462)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2811967080:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.17/1.34 % (419465)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3539071872:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.17/1.34 % (419461)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=840111593:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.17/1.34 % (419463)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.17/1.34 % (419467)First to succeed.
% 3.17/1.34 % (419467)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-419456"
% 3.17/1.34 % (419465)Also succeeded, but the first one will report.
% 3.17/1.34 % (419466)Instruction limit reached!
% 3.17/1.34 % (419466)------------------------------
% 3.17/1.34 % (419466)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.17/1.34 % (419466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.17/1.34 % (419466)CaDiCaL version: 2.1.3
% 3.17/1.34 % (419466)Termination reason: Instruction limit
% 3.17/1.34 % (419466)Termination phase: Saturation
% 3.17/1.34 % (419466)Time elapsed: 0.083 s
% 3.17/1.34 % (419466)Peak memory usage: 89 MB
% 3.17/1.34 % (419466)Instructions burned: 141 (million)
% 3.17/1.34 % (419464)------------------------------
% 3.17/1.34 % (419464)------------------------------
% 3.17/1.34 % (419476)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3766440895:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.17/1.34 % (419475)lrs+10_1_sil=8000:sp=occurrence:random_seed=990561263:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.17/1.34 % (419475)Also succeeded, but the first one will report.
% 3.17/1.34 % (419476)Instruction limit reached!
% 3.17/1.34 % (419476)------------------------------
% 3.17/1.34 % (419476)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.17/1.34 % (419476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.17/1.34 % (419476)CaDiCaL version: 2.1.3
% 3.17/1.34 % (419476)Termination reason: Instruction limit
% 3.17/1.34 % (419476)Termination phase: Saturation
% 3.17/1.34 % (419476)Time elapsed: 0.049 s
% 3.17/1.34 % (419476)Peak memory usage: 90 MB
% 3.17/1.34 % (419476)Instructions burned: 159 (million)
% 3.17/1.34 % (419467)Refutation found. Thanks to Tanya!
% 3.17/1.34 % SZS status Theorem for theBenchmark
% 3.17/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 3.93/1.54 % (419467)------------------------------
% 3.93/1.54 % (419467)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.54 % (419467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.54 % (419467)CaDiCaL version: 2.1.3
% 3.93/1.54 % (419467)Termination reason: Refutation
% 3.93/1.54 % (419467)Time elapsed: 0.025 s
% 3.93/1.54 % (419467)Peak memory usage: 89 MB
% 3.93/1.54 % (419467)Instructions burned: 41 (million)
% 3.93/1.54 % (419467)------------------------------
% 3.93/1.54 % (419467)------------------------------
% 3.93/1.54 % (419456)Success in time 0.476 s
% 3.93/1.54 % Vampire exiting
%------------------------------------------------------------------------------