%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : LCL608^1 : TPTP v6.1.0. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n095.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:25:50 EDT 2014

% Result   : Timeout 300.05s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : LCL608^1 : TPTP v6.1.0. Released v3.6.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n095.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 10:02:06 CDT 2014
% % CPUTime  : 300.05 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% Failed to open /home/cristobal/cocATP/CASC/TPTP/Axioms/LCL008^0.ax, trying next directory
% FOF formula (<kernel.Constant object at 0x1172488>, <kernel.Constant object at 0x11723f8>) of role type named current_world
% Using role type
% Declaring current_world:fofType
% FOF formula (<kernel.Constant object at 0x1172488>, <kernel.DependentProduct object at 0x1172050>) of role type named prop_a
% Using role type
% Declaring prop_a:(fofType->Prop)
% FOF formula (<kernel.Constant object at 0x1172098>, <kernel.DependentProduct object at 0x11720e0>) of role type named prop_b
% Using role type
% Declaring prop_b:(fofType->Prop)
% FOF formula (<kernel.Constant object at 0x11724d0>, <kernel.DependentProduct object at 0x1172710>) of role type named prop_c
% Using role type
% Declaring prop_c:(fofType->Prop)
% FOF formula (<kernel.Constant object at 0x1172098>, <kernel.DependentProduct object at 0x1172d40>) of role type named mfalse_decl
% Using role type
% Declaring mfalse:(fofType->Prop)
% FOF formula (((eq (fofType->Prop)) mfalse) (fun (X:fofType)=> False)) of role definition named mfalse
% A new definition: (((eq (fofType->Prop)) mfalse) (fun (X:fofType)=> False))
% Defined: mfalse:=(fun (X:fofType)=> False)
% FOF formula (<kernel.Constant object at 0x1172050>, <kernel.DependentProduct object at 0x1172cf8>) of role type named mtrue_decl
% Using role type
% Declaring mtrue:(fofType->Prop)
% FOF formula (((eq (fofType->Prop)) mtrue) (fun (X:fofType)=> True)) of role definition named mtrue
% A new definition: (((eq (fofType->Prop)) mtrue) (fun (X:fofType)=> True))
% Defined: mtrue:=(fun (X:fofType)=> True)
% FOF formula (<kernel.Constant object at 0x1172098>, <kernel.DependentProduct object at 0x11725f0>) of role type named mnot_decl
% Using role type
% Declaring mnot:((fofType->Prop)->(fofType->Prop))
% FOF formula (((eq ((fofType->Prop)->(fofType->Prop))) mnot) (fun (X:(fofType->Prop)) (U:fofType)=> ((X U)->False))) of role definition named mnot
% A new definition: (((eq ((fofType->Prop)->(fofType->Prop))) mnot) (fun (X:(fofType->Prop)) (U:fofType)=> ((X U)->False)))
% Defined: mnot:=(fun (X:(fofType->Prop)) (U:fofType)=> ((X U)->False))
% FOF formula (<kernel.Constant object at 0x1172248>, <kernel.DependentProduct object at 0x11725a8>) of role type named mor_decl
% Using role type
% Declaring mor:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mor) (fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((or (X U)) (Y U)))) of role definition named mor
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mor) (fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((or (X U)) (Y U))))
% Defined: mor:=(fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((or (X U)) (Y U)))
% FOF formula (<kernel.Constant object at 0x11ce050>, <kernel.DependentProduct object at 0x11ce1b8>) of role type named mand_decl
% Using role type
% Declaring mand:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mand) (fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((and (X U)) (Y U)))) of role definition named mand
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mand) (fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((and (X U)) (Y U))))
% Defined: mand:=(fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((and (X U)) (Y U)))
% FOF formula (<kernel.Constant object at 0x11ce1b8>, <kernel.DependentProduct object at 0xf0f248>) of role type named mimpl_decl
% Using role type
% Declaring mimpl:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mimpl) (fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mor (mnot U)) V))) of role definition named mimpl
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mimpl) (fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mor (mnot U)) V)))
% Defined: mimpl:=(fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mor (mnot U)) V))
% FOF formula (<kernel.Constant object at 0xf0f098>, <kernel.DependentProduct object at 0x1172098>) of role type named miff_decl
% Using role type
% Declaring miff:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) miff) (fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mand ((mimpl U) V)) ((mimpl V) U)))) of role definition named miff
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) miff) (fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mand ((mimpl U) V)) ((mimpl V) U))))
% Defined: miff:=(fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mand ((mimpl U) V)) ((mimpl V) U)))
% FOF formula (<kernel.Constant object at 0xf0f128>, <kernel.DependentProduct object at 0x1172e60>) of role type named mbox_decl
% Using role type
% Declaring mbox:((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))) mbox) (fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> (forall (Y:fofType), (((R X) Y)->(P Y))))) of role definition named mbox
% A new definition: (((eq ((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))) mbox) (fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> (forall (Y:fofType), (((R X) Y)->(P Y)))))
% Defined: mbox:=(fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> (forall (Y:fofType), (((R X) Y)->(P Y))))
% FOF formula (<kernel.Constant object at 0x1173a28>, <kernel.DependentProduct object at 0x1173950>) of role type named mdia_decl
% Using role type
% Declaring mdia:((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))) mdia) (fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> ((ex fofType) (fun (Y:fofType)=> ((and ((R X) Y)) (P Y)))))) of role definition named mdia
% A new definition: (((eq ((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))) mdia) (fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> ((ex fofType) (fun (Y:fofType)=> ((and ((R X) Y)) (P Y))))))
% Defined: mdia:=(fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> ((ex fofType) (fun (Y:fofType)=> ((and ((R X) Y)) (P Y)))))
% FOF formula (<kernel.Constant object at 0x1173950>, <kernel.Type object at 0x11725f0>) of role type named individuals_decl
% Using role type
% Declaring individuals:Type
% FOF formula (<kernel.Constant object at 0x11725a8>, <kernel.DependentProduct object at 0x1172b00>) of role type named mall_decl
% Using role type
% Declaring mall:((individuals->(fofType->Prop))->(fofType->Prop))
% FOF formula (((eq ((individuals->(fofType->Prop))->(fofType->Prop))) mall) (fun (P:(individuals->(fofType->Prop))) (W:fofType)=> (forall (X:individuals), ((P X) W)))) of role definition named mall
% A new definition: (((eq ((individuals->(fofType->Prop))->(fofType->Prop))) mall) (fun (P:(individuals->(fofType->Prop))) (W:fofType)=> (forall (X:individuals), ((P X) W))))
% Defined: mall:=(fun (P:(individuals->(fofType->Prop))) (W:fofType)=> (forall (X:individuals), ((P X) W)))
% FOF formula (<kernel.Constant object at 0x1172170>, <kernel.DependentProduct object at 0x1172e60>) of role type named mexists_decl
% Using role type
% Declaring mexists:((individuals->(fofType->Prop))->(fofType->Prop))
% FOF formula (((eq ((individuals->(fofType->Prop))->(fofType->Prop))) mexists) (fun (P:(individuals->(fofType->Prop))) (W:fofType)=> ((ex individuals) (fun (X:individuals)=> ((P X) W))))) of role definition named mexists
% A new definition: (((eq ((individuals->(fofType->Prop))->(fofType->Prop))) mexists) (fun (P:(individuals->(fofType->Prop))) (W:fofType)=> ((ex individuals) (fun (X:individuals)=> ((P X) W)))))
% Defined: mexists:=(fun (P:(individuals->(fofType->Prop))) (W:fofType)=> ((ex individuals) (fun (X:individuals)=> ((P X) W))))
% FOF formula (<kernel.Constant object at 0x11725a8>, <kernel.DependentProduct object at 0xd79638>) of role type named mvalid_decl
% Using role type
% Declaring mvalid:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) mvalid) (fun (P:(fofType->Prop))=> (forall (W:fofType), (P W)))) of role definition named mvalid
% A new definition: (((eq ((fofType->Prop)->Prop)) mvalid) (fun (P:(fofType->Prop))=> (forall (W:fofType), (P W))))
% Defined: mvalid:=(fun (P:(fofType->Prop))=> (forall (W:fofType), (P W)))
% FOF formula (<kernel.Constant object at 0x1172170>, <kernel.DependentProduct object at 0xd797e8>) of role type named msatisfiable_decl
% Using role type
% Declaring msatisfiable:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) msatisfiable) (fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (P W))))) of role definition named msatisfiable
% A new definition: (((eq ((fofType->Prop)->Prop)) msatisfiable) (fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (P W)))))
% Defined: msatisfiable:=(fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (P W))))
% FOF formula (<kernel.Constant object at 0x1172248>, <kernel.DependentProduct object at 0xd797e8>) of role type named mcountersatisfiable_decl
% Using role type
% Declaring mcountersatisfiable:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) mcountersatisfiable) (fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((P W)->False))))) of role definition named mcountersatisfiable
% A new definition: (((eq ((fofType->Prop)->Prop)) mcountersatisfiable) (fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((P W)->False)))))
% Defined: mcountersatisfiable:=(fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((P W)->False))))
% FOF formula (<kernel.Constant object at 0xd795f0>, <kernel.DependentProduct object at 0xd79a28>) of role type named minvalid_decl
% Using role type
% Declaring minvalid:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) minvalid) (fun (P:(fofType->Prop))=> (forall (W:fofType), ((P W)->False)))) of role definition named minvalid
% A new definition: (((eq ((fofType->Prop)->Prop)) minvalid) (fun (P:(fofType->Prop))=> (forall (W:fofType), ((P W)->False))))
% Defined: minvalid:=(fun (P:(fofType->Prop))=> (forall (W:fofType), ((P W)->False)))
% FOF formula (forall (A:(fofType->Prop)) (B:(fofType->Prop)), (((and (mvalid A)) (mvalid ((mimpl A) B)))->(mvalid B))) of role conjecture named thm
% Conjecture to prove = (forall (A:(fofType->Prop)) (B:(fofType->Prop)), (((and (mvalid A)) (mvalid ((mimpl A) B)))->(mvalid B))):Prop
% Parameter individuals_DUMMY:individuals.
% We need to prove ['(forall (A:(fofType->Prop)) (B:(fofType->Prop)), (((and (mvalid A)) (mvalid ((mimpl A) B)))->(mvalid B)))']
% Parameter fofType:Type.
% Parameter current_world:fofType.
% Parameter prop_a:(fofType->Prop).
% Parameter prop_b:(fofType->Prop).
% Parameter prop_c:(fofType->Prop).
% Definition mfalse:=(fun (X:fofType)=> False):(fofType->Prop).
% Definition mtrue:=(fun (X:fofType)=> True):(fofType->Prop).
% Definition mnot:=(fun (X:(fofType->Prop)) (U:fofType)=> ((X U)->False)):((fofType->Prop)->(fofType->Prop)).
% Definition mor:=(fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((or (X U)) (Y U))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mand:=(fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (U:fofType)=> ((and (X U)) (Y U))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mimpl:=(fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mor (mnot U)) V)):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition miff:=(fun (U:(fofType->Prop)) (V:(fofType->Prop))=> ((mand ((mimpl U) V)) ((mimpl V) U))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mbox:=(fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> (forall (Y:fofType), (((R X) Y)->(P Y)))):((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop))).
% Definition mdia:=(fun (R:(fofType->(fofType->Prop))) (P:(fofType->Prop)) (X:fofType)=> ((ex fofType) (fun (Y:fofType)=> ((and ((R X) Y)) (P Y))))):((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop))).
% Parameter individuals:Type.
% Definition mall:=(fun (P:(individuals->(fofType->Prop))) (W:fofType)=> (forall (X:individuals), ((P X) W))):((individuals->(fofType->Prop))->(fofType->Prop)).
% Definition mexists:=(fun (P:(individuals->(fofType->Prop))) (W:fofType)=> ((ex individuals) (fun (X:individuals)=> ((P X) W)))):((individuals->(fofType->Prop))->(fofType->Prop)).
% Definition mvalid:=(fun (P:(fofType->Prop))=> (forall (W:fofType), (P W))):((fofType->Prop)->Prop).
% Definition msatisfiable:=(fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (P W)))):((fofType->Prop)->Prop).
% Definition mcountersatisfiable:=(fun (P:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((P W)->False)))):((fofType->Prop)->Prop).
% Definition minvalid:=(fun (P:(fofType->Prop))=> (forall (W:fofType), ((P W)->False))):((fofType->Prop)->Prop).
% Trying to prove (forall (A:(fofType->Prop)) (B:(fofType->Prop)), (((and (mvalid A)) (mvalid ((mimpl A) B)))->(mvalid B)))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x2:(B W)
% Instantiate: W:=W0:fofType
% Found x2 as proof of (B W0)
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x2:(B W)
% Instantiate: W:=W0:fofType
% Found x2 as proof of (B W0)
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x2:(B W0)
% Instantiate: W0:=W:fofType
% Found (fun (x2:(B W0))=> x2) as proof of (B W)
% Found (fun (x2:(B W0))=> x2) as proof of ((B W0)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W0:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W0)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W0))
% Found x3:(B W1)
% Instantiate: W1:=W0:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W0)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W0))
% Found x2:(B W)
% Instantiate: W:=W0:fofType
% Found x2 as proof of (B W0)
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x2:(B W)
% Instantiate: W:=W0:fofType
% Found x2 as proof of (B W0)
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W))
% Found x3:(B W1)
% Instantiate: W1:=W0:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W0)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W0))
% Found x3:(B W1)
% Instantiate: W1:=W0:fofType
% Found (fun (x3:(B W1))=> x3) as proof of (B W0)
% Found (fun (x3:(B W1))=> x3) as proof of ((B W1)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x2:(B W)
% Instantiate: W:=W1:fofType
% Found x2 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x2:(B W)
% Instantiate: W:=W1:fofType
% Found x2 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W1:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W1)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W1))
% Found x4:(B W2)
% Instantiate: W2:=W1:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W1)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W1))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x4:(B W2)
% Instantiate: W2:=W:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W))
% Found x2:(B W)
% Instantiate: W:=W1:fofType
% Found x2 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x2:(B W)
% Instantiate: W:=W1:fofType
% Found x2 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x3:(B W0)
% Instantiate: W0:=W1:fofType
% Found x3 as proof of (B W1)
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W0:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W0)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W0))
% Found x4:(B W2)
% Instantiate: W2:=W1:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W1)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W1))
% Found x4:(B W2)
% Instantiate: W2:=W1:fofType
% Found (fun (x4:(B W2))=> x4) as proof of (B W1)
% Found (fun (x4:(B W2))=> x4) as proof of ((B W2)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x4:(B W1)
% Instantiate: W1:=W2:fofType
% Found x4 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x4:(B W1)
% Instantiate: W1:=W2:fofType
% Found x4 as proof of (B W2)
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W))
% Found x5:(B W3)
% Instantiate: W3:=W2:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W2)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W2))
% Found x5:(B W3)
% Instantiate: W3:=W2:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W2)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W2))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x5:(B W3)
% Instantiate: W3:=W0:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W0)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W0))
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x4:(B W1)
% Instantiate: W1:=W2:fofType
% Found x4 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x2:(B W)
% Instantiate: W:=W2:fofType
% Found x2 as proof of (B W2)
% Found x3:(B W0)
% Instantiate: W0:=W2:fofType
% Found x3 as proof of (B W2)
% Found x4:(B W1)
% Instantiate: W1:=W2:fofType
% Found x4 as proof of (B W2)
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W1:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W1)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W1))
% Found x5:(B W3)
% Instantiate: W3:=W2:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W2)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W2))
% Found x5:(B W3)
% Instantiate: W3:=W2:fofType
% Found (fun (x5:(B W3))=> x5) as proof of (B W2)
% Found (fun (x5:(B W3))=> x5) as proof of ((B W3)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x3:(B W0)
% Instantiate: W0:=W3:fofType
% Found x3 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x3:(B W0)
% Instantiate: W0:=W3:fofType
% Found x3 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W0:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W0)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W0))
% Found x6:(B W4)
% Instantiate: W4:=W3:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W3)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W3))
% Found x6:(B W4)
% Instantiate: W4:=W3:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W3)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W3))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x3:(B W0)
% Instantiate: W0:=W3:fofType
% Found x3 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x6:(B W4)
% Instantiate: W4:=W1:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W1)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W1))
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x3:(B W0)
% Instantiate: W0:=W3:fofType
% Found x3 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x2:(B W)
% Instantiate: W:=W3:fofType
% Found x2 as proof of (B W3)
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x5:(B W2)
% Instantiate: W2:=W3:fofType
% Found x5 as proof of (B W3)
% Found x4:(B W1)
% Instantiate: W1:=W3:fofType
% Found x4 as proof of (B W3)
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x6:(B W4)
% Instantiate: W4:=W2:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W2)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W3:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W3)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x6:(B W4)
% Instantiate: W4:=W3:fofType
% Found (fun (x6:(B W4))=> x6) as proof of (B W3)
% Found (fun (x6:(B W4))=> x6) as proof of ((B W4)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x4:(B W1)
% Instantiate: W1:=W4:fofType
% Found x4 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x7:(B W5)
% Instantiate: W5:=W0:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W0)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W0))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x4:(B W1)
% Instantiate: W1:=W4:fofType
% Found x4 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W1:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W1)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W1))
% Found x7:(B W5)
% Instantiate: W5:=W4:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W4)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W4))
% Found x7:(B W5)
% Instantiate: W5:=W4:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W4)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W4))
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x4:(B W1)
% Instantiate: W1:=W4:fofType
% Found x4 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x4:(B W1)
% Instantiate: W1:=W4:fofType
% Found x4 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x5:(B W2)
% Instantiate: W2:=W4:fofType
% Found x5 as proof of (B W4)
% Found x6:(B W3)
% Instantiate: W3:=W4:fofType
% Found x6 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x3:(B W0)
% Instantiate: W0:=W4:fofType
% Found x3 as proof of (B W4)
% Found x2:(B W)
% Instantiate: W:=W4:fofType
% Found x2 as proof of (B W4)
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x7:(B W5)
% Instantiate: W5:=W2:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W2)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W2))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W3:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W3)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W3))
% Found x7:(B W5)
% Instantiate: W5:=W4:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W4)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W4))
% Found x7:(B W5)
% Instantiate: W5:=W4:fofType
% Found (fun (x7:(B W5))=> x7) as proof of (B W4)
% Found (fun (x7:(B W5))=> x7) as proof of ((B W5)->(B W4))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W6)->(B W))
% Found x8:(B W6)
% Instantiate: W6:=W:fofType
% Found (fun (x8:(B W6))=> x8) as proof of (B W)
% Found (fun (x8:(B W6))=> x8) as proof of ((B W
% EOF
%------------------------------------------------------------------------------