[Updated tests/*.out files to reflect the behaviour of the new branch-and-bound algorithm
tobias@goedderz.info**20150311112654
 Ignore-this: 1a8381ae0fc08ddd9c906e2fa0783929
] 
<
[Re-use partially evaluated lggs to safe some runtime
tobias@goedderz.info**20150304155112
 Ignore-this: 517e0b8416e5450ec6d3181b840de85d
] 
[Added a separate branch-and-bound implementation and used it in bestMatchings
tobias@goedderz.info**20150309155256
 Ignore-this: a6bbb4ba0ba9b82cf6295892e837e2d1
] 
> hunk ./tests/ack.out 28
-             ack          in 245     loops
+             ack          in 257     loops
hunk ./tests/ack.out 33
-ack a0 (Z) = S a0
-ack (Z) (S a0) = S (S a0)
-ack (S a0) (S a1) = ack (fun654 (S a0) (S a1)) (fun655 (S a0) (S a1))
-fun654 (S a0) (S _) = a0
-fun655 (S a0) (S a1) = ack (fun738 (S a0) (S a1)) (fun739 (S a0) (S a1))
-fun738 (S a0) (S _) = S a0
-fun739 (S _) (S a1) = a1
+ack (Z) a0 = S a0
+ack (S a0) a1 = ack (fun4 (S a0) a1) (fun5 (S a0) a1)
+fun4 (S a0) _ = a0
+fun5 (S _) (Z) = S Z
+fun5 (S a0) (S a1) = ack (fun834 (S a0) (S a1)) (fun835 (S a0) (S a1))
+fun834 (S a0) (S _) = S a0
+fun835 (S _) (S a1) = a1
hunk ./tests/add.out 35
-add (S a0) (S a1) = S (S (add a1 a0))
+add (S a0) (S a1) = S (S (add a0 a1))
hunk ./tests/add.out 43
-add (S a0) (S a1) = S (S (add a0 a1))
+add (S a0) (S a1) = S (S (add a1 a0))
hunk ./tests/add.out 51
-add (S a0) (S a1) = S (S (add a1 a0))
+add (S a0) (S a1) = S (S (add a0 a1))
hunk ./tests/add.out 59
-add (S a0) (S a1) = S (S (add a0 a1))
+add (S a0) (S a1) = S (S (add a1 a0))
hunk ./tests/droP.out 34
-droP (S a0) a1 = droP (fun5 (S a0) a1) (fun6 (S a0) a1)
-fun5 (S a0) _ = a0
-fun6 (S _) [] = []
-fun6 (S _) (_ : a2) = a2
+droP (S a0) a1 = droP (fun13 (S a0) a1) (fun14 (S a0) a1)
+fun13 (S a0) _ = a0
+fun14 (S _) [] = []
+fun14 (S _) (_ : a2) = a2
hunk ./tests/eq.out 36
-eq (S a0) (S a1) = eq a0 a1
+eq (S a0) (S a1) = eq a1 a0
hunk ./tests/eq.out 45
-eq (S a0) (S a1) = eq a1 a0
+eq (S a0) (S a1) = eq a0 a1
hunk ./tests/fib.out 28
-             fib          in 95     loops
+             fib          in 94     loops
hunk ./tests/fib.out 37
-fun1 (S (S (S a0))) = S (fib (fun8 (S (S (S a0)))))
-fun8 (S (S (S (Z)))) = Z
-fun8 (S (S (S (S a0)))) = S (S (fun8 (S (S (S a0)))))
+fun1 (S (S (S a0))) = S (fib (fun7 (S (S (S a0)))))
+fun7 (S (S (S (Z)))) = Z
+fun7 (S (S (S (S a0)))) = S (S (fun7 (S (S (S a0)))))
hunk ./tests/member.out 28
-             member       in 12409     loops
+             member       in 11865     loops
hunk ./tests/oddpos.out 34
-oddpos (a0 : a1) = a0 : oddpos (fun4 (a0 : a1))
-fun4 [_] = []
-fun4 (_ : (_ : a2)) = a2
+oddpos (a0 : a1) = a0 : oddpos (fun7 (a0 : a1))
+fun7 [_] = []
+fun7 (_ : (_ : a2)) = a2
hunk ./tests/weave.out 28
-             weave        in 3562     loops
+             weave        in 3340     loops
hunk ./tests/weave.out 35
-weave (a0 : (a1 : a2)) a3 = a0 : fun13922 (a0 : (a1 : a2)) a3
-fun13922 (a0 : (a1 : a2)) a3 = weave (fun14070 (a0 : (a1 : a2)) a3) (fun14071 (a0 : (a1 : a2)) a3)
-fun14070 (_ : (_ : _)) a3 = a3
-fun14071 (_ : (a1 : a2)) _ = a1 : a2
+weave (a0 : (a1 : a2)) a3 = a0 : fun12874 (a0 : (a1 : a2)) a3
+fun12874 (a0 : (a1 : a2)) a3 = weave (fun12884 (a0 : (a1 : a2)) a3) (fun12885 (a0 : (a1 : a2)) a3)
+fun12884 (_ : (_ : _)) a3 = a3
+fun12885 (_ : (a1 : a2)) _ = a1 : a2