Implement more utility functions

[spacekookie]

lrs can do a few things already but especially terms need more awareness of what's inside them. So there need to be a few utility functions that handle this. They don't need to be super fast (at least not for now) but need to provide easily callable functionality.

• Find offending terms in a term ({ A, ¬A } which will start a branch reduce run)
• Count occurrences of symbols in a clause ({ A, ¬B }, { A, C } should result in A: 2, ¬B: 1, C: 1)
• Recognise "fuzzy results" ( { A, B } works with A=1, B=1 and A=1, B=0 and A=0, B=1 See Support "fuzzy" results #10)