diff --git a/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java b/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java
index 8254caf1..c4d49693 100644
--- a/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java
+++ b/src/de/dhbwstuttgart/typeinference/unify/TypeUnifyTask.java
@@ -32,7 +32,9 @@ import de.dhbwstuttgart.typeinference.unify.model.UnifyType;
  * @author Florian Steurer
  */
 public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>> {
-	
+
+	private static final long serialVersionUID = 1L;
+
 	/**
 	 * The implementation of setOps that will be used during the unification
 	 */
@@ -163,8 +165,6 @@ public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>> {
 			/*
 			 * Step 6 a) Restart (fork) for pairs where subst was applied
 			 */
-			Set<TypeUnifyTask> restart = new HashSet<>();
-			
 			if (eqPrime.equals(eq))
 				eqPrimePrimeSet.add(eqPrime);
 			else if(eqPrimePrime.isPresent()) {
@@ -172,12 +172,10 @@ public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>> {
 				forks.add(fork);
 				fork.fork();
 			}
-				//eqPrimePrimeSet.addAll(this.unify(eqPrimePrime.get(), fc));
 			else {
 				TypeUnifyTask fork = new TypeUnifyTask(eqPrime, fc);
 				forks.add(fork);
 				fork.fork();
-				// eqPrimePrimeSet.addAll(this.unify(eqPrime, fc));
 			}
 		}