Proof By Contradiction in Proof Techniques Part 2 Computability Theory by ComputeNow - October 4, 20180 Proof by contradiction looks like, in this we assumed the contradiction and prove that what we assumed is contradict itself by using theorem that already proved or have the tautology. Theorem 1: Statement S is true. Proof by contradiction Proof: Assume that the statementĀ SĀ is false. Then, derive a contradiction (such as 1