Closed etiennecallies closed 3 years ago
You can view the loader on preprod:
The max execution time has been arbitrary set to 3 seconds. There is no more exponential bound, but the prover tries with a bound of 2,3,4, ... until timeout.
Thus new sequents are provable, among them the famous ?((A+A^)*(((B*B)+B^)|((B*B)+B^)))
?((A+A^)*(((B*B)+B^)|((B*B)+B^)))
You can view the loader on preprod:
The max execution time has been arbitrary set to 3 seconds. There is no more exponential bound, but the prover tries with a bound of 2,3,4, ... until timeout.
Thus new sequents are provable, among them the famous
?((A+A^)*(((B*B)+B^)|((B*B)+B^)))