Quick Help: This set of challenging benchmarks is based on the biggest subset of benchs on which all solvers have been tested. It is based only on SatEx experimentations with the cpu-cutoff paramater of 10000s on the reference machine (see FAQ for more details about runnings). A challenging benchmarks is one that has not been solved by any solver within the given cpu time. |
This challenging section is only based on:
List of 10 Challenging benchmarks |
List of 26 benchmarks solved by one or two provers only |
List of 6 solvers that solves at least one of the quasi-challenges |
© 2000-2001 Laurent Simon | Scripts last modified on 01-07-2001 File generated on 6-09-2001 |
![]() ![]() |