Closed DavePearce closed 7 years ago
Right, the problem here is, again, representation. Basically, it's not moving the generated equation 0 >= (1 + us[0])
into normal form. This can be done with the following:
updatedTruth = Formulae.simplifyFormula(updatedTruth, types); updatedTruth = (Formula) construct(state,updatedTruth); updatedTruth = Formulae.simplifyFormula(updatedTruth, types);
But, at this point, it's fair to say that things are getting RIDICULOUS.
The following fails for reasons unknown:
Looking at the proof is helpful:
We can see that it's failing on the case where
j == 0
. This should be the easiest case! In particular, we can see117. 1 == ys[0]
so it should be no sweat.UPDATE: possible construct is not recursive when it should be?