%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SET018^7 : TPTP v6.1.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n118.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:29:57 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  : SET018^7 : TPTP v6.1.0. Released v5.5.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n118.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 07:52:21 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/LCL015^0.ax, trying next directory
% FOF formula (<kernel.Constant object at 0xcd5f38>, <kernel.Type object at 0xcd5488>) of role type named mu_type
% Using role type
% Declaring mu:Type
% FOF formula (<kernel.Constant object at 0xcd5ef0>, <kernel.DependentProduct object at 0xcd5f38>) of role type named qmltpeq_type
% Using role type
% Declaring qmltpeq:(mu->(mu->(fofType->Prop)))
% FOF formula (<kernel.Constant object at 0xaf3cb0>, <kernel.DependentProduct object at 0xaf3710>) of role type named meq_prop_type
% Using role type
% Declaring meq_prop:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) meq_prop) (fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (W:fofType)=> (((eq Prop) (X W)) (Y W)))) of role definition named meq_prop
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) meq_prop) (fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (W:fofType)=> (((eq Prop) (X W)) (Y W))))
% Defined: meq_prop:=(fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (W:fofType)=> (((eq Prop) (X W)) (Y W)))
% FOF formula (<kernel.Constant object at 0xaf3d40>, <kernel.DependentProduct object at 0xaf3b90>) of role type named mnot_type
% Using role type
% Declaring mnot:((fofType->Prop)->(fofType->Prop))
% FOF formula (((eq ((fofType->Prop)->(fofType->Prop))) mnot) (fun (Phi:(fofType->Prop)) (W:fofType)=> ((Phi W)->False))) of role definition named mnot
% A new definition: (((eq ((fofType->Prop)->(fofType->Prop))) mnot) (fun (Phi:(fofType->Prop)) (W:fofType)=> ((Phi W)->False)))
% Defined: mnot:=(fun (Phi:(fofType->Prop)) (W:fofType)=> ((Phi W)->False))
% FOF formula (<kernel.Constant object at 0xaf3b90>, <kernel.DependentProduct object at 0xaf3680>) of role type named mor_type
% Using role type
% Declaring mor:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mor) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop)) (W:fofType)=> ((or (Phi W)) (Psi W)))) of role definition named mor
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mor) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop)) (W:fofType)=> ((or (Phi W)) (Psi W))))
% Defined: mor:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop)) (W:fofType)=> ((or (Phi W)) (Psi W)))
% FOF formula (<kernel.Constant object at 0xf12ef0>, <kernel.DependentProduct object at 0xaf35f0>) of role type named mbox_type
% 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))) (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((R W) V)->False)) (Phi V))))) of role definition named mbox
% A new definition: (((eq ((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))) mbox) (fun (R:(fofType->(fofType->Prop))) (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((R W) V)->False)) (Phi V)))))
% Defined: mbox:=(fun (R:(fofType->(fofType->Prop))) (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((R W) V)->False)) (Phi V))))
% FOF formula (<kernel.Constant object at 0xaf35f0>, <kernel.DependentProduct object at 0xaf33b0>) of role type named mforall_prop_type
% Using role type
% Declaring mforall_prop:(((fofType->Prop)->(fofType->Prop))->(fofType->Prop))
% FOF formula (((eq (((fofType->Prop)->(fofType->Prop))->(fofType->Prop))) mforall_prop) (fun (Phi:((fofType->Prop)->(fofType->Prop))) (W:fofType)=> (forall (P:(fofType->Prop)), ((Phi P) W)))) of role definition named mforall_prop
% A new definition: (((eq (((fofType->Prop)->(fofType->Prop))->(fofType->Prop))) mforall_prop) (fun (Phi:((fofType->Prop)->(fofType->Prop))) (W:fofType)=> (forall (P:(fofType->Prop)), ((Phi P) W))))
% Defined: mforall_prop:=(fun (Phi:((fofType->Prop)->(fofType->Prop))) (W:fofType)=> (forall (P:(fofType->Prop)), ((Phi P) W)))
% FOF formula (<kernel.Constant object at 0xaf3440>, <kernel.DependentProduct object at 0xaf39e0>) of role type named mtrue_type
% Using role type
% Declaring mtrue:(fofType->Prop)
% FOF formula (((eq (fofType->Prop)) mtrue) (fun (W:fofType)=> True)) of role definition named mtrue
% A new definition: (((eq (fofType->Prop)) mtrue) (fun (W:fofType)=> True))
% Defined: mtrue:=(fun (W:fofType)=> True)
% FOF formula (<kernel.Constant object at 0xaf3a70>, <kernel.DependentProduct object at 0xaf3d40>) of role type named mfalse_type
% Using role type
% Declaring mfalse:(fofType->Prop)
% FOF formula (((eq (fofType->Prop)) mfalse) (mnot mtrue)) of role definition named mfalse
% A new definition: (((eq (fofType->Prop)) mfalse) (mnot mtrue))
% Defined: mfalse:=(mnot mtrue)
% FOF formula (<kernel.Constant object at 0xaf37a0>, <kernel.DependentProduct object at 0xaf3680>) of role type named mand_type
% Using role type
% Declaring mand:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mand) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mor (mnot Phi)) (mnot Psi))))) of role definition named mand
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mand) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mor (mnot Phi)) (mnot Psi)))))
% Defined: mand:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mor (mnot Phi)) (mnot Psi))))
% FOF formula (<kernel.Constant object at 0xaf3440>, <kernel.DependentProduct object at 0xaf3680>) of role type named mimplies_type
% Using role type
% Declaring mimplies:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mimplies) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Phi)) Psi))) of role definition named mimplies
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mimplies) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Phi)) Psi)))
% Defined: mimplies:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Phi)) Psi))
% FOF formula (<kernel.Constant object at 0xaf3b00>, <kernel.DependentProduct object at 0xae9710>) of role type named mimplied_type
% Using role type
% Declaring mimplied:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mimplied) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Psi)) Phi))) of role definition named mimplied
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mimplied) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Psi)) Phi)))
% Defined: mimplied:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Psi)) Phi))
% FOF formula (<kernel.Constant object at 0xaf3b00>, <kernel.DependentProduct object at 0xae9758>) of role type named mequiv_type
% Using role type
% Declaring mequiv:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mequiv) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mand ((mimplies Phi) Psi)) ((mimplies Psi) Phi)))) of role definition named mequiv
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mequiv) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mand ((mimplies Phi) Psi)) ((mimplies Psi) Phi))))
% Defined: mequiv:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mand ((mimplies Phi) Psi)) ((mimplies Psi) Phi)))
% FOF formula (<kernel.Constant object at 0xaf37a0>, <kernel.DependentProduct object at 0xae9830>) of role type named mxor_type
% Using role type
% Declaring mxor:((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))
% FOF formula (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mxor) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mequiv Phi) Psi)))) of role definition named mxor
% A new definition: (((eq ((fofType->Prop)->((fofType->Prop)->(fofType->Prop)))) mxor) (fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mequiv Phi) Psi))))
% Defined: mxor:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mequiv Phi) Psi)))
% FOF formula (<kernel.Constant object at 0xae9830>, <kernel.DependentProduct object at 0xae9518>) of role type named mdia_type
% 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))) (Phi:(fofType->Prop))=> (mnot ((mbox R) (mnot Phi))))) of role definition named mdia
% A new definition: (((eq ((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop)))) mdia) (fun (R:(fofType->(fofType->Prop))) (Phi:(fofType->Prop))=> (mnot ((mbox R) (mnot Phi)))))
% Defined: mdia:=(fun (R:(fofType->(fofType->Prop))) (Phi:(fofType->Prop))=> (mnot ((mbox R) (mnot Phi))))
% FOF formula (<kernel.Constant object at 0xae9830>, <kernel.DependentProduct object at 0xae9758>) of role type named exists_in_world_type
% Using role type
% Declaring exists_in_world:(mu->(fofType->Prop))
% FOF formula (forall (V:fofType), ((ex mu) (fun (X:mu)=> ((exists_in_world X) V)))) of role axiom named nonempty_ax
% A new axiom: (forall (V:fofType), ((ex mu) (fun (X:mu)=> ((exists_in_world X) V))))
% FOF formula (<kernel.Constant object at 0xae9290>, <kernel.DependentProduct object at 0xae91b8>) of role type named mforall_ind_type
% Using role type
% Declaring mforall_ind:((mu->(fofType->Prop))->(fofType->Prop))
% FOF formula (((eq ((mu->(fofType->Prop))->(fofType->Prop))) mforall_ind) (fun (Phi:(mu->(fofType->Prop))) (W:fofType)=> (forall (X:mu), (((exists_in_world X) W)->((Phi X) W))))) of role definition named mforall_ind
% A new definition: (((eq ((mu->(fofType->Prop))->(fofType->Prop))) mforall_ind) (fun (Phi:(mu->(fofType->Prop))) (W:fofType)=> (forall (X:mu), (((exists_in_world X) W)->((Phi X) W)))))
% Defined: mforall_ind:=(fun (Phi:(mu->(fofType->Prop))) (W:fofType)=> (forall (X:mu), (((exists_in_world X) W)->((Phi X) W))))
% FOF formula (<kernel.Constant object at 0xae96c8>, <kernel.DependentProduct object at 0xae9170>) of role type named mexists_ind_type
% Using role type
% Declaring mexists_ind:((mu->(fofType->Prop))->(fofType->Prop))
% FOF formula (((eq ((mu->(fofType->Prop))->(fofType->Prop))) mexists_ind) (fun (Phi:(mu->(fofType->Prop)))=> (mnot (mforall_ind (fun (X:mu)=> (mnot (Phi X))))))) of role definition named mexists_ind
% A new definition: (((eq ((mu->(fofType->Prop))->(fofType->Prop))) mexists_ind) (fun (Phi:(mu->(fofType->Prop)))=> (mnot (mforall_ind (fun (X:mu)=> (mnot (Phi X)))))))
% Defined: mexists_ind:=(fun (Phi:(mu->(fofType->Prop)))=> (mnot (mforall_ind (fun (X:mu)=> (mnot (Phi X))))))
% FOF formula (<kernel.Constant object at 0xae9170>, <kernel.DependentProduct object at 0xae94d0>) of role type named mexists_prop_type
% Using role type
% Declaring mexists_prop:(((fofType->Prop)->(fofType->Prop))->(fofType->Prop))
% FOF formula (((eq (((fofType->Prop)->(fofType->Prop))->(fofType->Prop))) mexists_prop) (fun (Phi:((fofType->Prop)->(fofType->Prop)))=> (mnot (mforall_prop (fun (P:(fofType->Prop))=> (mnot (Phi P))))))) of role definition named mexists_prop
% A new definition: (((eq (((fofType->Prop)->(fofType->Prop))->(fofType->Prop))) mexists_prop) (fun (Phi:((fofType->Prop)->(fofType->Prop)))=> (mnot (mforall_prop (fun (P:(fofType->Prop))=> (mnot (Phi P)))))))
% Defined: mexists_prop:=(fun (Phi:((fofType->Prop)->(fofType->Prop)))=> (mnot (mforall_prop (fun (P:(fofType->Prop))=> (mnot (Phi P))))))
% FOF formula (<kernel.Constant object at 0xae91b8>, <kernel.DependentProduct object at 0xae9c68>) of role type named mreflexive_type
% Using role type
% Declaring mreflexive:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mreflexive) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((R S) S)))) of role definition named mreflexive
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mreflexive) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((R S) S))))
% Defined: mreflexive:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((R S) S)))
% FOF formula (<kernel.Constant object at 0xae9c68>, <kernel.DependentProduct object at 0xae9bd8>) of role type named msymmetric_type
% Using role type
% Declaring msymmetric:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) msymmetric) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (((R S) T)->((R T) S))))) of role definition named msymmetric
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) msymmetric) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (((R S) T)->((R T) S)))))
% Defined: msymmetric:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (((R S) T)->((R T) S))))
% FOF formula (<kernel.Constant object at 0xae9bd8>, <kernel.DependentProduct object at 0xae9cb0>) of role type named mserial_type
% Using role type
% Declaring mserial:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mserial) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((R S) T)))))) of role definition named mserial
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mserial) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((R S) T))))))
% Defined: mserial:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((R S) T)))))
% FOF formula (<kernel.Constant object at 0xae9cb0>, <kernel.DependentProduct object at 0xae97a0>) of role type named mtransitive_type
% Using role type
% Declaring mtransitive:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mtransitive) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R T) U))->((R S) U))))) of role definition named mtransitive
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mtransitive) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R T) U))->((R S) U)))))
% Defined: mtransitive:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R T) U))->((R S) U))))
% FOF formula (<kernel.Constant object at 0xae97a0>, <kernel.DependentProduct object at 0xae9098>) of role type named meuclidean_type
% Using role type
% Declaring meuclidean:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) meuclidean) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((R T) U))))) of role definition named meuclidean
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) meuclidean) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((R T) U)))))
% Defined: meuclidean:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((R T) U))))
% FOF formula (<kernel.Constant object at 0xae9098>, <kernel.DependentProduct object at 0xae9e60>) of role type named mpartially_functional_type
% Using role type
% Declaring mpartially_functional:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mpartially_functional) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->(((eq fofType) T) U))))) of role definition named mpartially_functional
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mpartially_functional) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->(((eq fofType) T) U)))))
% Defined: mpartially_functional:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->(((eq fofType) T) U))))
% FOF formula (<kernel.Constant object at 0xae9e60>, <kernel.DependentProduct object at 0xae9488>) of role type named mfunctional_type
% Using role type
% Declaring mfunctional:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mfunctional) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((and ((R S) T)) (forall (U:fofType), (((R S) U)->(((eq fofType) T) U))))))))) of role definition named mfunctional
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mfunctional) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((and ((R S) T)) (forall (U:fofType), (((R S) U)->(((eq fofType) T) U)))))))))
% Defined: mfunctional:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((and ((R S) T)) (forall (U:fofType), (((R S) U)->(((eq fofType) T) U))))))))
% FOF formula (<kernel.Constant object at 0xae9488>, <kernel.DependentProduct object at 0xae9878>) of role type named mweakly_dense_type
% Using role type
% Declaring mweakly_dense:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mweakly_dense) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (fofType->(((R S) T)->((ex fofType) (fun (U:fofType)=> ((and ((R S) U)) ((R U) T))))))))) of role definition named mweakly_dense
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mweakly_dense) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (fofType->(((R S) T)->((ex fofType) (fun (U:fofType)=> ((and ((R S) U)) ((R U) T)))))))))
% Defined: mweakly_dense:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (fofType->(((R S) T)->((ex fofType) (fun (U:fofType)=> ((and ((R S) U)) ((R U) T))))))))
% FOF formula (<kernel.Constant object at 0xae9878>, <kernel.DependentProduct object at 0xae9c68>) of role type named mweakly_connected_type
% Using role type
% Declaring mweakly_connected:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mweakly_connected) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((or ((or ((R T) U)) (((eq fofType) T) U))) ((R U) T)))))) of role definition named mweakly_connected
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mweakly_connected) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((or ((or ((R T) U)) (((eq fofType) T) U))) ((R U) T))))))
% Defined: mweakly_connected:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((or ((or ((R T) U)) (((eq fofType) T) U))) ((R U) T)))))
% FOF formula (<kernel.Constant object at 0xae9c68>, <kernel.DependentProduct object at 0xae96c8>) of role type named mweakly_directed_type
% Using role type
% Declaring mweakly_directed:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) mweakly_directed) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((ex fofType) (fun (V:fofType)=> ((and ((R T) V)) ((R U) V)))))))) of role definition named mweakly_directed
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) mweakly_directed) (fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((ex fofType) (fun (V:fofType)=> ((and ((R T) V)) ((R U) V))))))))
% Defined: mweakly_directed:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((ex fofType) (fun (V:fofType)=> ((and ((R T) V)) ((R U) V)))))))
% FOF formula (<kernel.Constant object at 0xae9170>, <kernel.DependentProduct object at 0xae9b90>) of role type named mvalid_type
% Using role type
% Declaring mvalid:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) mvalid) (fun (Phi:(fofType->Prop))=> (forall (W:fofType), (Phi W)))) of role definition named mvalid
% A new definition: (((eq ((fofType->Prop)->Prop)) mvalid) (fun (Phi:(fofType->Prop))=> (forall (W:fofType), (Phi W))))
% Defined: mvalid:=(fun (Phi:(fofType->Prop))=> (forall (W:fofType), (Phi W)))
% FOF formula (<kernel.Constant object at 0xae9c68>, <kernel.DependentProduct object at 0xcc3050>) of role type named msatisfiable_type
% Using role type
% Declaring msatisfiable:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) msatisfiable) (fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (Phi W))))) of role definition named msatisfiable
% A new definition: (((eq ((fofType->Prop)->Prop)) msatisfiable) (fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (Phi W)))))
% Defined: msatisfiable:=(fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (Phi W))))
% FOF formula (<kernel.Constant object at 0xae9098>, <kernel.DependentProduct object at 0xcc3128>) of role type named mcountersatisfiable_type
% Using role type
% Declaring mcountersatisfiable:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) mcountersatisfiable) (fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((Phi W)->False))))) of role definition named mcountersatisfiable
% A new definition: (((eq ((fofType->Prop)->Prop)) mcountersatisfiable) (fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((Phi W)->False)))))
% Defined: mcountersatisfiable:=(fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((Phi W)->False))))
% FOF formula (<kernel.Constant object at 0xae9b90>, <kernel.DependentProduct object at 0xcc32d8>) of role type named minvalid_type
% Using role type
% Declaring minvalid:((fofType->Prop)->Prop)
% FOF formula (((eq ((fofType->Prop)->Prop)) minvalid) (fun (Phi:(fofType->Prop))=> (forall (W:fofType), ((Phi W)->False)))) of role definition named minvalid
% A new definition: (((eq ((fofType->Prop)->Prop)) minvalid) (fun (Phi:(fofType->Prop))=> (forall (W:fofType), ((Phi W)->False))))
% Defined: minvalid:=(fun (Phi:(fofType->Prop))=> (forall (W:fofType), ((Phi W)->False)))
% Failed to open /home/cristobal/cocATP/CASC/TPTP/Axioms/LCL013^5.ax, trying next directory
% FOF formula (<kernel.Constant object at 0xcd5f80>, <kernel.DependentProduct object at 0xcd53f8>) of role type named rel_s4_type
% Using role type
% Declaring rel_s4:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xcd57e8>, <kernel.DependentProduct object at 0xcd5e18>) of role type named mbox_s4_type
% Using role type
% Declaring mbox_s4:((fofType->Prop)->(fofType->Prop))
% FOF formula (((eq ((fofType->Prop)->(fofType->Prop))) mbox_s4) (fun (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((rel_s4 W) V)->False)) (Phi V))))) of role definition named mbox_s4
% A new definition: (((eq ((fofType->Prop)->(fofType->Prop))) mbox_s4) (fun (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((rel_s4 W) V)->False)) (Phi V)))))
% Defined: mbox_s4:=(fun (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((rel_s4 W) V)->False)) (Phi V))))
% FOF formula (<kernel.Constant object at 0x9c1b00>, <kernel.DependentProduct object at 0xcd5638>) of role type named mdia_s4_type
% Using role type
% Declaring mdia_s4:((fofType->Prop)->(fofType->Prop))
% FOF formula (((eq ((fofType->Prop)->(fofType->Prop))) mdia_s4) (fun (Phi:(fofType->Prop))=> (mnot (mbox_s4 (mnot Phi))))) of role definition named mdia_s4
% A new definition: (((eq ((fofType->Prop)->(fofType->Prop))) mdia_s4) (fun (Phi:(fofType->Prop))=> (mnot (mbox_s4 (mnot Phi)))))
% Defined: mdia_s4:=(fun (Phi:(fofType->Prop))=> (mnot (mbox_s4 (mnot Phi))))
% FOF formula (mreflexive rel_s4) of role axiom named a1
% A new axiom: (mreflexive rel_s4)
% FOF formula (mtransitive rel_s4) of role axiom named a2
% A new axiom: (mtransitive rel_s4)
% Failed to open /home/cristobal/cocATP/CASC/TPTP/Axioms/LCL015^1.ax, trying next directory
% FOF formula (forall (X:mu) (V:fofType) (W:fofType), (((and ((exists_in_world X) V)) ((rel_s4 V) W))->((exists_in_world X) W))) of role axiom named cumulative_ax
% A new axiom: (forall (X:mu) (V:fofType) (W:fofType), (((and ((exists_in_world X) V)) ((rel_s4 V) W))->((exists_in_world X) W)))
% FOF formula (<kernel.Constant object at 0xad8bd8>, <kernel.DependentProduct object at 0xad8c20>) of role type named inductive_type
% Using role type
% Declaring inductive:(mu->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xad8680>, <kernel.DependentProduct object at 0xad85a8>) of role type named subclass_type
% Using role type
% Declaring subclass:(mu->(mu->(fofType->Prop)))
% FOF formula (<kernel.Constant object at 0xad8a28>, <kernel.DependentProduct object at 0xad8518>) of role type named disjoint_type
% Using role type
% Declaring disjoint:(mu->(mu->(fofType->Prop)))
% FOF formula (<kernel.Constant object at 0xad8c20>, <kernel.DependentProduct object at 0xad8680>) of role type named function_type
% Using role type
% Declaring function:(mu->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xad85a8>, <kernel.DependentProduct object at 0xad8830>) of role type named member_type
% Using role type
% Declaring member:(mu->(mu->(fofType->Prop)))
% FOF formula (<kernel.Constant object at 0xad8518>, <kernel.DependentProduct object at 0xad8560>) of role type named unordered_pair_type
% Using role type
% Declaring unordered_pair:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((unordered_pair V2) V1)) V)) of role axiom named existence_of_unordered_pair_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((unordered_pair V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xad8440>, <kernel.DependentProduct object at 0xad8560>) of role type named second_type
% Using role type
% Declaring second:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (second V1)) V)) of role axiom named existence_of_second_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (second V1)) V))
% FOF formula (<kernel.Constant object at 0x9c1b00>, <kernel.DependentProduct object at 0xad8a28>) of role type named first_type
% Using role type
% Declaring first:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (first V1)) V)) of role axiom named existence_of_first_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (first V1)) V))
% FOF formula (<kernel.Constant object at 0x9c10e0>, <kernel.Constant object at 0xad8758>) of role type named element_relation_type
% Using role type
% Declaring element_relation:mu
% FOF formula (forall (V:fofType), ((exists_in_world element_relation) V)) of role axiom named existence_of_element_relation_ax
% A new axiom: (forall (V:fofType), ((exists_in_world element_relation) V))
% FOF formula (<kernel.Constant object at 0xf12ef0>, <kernel.DependentProduct object at 0xad85a8>) of role type named complement_type
% Using role type
% Declaring complement:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (complement V1)) V)) of role axiom named existence_of_complement_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (complement V1)) V))
% FOF formula (<kernel.Constant object at 0xad8830>, <kernel.DependentProduct object at 0xad8758>) of role type named intersection_type
% Using role type
% Declaring intersection:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((intersection V2) V1)) V)) of role axiom named existence_of_intersection_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((intersection V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xad8758>, <kernel.DependentProduct object at 0xcd53f8>) of role type named rotate_type
% Using role type
% Declaring rotate:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (rotate V1)) V)) of role axiom named existence_of_rotate_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (rotate V1)) V))
% FOF formula (<kernel.Constant object at 0xad8758>, <kernel.DependentProduct object at 0xad8ab8>) of role type named union_type
% Using role type
% Declaring union:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((union V2) V1)) V)) of role axiom named existence_of_union_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((union V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xad87a0>, <kernel.DependentProduct object at 0xcd52d8>) of role type named successor_type
% Using role type
% Declaring successor:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (successor V1)) V)) of role axiom named existence_of_successor_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (successor V1)) V))
% FOF formula (<kernel.Constant object at 0xad8ab8>, <kernel.DependentProduct object at 0xcd5200>) of role type named flip_type
% Using role type
% Declaring flip:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (flip V1)) V)) of role axiom named existence_of_flip_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (flip V1)) V))
% FOF formula (<kernel.Constant object at 0xad8ab8>, <kernel.DependentProduct object at 0xcd51b8>) of role type named domain_of_type
% Using role type
% Declaring domain_of:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (domain_of V1)) V)) of role axiom named existence_of_domain_of_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (domain_of V1)) V))
% FOF formula (<kernel.Constant object at 0xcd5e18>, <kernel.DependentProduct object at 0xcd52d8>) of role type named restrict_type
% Using role type
% Declaring restrict:(mu->(mu->(mu->mu)))
% FOF formula (forall (V:fofType) (V3:mu) (V2:mu) (V1:mu), ((exists_in_world (((restrict V3) V2) V1)) V)) of role axiom named existence_of_restrict_ax
% A new axiom: (forall (V:fofType) (V3:mu) (V2:mu) (V1:mu), ((exists_in_world (((restrict V3) V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xcd53f8>, <kernel.DependentProduct object at 0xcd5dd0>) of role type named range_of_type
% Using role type
% Declaring range_of:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (range_of V1)) V)) of role axiom named existence_of_range_of_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (range_of V1)) V))
% FOF formula (<kernel.Constant object at 0xcd5dd0>, <kernel.Constant object at 0xcd5ef0>) of role type named successor_relation_type
% Using role type
% Declaring successor_relation:mu
% FOF formula (forall (V:fofType), ((exists_in_world successor_relation) V)) of role axiom named existence_of_successor_relation_ax
% A new axiom: (forall (V:fofType), ((exists_in_world successor_relation) V))
% FOF formula (<kernel.Constant object at 0xcd5ef0>, <kernel.DependentProduct object at 0xaf3dd0>) of role type named power_class_type
% Using role type
% Declaring power_class:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (power_class V1)) V)) of role axiom named existence_of_power_class_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (power_class V1)) V))
% FOF formula (<kernel.Constant object at 0xcd5248>, <kernel.Constant object at 0xcd5f38>) of role type named identity_relation_type
% Using role type
% Declaring identity_relation:mu
% FOF formula (forall (V:fofType), ((exists_in_world identity_relation) V)) of role axiom named existence_of_identity_relation_ax
% A new axiom: (forall (V:fofType), ((exists_in_world identity_relation) V))
% FOF formula (<kernel.Constant object at 0xcd5ea8>, <kernel.DependentProduct object at 0xaf3f38>) of role type named inverse_type
% Using role type
% Declaring inverse:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (inverse V1)) V)) of role axiom named existence_of_inverse_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (inverse V1)) V))
% FOF formula (<kernel.Constant object at 0xcd5248>, <kernel.DependentProduct object at 0xaf3fc8>) of role type named compose_type
% Using role type
% Declaring compose:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((compose V2) V1)) V)) of role axiom named existence_of_compose_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((compose V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xcd5ea8>, <kernel.DependentProduct object at 0xaf34d0>) of role type named cross_product_type
% Using role type
% Declaring cross_product:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((cross_product V2) V1)) V)) of role axiom named existence_of_cross_product_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((cross_product V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xaf3cb0>, <kernel.DependentProduct object at 0xaf34d0>) of role type named singleton_type
% Using role type
% Declaring singleton:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (singleton V1)) V)) of role axiom named existence_of_singleton_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (singleton V1)) V))
% FOF formula (<kernel.Constant object at 0xaf3e60>, <kernel.DependentProduct object at 0xaf3dd0>) of role type named image_type
% Using role type
% Declaring image:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((image V2) V1)) V)) of role axiom named existence_of_image_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((image V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xaf3950>, <kernel.DependentProduct object at 0xaf3e60>) of role type named sum_class_type
% Using role type
% Declaring sum_class:(mu->mu)
% FOF formula (forall (V:fofType) (V1:mu), ((exists_in_world (sum_class V1)) V)) of role axiom named existence_of_sum_class_ax
% A new axiom: (forall (V:fofType) (V1:mu), ((exists_in_world (sum_class V1)) V))
% FOF formula (<kernel.Constant object at 0xaf35f0>, <kernel.DependentProduct object at 0xaf3cb0>) of role type named apply_type
% Using role type
% Declaring apply:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((apply V2) V1)) V)) of role axiom named existence_of_apply_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((apply V2) V1)) V))
% FOF formula (<kernel.Constant object at 0xaf35f0>, <kernel.Constant object at 0xaf37a0>) of role type named null_class_type
% Using role type
% Declaring null_class:mu
% FOF formula (forall (V:fofType), ((exists_in_world null_class) V)) of role axiom named existence_of_null_class_ax
% A new axiom: (forall (V:fofType), ((exists_in_world null_class) V))
% FOF formula (<kernel.Constant object at 0xaf33b0>, <kernel.Constant object at 0xaf3e60>) of role type named universal_class_type
% Using role type
% Declaring universal_class:mu
% FOF formula (forall (V:fofType), ((exists_in_world universal_class) V)) of role axiom named existence_of_universal_class_ax
% A new axiom: (forall (V:fofType), ((exists_in_world universal_class) V))
% FOF formula (<kernel.Constant object at 0xaf3e60>, <kernel.DependentProduct object at 0xaf3d40>) of role type named ordered_pair_type
% Using role type
% Declaring ordered_pair:(mu->(mu->mu))
% FOF formula (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((ordered_pair V2) V1)) V)) of role axiom named existence_of_ordered_pair_ax
% A new axiom: (forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((ordered_pair V2) V1)) V))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq X) X)))) of role axiom named reflexivity
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq X) X))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mimplies ((qmltpeq X) Y)) ((qmltpeq Y) X))))))) of role axiom named symmetry
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mimplies ((qmltpeq X) Y)) ((qmltpeq Y) X)))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((mand ((qmltpeq X) Y)) ((qmltpeq Y) Z))) ((qmltpeq X) Z))))))))) of role axiom named transitivity
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((mand ((qmltpeq X) Y)) ((qmltpeq Y) Z))) ((qmltpeq X) Z)))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((apply A) C)) ((apply B) C)))))))))) of role axiom named apply_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((apply A) C)) ((apply B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((apply C) A)) ((apply C) B)))))))))) of role axiom named apply_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((apply C) A)) ((apply C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (complement A)) (complement B)))))))) of role axiom named complement_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (complement A)) (complement B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((compose A) C)) ((compose B) C)))))))))) of role axiom named compose_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((compose A) C)) ((compose B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((compose C) A)) ((compose C) B)))))))))) of role axiom named compose_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((compose C) A)) ((compose C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((cross_product A) C)) ((cross_product B) C)))))))))) of role axiom named cross_product_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((cross_product A) C)) ((cross_product B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((cross_product C) A)) ((cross_product C) B)))))))))) of role axiom named cross_product_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((cross_product C) A)) ((cross_product C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (domain_of A)) (domain_of B)))))))) of role axiom named domain_of_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (domain_of A)) (domain_of B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (first A)) (first B)))))))) of role axiom named first_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (first A)) (first B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (flip A)) (flip B)))))))) of role axiom named flip_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (flip A)) (flip B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((image A) C)) ((image B) C)))))))))) of role axiom named image_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((image A) C)) ((image B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((image C) A)) ((image C) B)))))))))) of role axiom named image_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((image C) A)) ((image C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((intersection A) C)) ((intersection B) C)))))))))) of role axiom named intersection_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((intersection A) C)) ((intersection B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((intersection C) A)) ((intersection C) B)))))))))) of role axiom named intersection_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((intersection C) A)) ((intersection C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (inverse A)) (inverse B)))))))) of role axiom named inverse_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (inverse A)) (inverse B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((ordered_pair A) C)) ((ordered_pair B) C)))))))))) of role axiom named ordered_pair_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((ordered_pair A) C)) ((ordered_pair B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((ordered_pair C) A)) ((ordered_pair C) B)))))))))) of role axiom named ordered_pair_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((ordered_pair C) A)) ((ordered_pair C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (power_class A)) (power_class B)))))))) of role axiom named power_class_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (power_class A)) (power_class B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (range_of A)) (range_of B)))))))) of role axiom named range_of_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (range_of A)) (range_of B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict A) C) D)) (((restrict B) C) D)))))))))))) of role axiom named restrict_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict A) C) D)) (((restrict B) C) D))))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict C) A) D)) (((restrict C) B) D)))))))))))) of role axiom named restrict_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict C) A) D)) (((restrict C) B) D))))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict C) D) A)) (((restrict C) D) B)))))))))))) of role axiom named restrict_substitution_3
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict C) D) A)) (((restrict C) D) B))))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (rotate A)) (rotate B)))))))) of role axiom named rotate_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (rotate A)) (rotate B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (second A)) (second B)))))))) of role axiom named second_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (second A)) (second B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (singleton A)) (singleton B)))))))) of role axiom named singleton_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (singleton A)) (singleton B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (successor A)) (successor B)))))))) of role axiom named successor_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (successor A)) (successor B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (sum_class A)) (sum_class B)))))))) of role axiom named sum_class_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (sum_class A)) (sum_class B))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((union A) C)) ((union B) C)))))))))) of role axiom named union_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((union A) C)) ((union B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((union C) A)) ((union C) B)))))))))) of role axiom named union_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((union C) A)) ((union C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((unordered_pair A) C)) ((unordered_pair B) C)))))))))) of role axiom named unordered_pair_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((unordered_pair A) C)) ((unordered_pair B) C))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((unordered_pair C) A)) ((unordered_pair C) B)))))))))) of role axiom named unordered_pair_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((unordered_pair C) A)) ((unordered_pair C) B))))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((disjoint A) C))) ((disjoint B) C))))))))) of role axiom named disjoint_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((disjoint A) C))) ((disjoint B) C)))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((disjoint C) A))) ((disjoint C) B))))))))) of role axiom named disjoint_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((disjoint C) A))) ((disjoint C) B)))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((mand ((qmltpeq A) B)) (function A))) (function B))))))) of role axiom named function_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((mand ((qmltpeq A) B)) (function A))) (function B)))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((mand ((qmltpeq A) B)) (inductive A))) (inductive B))))))) of role axiom named inductive_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((mand ((qmltpeq A) B)) (inductive A))) (inductive B)))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((member A) C))) ((member B) C))))))))) of role axiom named member_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((member A) C))) ((member B) C)))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((member C) A))) ((member C) B))))))))) of role axiom named member_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((member C) A))) ((member C) B)))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((subclass A) C))) ((subclass B) C))))))))) of role axiom named subclass_substitution_1
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((subclass A) C))) ((subclass B) C)))))))))
% FOF formula (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((subclass C) A))) ((subclass C) B))))))))) of role axiom named subclass_substitution_2
% A new axiom: (mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((subclass C) A))) ((subclass C) B)))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((subclass X) Y)) (mforall_ind (fun (U:mu)=> ((mimplies ((member U) X)) ((member U) Y)))))))))) of role axiom named subclass_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((subclass X) Y)) (mforall_ind (fun (U:mu)=> ((mimplies ((member U) X)) ((member U) Y))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((subclass X) universal_class)))) of role axiom named class_elements_are_sets
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((subclass X) universal_class))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((qmltpeq X) Y)) ((mand ((subclass X) Y)) ((subclass Y) X)))))))) of role axiom named extensionality
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((qmltpeq X) Y)) ((mand ((subclass X) Y)) ((subclass Y) X))))))))
% FOF formula (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member U) ((unordered_pair X) Y))) ((mand ((member U) universal_class)) ((mor ((qmltpeq U) X)) ((qmltpeq U) Y))))))))))) of role axiom named unordered_pair_defn
% A new axiom: (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member U) ((unordered_pair X) Y))) ((mand ((member U) universal_class)) ((mor ((qmltpeq U) X)) ((qmltpeq U) Y)))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((member ((unordered_pair X) Y)) universal_class)))))) of role axiom named unordered_pair
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((member ((unordered_pair X) Y)) universal_class))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq (singleton X)) ((unordered_pair X) X))))) of role axiom named singleton_set_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq (singleton X)) ((unordered_pair X) X)))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq ((ordered_pair X) Y)) ((unordered_pair (singleton X)) ((unordered_pair X) (singleton Y))))))))) of role axiom named ordered_pair_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq ((ordered_pair X) Y)) ((unordered_pair (singleton X)) ((unordered_pair X) (singleton Y)))))))))
% FOF formula (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair U) V)) ((cross_product X) Y))) ((mand ((member U) X)) ((member V) Y)))))))))))) of role axiom named cross_product_defn
% A new axiom: (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair U) V)) ((cross_product X) Y))) ((mand ((member U) X)) ((member V) Y))))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((member Z) ((cross_product X) Y))) ((qmltpeq Z) ((ordered_pair (first Z)) (second Z))))))))))) of role axiom named cross_product
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((member Z) ((cross_product X) Y))) ((qmltpeq Z) ((ordered_pair (first Z)) (second Z)))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair X) Y)) element_relation)) ((mand ((member Y) universal_class)) ((member X) Y)))))))) of role axiom named element_relation_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair X) Y)) element_relation)) ((mand ((member Y) universal_class)) ((member X) Y))))))))
% FOF formula (mvalid ((subclass element_relation) ((cross_product universal_class) universal_class))) of role axiom named element_relation
% A new axiom: (mvalid ((subclass element_relation) ((cross_product universal_class) universal_class)))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) ((intersection X) Y))) ((mand ((member Z) X)) ((member Z) Y)))))))))) of role axiom named intersection
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) ((intersection X) Y))) ((mand ((member Z) X)) ((member Z) Y))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) (complement X))) ((mand ((member Z) universal_class)) (mnot ((member Z) X))))))))) of role axiom named complement
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) (complement X))) ((mand ((member Z) universal_class)) (mnot ((member Z) X)))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq (((restrict XR) X) Y)) ((intersection XR) ((cross_product X) Y)))))))))) of role axiom named restrict_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq (((restrict XR) X) Y)) ((intersection XR) ((cross_product X) Y))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mnot ((member X) null_class))))) of role axiom named null_class_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mnot ((member X) null_class)))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) (domain_of X))) ((mand ((member Z) universal_class)) (mnot ((qmltpeq (((restrict X) (singleton Z)) universal_class)) null_class))))))))) of role axiom named domain_of
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) (domain_of X))) ((mand ((member Z) universal_class)) (mnot ((qmltpeq (((restrict X) (singleton Z)) universal_class)) null_class)))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (W:mu)=> ((mequiv ((member ((ordered_pair ((ordered_pair U) V)) W)) (rotate X))) ((mand ((member ((ordered_pair ((ordered_pair U) V)) W)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))) ((member ((ordered_pair ((ordered_pair V) W)) U)) X)))))))))))) of role axiom named rotate_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (W:mu)=> ((mequiv ((member ((ordered_pair ((ordered_pair U) V)) W)) (rotate X))) ((mand ((member ((ordered_pair ((ordered_pair U) V)) W)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))) ((member ((ordered_pair ((ordered_pair V) W)) U)) X))))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((subclass (rotate X)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))))) of role axiom named rotate
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((subclass (rotate X)) ((cross_product ((cross_product universal_class) universal_class)) universal_class)))))
% FOF formula (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (W:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member ((ordered_pair ((ordered_pair U) V)) W)) (flip X))) ((mand ((member ((ordered_pair ((ordered_pair U) V)) W)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))) ((member ((ordered_pair ((ordered_pair V) U)) W)) X)))))))))))) of role axiom named flip_defn
% A new axiom: (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (W:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member ((ordered_pair ((ordered_pair U) V)) W)) (flip X))) ((mand ((member ((ordered_pair ((ordered_pair U) V)) W)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))) ((member ((ordered_pair ((ordered_pair V) U)) W)) X))))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((subclass (flip X)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))))) of role axiom named flip
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((subclass (flip X)) ((cross_product ((cross_product universal_class) universal_class)) universal_class)))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) ((union X) Y))) ((mor ((member Z) X)) ((member Z) Y)))))))))) of role axiom named union_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) ((union X) Y))) ((mor ((member Z) X)) ((member Z) Y))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq (successor X)) ((union X) (singleton X)))))) of role axiom named successor_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq (successor X)) ((union X) (singleton X))))))
% FOF formula (mvalid ((subclass successor_relation) ((cross_product universal_class) universal_class))) of role axiom named successor_relation_defn1
% A new axiom: (mvalid ((subclass successor_relation) ((cross_product universal_class) universal_class)))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair X) Y)) successor_relation)) ((mand ((member X) universal_class)) ((mand ((member Y) universal_class)) ((qmltpeq (successor X)) Y))))))))) of role axiom named successor_relation_defn2
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair X) Y)) successor_relation)) ((mand ((member X) universal_class)) ((mand ((member Y) universal_class)) ((qmltpeq (successor X)) Y)))))))))
% FOF formula (mvalid (mforall_ind (fun (Y:mu)=> ((qmltpeq (inverse Y)) (domain_of (flip ((cross_product Y) universal_class))))))) of role axiom named inverse_defn
% A new axiom: (mvalid (mforall_ind (fun (Y:mu)=> ((qmltpeq (inverse Y)) (domain_of (flip ((cross_product Y) universal_class)))))))
% FOF formula (mvalid (mforall_ind (fun (Z:mu)=> ((qmltpeq (range_of Z)) (domain_of (inverse Z)))))) of role axiom named range_of_defn
% A new axiom: (mvalid (mforall_ind (fun (Z:mu)=> ((qmltpeq (range_of Z)) (domain_of (inverse Z))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XR:mu)=> ((qmltpeq ((image XR) X)) (range_of (((restrict XR) X) universal_class)))))))) of role axiom named image_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XR:mu)=> ((qmltpeq ((image XR) X)) (range_of (((restrict XR) X) universal_class))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((mequiv (inductive X)) ((mand ((member null_class) X)) ((subclass ((image successor_relation) X)) X)))))) of role axiom named inductive_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((mequiv (inductive X)) ((mand ((member null_class) X)) ((subclass ((image successor_relation) X)) X))))))
% FOF formula (mvalid (mexists_ind (fun (X:mu)=> ((mand ((member X) universal_class)) ((mand (inductive X)) (mforall_ind (fun (Y:mu)=> ((mimplies (inductive Y)) ((subclass X) Y))))))))) of role axiom named infinity
% A new axiom: (mvalid (mexists_ind (fun (X:mu)=> ((mand ((member X) universal_class)) ((mand (inductive X)) (mforall_ind (fun (Y:mu)=> ((mimplies (inductive Y)) ((subclass X) Y)))))))))
% FOF formula (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member U) (sum_class X))) (mexists_ind (fun (Y:mu)=> ((mand ((member U) Y)) ((member Y) X)))))))))) of role axiom named sum_class_defn
% A new axiom: (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member U) (sum_class X))) (mexists_ind (fun (Y:mu)=> ((mand ((member U) Y)) ((member Y) X))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((mimplies ((member X) universal_class)) ((member (sum_class X)) universal_class))))) of role axiom named sum_class
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((mimplies ((member X) universal_class)) ((member (sum_class X)) universal_class)))))
% FOF formula (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member U) (power_class X))) ((mand ((member U) universal_class)) ((subclass U) X)))))))) of role axiom named power_class_defn
% A new axiom: (mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member U) (power_class X))) ((mand ((member U) universal_class)) ((subclass U) X))))))))
% FOF formula (mvalid (mforall_ind (fun (U:mu)=> ((mimplies ((member U) universal_class)) ((member (power_class U)) universal_class))))) of role axiom named power_class
% A new axiom: (mvalid (mforall_ind (fun (U:mu)=> ((mimplies ((member U) universal_class)) ((member (power_class U)) universal_class)))))
% FOF formula (mvalid (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (YR:mu)=> ((subclass ((compose YR) XR)) ((cross_product universal_class) universal_class))))))) of role axiom named compose_defn1
% A new axiom: (mvalid (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (YR:mu)=> ((subclass ((compose YR) XR)) ((cross_product universal_class) universal_class)))))))
% FOF formula (mvalid (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (YR:mu)=> (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> ((mequiv ((member ((ordered_pair U) V)) ((compose YR) XR))) ((mand ((member U) universal_class)) ((member V) ((image YR) ((image YR) (singleton U))))))))))))))) of role axiom named compose_defn2
% A new axiom: (mvalid (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (YR:mu)=> (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> ((mequiv ((member ((ordered_pair U) V)) ((compose YR) XR))) ((mand ((member U) universal_class)) ((member V) ((image YR) ((image YR) (singleton U)))))))))))))))
% FOF formula (mvalid (mforall_ind (fun (XF:mu)=> ((mequiv (function XF)) ((mand ((subclass XF) ((cross_product universal_class) universal_class))) ((subclass ((compose XF) (inverse XF))) identity_relation)))))) of role axiom named function_defn
% A new axiom: (mvalid (mforall_ind (fun (XF:mu)=> ((mequiv (function XF)) ((mand ((subclass XF) ((cross_product universal_class) universal_class))) ((subclass ((compose XF) (inverse XF))) identity_relation))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XF:mu)=> ((mimplies ((mand ((member X) universal_class)) (function XF))) ((member ((image XF) X)) universal_class))))))) of role axiom named replacement
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XF:mu)=> ((mimplies ((mand ((member X) universal_class)) (function XF))) ((member ((image XF) X)) universal_class)))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((disjoint X) Y)) (mforall_ind (fun (U:mu)=> (mnot ((mand ((member U) X)) ((member U) Y))))))))))) of role axiom named disjoint_defn
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((disjoint X) Y)) (mforall_ind (fun (U:mu)=> (mnot ((mand ((member U) X)) ((member U) Y)))))))))))
% FOF formula (mvalid (mforall_ind (fun (X:mu)=> ((mimplies (mnot ((qmltpeq X) null_class))) (mexists_ind (fun (U:mu)=> ((mand ((member U) universal_class)) ((mand ((member U) X)) ((disjoint U) X))))))))) of role axiom named regularity
% A new axiom: (mvalid (mforall_ind (fun (X:mu)=> ((mimplies (mnot ((qmltpeq X) null_class))) (mexists_ind (fun (U:mu)=> ((mand ((member U) universal_class)) ((mand ((member U) X)) ((disjoint U) X)))))))))
% FOF formula (mvalid (mforall_ind (fun (XF:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq ((apply XF) Y)) (sum_class ((image XF) (singleton Y))))))))) of role axiom named apply_defn
% A new axiom: (mvalid (mforall_ind (fun (XF:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq ((apply XF) Y)) (sum_class ((image XF) (singleton Y)))))))))
% FOF formula (mvalid (mexists_ind (fun (XF:mu)=> ((mand (function XF)) (mforall_ind (fun (Y:mu)=> ((mimplies ((member Y) universal_class)) ((mor ((qmltpeq Y) null_class)) ((member ((apply XF) Y)) Y))))))))) of role axiom named choice
% A new axiom: (mvalid (mexists_ind (fun (XF:mu)=> ((mand (function XF)) (mforall_ind (fun (Y:mu)=> ((mimplies ((member Y) universal_class)) ((mor ((qmltpeq Y) null_class)) ((member ((apply XF) Y)) Y)))))))))
% FOF formula (mvalid (mforall_ind (fun (W:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((mand ((qmltpeq ((ordered_pair W) X)) ((ordered_pair Y) Z))) ((member X) universal_class))) ((qmltpeq X) Z))))))))))) of role conjecture named ordered_pair_determines_components2
% Conjecture to prove = (mvalid (mforall_ind (fun (W:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((mand ((qmltpeq ((ordered_pair W) X)) ((ordered_pair Y) Z))) ((member X) universal_class))) ((qmltpeq X) Z))))))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(mvalid (mforall_ind (fun (W:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((mand ((qmltpeq ((ordered_pair W) X)) ((ordered_pair Y) Z))) ((member X) universal_class))) ((qmltpeq X) Z)))))))))))']
% Parameter mu:Type.
% Parameter fofType:Type.
% Parameter qmltpeq:(mu->(mu->(fofType->Prop))).
% Definition meq_prop:=(fun (X:(fofType->Prop)) (Y:(fofType->Prop)) (W:fofType)=> (((eq Prop) (X W)) (Y W))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mnot:=(fun (Phi:(fofType->Prop)) (W:fofType)=> ((Phi W)->False)):((fofType->Prop)->(fofType->Prop)).
% Definition mor:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop)) (W:fofType)=> ((or (Phi W)) (Psi W))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mbox:=(fun (R:(fofType->(fofType->Prop))) (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((R W) V)->False)) (Phi V)))):((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop))).
% Definition mforall_prop:=(fun (Phi:((fofType->Prop)->(fofType->Prop))) (W:fofType)=> (forall (P:(fofType->Prop)), ((Phi P) W))):(((fofType->Prop)->(fofType->Prop))->(fofType->Prop)).
% Definition mtrue:=(fun (W:fofType)=> True):(fofType->Prop).
% Definition mfalse:=(mnot mtrue):(fofType->Prop).
% Definition mand:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mor (mnot Phi)) (mnot Psi)))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mimplies:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Phi)) Psi)):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mimplied:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mor (mnot Psi)) Phi)):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mequiv:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> ((mand ((mimplies Phi) Psi)) ((mimplies Psi) Phi))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mxor:=(fun (Phi:(fofType->Prop)) (Psi:(fofType->Prop))=> (mnot ((mequiv Phi) Psi))):((fofType->Prop)->((fofType->Prop)->(fofType->Prop))).
% Definition mdia:=(fun (R:(fofType->(fofType->Prop))) (Phi:(fofType->Prop))=> (mnot ((mbox R) (mnot Phi)))):((fofType->(fofType->Prop))->((fofType->Prop)->(fofType->Prop))).
% Parameter exists_in_world:(mu->(fofType->Prop)).
% Axiom nonempty_ax:(forall (V:fofType), ((ex mu) (fun (X:mu)=> ((exists_in_world X) V)))).
% Definition mforall_ind:=(fun (Phi:(mu->(fofType->Prop))) (W:fofType)=> (forall (X:mu), (((exists_in_world X) W)->((Phi X) W)))):((mu->(fofType->Prop))->(fofType->Prop)).
% Definition mexists_ind:=(fun (Phi:(mu->(fofType->Prop)))=> (mnot (mforall_ind (fun (X:mu)=> (mnot (Phi X)))))):((mu->(fofType->Prop))->(fofType->Prop)).
% Definition mexists_prop:=(fun (Phi:((fofType->Prop)->(fofType->Prop)))=> (mnot (mforall_prop (fun (P:(fofType->Prop))=> (mnot (Phi P)))))):(((fofType->Prop)->(fofType->Prop))->(fofType->Prop)).
% Definition mreflexive:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((R S) S))):((fofType->(fofType->Prop))->Prop).
% Definition msymmetric:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (((R S) T)->((R T) S)))):((fofType->(fofType->Prop))->Prop).
% Definition mserial:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((R S) T))))):((fofType->(fofType->Prop))->Prop).
% Definition mtransitive:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R T) U))->((R S) U)))):((fofType->(fofType->Prop))->Prop).
% Definition meuclidean:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((R T) U)))):((fofType->(fofType->Prop))->Prop).
% Definition mpartially_functional:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->(((eq fofType) T) U)))):((fofType->(fofType->Prop))->Prop).
% Definition mfunctional:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType), ((ex fofType) (fun (T:fofType)=> ((and ((R S) T)) (forall (U:fofType), (((R S) U)->(((eq fofType) T) U)))))))):((fofType->(fofType->Prop))->Prop).
% Definition mweakly_dense:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType), (fofType->(((R S) T)->((ex fofType) (fun (U:fofType)=> ((and ((R S) U)) ((R U) T)))))))):((fofType->(fofType->Prop))->Prop).
% Definition mweakly_connected:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((or ((or ((R T) U)) (((eq fofType) T) U))) ((R U) T))))):((fofType->(fofType->Prop))->Prop).
% Definition mweakly_directed:=(fun (R:(fofType->(fofType->Prop)))=> (forall (S:fofType) (T:fofType) (U:fofType), (((and ((R S) T)) ((R S) U))->((ex fofType) (fun (V:fofType)=> ((and ((R T) V)) ((R U) V))))))):((fofType->(fofType->Prop))->Prop).
% Definition mvalid:=(fun (Phi:(fofType->Prop))=> (forall (W:fofType), (Phi W))):((fofType->Prop)->Prop).
% Definition msatisfiable:=(fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> (Phi W)))):((fofType->Prop)->Prop).
% Definition mcountersatisfiable:=(fun (Phi:(fofType->Prop))=> ((ex fofType) (fun (W:fofType)=> ((Phi W)->False)))):((fofType->Prop)->Prop).
% Definition minvalid:=(fun (Phi:(fofType->Prop))=> (forall (W:fofType), ((Phi W)->False))):((fofType->Prop)->Prop).
% Parameter rel_s4:(fofType->(fofType->Prop)).
% Definition mbox_s4:=(fun (Phi:(fofType->Prop)) (W:fofType)=> (forall (V:fofType), ((or (((rel_s4 W) V)->False)) (Phi V)))):((fofType->Prop)->(fofType->Prop)).
% Definition mdia_s4:=(fun (Phi:(fofType->Prop))=> (mnot (mbox_s4 (mnot Phi)))):((fofType->Prop)->(fofType->Prop)).
% Axiom a1:(mreflexive rel_s4).
% Axiom a2:(mtransitive rel_s4).
% Axiom cumulative_ax:(forall (X:mu) (V:fofType) (W:fofType), (((and ((exists_in_world X) V)) ((rel_s4 V) W))->((exists_in_world X) W))).
% Parameter inductive:(mu->(fofType->Prop)).
% Parameter subclass:(mu->(mu->(fofType->Prop))).
% Parameter disjoint:(mu->(mu->(fofType->Prop))).
% Parameter function:(mu->(fofType->Prop)).
% Parameter member:(mu->(mu->(fofType->Prop))).
% Parameter unordered_pair:(mu->(mu->mu)).
% Axiom existence_of_unordered_pair_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((unordered_pair V2) V1)) V)).
% Parameter second:(mu->mu).
% Axiom existence_of_second_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (second V1)) V)).
% Parameter first:(mu->mu).
% Axiom existence_of_first_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (first V1)) V)).
% Parameter element_relation:mu.
% Axiom existence_of_element_relation_ax:(forall (V:fofType), ((exists_in_world element_relation) V)).
% Parameter complement:(mu->mu).
% Axiom existence_of_complement_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (complement V1)) V)).
% Parameter intersection:(mu->(mu->mu)).
% Axiom existence_of_intersection_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((intersection V2) V1)) V)).
% Parameter rotate:(mu->mu).
% Axiom existence_of_rotate_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (rotate V1)) V)).
% Parameter union:(mu->(mu->mu)).
% Axiom existence_of_union_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((union V2) V1)) V)).
% Parameter successor:(mu->mu).
% Axiom existence_of_successor_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (successor V1)) V)).
% Parameter flip:(mu->mu).
% Axiom existence_of_flip_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (flip V1)) V)).
% Parameter domain_of:(mu->mu).
% Axiom existence_of_domain_of_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (domain_of V1)) V)).
% Parameter restrict:(mu->(mu->(mu->mu))).
% Axiom existence_of_restrict_ax:(forall (V:fofType) (V3:mu) (V2:mu) (V1:mu), ((exists_in_world (((restrict V3) V2) V1)) V)).
% Parameter range_of:(mu->mu).
% Axiom existence_of_range_of_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (range_of V1)) V)).
% Parameter successor_relation:mu.
% Axiom existence_of_successor_relation_ax:(forall (V:fofType), ((exists_in_world successor_relation) V)).
% Parameter power_class:(mu->mu).
% Axiom existence_of_power_class_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (power_class V1)) V)).
% Parameter identity_relation:mu.
% Axiom existence_of_identity_relation_ax:(forall (V:fofType), ((exists_in_world identity_relation) V)).
% Parameter inverse:(mu->mu).
% Axiom existence_of_inverse_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (inverse V1)) V)).
% Parameter compose:(mu->(mu->mu)).
% Axiom existence_of_compose_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((compose V2) V1)) V)).
% Parameter cross_product:(mu->(mu->mu)).
% Axiom existence_of_cross_product_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((cross_product V2) V1)) V)).
% Parameter singleton:(mu->mu).
% Axiom existence_of_singleton_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (singleton V1)) V)).
% Parameter image:(mu->(mu->mu)).
% Axiom existence_of_image_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((image V2) V1)) V)).
% Parameter sum_class:(mu->mu).
% Axiom existence_of_sum_class_ax:(forall (V:fofType) (V1:mu), ((exists_in_world (sum_class V1)) V)).
% Parameter apply:(mu->(mu->mu)).
% Axiom existence_of_apply_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((apply V2) V1)) V)).
% Parameter null_class:mu.
% Axiom existence_of_null_class_ax:(forall (V:fofType), ((exists_in_world null_class) V)).
% Parameter universal_class:mu.
% Axiom existence_of_universal_class_ax:(forall (V:fofType), ((exists_in_world universal_class) V)).
% Parameter ordered_pair:(mu->(mu->mu)).
% Axiom existence_of_ordered_pair_ax:(forall (V:fofType) (V2:mu) (V1:mu), ((exists_in_world ((ordered_pair V2) V1)) V)).
% Axiom reflexivity:(mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq X) X)))).
% Axiom symmetry:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mimplies ((qmltpeq X) Y)) ((qmltpeq Y) X))))))).
% Axiom transitivity:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((mand ((qmltpeq X) Y)) ((qmltpeq Y) Z))) ((qmltpeq X) Z))))))))).
% Axiom apply_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((apply A) C)) ((apply B) C)))))))))).
% Axiom apply_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((apply C) A)) ((apply C) B)))))))))).
% Axiom complement_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (complement A)) (complement B)))))))).
% Axiom compose_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((compose A) C)) ((compose B) C)))))))))).
% Axiom compose_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((compose C) A)) ((compose C) B)))))))))).
% Axiom cross_product_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((cross_product A) C)) ((cross_product B) C)))))))))).
% Axiom cross_product_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((cross_product C) A)) ((cross_product C) B)))))))))).
% Axiom domain_of_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (domain_of A)) (domain_of B)))))))).
% Axiom first_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (first A)) (first B)))))))).
% Axiom flip_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (flip A)) (flip B)))))))).
% Axiom image_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((image A) C)) ((image B) C)))))))))).
% Axiom image_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((image C) A)) ((image C) B)))))))))).
% Axiom intersection_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((intersection A) C)) ((intersection B) C)))))))))).
% Axiom intersection_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((intersection C) A)) ((intersection C) B)))))))))).
% Axiom inverse_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (inverse A)) (inverse B)))))))).
% Axiom ordered_pair_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((ordered_pair A) C)) ((ordered_pair B) C)))))))))).
% Axiom ordered_pair_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((ordered_pair C) A)) ((ordered_pair C) B)))))))))).
% Axiom power_class_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (power_class A)) (power_class B)))))))).
% Axiom range_of_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (range_of A)) (range_of B)))))))).
% Axiom restrict_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict A) C) D)) (((restrict B) C) D)))))))))))).
% Axiom restrict_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict C) A) D)) (((restrict C) B) D)))))))))))).
% Axiom restrict_substitution_3:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> (mforall_ind (fun (D:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (((restrict C) D) A)) (((restrict C) D) B)))))))))))).
% Axiom rotate_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (rotate A)) (rotate B)))))))).
% Axiom second_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (second A)) (second B)))))))).
% Axiom singleton_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (singleton A)) (singleton B)))))))).
% Axiom successor_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (successor A)) (successor B)))))))).
% Axiom sum_class_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq (sum_class A)) (sum_class B)))))))).
% Axiom union_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((union A) C)) ((union B) C)))))))))).
% Axiom union_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((union C) A)) ((union C) B)))))))))).
% Axiom unordered_pair_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((unordered_pair A) C)) ((unordered_pair B) C)))))))))).
% Axiom unordered_pair_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((qmltpeq A) B)) ((qmltpeq ((unordered_pair C) A)) ((unordered_pair C) B)))))))))).
% Axiom disjoint_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((disjoint A) C))) ((disjoint B) C))))))))).
% Axiom disjoint_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((disjoint C) A))) ((disjoint C) B))))))))).
% Axiom function_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((mand ((qmltpeq A) B)) (function A))) (function B))))))).
% Axiom inductive_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> ((mimplies ((mand ((qmltpeq A) B)) (inductive A))) (inductive B))))))).
% Axiom member_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((member A) C))) ((member B) C))))))))).
% Axiom member_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((member C) A))) ((member C) B))))))))).
% Axiom subclass_substitution_1:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((subclass A) C))) ((subclass B) C))))))))).
% Axiom subclass_substitution_2:(mvalid (mforall_ind (fun (A:mu)=> (mforall_ind (fun (B:mu)=> (mforall_ind (fun (C:mu)=> ((mimplies ((mand ((qmltpeq A) B)) ((subclass C) A))) ((subclass C) B))))))))).
% Axiom subclass_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((subclass X) Y)) (mforall_ind (fun (U:mu)=> ((mimplies ((member U) X)) ((member U) Y)))))))))).
% Axiom class_elements_are_sets:(mvalid (mforall_ind (fun (X:mu)=> ((subclass X) universal_class)))).
% Axiom extensionality:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((qmltpeq X) Y)) ((mand ((subclass X) Y)) ((subclass Y) X)))))))).
% Axiom unordered_pair_defn:(mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member U) ((unordered_pair X) Y))) ((mand ((member U) universal_class)) ((mor ((qmltpeq U) X)) ((qmltpeq U) Y))))))))))).
% Axiom unordered_pair_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((member ((unordered_pair X) Y)) universal_class)))))).
% Axiom singleton_set_defn:(mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq (singleton X)) ((unordered_pair X) X))))).
% Axiom ordered_pair_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq ((ordered_pair X) Y)) ((unordered_pair (singleton X)) ((unordered_pair X) (singleton Y))))))))).
% Axiom cross_product_defn:(mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair U) V)) ((cross_product X) Y))) ((mand ((member U) X)) ((member V) Y)))))))))))).
% Axiom cross_product_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((member Z) ((cross_product X) Y))) ((qmltpeq Z) ((ordered_pair (first Z)) (second Z))))))))))).
% Axiom element_relation_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair X) Y)) element_relation)) ((mand ((member Y) universal_class)) ((member X) Y)))))))).
% Axiom element_relation_TPTP_next:(mvalid ((subclass element_relation) ((cross_product universal_class) universal_class))).
% Axiom intersection_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) ((intersection X) Y))) ((mand ((member Z) X)) ((member Z) Y)))))))))).
% Axiom complement_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) (complement X))) ((mand ((member Z) universal_class)) (mnot ((member Z) X))))))))).
% Axiom restrict_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq (((restrict XR) X) Y)) ((intersection XR) ((cross_product X) Y)))))))))).
% Axiom null_class_defn:(mvalid (mforall_ind (fun (X:mu)=> (mnot ((member X) null_class))))).
% Axiom domain_of_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) (domain_of X))) ((mand ((member Z) universal_class)) (mnot ((qmltpeq (((restrict X) (singleton Z)) universal_class)) null_class))))))))).
% Axiom rotate_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (W:mu)=> ((mequiv ((member ((ordered_pair ((ordered_pair U) V)) W)) (rotate X))) ((mand ((member ((ordered_pair ((ordered_pair U) V)) W)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))) ((member ((ordered_pair ((ordered_pair V) W)) U)) X)))))))))))).
% Axiom rotate_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> ((subclass (rotate X)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))))).
% Axiom flip_defn:(mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> (mforall_ind (fun (W:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member ((ordered_pair ((ordered_pair U) V)) W)) (flip X))) ((mand ((member ((ordered_pair ((ordered_pair U) V)) W)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))) ((member ((ordered_pair ((ordered_pair V) U)) W)) X)))))))))))).
% Axiom flip_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> ((subclass (flip X)) ((cross_product ((cross_product universal_class) universal_class)) universal_class))))).
% Axiom union_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mequiv ((member Z) ((union X) Y))) ((mor ((member Z) X)) ((member Z) Y)))))))))).
% Axiom successor_defn:(mvalid (mforall_ind (fun (X:mu)=> ((qmltpeq (successor X)) ((union X) (singleton X)))))).
% Axiom successor_relation_defn1:(mvalid ((subclass successor_relation) ((cross_product universal_class) universal_class))).
% Axiom successor_relation_defn2:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((member ((ordered_pair X) Y)) successor_relation)) ((mand ((member X) universal_class)) ((mand ((member Y) universal_class)) ((qmltpeq (successor X)) Y))))))))).
% Axiom inverse_defn:(mvalid (mforall_ind (fun (Y:mu)=> ((qmltpeq (inverse Y)) (domain_of (flip ((cross_product Y) universal_class))))))).
% Axiom range_of_defn:(mvalid (mforall_ind (fun (Z:mu)=> ((qmltpeq (range_of Z)) (domain_of (inverse Z)))))).
% Axiom image_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XR:mu)=> ((qmltpeq ((image XR) X)) (range_of (((restrict XR) X) universal_class)))))))).
% Axiom inductive_defn:(mvalid (mforall_ind (fun (X:mu)=> ((mequiv (inductive X)) ((mand ((member null_class) X)) ((subclass ((image successor_relation) X)) X)))))).
% Axiom infinity:(mvalid (mexists_ind (fun (X:mu)=> ((mand ((member X) universal_class)) ((mand (inductive X)) (mforall_ind (fun (Y:mu)=> ((mimplies (inductive Y)) ((subclass X) Y))))))))).
% Axiom sum_class_defn:(mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member U) (sum_class X))) (mexists_ind (fun (Y:mu)=> ((mand ((member U) Y)) ((member Y) X)))))))))).
% Axiom sum_class_TPTP_next:(mvalid (mforall_ind (fun (X:mu)=> ((mimplies ((member X) universal_class)) ((member (sum_class X)) universal_class))))).
% Axiom power_class_defn:(mvalid (mforall_ind (fun (U:mu)=> (mforall_ind (fun (X:mu)=> ((mequiv ((member U) (power_class X))) ((mand ((member U) universal_class)) ((subclass U) X)))))))).
% Axiom power_class_TPTP_next:(mvalid (mforall_ind (fun (U:mu)=> ((mimplies ((member U) universal_class)) ((member (power_class U)) universal_class))))).
% Axiom compose_defn1:(mvalid (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (YR:mu)=> ((subclass ((compose YR) XR)) ((cross_product universal_class) universal_class))))))).
% Axiom compose_defn2:(mvalid (mforall_ind (fun (XR:mu)=> (mforall_ind (fun (YR:mu)=> (mforall_ind (fun (U:mu)=> (mforall_ind (fun (V:mu)=> ((mequiv ((member ((ordered_pair U) V)) ((compose YR) XR))) ((mand ((member U) universal_class)) ((member V) ((image YR) ((image YR) (singleton U))))))))))))))).
% Axiom function_defn:(mvalid (mforall_ind (fun (XF:mu)=> ((mequiv (function XF)) ((mand ((subclass XF) ((cross_product universal_class) universal_class))) ((subclass ((compose XF) (inverse XF))) identity_relation)))))).
% Axiom replacement:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (XF:mu)=> ((mimplies ((mand ((member X) universal_class)) (function XF))) ((member ((image XF) X)) universal_class))))))).
% Axiom disjoint_defn:(mvalid (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> ((mequiv ((disjoint X) Y)) (mforall_ind (fun (U:mu)=> (mnot ((mand ((member U) X)) ((member U) Y))))))))))).
% Axiom regularity:(mvalid (mforall_ind (fun (X:mu)=> ((mimplies (mnot ((qmltpeq X) null_class))) (mexists_ind (fun (U:mu)=> ((mand ((member U) universal_class)) ((mand ((member U) X)) ((disjoint U) X))))))))).
% Axiom apply_defn:(mvalid (mforall_ind (fun (XF:mu)=> (mforall_ind (fun (Y:mu)=> ((qmltpeq ((apply XF) Y)) (sum_class ((image XF) (singleton Y))))))))).
% Axiom choice_TPTP_next:(mvalid (mexists_ind (fun (XF:mu)=> ((mand (function XF)) (mforall_ind (fun (Y:mu)=> ((mimplies ((member Y) universal_class)) ((mor ((qmltpeq Y) null_class)) ((member ((apply XF) Y)) Y))))))))).
% Trying to prove (mvalid (mforall_ind (fun (W:mu)=> (mforall_ind (fun (X:mu)=> (mforall_ind (fun (Y:mu)=> (mforall_ind (fun (Z:mu)=> ((mimplies ((mand ((qmltpeq ((ordered_pair W) X)) ((ordered_pair Y) Z))) ((member X) universal_class))) ((qmltpeq X) Z)))))))))))
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x0:((exists_in_world X0) W)
% Found x0 as proof of ((exists_in_world X0) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x2:((exists_in_world X1) W)
% Found x2 as proof of ((exists_in_world X1) W)
% Found x1:((exists_in_world X01) W)
% Found x1 as proof of ((exists_in_world X01) W)
% Found x:((exists_in_world X) W)
% Found x as proof of ((exists_in_world X) W)
% Found x:((exists_in_world X) W)
% Found x as pr
% EOF
%------------------------------------------------------------------------------