diff --git a/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java b/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java
index 2f426a463..fb3aa1abe 100644
--- a/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java
+++ b/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java
@@ -320,6 +320,7 @@ public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>>  {
 				System.out.print("");
 			if (variance == 1) {
 				a_next = oup.max(nextSetasList.iterator());
+				List<Set<UnifyPair>> liup = oup.sortedCopy(nextSetasList);
 			}
 			else if (variance == -1) {
 				a_next = oup.min(nextSetasList.iterator());
diff --git a/src/de/dhbwstuttgart/typeinference/unify/model/OrderingUnifyPair.java b/src/de/dhbwstuttgart/typeinference/unify/model/OrderingUnifyPair.java
index 0aa996831..55576bf0b 100644
--- a/src/de/dhbwstuttgart/typeinference/unify/model/OrderingUnifyPair.java
+++ b/src/de/dhbwstuttgart/typeinference/unify/model/OrderingUnifyPair.java
@@ -92,6 +92,9 @@ public class OrderingUnifyPair extends Ordering<Set<UnifyPair>> {
 				.collect(Collectors.toCollection(HashSet::new));
 		//System.out.println(left.toString());
 		//Fall 2 und 3
+		if (lefteq.iterator().next().getLhsType().getName().equals("AJO")) {
+			System.out.print("");
+		}
 		if (lefteq.size() == 1 && leftle.size() == 1  && righteq.size() == 0 && rightle.size() == 1) {
 			return 1;
 		}