Merge branch 'hotfix/0.1.3'
Merge branch 'release/1.0'
Merge branch 'develop'

* develop:
  Add torrent files with all proofs used in the experiments
Make read parameters of compression ratio type safe
Merge remote-tracking branch 'upstream/master' into develop
Merge with Skeptik/develop and fix bug in RU
Rename Subsumption algorithms
Implement ForwardAxiomSubsumption and move fixNodes to algorithm/compressor/package.scala

Relates to Issues #79 and #76
Implement possibility to change traversal order when creating a proof from root node and implement corresponding versions of Subsumption algorithms
Fix bug in BottomUpSubsumption

relates to Issue #77
Rework Subsumption algorithms and add version of fixNodes without redundant parameters
Fix bug in bottomUp - time subsumption

ancestors were not computed correctly
Rework RecycleUnits and implement a different replace traversal

New replace traversal checks if current node has unit clause as subclause instead of comparing to pivot elements. Also dagifies the proof on the way.
Implement first version of greedy pebbling
Implement additional constructor for proofs, add pebbling to measurements and move pebbling algorithm

Proof now can take a permutation map for premises as input.
The measure method of the proof package object can now can measure the pebbling of a proof.
Pebbling is now in at.logic.scala.algorithm.compressor and the apply method returns a proof.
Change measure name from pebble to space and alter its computation to use a single traversal
Implement output format with deletion information
Implement proof constructor using predefined nodes order
Surpress deletion information for resolution nodes with one child
Implement generic (top down and bottom up) pebblers and several node orderings representing different heuristics