major code change: refute can now handle any Isabelle term, adds certain axioms automatically, and can handle inductive datatypes (but not yet recursion over them)
Sep2 = Main +
consts sep :: 'a list => 'a => 'a list
recdef sep "measure length"
"sep (x#y#zs) = (%a. x # a # sep zs a)"
"sep xs = (%a. xs)"
end