X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Ftests%2FTPTP%2FVeloci%2FCOL084-1.p.ma;fp=matita%2Ftests%2FTPTP%2FVeloci%2FCOL084-1.p.ma;h=8813fc43b2b9ed53d46bd6fa9aaa7440e03dbb09;hp=0000000000000000000000000000000000000000;hb=f61af501fb4608cc4fb062a0864c774e677f0d76;hpb=58ae1809c352e71e7b5530dc41e2bfc834e1aef1

diff --git a/matita/tests/TPTP/Veloci/COL084-1.p.ma b/matita/tests/TPTP/Veloci/COL084-1.p.ma
new file mode 100644
index 000000000..8813fc43b
--- /dev/null
+++ b/matita/tests/TPTP/Veloci/COL084-1.p.ma
@@ -0,0 +1,46 @@
+
+include "logic/equality.ma".
+(* Inclusion of: COL084-1.p *)
+(* -------------------------------------------------------------------------- *)
+(*  File     : COL084-1 : TPTP v3.1.1. Released v2.6.0. *)
+(*  Domain   : Combinatory Logic *)
+(*  Problem  : Compatible Birds, part 2 *)
+(*  Version  : Especial. *)
+(*  English  :  *)
+(*  Refs     : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi *)
+(*  Source   : [TPTP] *)
+(*  Names    :  *)
+(*  Status   : Unsatisfiable *)
+(*  Rating   : 0.00 v2.6.0 *)
+(*  Syntax   : Number of clauses     :    3 (   0 non-Horn;   3 unit;   1 RR) *)
+(*             Number of atoms       :    3 (   3 equality) *)
+(*             Maximal clause size   :    1 (   1 average) *)
+(*             Number of predicates  :    1 (   0 propositional; 2-2 arity) *)
+(*             Number of functors    :    4 (   2 constant; 0-2 arity) *)
+(*             Number of variables   :    6 (   2 singleton) *)
+(*             Maximal term depth    :    3 (   2 average) *)
+(*  Comments : A UEQ part of COL054-1 *)
+(* -------------------------------------------------------------------------- *)
+theorem prove_birds_are_compatible_2:
+ \forall Univ:Set.
+\forall b:Univ.
+\forall compose:\forall _:Univ.\forall _:Univ.Univ.
+\forall mocking_bird:Univ.
+\forall response:\forall _:Univ.\forall _:Univ.Univ.
+\forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (response (compose A B) C) (response A (response B C)).
+\forall H1:\forall A:Univ.eq Univ (response mocking_bird A) (response A A).\exist A:Univ.\exist B:Univ.eq Univ (response b B) A
+.
+intros.
+exists[
+2:
+exists[
+2:
+autobatch paramodulation timeout=100;
+try assumption.
+|
+skip]
+|
+skip]
+print proofterm.
+qed.
+(* -------------------------------------------------------------------------- *)