aboutsummaryrefslogtreecommitdiff
path: root/test-suite
diff options
context:
space:
mode:
authorletouzey2011-05-16 15:50:18 +0000
committerletouzey2011-05-16 15:50:18 +0000
commite6fd0c0a5937940ca368882aa65c52733a8f1ebd (patch)
treec0f73c44f715141d38da84f5ab9a69e27bc8f7d3 /test-suite
parentbefdbea90f91f85482c14a78120cf94b5bb0b5ea (diff)
Fix order in Search tests.
Signed-off-by: Tom Prince <tom.prince@ualberta.net> git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@14127 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'test-suite')
-rw-r--r--test-suite/output/Search.out2
-rw-r--r--test-suite/output/SearchPattern.out6
2 files changed, 4 insertions, 4 deletions
diff --git a/test-suite/output/Search.out b/test-suite/output/Search.out
index 9bce8db4df..fd484cdc5b 100644
--- a/test-suite/output/Search.out
+++ b/test-suite/output/Search.out
@@ -4,13 +4,13 @@ le_pred: forall n m : nat, n <= m -> pred n <= pred m
le_S_n: forall n m : nat, S n <= S m -> n <= m
false: bool
true: bool
+xorb: bool -> bool -> bool
sumor_beq:
forall (A : Type) (B : Prop),
(A -> A -> bool) -> (B -> B -> bool) -> A + {B} -> A + {B} -> bool
sumbool_beq:
forall A B : Prop,
(A -> A -> bool) -> (B -> B -> bool) -> {A} + {B} -> {A} + {B} -> bool
-xorb: bool -> bool -> bool
sum_beq:
forall A B : Type,
(A -> A -> bool) -> (B -> B -> bool) -> A + B -> A + B -> bool
diff --git a/test-suite/output/SearchPattern.out b/test-suite/output/SearchPattern.out
index 4710de3dc1..410f13dd8b 100644
--- a/test-suite/output/SearchPattern.out
+++ b/test-suite/output/SearchPattern.out
@@ -1,12 +1,12 @@
false: bool
true: bool
+xorb: bool -> bool -> bool
sumor_beq:
forall (A : Type) (B : Prop),
(A -> A -> bool) -> (B -> B -> bool) -> A + {B} -> A + {B} -> bool
sumbool_beq:
forall A B : Prop,
(A -> A -> bool) -> (B -> B -> bool) -> {A} + {B} -> {A} + {B} -> bool
-xorb: bool -> bool -> bool
sum_beq:
forall A B : Type,
(A -> A -> bool) -> (B -> B -> bool) -> A + B -> A + B -> bool
@@ -40,8 +40,8 @@ min: nat -> nat -> nat
max: nat -> nat -> nat
mult_n_Sm: forall n m : nat, n * m + n = n * S m
le_n: forall n : nat, n <= n
-eq_refl: forall (A : Type) (x : A), x = x
identity_refl: forall (A : Type) (a : A), identity a a
+eq_refl: forall (A : Type) (x : A), x = x
iff_refl: forall A : Prop, A <-> A
-conj: forall A B : Prop, A -> B -> A /\ B
pair: forall A B : Type, A -> B -> A * B
+conj: forall A B : Prop, A -> B -> A /\ B