diff --git a/README.md b/README.md
deleted file mode 100644
--- a/README.md
+++ /dev/null
@@ -1,38 +0,0 @@
-# tptp
-
-[![Build Status](https://travis-ci.org/aztek/tptp.svg?branch=master)](https://travis-ci.org/aztek/tptp)
-
-[TPTP](http://www.tptp.org) (Thousands of Problems for Theorem Provers) is the standard language of problems, proofs, and models, used by automated theorem provers.
-
-This library provides definitions of data types, a pretty printer and an [attoparsec](http://hackage.haskell.org/package/attoparsec) parser for (currently, a subset of) the TPTP language.
-
-## Example
-
-Consider the following classical syllogism.
-
-> All humans are mortal.
-> Socrates is a human.
-> Therefore, Socrates is mortal.
-
-We can formalize this syllogism in unsorted first-order logic and write it down in TPTP as following.
-
-```haskell
-import Data.TPTP
-
-humansAreMortal :: UnsortedFirstOrder
-humansAreMortal = forall ["P"] $
-  Connective (Predicate "human" [var "P"]) Implication (Predicate "mortal" [var "P"])
-
-socratesIsHuman :: UnsortedFirstOrder
-socratesIsHuman = Predicate "human" [Function "socrates" []]
-
-socratesIsMortal :: UnsortedFirstOrder
-socratesIsMortal = Predicate "mortal" [Function "socrates" []]
-
-syllogism :: TPTP
-syllogism = TPTP [
-    axiom "humans_are_mortal" humansAreMortal,
-    axiom "socrates_is_human" socratesIsHuman,
-    conjecture "socrates_is_mortal" socratesIsMortal
-  ]
-```
diff --git a/tptp.cabal b/tptp.cabal
--- a/tptp.cabal
+++ b/tptp.cabal
@@ -1,6 +1,6 @@
 cabal-version: 2.4
 name: tptp
-version: 0.1.0.0
+version: 0.1.0.1
 synopsis: A parser and a pretty printer for the TPTP language
 description:
   <http://www.tptp.org TPTP> (Thousands of Problems for Theorem Provers)
@@ -17,7 +17,6 @@
 author: Evgenii Kotelnikov
 maintainer: evgeny.kotelnikov@gmail.com
 category: Language, Parsing, Pretty Printer, Theorem Provers, Formal Methods
-extra-source-files: README.md
 tested-with:
   GHC == 7.10.3,
   GHC == 8.0.2,