branch for universe

[helm.git] / matita / tests / TPTP / Veloci / COL025-1.p.ma

diff --git a/matita/tests/TPTP/Veloci/COL025-1.p.ma b/matita/tests/TPTP/Veloci/COL025-1.p.ma
new file mode 100644 (file)
index 0000000..46b622e
--- /dev/null
+++ b/matita/tests/TPTP/Veloci/COL025-1.p.ma
@@ -0,0 +1,48 @@
+
+include "logic/equality.ma".
+(* Inclusion of: COL025-1.p *)
+(* -------------------------------------------------------------------------- *)
+(*  File     : COL025-1 : TPTP v3.1.1. Released v1.0.0. *)
+(*  Domain   : Combinatory Logic *)
+(*  Problem  : Weak fixed point for B and W *)
+(*  Version  : [WM88] (equality) axioms. *)
+(*  English  : The weak fixed point property holds for the set P consisting  *)
+(*             of the combinators B and W, where ((Bx)y)z = x(yz), (Wx)y  *)
+(*             = (xy)y. *)
+(*  Refs     : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi *)
+(*           : [MW87]  McCune & Wos (1987), A Case Study in Automated Theorem *)
+(*           : [WM88]  Wos & McCune (1988), Challenge Problems Focusing on Eq *)
+(*           : [MW88]  McCune & Wos (1988), Some Fixed Point Problems in Comb *)
+(*  Source   : [MW88] *)
+(*  Names    : stage1.in & stage2.in [OTTER] *)
+(*           : - [MW88] *)
+(*  Status   : Unsatisfiable *)
+(*  Rating   : 0.00 v2.0.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 (   3 constant; 0-2 arity) *)
+(*             Number of variables   :    6 (   0 singleton) *)
+(*             Maximal term depth    :    4 (   3 average) *)
+(*  Comments :  *)
+(* -------------------------------------------------------------------------- *)
+theorem prove_fixed_point:
+ \forall Univ:Set.
+\forall apply:\forall _:Univ.\forall _:Univ.Univ.
+\forall b:Univ.
+\forall combinator:Univ.
+\forall w:Univ.
+\forall H0:\forall X:Univ.\forall Y:Univ.eq Univ (apply (apply w X) Y) (apply (apply X Y) Y).
+\forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).\exist Y:Univ.eq Univ Y (apply combinator Y)
+.
+intros.
+exists[
+2:
+autobatch paramodulation timeout=100;
+try assumption.
+|
+skip]
+print proofterm.
+qed.
+(* -------------------------------------------------------------------------- *)