## Section: New Results

### Formal verification of automated proof algorithms

Participant : Laurent Théry [correspondant] .

We have been interested in proving that the classic 2-Sat problem can be solved in linear time. This leads to proving two classic algorithms: