The problem is hard
As hard as it may be
To decide in a time
Polynomially
If P and NP
In the same clique
Can easily solve
The problem CLIQUE
There is an answer
For this problem hard
Solve using SAT
If you are smart
Need some tape
A read write head
To build a machine
Turing instead
Cook and Levin
Came in to action
To give a break
Overwhelming madness
If we prove
Using reduction
Thus they found
NP-Completeness
Rusiru Boteju








