%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM194^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 : Wed Sep 30 07:46:26 AM UTC 2026
% Result : Theorem 0.77s 0.40s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM194^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n018.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:53:11 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.21/0.26 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.77/0.39 % (419385)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.77/0.39 % (419394)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2689611492:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.77/0.39 % (419396)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.77/0.39 % (419396)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.77/0.39 % (419391)lrs+10_16_si=on:nwc=1.5:random_seed=2474810906:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.77/0.39 % (419390)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3931636473:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.77/0.39 % (419394)Instruction limit reached!
% 0.77/0.39 % (419394)------------------------------
% 0.77/0.39 % (419394)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419394)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419394)Termination reason: Instruction limit
% 0.77/0.39 % (419394)Termination phase: Property scanning
% 0.77/0.39 % (419394)Time elapsed: 0.007 s
% 0.77/0.39 % (419392)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4117346571:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.77/0.39 % (419394)Peak memory usage: 10 MB
% 0.77/0.39 % (419395)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2478061019:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.77/0.39 % (419394)Instructions burned: 26 (million)
% 0.77/0.39 % (419393)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2071695232:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.77/0.39 % (419396)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=3630534840:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.77/0.39 % (419392)Instruction limit reached!
% 0.77/0.39 % (419392)------------------------------
% 0.77/0.39 % (419392)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419392)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419392)Termination reason: Instruction limit
% 0.77/0.39 % (419392)Termination phase: shuffling
% 0.77/0.39 % (419392)Time elapsed: 0.002 s
% 0.77/0.39 % (419392)Peak memory usage: 10 MB
% 0.77/0.39 % (419392)Instructions burned: 4 (million)
% 0.77/0.39 % (419391)Instruction limit reached!
% 0.77/0.39 % (419391)------------------------------
% 0.77/0.39 % (419391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419391)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419391)Termination reason: Instruction limit
% 0.77/0.39 % (419391)Termination phase: shuffling
% 0.77/0.39 % (419391)Time elapsed: 0.009 s
% 0.77/0.39 % (419391)Peak memory usage: 10 MB
% 0.77/0.39 % (419391)Instructions burned: 18 (million)
% 0.77/0.39 % (419403)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=1617462948:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.77/0.39 % (419403)Instruction limit reached!
% 0.77/0.39 % (419403)------------------------------
% 0.77/0.39 % (419403)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419403)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419403)Termination reason: Instruction limit
% 0.77/0.39 % (419403)Termination phase: shuffling
% 0.77/0.39 % (419403)Time elapsed: 0.004 s
% 0.77/0.39 % (419403)Peak memory usage: 10 MB
% 0.77/0.39 % (419403)Instructions burned: 14 (million)
% 0.77/0.39 % (419405)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3847341166:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.77/0.39 % (419406)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.77/0.39 % (419405)Instruction limit reached!
% 0.77/0.39 % (419405)------------------------------
% 0.77/0.39 % (419405)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419405)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419405)Termination reason: Instruction limit
% 0.77/0.39 % (419405)Termination phase: shuffling
% 0.77/0.39 % (419405)Time elapsed: 0.003 s
% 0.77/0.39 % (419405)Peak memory usage: 10 MB
% 0.77/0.39 % (419405)Instructions burned: 5 (million)
% 0.77/0.39 % (419408)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=239095214:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.77/0.39 % (419406)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=4246618198:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.77/0.39 % (419408)Instruction limit reached!
% 0.77/0.39 % (419408)------------------------------
% 0.77/0.39 % (419408)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419408)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419408)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419408)Termination reason: Instruction limit
% 0.77/0.39 % (419408)Termination phase: shuffling
% 0.77/0.39 % (419408)Time elapsed: 0.003 s
% 0.77/0.39 % (419408)Peak memory usage: 10 MB
% 0.77/0.39 % (419408)Instructions burned: 12 (million)
% 0.77/0.39 % (419406)Instruction limit reached!
% 0.77/0.39 % (419406)------------------------------
% 0.77/0.39 % (419406)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419406)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419406)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419406)Termination reason: Instruction limit
% 0.77/0.39 % (419406)Termination phase: shuffling
% 0.77/0.39 % (419406)Time elapsed: 0.004 s
% 0.77/0.39 % (419406)Peak memory usage: 10 MB
% 0.77/0.39 % (419406)Instructions burned: 7 (million)
% 0.77/0.39 % (419395)Instruction limit reached!
% 0.77/0.39 % (419395)------------------------------
% 0.77/0.39 % (419395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419395)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419395)Termination reason: Instruction limit
% 0.77/0.39 % (419395)Termination phase: Property scanning
% 0.77/0.39 % (419395)Time elapsed: 0.036 s
% 0.77/0.39 % (419395)Peak memory usage: 11 MB
% 0.77/0.39 % (419395)Instructions burned: 76 (million)
% 0.77/0.39 % (419413)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=3125168133:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.77/0.39 % (419411)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.77/0.39 % (419411)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.77/0.39 % (419411)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=1142404399:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.77/0.39 % (419415)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.77/0.39 % (419414)lrs+10_1_si=on:cs=on:random_seed=742361419:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.77/0.39 % (419415)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=3698448325:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.77/0.39 % (419414)Instruction limit reached!
% 0.77/0.39 % (419414)------------------------------
% 0.77/0.39 % (419414)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419414)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419414)Termination reason: Instruction limit
% 0.77/0.39 % (419414)Termination phase: shuffling
% 0.77/0.39 % (419414)Time elapsed: 0.004 s
% 0.77/0.39 % (419414)Peak memory usage: 10 MB
% 0.77/0.39 % (419414)Instructions burned: 9 (million)
% 0.77/0.39 % (419411)Instruction limit reached!
% 0.77/0.39 % (419411)------------------------------
% 0.77/0.39 % (419411)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419411)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419411)CaDiCaL version: 2.1.3
% 0.77/0.39 % (419411)Termination reason: Instruction limit
% 0.77/0.39 % (419411)Termination phase: shuffling
% 0.77/0.39 % (419411)Time elapsed: 0.013 s
% 0.77/0.39 % (419411)Peak memory usage: 10 MB
% 0.77/0.39 % (419411)Instructions burned: 28 (million)
% 0.77/0.39 % (419415)Instruction limit reached!
% 0.77/0.39 % (419415)------------------------------
% 0.77/0.39 % (419415)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.39 % (419415)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.39 % (419415)CaDiCaL version: 2.1.3
% 0.77/0.40 % (419415)Termination reason: Instruction limit
% 0.77/0.40 % (419415)Termination phase: shuffling
% 0.77/0.40 % (419415)Time elapsed: 0.003 s
% 0.77/0.40 % (419415)Peak memory usage: 10 MB
% 0.77/0.40 % (419415)Instructions burned: 5 (million)
% 0.77/0.40 % (419413)Instruction limit reached!
% 0.77/0.40 % (419413)------------------------------
% 0.77/0.40 % (419413)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.40 % (419413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.40 % (419413)CaDiCaL version: 2.1.3
% 0.77/0.40 % (419413)Termination reason: Instruction limit
% 0.77/0.40 % (419413)Termination phase: Property scanning
% 0.77/0.40 % (419413)Time elapsed: 0.021 s
% 0.77/0.40 % (419413)Peak memory usage: 11 MB
% 0.77/0.40 % (419413)Instructions burned: 91 (million)
% 0.77/0.40 % (419393) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-419385-419393"...
% 0.77/0.40 % (419423)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3008780360:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.77/0.40 % (419390)Instruction limit reached!
% 0.77/0.40 % (419390)------------------------------
% 0.77/0.40 % (419390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.40 % (419390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.40 % (419390)CaDiCaL version: 2.1.3
% 0.77/0.40 % (419390)Termination reason: Instruction limit
% 0.77/0.40 % (419390)Termination phase: Property scanning
% 0.77/0.40 % (419390)Time elapsed: 0.072 s
% 0.77/0.40 % (419390)Peak memory usage: 12 MB
% 0.77/0.40 % (419390)Instructions burned: 87 (million)
% 0.77/0.40 % (419393)...printing done.
% 0.77/0.40 % (419393)Refutation found. Thanks to Tanya!
% 0.77/0.40 % SZS status Theorem for theBenchmark
% 0.77/0.40 % SZS output start Proof for theBenchmark
% 0.77/0.40 thf(type_def_5, type, product_prod: ($tType * $tType) > $tType).
% 0.77/0.40 thf(type_def_6, type, sum_sum: ($tType * $tType) > $tType).
% 0.77/0.40 thf(type_def_7, type, dtree: $tType).
% 0.77/0.40 thf(type_def_8, type, set: $tType > $tType).
% 0.77/0.40 thf(type_def_9, type, t: $tType).
% 0.77/0.40 thf(type_def_10, type, n: $tType).
% 0.77/0.40 thf(type_def_11, type, itself: $tType > $tType).
% 0.77/0.40 thf(type_def_12, type, sTfun: ($tType * $tType) > $tType).
% 0.77/0.40 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.77/0.40 thf(func_def_1, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.77/0.40 thf(func_def_2, type, bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.77/0.40 thf(func_def_3, type, top: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.77/0.40 thf(func_def_4, type, bounded_lattice_top: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.77/0.40 thf(func_def_5, type, node: (n > set @ sum_sum @ t @ dtree > dtree)).
% 0.77/0.40 thf(func_def_6, type, cont: (dtree > set @ sum_sum @ t @ dtree)).
% 0.77/0.40 thf(func_def_7, type, root: (dtree > n)).
% 0.77/0.40 thf(func_def_8, type, unfold: !>[X0: $tType]:(((X0 > n) > (X0 > set @ sum_sum @ t @ X0) > X0 > dtree))).
% 0.77/0.40 thf(func_def_9, type, comp: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > (X2 > X0) > X2 > X1))).
% 0.77/0.40 thf(func_def_10, type, gram_L861583724lle_Fr: (set @ n > dtree > set @ t)).
% 0.77/0.40 thf(func_def_11, type, gram_L1556062726le_Frr: (set @ n > dtree > set @ t)).
% 0.77/0.40 thf(func_def_12, type, gram_L1451583624elle_H: (dtree > n > dtree)).
% 0.77/0.40 thf(func_def_13, type, gram_L1221482011le_H_c: (dtree > n > set @ sum_sum @ t @ n)).
% 0.77/0.40 thf(func_def_14, type, gram_L1221482026le_H_r: (dtree > n > n)).
% 0.77/0.40 thf(func_def_15, type, gram_L1451583628elle_L: (set @ n > n > set @ set @ t)).
% 0.77/0.40 thf(func_def_16, type, gram_L1451583632elle_P: set @ product_prod @ n @ set @ sum_sum @ t @ n).
% 0.77/0.40 thf(func_def_17, type, gram_L1231612515_deftr: (n > dtree)).
% 0.77/0.40 thf(func_def_18, type, gram_L1004374585hsubst: (dtree > dtree > dtree)).
% 0.77/0.40 thf(func_def_19, type, gram_L1905609002ubst_c: (dtree > dtree > set @ sum_sum @ t @ dtree)).
% 0.77/0.40 thf(func_def_20, type, gram_L1905609017ubst_r: (dtree > n)).
% 0.77/0.40 thf(func_def_21, type, gram_L1333338417e_inFr: (set @ n > dtree > t > $o)).
% 0.77/0.40 thf(func_def_22, type, gram_L805317441_inFr2: (set @ n > dtree > t > $o)).
% 0.77/0.40 thf(func_def_23, type, gram_L805317505_inFrr: (set @ n > dtree > t > $o)).
% 0.77/0.40 thf(func_def_24, type, gram_L830233218_inItr: (set @ n > dtree > n > $o)).
% 0.77/0.40 thf(func_def_25, type, gram_L315592705e_pick: (dtree > n > dtree)).
% 0.77/0.40 thf(func_def_26, type, gram_L1828378864e_rcut: (dtree > dtree)).
% 0.77/0.40 thf(func_def_27, type, gram_L1918716148le_reg: ((n > dtree) > dtree > $o)).
% 0.77/0.40 thf(func_def_28, type, gram_L646766332egular: (dtree > $o)).
% 0.77/0.40 thf(func_def_29, type, gram_L716654942_subtr: (set @ n > dtree > dtree > $o)).
% 0.77/0.40 thf(func_def_30, type, gram_L1283001940subtr2: (set @ n > dtree > dtree > $o)).
% 0.77/0.40 thf(func_def_31, type, gram_L1614515765ubtrOf: (dtree > n > dtree)).
% 0.77/0.40 thf(func_def_32, type, gram_L864798063lle_wf: (dtree > $o)).
% 0.77/0.40 thf(func_def_33, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.77/0.40 thf(func_def_34, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.77/0.40 thf(func_def_35, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.77/0.40 thf(func_def_36, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_37, type, top_top: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_38, type, product_Pair: !>[X0: $tType, X1: $tType]:((X0 > X1 > product_prod @ X0 @ X1))).
% 0.77/0.40 thf(func_def_39, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.77/0.40 thf(func_def_40, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.77/0.40 thf(func_def_41, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.77/0.40 thf(func_def_42, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 0.77/0.40 thf(func_def_43, type, vimage: !>[X0: $tType, X1: $tType]:(((X0 > X1) > set @ X1 > set @ X0))).
% 0.77/0.40 thf(func_def_44, type, sum_Inl: !>[X0: $tType, X1: $tType]:((X0 > sum_sum @ X0 @ X1))).
% 0.77/0.40 thf(func_def_45, type, sum_Inr: !>[X0: $tType, X1: $tType]:((X0 > sum_sum @ X1 @ X0))).
% 0.77/0.40 thf(func_def_46, type, sum_rec_sum: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > (X2 > X1) > sum_sum @ X0 @ X2 > X1))).
% 0.77/0.40 thf(func_def_47, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.77/0.40 thf(func_def_48, type, k: (n > set @ t)).
% 0.77/0.40 thf(func_def_49, type, ftr: (n > dtree)).
% 0.77/0.40 thf(func_def_50, type, n2: n).
% 0.77/0.40 thf(func_def_51, type, ns: set @ n).
% 0.77/0.40 thf(func_def_52, type, tns: set @ sum_sum @ t @ n).
% 0.77/0.40 thf(func_def_53, type, tr: dtree).
% 0.77/0.40 thf(func_def_54, type, tr2: dtree).
% 0.77/0.40 thf(func_def_58, type, db0: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_59, type, db1: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_60, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.77/0.40 thf(func_def_61, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.77/0.40 thf(func_def_62, type, vAND: ($o > $o > $o)).
% 0.77/0.40 thf(func_def_63, type, db3: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_64, type, db2: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_65, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.77/0.40 thf(func_def_66, type, vIMP: ($o > $o > $o)).
% 0.77/0.40 thf(func_def_67, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.77/0.40 thf(func_def_68, type, vOR: ($o > $o > $o)).
% 0.77/0.40 thf(func_def_69, type, db5: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_70, type, db6: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_71, type, db4: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_72, type, sK0: (n > set @ sum_sum @ t @ n)).
% 0.77/0.40 thf(func_def_73, type, sK1: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.77/0.40 thf(func_def_74, type, sK2: (set @ n > dtree > dtree > dtree)).
% 0.77/0.40 thf(func_def_75, type, sK3: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.77/0.40 thf(func_def_76, type, sK4: (n > set @ n > dtree > dtree)).
% 0.77/0.40 thf(func_def_77, type, sK5: !>[X0: $tType]:((set @ X0 > X0))).
% 0.77/0.40 thf(func_def_78, type, sK6: ((set @ n > dtree > n > $o) > dtree)).
% 0.77/0.40 thf(func_def_79, type, sK7: ((set @ n > dtree > n > $o) > n)).
% 0.77/0.40 thf(func_def_80, type, sK8: ((set @ n > dtree > n > $o) > dtree)).
% 0.77/0.40 thf(func_def_81, type, sK9: ((set @ n > dtree > n > $o) > set @ n)).
% 0.77/0.40 thf(func_def_82, type, sK10: ((set @ n > dtree > n > $o) > dtree)).
% 0.77/0.40 thf(func_def_83, type, sK11: ((set @ n > dtree > n > $o) > set @ n)).
% 0.77/0.40 thf(func_def_84, type, sK12: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_85, type, sK13: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_86, type, sK14: ((set @ n > dtree > dtree > $o) > set @ n)).
% 0.77/0.40 thf(func_def_87, type, sK15: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_88, type, sK16: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_89, type, sK17: ((set @ n > dtree > dtree > $o) > set @ n)).
% 0.77/0.40 thf(func_def_90, type, sK18: !>[X0: $tType]:((set @ X0 > X0))).
% 0.77/0.40 thf(func_def_91, type, sK19: !>[X0: $tType, X1: $tType]:((sum_sum @ X1 @ X0 > X0))).
% 0.77/0.40 thf(func_def_92, type, sK20: !>[X0: $tType, X1: $tType]:((sum_sum @ X1 @ X0 > X1))).
% 0.77/0.40 thf(func_def_93, type, sK21: (set @ n > dtree > t > dtree)).
% 0.77/0.40 thf(func_def_94, type, sK22: (dtree > dtree > n)).
% 0.77/0.40 thf(func_def_95, type, sK23: (set @ n > dtree > t > dtree)).
% 0.77/0.40 thf(func_def_96, type, sK24: (set @ n > dtree > t > set @ n)).
% 0.77/0.40 thf(func_def_97, type, sK25: (set @ n > dtree > t > dtree)).
% 0.77/0.40 thf(func_def_98, type, sK26: !>[X0: $tType]:((set @ X0 > X0))).
% 0.77/0.40 thf(func_def_99, type, sK27: !>[X0: $tType]:(X0)).
% 0.77/0.40 thf(func_def_100, type, sK28: !>[X0: $tType]:((set @ X0 > X0))).
% 0.77/0.40 thf(func_def_101, type, sK29: !>[X0: $tType]:((set @ X0 > X0))).
% 0.77/0.40 thf(func_def_102, type, sK30: (t > set @ n > dtree > dtree)).
% 0.77/0.40 thf(func_def_103, type, sK31: ((set @ n > dtree > t > $o) > t)).
% 0.77/0.40 thf(func_def_104, type, sK32: ((set @ n > dtree > t > $o) > dtree)).
% 0.77/0.40 thf(func_def_105, type, sK33: ((set @ n > dtree > t > $o) > set @ n)).
% 0.77/0.40 thf(func_def_106, type, sK34: ((set @ n > dtree > t > $o) > dtree)).
% 0.77/0.40 thf(func_def_107, type, sK35: ((set @ n > dtree > t > $o) > set @ n)).
% 0.77/0.40 thf(func_def_108, type, sK36: ((set @ n > dtree > t > $o) > dtree)).
% 0.77/0.40 thf(func_def_109, type, sK37: ((set @ n > dtree > t > $o) > t)).
% 0.77/0.40 thf(func_def_110, type, sK38: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_111, type, sK39: ((set @ n > dtree > dtree > $o) > set @ n)).
% 0.77/0.40 thf(func_def_112, type, sK40: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_113, type, sK41: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_114, type, sK42: ((set @ n > dtree > dtree > $o) > set @ n)).
% 0.77/0.40 thf(func_def_115, type, sK43: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_116, type, sK44: ((dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_117, type, sK45: ((dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_118, type, sK46: ((dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_119, type, sK47: ((dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_120, type, sK48: (n > dtree)).
% 0.77/0.40 thf(func_def_121, type, sK49: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.77/0.40 thf(func_def_122, type, sK50: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.77/0.40 thf(func_def_123, type, sK51: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 0.77/0.40 thf(func_def_124, type, sK52: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.77/0.40 thf(func_def_125, type, sK53: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.77/0.40 thf(func_def_126, type, sK54: ((set @ n > dtree > dtree > $o) > set @ n)).
% 0.77/0.40 thf(func_def_127, type, sK55: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_128, type, sK56: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_129, type, sK57: ((set @ n > dtree > dtree > $o) > set @ n)).
% 0.77/0.40 thf(func_def_130, type, sK58: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_131, type, sK59: ((set @ n > dtree > dtree > $o) > dtree)).
% 0.77/0.40 thf(func_def_132, type, sK60: !>[X0: $tType]:((set @ X0 > X0 > set @ X0 > X0 > set @ X0))).
% 0.77/0.40 thf(func_def_133, type, sK61: (t > dtree > set @ n > dtree)).
% 0.77/0.40 thf(func_def_134, type, sK62: (n > set @ n > dtree > dtree)).
% 0.77/0.40 thf(func_def_135, type, sK63: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > X0))).
% 0.77/0.40 thf(func_def_136, type, sK64: !>[X0: $tType, X1: $tType]:(((sum_sum @ X0 @ X1 > $o) > X1))).
% 0.77/0.40 thf(func_def_137, type, sK65: !>[X0: $tType, X1: $tType]:(((sum_sum @ X0 @ X1 > $o) > X0))).
% 0.77/0.40 thf(func_def_138, type, sK66: !>[X0: $tType]:((set @ X0 > X0))).
% 0.77/0.40 thf(func_def_139, type, sK67: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1))).
% 0.77/0.40 thf(func_def_140, type, sK68: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X0))).
% 0.77/0.40 thf(func_def_141, type, sK69: (n > dtree)).
% 0.77/0.40 thf(func_def_142, type, sK70: !>[X0: $tType, X1: $tType]:((sum_sum @ X1 @ X0 > X1))).
% 0.77/0.40 thf(func_def_143, type, sK71: !>[X0: $tType, X1: $tType]:((sum_sum @ X1 @ X0 > X0))).
% 0.77/0.40 thf(func_def_144, type, sK72: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.77/0.40 thf(func_def_145, type, sK73: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.77/0.40 thf(func_def_146, type, sK74: !>[X0: $tType]:(((X0 > $o) > set @ X0 > set @ X0 > X0))).
% 0.77/0.40 thf(func_def_147, type, sK75: ((set @ n > dtree > t > $o) > t)).
% 0.77/0.40 thf(func_def_148, type, sK76: ((set @ n > dtree > t > $o) > dtree)).
% 0.77/0.40 thf(func_def_149, type, sK77: ((set @ n > dtree > t > $o) > set @ n)).
% 0.77/0.40 thf(func_def_150, type, sK78: ((set @ n > dtree > t > $o) > dtree)).
% 0.77/0.40 thf(func_def_151, type, sK79: ((set @ n > dtree > t > $o) > dtree)).
% 0.77/0.40 thf(func_def_152, type, sK80: ((set @ n > dtree > t > $o) > t)).
% 0.77/0.40 thf(func_def_153, type, sK81: ((set @ n > dtree > t > $o) > set @ n)).
% 0.77/0.40 thf(func_def_154, type, sK82: !>[X0: $tType]:((set @ X0 > X0))).
% 0.77/0.40 thf(func_def_155, type, sK83: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X0 > $o) > (X1 > $o) > X1))).
% 0.77/0.40 thf(func_def_156, type, sK84: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.77/0.40 thf(func_def_157, type, sK85: (set @ n > dtree > dtree > dtree)).
% 0.77/0.40 thf(func_def_158, type, sK86: !>[X0: $tType, X1: $tType, X2: $tType]:(($o > (sum_sum @ X1 @ X2 > X0) > X0 > X2))).
% 0.77/0.40 thf(func_def_159, type, sK87: !>[X0: $tType, X1: $tType, X2: $tType]:(($o > (sum_sum @ X1 @ X2 > X0) > X0 > X1))).
% 0.77/0.40 thf(func_def_160, type, vNOT: ($o > $o)).
% 0.77/0.40 thf(f1,axiom,(
% 0.77/0.40 (gram_L864798063lle_wf @ tr2)),
% 0.77/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_dtr)).
% 0.77/0.40 thf(f3,axiom,(
% 0.77/0.40 ! [X1 : dtree,X0 : dtree] : ((gram_L864798063lle_wf @ X0) => ((gram_L864798063lle_wf @ X1) => (gram_L864798063lle_wf @ (gram_L1004374585hsubst @ X0 @ X1))))),
% 0.77/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_wf__hsubst)).
% 0.77/0.40 thf(f272,conjecture,(
% 0.77/0.40 (gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))),
% 0.77/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.77/0.40 thf(f273,negated_conjecture,(
% 0.77/0.40 ~(gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))),
% 0.77/0.40 inference(negated_conjecture,[status(cth)],[f272])).
% 0.77/0.40 thf(f278,plain,(
% 0.77/0.40 (gram_L864798063lle_wf @ tr2)),
% 0.77/0.40 inference(rectify,[],[f1])).
% 0.77/0.40 thf(f279,plain,(
% 0.77/0.40 (((gram_L864798063lle_wf @ tr2)) = $true)),
% 0.77/0.40 inference(fool_elimination,[],[f278])).
% 0.77/0.40 thf(f535,plain,(
% 0.77/0.40 ~(gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))),
% 0.77/0.40 inference(rectify,[],[f273])).
% 0.77/0.40 thf(f536,plain,(
% 0.77/0.40 ~ (((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))) = $true)),
% 0.77/0.40 inference(fool_elimination,[],[f535])).
% 0.77/0.40 thf(f611,plain,(
% 0.77/0.40 ! [X0 : dtree,X1 : dtree] : ((gram_L864798063lle_wf @ X1) => ((gram_L864798063lle_wf @ X0) => (gram_L864798063lle_wf @ (gram_L1004374585hsubst @ X1 @ X0))))),
% 0.77/0.40 inference(rectify,[],[f3])).
% 0.77/0.40 thf(f612,plain,(
% 0.77/0.40 ! [X0 : dtree,X1 : dtree] : ((((gram_L864798063lle_wf @ X1)) = $true) => ((((gram_L864798063lle_wf @ X0)) = $true) => ($true = ((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ X1 @ X0))))))),
% 0.77/0.40 inference(fool_elimination,[],[f611])).
% 0.77/0.40 thf(f677,plain,(
% 0.77/0.40 (((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))) != $true)),
% 0.77/0.40 inference(flattening,[],[f536])).
% 0.77/0.40 thf(f758,plain,(
% 0.77/0.40 ! [X0 : dtree,X1 : dtree] : ((($true = ((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ X1 @ X0)))) | (((gram_L864798063lle_wf @ X0)) != $true)) | (((gram_L864798063lle_wf @ X1)) != $true))),
% 0.77/0.40 inference(ennf_transformation,[],[f612])).
% 0.77/0.40 thf(f759,plain,(
% 0.77/0.40 ! [X0 : dtree,X1 : dtree] : ((((gram_L864798063lle_wf @ X0)) != $true) | ($true = ((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ X1 @ X0)))) | (((gram_L864798063lle_wf @ X1)) != $true))),
% 0.77/0.40 inference(flattening,[],[f758])).
% 0.77/0.40 thf(f1369,plain,(
% 0.77/0.40 ( ! [X0 : dtree,X1 : dtree] : (($true = ((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ X1 @ X0)))) | (((gram_L864798063lle_wf @ X1)) != $true) | (((gram_L864798063lle_wf @ X0)) != $true)) )),
% 0.77/0.40 inference(cnf_transformation,[],[f759])).
% 0.77/0.40 thf(f1527,plain,(
% 0.77/0.40 (((gram_L864798063lle_wf @ tr2)) = $true)),
% 0.77/0.40 inference(cnf_transformation,[],[f279])).
% 0.77/0.40 thf(f1572,plain,(
% 0.77/0.40 (((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))) != $true)),
% 0.77/0.40 inference(cnf_transformation,[],[f677])).
% 0.77/0.40 thf(f1717,definition,(
% 0.77/0.40 spl88_12 <=> (((gram_L864798063lle_wf @ tr2)) = $true)),
% 0.77/0.40 introduced(definition,[new_symbols(definition,[spl88_12])],[avatar_definition])).
% 0.77/0.40 thf(f1719,plain,(
% 0.77/0.40 (((gram_L864798063lle_wf @ tr2)) = $true) | ~spl88_12),
% 0.77/0.40 inference(avatar_component_clause,[],[f1717])).
% 0.77/0.40 thf(f1720,plain,(
% 0.77/0.40 spl88_12),
% 0.77/0.40 inference(avatar_split_clause,[],[f1527,f1717])).
% 0.77/0.40 thf(f1792,definition,(
% 0.77/0.40 spl88_27 <=> (((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))) = $true)),
% 0.77/0.40 introduced(definition,[new_symbols(definition,[spl88_27])],[avatar_definition])).
% 0.77/0.40 thf(f1794,plain,(
% 0.77/0.40 (((gram_L864798063lle_wf @ (gram_L1004374585hsubst @ tr2 @ tr2))) != $true) | spl88_27),
% 0.77/0.40 inference(avatar_component_clause,[],[f1792])).
% 0.77/0.40 thf(f1795,plain,(
% 0.77/0.40 ~spl88_27),
% 0.77/0.40 inference(avatar_split_clause,[],[f1572,f1792])).
% 0.77/0.40 thf(f1802,plain,(
% 0.77/0.40 ($true != $true) | (((gram_L864798063lle_wf @ tr2)) != $true) | (((gram_L864798063lle_wf @ tr2)) != $true) | spl88_27),
% 0.77/0.40 inference(superposition,[],[f1794,f1369])).
% 0.77/0.40 thf(f1803,plain,(
% 0.77/0.40 ($true != $true) | (((gram_L864798063lle_wf @ tr2)) != $true) | spl88_27),
% 0.77/0.40 inference(duplicate_literal_removal,[],[f1802])).
% 0.77/0.40 thf(f1804,plain,(
% 0.77/0.40 (((gram_L864798063lle_wf @ tr2)) != $true) | spl88_27),
% 0.77/0.40 inference(trivial_inequality_removal,[],[f1803])).
% 0.77/0.40 thf(f1805,plain,(
% 0.77/0.40 $false | (~spl88_12 | spl88_27)),
% 0.77/0.40 inference(forward_subsumption_resolution,[],[f1804,f1719])).
% 0.77/0.40 thf(f1806,plain,(
% 0.77/0.40 ~spl88_12 | spl88_27),
% 0.77/0.40 inference(avatar_contradiction_clause,[],[f1805])).
% 0.77/0.40 cnf(s12, plain, spl88_12, inference(sat_conversion,[],[f1720])).
% 0.77/0.40 cnf(s27, plain, ~spl88_27, inference(sat_conversion,[],[f1795])).
% 0.77/0.40 cnf(s29, plain, ~spl88_12 | spl88_27, inference(sat_conversion,[],[f1806])).
% 0.77/0.40 cnf(s30, plain, ~spl88_12, inference(rat,[],[s29,s27])).
% 0.77/0.40 cnf(s31, plain, $false, inference(rat,[],[s12,s30])).
% 0.77/0.40 thf(f1807,plain,(
% 0.77/0.40 $false),
% 0.77/0.40 inference(avatar_sat_refutation,[],[s31])).
% 0.77/0.40 % SZS output end Proof for theBenchmark
% 0.77/0.40 % (419393)------------------------------
% 0.77/0.40 % (419393)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.77/0.40 % (419393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.77/0.40 % (419393)CaDiCaL version: 2.1.3
% 0.77/0.40 % (419393)Termination reason: Refutation
% 0.77/0.40 % (419393)Time elapsed: 0.071 s
% 0.77/0.40 % (419393)Peak memory usage: 14 MB
% 0.77/0.40 % (419393)Instructions burned: 147 (million)
% 0.77/0.40 % (419385)Success in time 0.125 s
% 0.77/0.40 % Vampire exiting
%------------------------------------------------------------------------------