X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FCOL019-1.ma;h=d587e774fd26465ac88d514e17a4ce9f7b90c98a;hb=02e8b3eb9d2a8a3bb3942c41b47b6ac048efd5be;hp=1ea3c6a4873b0ac36923601d42e61b15ebf02164;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git diff --git a/helm/software/matita/contribs/ng_TPTP/COL019-1.ma b/helm/software/matita/contribs/ng_TPTP/COL019-1.ma index 1ea3c6a48..d587e774f 100644 --- a/helm/software/matita/contribs/ng_TPTP/COL019-1.ma +++ b/helm/software/matita/contribs/ng_TPTP/COL019-1.ma @@ -4,7 +4,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : COL019-1 : TPTP v3.2.0. Released v1.0.0. *) +(* File : COL019-1 : TPTP v3.7.0. Released v1.0.0. *) (* Domain : Combinatory Logic *) @@ -32,7 +32,7 @@ include "logic/equality.ma". (* Status : Unsatisfiable *) -(* Rating : 0.00 v2.1.0, 0.13 v2.0.0 *) +(* Rating : 0.11 v3.4.0, 0.12 v3.3.0, 0.00 v2.1.0, 0.13 v2.0.0 *) (* Syntax : Number of clauses : 4 ( 0 non-Horn; 4 unit; 1 RR) *) @@ -52,7 +52,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) ntheorem prove_fixed_point: - ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. + (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. ∀apply:∀_:Univ.∀_:Univ.Univ. ∀b:Univ. ∀combinator:Univ. @@ -60,25 +60,25 @@ ntheorem prove_fixed_point: ∀t:Univ. ∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply t X) Y) (apply Y X). ∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)). -∀H2:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply s X) Y) Z) (apply (apply X Z) (apply Y Z)).∃Y:Univ.eq Univ Y (apply combinator Y) +∀H2:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply s X) Y) Z) (apply (apply X Z) (apply Y Z)).∃Y:Univ.eq Univ Y (apply combinator Y)) . -#Univ. -#X. -#Y. -#Z. -#apply. -#b. -#combinator. -#s. -#t. -#H0. -#H1. -#H2. -napply ex_intro[ -nid2: -nauto by H0,H1,H2; -nid| -skip] +#Univ ##. +#X ##. +#Y ##. +#Z ##. +#apply ##. +#b ##. +#combinator ##. +#s ##. +#t ##. +#H0 ##. +#H1 ##. +#H2 ##. +napply (ex_intro ? ? ? ?) ##[ +##2: +nauto by H0,H1,H2 ##; +##| ##skip ##] +ntry (nassumption) ##; nqed. (* -------------------------------------------------------------------------- *)