[fix logic inversion in ListCata.mbFilter
Helmut Grohne <grohne@cs.uni-bonn.de>**20150218155226
 Ignore-this: a1e75b56d71c11f9d20700bc1be9a115
 
 mbFilter would (Data.List.)partition the io examples into those where the last
 argument is the rhs and where it shows up in the tail of a cons of the rhs. The
 code assumed that the former ones were the ones where the filter function would
 give True, but this is actually the case where an element is dropped. Running
 igor on the examples evens or zeros clearly shows this logic inversion.
] hunk ./src/Igor2/RuleDevelopment/ListCata.hs 84
-        (t@(_:_),f@(_:_)) -> 
-            let fio = nub (mkFIO False f) 
+        (f@(_:_), t@(_:_)) ->
+            let fio = nub (mkFIO False f)
hunk ./src/Igor2/RuleDevelopment/ListCata.hs 87
-            if  not (filterApplicable f fio tio) then Nothing
+            if  not (filterApplicable t fio tio) then Nothing
hunk ./src/Igor2/RuleDevelopment/ListCata.hs 115
-    lastArgIsOut r = (last $ lhs r) == (rhs r)
-    filterApplicable f fio tio = and [hasMapProperty (bc,f), null $ (on intersect (map lhs)) fio tio]
-    -- check filter property, i.e. mapProperty on those examples which are not 
+    lastArgIsOut r = last (lhs r) == rhs r
+    filterApplicable t fio tio = hasMapProperty (bc, t) && null (on intersect (map lhs) fio tio)
+    -- check filter property, i.e. mapProperty on those examples which are not