%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM233_1 : TPTP v9.3.1. Released v9.3.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 09:40:32 AM UTC 2026
% Result : Theorem 0.20s 0.33s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 51 ( 12 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 49 ( 22 ~; 9 |; 15 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 28 ( 26 usr; 1 prp; 0-5 aty)
% Number of functors : 115 ( 115 usr; 9 con; 0-3 aty)
% Number of variables : 20 ( 18 !; 2 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
vTerm: $tType ).
tff(type_def_6,type,
vOptTerm: $tType ).
tff(type_def_7,type,
vTy: $tType ).
tff(func_def_0,type,
vNat: vTy ).
tff(func_def_1,type,
vSucc: vTerm > vTerm ).
tff(func_def_2,type,
vPred: vTerm > vTerm ).
tff(func_def_3,type,
vsomeTerm: vTerm > vOptTerm ).
tff(func_def_4,type,
vZero: vTerm ).
tff(func_def_5,type,
vIszero: vTerm > vTerm ).
tff(func_def_6,type,
vTrue: vTerm ).
tff(func_def_7,type,
vFalse: vTerm ).
tff(func_def_8,type,
vnoTerm: vOptTerm ).
tff(func_def_9,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(func_def_10,type,
vt2: vTerm ).
tff(func_def_11,type,
vB: vTy ).
tff(func_def_12,type,
vIfelse: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_13,type,
vt1: vTerm ).
tff(func_def_14,type,
vreduce: vTerm > vOptTerm ).
tff(func_def_15,type,
vplusop: ( vTerm * vTerm ) > vTerm ).
tff(func_def_16,type,
vgetTerm: vOptTerm > vTerm ).
tff(func_def_17,type,
sK0: vTerm > vTerm ).
tff(func_def_18,type,
sK1: vTerm > vTerm ).
tff(func_def_19,type,
sK2: vTerm > vTerm ).
tff(func_def_20,type,
sK3: vTerm > vTerm ).
tff(func_def_21,type,
sK4: vTerm > vTerm ).
tff(func_def_22,type,
sK5: vTerm > vTerm ).
tff(func_def_23,type,
sK6: vTerm > vTerm ).
tff(func_def_24,type,
sK7: vTerm > vTerm ).
tff(func_def_25,type,
sK8: vOptTerm > vTerm ).
tff(func_def_26,type,
sK9: vTerm > vTerm ).
tff(func_def_27,type,
sK10: vTerm > vTerm ).
tff(func_def_28,type,
sK11: vTerm > vTerm ).
tff(func_def_29,type,
sK12: vTerm > vTerm ).
tff(func_def_30,type,
sK13: vTerm > vTerm ).
tff(func_def_31,type,
sK14: vTerm > vTerm ).
tff(func_def_32,type,
sK15: vOptTerm > vTerm ).
tff(func_def_33,type,
sK16: vTerm > vTerm ).
tff(func_def_34,type,
sK17: ( vTerm * vTerm ) > vTerm ).
tff(func_def_35,type,
sK18: ( vTerm * vTerm ) > vTerm ).
tff(func_def_36,type,
sK19: ( vTerm * vTerm ) > vTerm ).
tff(func_def_37,type,
sK20: ( vTerm * vTerm ) > vTerm ).
tff(func_def_38,type,
sK21: ( vTerm * vTerm ) > vTerm ).
tff(func_def_39,type,
sK23: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_40,type,
sK24: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_41,type,
sK25: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_42,type,
sK26: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_43,type,
sK27: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_44,type,
sK28: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_45,type,
sK29: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_46,type,
sK30: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_47,type,
sK31: vTerm > vTerm ).
tff(func_def_48,type,
sK32: vTerm > vTerm ).
tff(func_def_49,type,
sK33: vTerm > vTerm ).
tff(func_def_50,type,
sK34: vTerm > vTerm ).
tff(func_def_51,type,
sK35: vTerm > vTerm ).
tff(func_def_52,type,
sK36: vTerm > vTerm ).
tff(func_def_53,type,
sK37: vTerm > vTerm ).
tff(func_def_54,type,
sK38: vTerm > vTerm ).
tff(func_def_55,type,
sK39: vTerm > vTerm ).
tff(func_def_56,type,
sK40: vTerm > vTerm ).
tff(func_def_57,type,
sK41: vTerm > vTerm ).
tff(func_def_58,type,
sK42: vTerm > vTerm ).
tff(func_def_59,type,
sK43: vTerm > vTerm ).
tff(func_def_60,type,
sK44: vTerm > vTerm ).
tff(func_def_61,type,
sK45: vTerm > vTerm ).
tff(func_def_62,type,
sK46: vTerm > vTerm ).
tff(func_def_63,type,
sK47: vTerm > vTerm ).
tff(func_def_64,type,
sK48: vTerm > vTerm ).
tff(func_def_65,type,
sK49: vTerm > vTerm ).
tff(func_def_66,type,
sK50: vTerm > vTerm ).
tff(func_def_67,type,
sK51: vTerm > vTerm ).
tff(func_def_68,type,
sK52: vTerm > vOptTerm ).
tff(func_def_69,type,
sK53: vTerm > vTerm ).
tff(func_def_70,type,
sK54: vTerm > vTerm ).
tff(func_def_71,type,
sK55: vTerm > vOptTerm ).
tff(func_def_72,type,
sK56: vTerm > vTerm ).
tff(func_def_73,type,
sK57: vTerm > vTerm ).
tff(func_def_74,type,
sK58: vTerm > vOptTerm ).
tff(func_def_75,type,
sK59: vTerm > vTerm ).
tff(func_def_76,type,
sK60: vTerm > vTerm ).
tff(func_def_77,type,
sK61: vTerm > vOptTerm ).
tff(func_def_78,type,
sK62: vTerm > vTerm ).
tff(func_def_79,type,
sK63: vTerm > vTerm ).
tff(func_def_80,type,
sK64: vTerm > vTerm ).
tff(func_def_81,type,
sK65: vTerm > vOptTerm ).
tff(func_def_82,type,
sK66: vTerm > vTerm ).
tff(func_def_83,type,
sK67: vTerm > vOptTerm ).
tff(func_def_84,type,
sK68: vTerm > vTerm ).
tff(func_def_85,type,
sK69: vTerm > vOptTerm ).
tff(func_def_86,type,
sK70: vTerm > vTerm ).
tff(func_def_87,type,
sK71: vTerm > vOptTerm ).
tff(func_def_88,type,
sK72: vTerm > vTerm ).
tff(func_def_89,type,
sK73: vTerm > vTerm ).
tff(func_def_90,type,
sK74: vTerm > vOptTerm ).
tff(func_def_91,type,
sK75: vTerm > vTerm ).
tff(func_def_92,type,
sK76: vTerm > vOptTerm ).
tff(func_def_93,type,
sK77: vTerm > vTerm ).
tff(func_def_94,type,
sK78: vTerm > vOptTerm ).
tff(func_def_95,type,
sK79: vTerm > vTerm ).
tff(func_def_96,type,
sK80: vTerm > vOptTerm ).
tff(func_def_97,type,
sK81: vTerm > vTerm ).
tff(func_def_98,type,
sK82: vTerm > vTerm ).
tff(func_def_99,type,
sK83: vTerm > vOptTerm ).
tff(func_def_100,type,
sK84: vTerm > vTerm ).
tff(func_def_101,type,
sK85: vTerm > vOptTerm ).
tff(func_def_102,type,
sK86: vTerm > vTerm ).
tff(func_def_103,type,
sK87: vTerm > vTerm ).
tff(func_def_104,type,
sK88: vTerm > vTerm ).
tff(func_def_105,type,
sK89: vTerm > vOptTerm ).
tff(func_def_106,type,
sK90: vTerm > vTerm ).
tff(func_def_107,type,
sK91: vTerm > vTerm ).
tff(func_def_108,type,
sK92: vTerm > vTerm ).
tff(func_def_109,type,
sK93: vTerm > vOptTerm ).
tff(func_def_110,type,
sK94: vTerm > vTerm ).
tff(func_def_111,type,
sK95: vTerm > vTerm ).
tff(func_def_112,type,
sK96: vTerm > vTerm ).
tff(func_def_113,type,
sK97: vTerm > vTerm ).
tff(func_def_114,type,
sK119: vTy ).
tff(pred_def_1,type,
visValue: vTerm > $o ).
tff(pred_def_2,type,
visNV: vTerm > $o ).
tff(pred_def_3,type,
visSomeTerm: vOptTerm > $o ).
tff(pred_def_4,type,
vptchecksimple: ( vTerm * vTy ) > $o ).
tff(pred_def_5,type,
sP22: ( vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_6,type,
sP98: ( vOptTerm * vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_7,type,
sP99: ( vOptTerm * vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_8,type,
sP100: ( vOptTerm * vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_9,type,
sP101: ( vOptTerm * vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_10,type,
sP102: ( vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_11,type,
sP103: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_12,type,
sP104: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_13,type,
sP105: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_14,type,
sP106: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_15,type,
sP107: ( vTerm * vTerm ) > $o ).
tff(pred_def_16,type,
sP108: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_17,type,
sP109: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_18,type,
sP110: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_19,type,
sP111: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_20,type,
sP112: ( vTerm * vTerm ) > $o ).
tff(pred_def_21,type,
sP113: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_22,type,
sP114: ( vOptTerm * vTerm * vTerm ) > $o ).
tff(pred_def_23,type,
sP115: ( vOptTerm * vTerm * vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_24,type,
sP116: ( vOptTerm * vTerm * vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_25,type,
sP117: ( vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_26,type,
sP118: ( vTerm * vTerm * vTerm ) > $o ).
tff(f51,axiom,
~ visSomeTerm(vnoTerm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeTerm-0') ).
tff(f52,axiom,
! [X0: vTerm] : visSomeTerm(vsomeTerm(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeTerm-1') ).
tff(f80,axiom,
! [X0: vTerm,X1: vTerm] :
( ( ~ visNV(X0)
& visSomeTerm(vreduce(X0)) )
=> ( vreduce(vPlus(X0,X1)) = vsomeTerm(vPlus(vgetTerm(vreduce(X0)),X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-21') ).
tff(f108,conjecture,
! [X0: vTy] :
( ( visSomeTerm(vreduce(vt1))
& ~ visNV(vt1)
& vptchecksimple(vPlus(vt1,vt2),X0)
& ~ visValue(vPlus(vt1,vt2)) )
=> ( vreduce(vPlus(vt1,vt2)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Plus-isNV-False-isSomeTerm-True') ).
tff(f109,negated_conjecture,
~ ! [X0: vTy] :
( ( visSomeTerm(vreduce(vt1))
& ~ visNV(vt1)
& vptchecksimple(vPlus(vt1,vt2),X0)
& ~ visValue(vPlus(vt1,vt2)) )
=> ( vreduce(vPlus(vt1,vt2)) != vnoTerm ) ),
inference(negated_conjecture,[status(cth)],[f108]) ).
tff(f163,plain,
! [X0: vTerm,X1: vTerm] :
( ( vreduce(vPlus(X0,X1)) = vsomeTerm(vPlus(vgetTerm(vreduce(X0)),X1)) )
| visNV(X0)
| ~ visSomeTerm(vreduce(X0)) ),
inference(ennf_transformation,[],[f80]) ).
tff(f164,plain,
! [X0: vTerm,X1: vTerm] :
( ( vreduce(vPlus(X0,X1)) = vsomeTerm(vPlus(vgetTerm(vreduce(X0)),X1)) )
| visNV(X0)
| ~ visSomeTerm(vreduce(X0)) ),
inference(flattening,[],[f163]) ).
tff(f194,plain,
? [X0: vTy] :
( ( vnoTerm = vreduce(vPlus(vt1,vt2)) )
& visSomeTerm(vreduce(vt1))
& ~ visNV(vt1)
& vptchecksimple(vPlus(vt1,vt2),X0)
& ~ visValue(vPlus(vt1,vt2)) ),
inference(ennf_transformation,[],[f109]) ).
tff(f195,plain,
? [X0: vTy] :
( ( vnoTerm = vreduce(vPlus(vt1,vt2)) )
& visSomeTerm(vreduce(vt1))
& ~ visNV(vt1)
& vptchecksimple(vPlus(vt1,vt2),X0)
& ~ visValue(vPlus(vt1,vt2)) ),
inference(flattening,[],[f194]) ).
tff(f263,plain,
~ visSomeTerm(vnoTerm),
inference(cnf_transformation,[],[f51]) ).
tff(f264,plain,
! [X0: vTerm] : visSomeTerm(vsomeTerm(X0)),
inference(cnf_transformation,[],[f52]) ).
tff(f325,plain,
! [X0: vTerm,X1: vTerm] :
( ~ visSomeTerm(vreduce(X0))
| visNV(X0)
| ( vreduce(vPlus(X0,X1)) = vsomeTerm(vPlus(vgetTerm(vreduce(X0)),X1)) ) ),
inference(cnf_transformation,[],[f164]) ).
tff(f506,plain,
~ visNV(vt1),
inference(cnf_transformation,[],[f195]) ).
tff(f507,plain,
visSomeTerm(vreduce(vt1)),
inference(cnf_transformation,[],[f195]) ).
tff(f508,plain,
vnoTerm = vreduce(vPlus(vt1,vt2)),
inference(cnf_transformation,[],[f195]) ).
tff(f529,plain,
visSomeTerm(vnoTerm),
inference(consistent_polarity_flipping,[],[f263]) ).
tff(f530,plain,
! [X0: vTerm] : ~ visSomeTerm(vsomeTerm(X0)),
inference(consistent_polarity_flipping,[],[f264]) ).
tff(f563,plain,
! [X0: vTerm,X1: vTerm] :
( visSomeTerm(vreduce(X0))
| visNV(X0)
| ( vreduce(vPlus(X0,X1)) = vsomeTerm(vPlus(vgetTerm(vreduce(X0)),X1)) ) ),
inference(consistent_polarity_flipping,[],[f325]) ).
tff(f669,plain,
~ visSomeTerm(vreduce(vt1)),
inference(consistent_polarity_flipping,[],[f507]) ).
tff(f1354,plain,
! [X0: vTerm] :
( visNV(vt1)
| ( vreduce(vPlus(vt1,X0)) = vsomeTerm(vPlus(vgetTerm(vreduce(vt1)),X0)) ) ),
inference(resolution,[],[f563,f669]) ).
tff(f1383,plain,
! [X0: vTerm] : ( vreduce(vPlus(vt1,X0)) = vsomeTerm(vPlus(vgetTerm(vreduce(vt1)),X0)) ),
inference(forward_subsumption_resolution,[],[f1354,f506]) ).
tff(f3127,plain,
! [X0: vTerm] : ~ visSomeTerm(vreduce(vPlus(vt1,X0))),
inference(superposition,[],[f530,f1383]) ).
tff(f3153,plain,
~ visSomeTerm(vnoTerm),
inference(superposition,[],[f3127,f508]) ).
tff(f3154,plain,
$false,
inference(forward_subsumption_resolution,[],[f3153,f529]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM233_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 % Computer : n011.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 22:02:31 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/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.20/0.33 % (3830526)Will run a generic schedule for satisfiability detection.
% 0.20/0.33 % (3830532)% WARNING: option uhcvi not known.
% 0.20/0.33 % (3830532)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1518461358:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.33 % (3830531)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1829215941_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.33 % (3830533)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1199315511:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.33 % (3830534)dis+10_1_sil=32000:sp=arity:random_seed=13299062:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.33 % (3830535)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=114606144:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.33 % (3830536)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3798084662:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.33 % (3830537)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1116788756:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.33 % Detected minimum model sizes of [1,3,1]
% 0.20/0.33 % Detected maximum model sizes of [3,max,max]
% 0.20/0.33 % TRYING [1,3,1]
% 0.20/0.33 % TRYING [1,3,2]
% 0.20/0.33 % (3830534)Instruction limit reached!
% 0.20/0.33 % (3830534)------------------------------
% 0.20/0.33 % (3830534)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33 % (3830534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33 % (3830534)CaDiCaL version: 2.1.3
% 0.20/0.33 % (3830534)Termination reason: Instruction limit
% 0.20/0.33 % (3830534)Termination phase: Saturation
% 0.20/0.33 % (3830534)Time elapsed: 0.052 s
% 0.20/0.33 % (3830534)Peak memory usage: 12 MB
% 0.20/0.33 % (3830534)Instructions burned: 103 (million)
% 0.20/0.33 % (3830532) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3830526-3830532"...
% 0.20/0.33 % (3830532)...printing done.
% 0.20/0.33 % (3830535)Instruction limit reached!
% 0.20/0.33 % (3830535)------------------------------
% 0.20/0.33 % (3830535)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33 % (3830535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33 % (3830535)CaDiCaL version: 2.1.3
% 0.20/0.33 % (3830535)Termination reason: Instruction limit
% 0.20/0.33 % (3830535)Termination phase: Saturation
% 0.20/0.33 % (3830532)Refutation found. Thanks to Tanya!
% 0.20/0.33 % SZS status Theorem for theBenchmark
% 0.20/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.33 % (3830532)------------------------------
% 0.20/0.33 % (3830532)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33 % (3830532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33 % (3830532)CaDiCaL version: 2.1.3
% 0.20/0.33 % (3830532)Termination reason: Refutation
% 0.20/0.33 % (3830532)Time elapsed: 0.063 s
% 0.20/0.33 % (3830532)Peak memory usage: 13 MB
% 0.20/0.33 % (3830532)Instructions burned: 219 (million)
% 0.20/0.33 % (3830526)Success in time 0.096 s
% 0.20/0.33 % Vampire exiting
%------------------------------------------------------------------------------