freescale porting

[helm.git] / helm / software / matita / contribs / ng_TPTP / COL056-1.ma

diff --git a/helm/software/matita/contribs/ng_TPTP/COL056-1.ma b/helm/software/matita/contribs/ng_TPTP/COL056-1.ma
index fc787c7db3d1fa5b025ea7bf9df5123d9245957c..8ec2072506431fdadb0f6c0dbee769524ff9e5c2 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/COL056-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/COL056-1.ma
@@ -4,7 +4,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : COL056-1 : TPTP v3.2.0. Released v1.0.0. *)
+(*  File     : COL056-1 : TPTP v3.7.0. Released v1.0.0. *)
 
 (*  Domain   : Combinatory Logic *)
 
@@ -26,7 +26,7 @@ include "logic/equality.ma".
 
 (*  Status   : Unsatisfiable *)
 
-(*  Rating   : 0.07 v3.1.0, 0.00 v2.7.0, 0.09 v2.6.0, 0.17 v2.5.0, 0.00 v2.0.0 *)
+(*  Rating   : 0.11 v3.4.0, 0.12 v3.3.0, 0.07 v3.1.0, 0.00 v2.7.0, 0.09 v2.6.0, 0.17 v2.5.0, 0.00 v2.0.0 *)
 
 (*  Syntax   : Number of clauses     :    4 (   0 non-Horn;   4 unit;   3 RR) *)
 
@@ -70,7 +70,7 @@ include "logic/equality.ma".
 
 (* ----   (AB = C) and (AC = B) and -(wv = v). *)
 ntheorem prove_there_exists_a_happy_bird:
- ∀Univ:Type.∀V:Univ.∀W:Univ.∀X:Univ.∀Y:Univ.
+ (∀Univ:Type.∀V:Univ.∀W:Univ.∀X:Univ.∀Y:Univ.
 ∀a:Univ.
 ∀b:Univ.
 ∀c:Univ.
@@ -78,30 +78,29 @@ ntheorem prove_there_exists_a_happy_bird:
 ∀response:∀_:Univ.∀_:Univ.Univ.
 ∀H0:eq Univ (response a c) b.
 ∀H1:eq Univ (response a b) c.
-∀H2:∀W:Univ.∀X:Univ.∀Y:Univ.eq Univ (response (compose X Y) W) (response X (response Y W)).∃V:Univ.∃W:Univ.eq Univ (response W V) V
+∀H2:∀W:Univ.∀X:Univ.∀Y:Univ.eq Univ (response (compose X Y) W) (response X (response Y W)).∃V:Univ.∃W:Univ.eq Univ (response W V) V)
 .
-#Univ.
-#V.
-#W.
-#X.
-#Y.
-#a.
-#b.
-#c.
-#compose.
-#response.
-#H0.
-#H1.
-#H2.
-napply ex_intro[
-nid2:
-napply ex_intro[
-nid2:
-nauto by H0,H1,H2;
-nid|
-skip]
-nid|
-skip]
+#Univ ##.
+#V ##.
+#W ##.
+#X ##.
+#Y ##.
+#a ##.
+#b ##.
+#c ##.
+#compose ##.
+#response ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1,H2 ##;
+##| ##skip ##]
+##| ##skip ##]
+ntry (nassumption) ##;
 nqed.
 
 (* -------------------------------------------------------------------------- *)