%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU472^1 : TPTP v6.1.0. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n098.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:32:16 EDT 2014 % Result : Theorem 3.70s % Output : Proof 3.70s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU472^1 : TPTP v6.1.0. Released v3.6.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n098.star.cs.uiowa.edu % % Model : x86_64 x86_64 % % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz % % Memory : 32286.75MB % % OS : Linux 2.6.32-431.20.3.el6.x86_64 % % CPULimit : 300 % % DateTime : Thu Jul 17 10:18:51 CDT 2014 % % CPUTime : 3.70 % 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/SET009^0.ax, trying next directory % FOF formula (<kernel.Constant object at 0xf62128>, <kernel.DependentProduct object at 0xe388c0>) of role type named subrel_type % Using role type % Declaring subrel:((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop)) % FOF formula (((eq ((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop))) subrel) (fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y))))) of role definition named subrel % A new definition: (((eq ((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop))) subrel) (fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y))))) % Defined: subrel:=(fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y)))) % FOF formula (<kernel.Constant object at 0xf62560>, <kernel.DependentProduct object at 0xf62320>) of role type named inv_type % Using role type % Declaring inv:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) inv) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X))) of role definition named inverse % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) inv) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X))) % Defined: inv:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X)) % FOF formula (<kernel.Constant object at 0xf62560>, <kernel.DependentProduct object at 0xf81200>) of role type named idem_type % Using role type % Declaring idem:(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop) % FOF formula (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) idem) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R))))) of role definition named idempotent % A new definition: (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) idem) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R))))) % Defined: idem:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R)))) % FOF formula (<kernel.Constant object at 0xf81908>, <kernel.DependentProduct object at 0xf81680>) of role type named infl_type % Using role type % Declaring infl:(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop) % FOF formula (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) infl) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R))))) of role definition named inflationary % A new definition: (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) infl) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R))))) % Defined: infl:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R)))) % FOF formula (<kernel.Constant object at 0xf81200>, <kernel.DependentProduct object at 0xf81cb0>) of role type named mono_type % Using role type % Declaring mono:(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop) % FOF formula (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) mono) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S)))))) of role definition named monotonic % A new definition: (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) mono) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S)))))) % Defined: mono:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S))))) % FOF formula (<kernel.Constant object at 0xf81200>, <kernel.DependentProduct object at 0xf81998>) of role type named refl_type % Using role type % Declaring refl:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) refl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X)))) of role definition named reflexive % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) refl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X)))) % Defined: refl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X))) % FOF formula (<kernel.Constant object at 0xf818c0>, <kernel.DependentProduct object at 0xf81b00>) of role type named irrefl_type % Using role type % Declaring irrefl:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) irrefl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False)))) of role definition named irreflexive % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) irrefl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False)))) % Defined: irrefl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False))) % FOF formula (<kernel.Constant object at 0xf81200>, <kernel.DependentProduct object at 0xf81320>) of role type named rc_type % Using role type % Declaring rc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) rc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y)))) of role definition named reflexive_closure % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) rc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y)))) % Defined: rc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y))) % FOF formula (<kernel.Constant object at 0xf81200>, <kernel.DependentProduct object at 0xf81560>) of role type named symm_type % Using role type % Declaring symm:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) symm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X))))) of role definition named symmetric % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) symm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X))))) % Defined: symm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X)))) % FOF formula (<kernel.Constant object at 0xba5a28>, <kernel.DependentProduct object at 0xba5d40>) of role type named antisymm_type % Using role type % Declaring antisymm:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) antisymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y))))) of role definition named antisymmetric % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) antisymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y))))) % Defined: antisymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y)))) % FOF formula (<kernel.Constant object at 0xba5ea8>, <kernel.DependentProduct object at 0xf81b90>) of role type named asymm_type % Using role type % Declaring asymm:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) asymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False))))) of role definition named asymmetric % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) asymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False))))) % Defined: asymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False)))) % FOF formula (<kernel.Constant object at 0xba5d40>, <kernel.DependentProduct object at 0xf81440>) of role type named sc_type % Using role type % Declaring sc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) sc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y)))) of role definition named symmetric_closure % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) sc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y)))) % Defined: sc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y))) % FOF formula (<kernel.Constant object at 0xf81c20>, <kernel.DependentProduct object at 0xf81a70>) of role type named trans_type % Using role type % Declaring trans:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) trans) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z))))) of role definition named transitive % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) trans) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z))))) % Defined: trans:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z)))) % FOF formula (<kernel.Constant object at 0xf81758>, <kernel.DependentProduct object at 0xf81050>) of role type named tc_type % Using role type % Declaring tc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) tc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y))))) of role definition named transitive_closure % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) tc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y))))) % Defined: tc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y)))) % FOF formula (<kernel.Constant object at 0xf81710>, <kernel.DependentProduct object at 0xb8a680>) of role type named trc_type % Using role type % Declaring trc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trc) (fun (R:(fofType->(fofType->Prop)))=> (rc (tc R)))) of role definition named transitive_reflexive_closure % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trc) (fun (R:(fofType->(fofType->Prop)))=> (rc (tc R)))) % Defined: trc:=(fun (R:(fofType->(fofType->Prop)))=> (rc (tc R))) % FOF formula (<kernel.Constant object at 0xb8a6c8>, <kernel.DependentProduct object at 0xb8a9e0>) of role type named trsc_type % Using role type % Declaring trsc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trsc) (fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R))))) of role definition named transitive_reflexive_symmetric_closure % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trsc) (fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R))))) % Defined: trsc:=(fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R)))) % FOF formula (<kernel.Constant object at 0xb8a6c8>, <kernel.DependentProduct object at 0xb8a710>) of role type named po_type % Using role type % Declaring po:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) po) (fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R)))) of role definition named partial_order % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) po) (fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R)))) % Defined: po:=(fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R))) % FOF formula (<kernel.Constant object at 0xb8a878>, <kernel.DependentProduct object at 0xb8a7e8>) of role type named so_type % Using role type % Declaring so:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) so) (fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R)))) of role definition named strict_order % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) so) (fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R)))) % Defined: so:=(fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R))) % FOF formula (<kernel.Constant object at 0xb8a710>, <kernel.DependentProduct object at 0xb8a908>) of role type named total_type % Using role type % Declaring total:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) total) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X))))) of role definition named total % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) total) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X))))) % Defined: total:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X)))) % FOF formula (<kernel.Constant object at 0xb8a908>, <kernel.DependentProduct object at 0xb8ab48>) of role type named term_type % Using role type % Declaring term:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False)))))))))) of role definition named terminating % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False)))))))))) % Defined: term:=(fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False))))))))) % FOF formula (<kernel.Constant object at 0xb8abd8>, <kernel.DependentProduct object at 0xb8acf8>) of role type named ind_type % Using role type % Declaring ind:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) ind) (fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X)))))) of role definition named satisfying_the_induction_principle % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) ind) (fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X)))))) % Defined: ind:=(fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X))))) % FOF formula (<kernel.Constant object at 0xb8a5f0>, <kernel.DependentProduct object at 0xb8abd8>) of role type named innf_type % Using role type % Declaring innf:((fofType->(fofType->Prop))->(fofType->Prop)) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->Prop))) innf) (fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False))) of role definition named in_normal_form % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->Prop))) innf) (fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False))) % Defined: innf:=(fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False)) % FOF formula (<kernel.Constant object at 0xb8acf8>, <kernel.DependentProduct object at 0xb8a6c8>) of role type named nfof_type % Using role type % Declaring nfof:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) nfof) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X)))) of role definition named normal_form_of % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) nfof) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X)))) % Defined: nfof:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X))) % FOF formula (<kernel.Constant object at 0xb8a5f0>, <kernel.DependentProduct object at 0xb8ad88>) of role type named norm_type % Using role type % Declaring norm:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) norm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X)))))) of role definition named normalizing % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) norm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X)))))) % Defined: norm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X))))) % FOF formula (<kernel.Constant object at 0xb8a5f0>, <kernel.DependentProduct object at 0xb8af80>) of role type named join_type % Using role type % Declaring join:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))) % FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) join) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z)))))) of role definition named joinable % A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) join) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z)))))) % Defined: join:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z))))) % FOF formula (<kernel.Constant object at 0xb8a950>, <kernel.DependentProduct object at 0xf6f3f8>) of role type named lconfl_type % Using role type % Declaring lconfl:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) lconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y))))) of role definition named locally_confluent % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) lconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y))))) % Defined: lconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y)))) % FOF formula (<kernel.Constant object at 0xb8a5f0>, <kernel.DependentProduct object at 0xf6f050>) of role type named sconfl_type % Using role type % Declaring sconfl:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) sconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))) of role definition named semi_confluent % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) sconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))) % Defined: sconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))) % FOF formula (<kernel.Constant object at 0xf6f3f8>, <kernel.DependentProduct object at 0xf6f440>) of role type named confl_type % Using role type % Declaring confl:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) confl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))) of role definition named confluent % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) confl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))) % Defined: confl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))) % FOF formula (<kernel.Constant object at 0xf6f050>, <kernel.DependentProduct object at 0xf6f320>) of role type named cr_type % Using role type % Declaring cr:((fofType->(fofType->Prop))->Prop) % FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) cr) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y))))) of role definition named church_rosser % A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) cr) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y))))) % Defined: cr:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y)))) % FOF formula (infl trsc) of role conjecture named transitive_reflexive_symmetric_closure_op_is_inflationary % Conjecture to prove = (infl trsc):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(infl trsc)'] % Parameter fofType:Type. % Definition subrel:=(fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y)))):((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop)). % Definition inv:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X)):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition idem:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R)))):(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop). % Definition infl:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R)))):(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop). % Definition mono:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S))))):(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop). % Definition refl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X))):((fofType->(fofType->Prop))->Prop). % Definition irrefl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False))):((fofType->(fofType->Prop))->Prop). % Definition rc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition symm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X)))):((fofType->(fofType->Prop))->Prop). % Definition antisymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y)))):((fofType->(fofType->Prop))->Prop). % Definition asymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False)))):((fofType->(fofType->Prop))->Prop). % Definition sc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition trans:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z)))):((fofType->(fofType->Prop))->Prop). % Definition tc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y)))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition trc:=(fun (R:(fofType->(fofType->Prop)))=> (rc (tc R))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition trsc:=(fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R)))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition po:=(fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R))):((fofType->(fofType->Prop))->Prop). % Definition so:=(fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R))):((fofType->(fofType->Prop))->Prop). % Definition total:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X)))):((fofType->(fofType->Prop))->Prop). % Definition term:=(fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False))))))))):((fofType->(fofType->Prop))->Prop). % Definition ind:=(fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X))))):((fofType->(fofType->Prop))->Prop). % Definition innf:=(fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False)):((fofType->(fofType->Prop))->(fofType->Prop)). % Definition nfof:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition norm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X))))):((fofType->(fofType->Prop))->Prop). % Definition join:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z))))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))). % Definition lconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y)))):((fofType->(fofType->Prop))->Prop). % Definition sconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))):((fofType->(fofType->Prop))->Prop). % Definition confl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))):((fofType->(fofType->Prop))->Prop). % Definition cr:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y)))):((fofType->(fofType->Prop))->Prop). % Trying to prove (infl trsc) % Found x2000:=(x200 x):((S X) Y) % Found (x200 x) as proof of ((S X) Y) % Found ((x20 Y) x) as proof of ((S X) Y) % Found (((x2 X) Y) x) as proof of ((S X) Y) % Found (fun (x2:((subrel R) S))=> (((x2 X) Y) x)) as proof of ((S X) Y) % Found (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)) as proof of (((subrel R) S)->((S X) Y)) % Found (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)) as proof of ((trans S)->(((subrel R) S)->((S X) Y))) % Found (and_rect00 (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))) as proof of ((S X) Y) % Found ((and_rect0 ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))) as proof of ((S X) Y) % Found (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))) as proof of ((S X) Y) % Found (fun (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)))) as proof of ((S X) Y) % Found (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)))) as proof of (((and (trans S)) ((subrel R) S))->((S X) Y)) % Found (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)))) as proof of (((tc R) X) Y) % Found (or_intror10 (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))) as proof of ((or (((eq fofType) X) Y)) (((tc R) X) Y)) % Found ((or_intror1 (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))) as proof of ((or (((eq fofType) X) Y)) (((tc R) X) Y)) % Found (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))) as proof of ((or (((eq fofType) X) Y)) (((tc R) X) Y)) % Found (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))) as proof of ((or (((eq fofType) X) Y)) (((tc R) X) Y)) % Found (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))) as proof of (((rc (tc R)) X) Y) % Found (or_intror00 (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)))))) as proof of ((or (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) % Found ((or_intror0 (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)))))) as proof of ((or (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) % Found (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)))))) as proof of ((or (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) % Found (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x)))))) as proof of ((or (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) % Found (fun (x:((R X) Y))=> (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))))) as proof of (((trsc R) X) Y) % Found (fun (Y:fofType) (x:((R X) Y))=> (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))))) as proof of (((R X) Y)->(((trsc R) X) Y)) % Found (fun (X:fofType) (Y:fofType) (x:((R X) Y))=> (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))))) as proof of (forall (Y:fofType), (((R X) Y)->(((trsc R) X) Y))) % Found (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType) (x:((R X) Y))=> (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))))) as proof of ((subrel R) (trsc R)) % Found (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType) (x:((R X) Y))=> (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))))) as proof of (infl trsc) % Got proof (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType) (x:((R X) Y))=> (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))))) % Time elapsed = 3.269888s % node=432 cost=2756.000000 depth=25 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType) (x:((R X) Y))=> (((or_intror (((rc (tc R)) Y) X)) (((rc (tc R)) X) Y)) (((or_intror (((eq fofType) X) Y)) (((tc R) X) Y)) (fun (S:(fofType->(fofType->Prop))) (x0:((and (trans S)) ((subrel R) S)))=> (((fun (P:Type) (x1:((trans S)->(((subrel R) S)->P)))=> (((((and_rect (trans S)) ((subrel R) S)) P) x1) x0)) ((S X) Y)) (fun (x1:(trans S)) (x2:((subrel R) S))=> (((x2 X) Y) x))))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------