Suppose we want to prove Euclid’s theorem. 
The classic proof is by contradiction. However, if we start such a
proof with CCONTR_TAC, we get the goal
   { ~!m. ?n. prime n /\ m < n } ?- F
   { ?m. !n. ~prime n \/ ~(m < n) } ?- F
   { !n. ~prime n \/ ~(m < n) } ?- F