ComputerAidedLL / click-and-collect

A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml
GNU Lesser General Public License v2.1
17 stars 2 forks source link

Timeout for auto prover #85

Closed etiennecallies closed 3 years ago

etiennecallies commented 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^)))