
Name 

Atom 
Clause  
Come From 

1. 
hard.1.cnf
( n60e348.cnf)


721 
4543  
Hamiltonian Circuit problem on a randomly generated graph
hard.1.graph
( n60e348), with 60 vertexes and 348 arcs, which does not contain a Hamiltonian Circuit. 

2. 
hard.2.cnf
( n60e358.cnf)


741 
4837  
Hamiltonian Circuit problem on a randomly generated graph
hard.2.graph
( n60e358), with 60 vertexes and 358 arcs, which does not contain a Hamiltonian Circuit. 

3. 
hard.3.cnf 

635 
3330  
Hamiltonian Circuit problem on a randomly generated graph
hard.3.graph, with 60 vertexes and 295 arcs, which does not contain a Hamiltonian Circuit. 

4. 
hard.4.cnf 

729 
4563  
Hamiltonian Circuit problem on a randomly generated graph
hard.4.graph, with 60 vertexes and 343 arcs, which does not contain a Hamiltonian Circuit. 

5. 
hard.5.cnf 

607 
3813  
Hamiltonian Circuit problem on a randomly generated graph
hard.5.graph, with 50 vertexes and 291 arcs, which does not contain a Hamiltonian Circuit. 

6. 
hard.6.cnf 

703 
5413  
Hamiltonian Circuit problem on a randomly generated graph
hard.6.graph, with 50 vertexes and 345 arcs, which does not contain a Hamiltonian Circuit. 

7. 
hard.7.cnf 

623 
4137  
Hamiltonian Circuit problem on a randomly generated graph
hard.7.graph, with 50 vertexes and 311 arcs, which does not contain a Hamiltonian Circuit. 

8. 
hard.8.cnf 

643 
4325  
Hamiltonian Circuit problem on a randomly generated graph
hard.8.graph, with 50 vertexes and 312 arcs, which does not contain a Hamiltonian Circuit. 

9. 
hard.9.cnf 

635 
4319  
Hamiltonian Circuit problem on a randomly generated graph
hard.9.graph, with 50 vertexes and 314 arcs, which does not contain a Hamiltonian Circuit. 

10. 
hard.10.cnf 

639 
4339  
Hamiltonian Circuit problem on a randomly generated graph
hard.10.graph, with 50 vertexes and 314 arcs, which does not contain a Hamiltonian Circuit. 

11. 
hard.11.cnf 

605 
3664  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.12, with 50 vertexes and 345 arcs, which does not contain a Hamiltonian Circuit. 

12. 
hard.12.cnf 

613 
4036  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.14, with 50 vertexes and 307 arcs, which does not contain a Hamiltonian Circuit. 

13. 
hard.13.cnf 

631 
4337  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.26, with 50 vertexes and 307 arcs, which does not contain a Hamiltonian Circuit. 

14. 
hard.14.cnf 

615 
3947  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.27, with 50 vertexes and 304 arcs, which does not contain a Hamiltonian Circuit. 

15. 
hard.15.cnf 

613 
3790  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.29, with 50 vertexes and 303 arcs, which does not contain a Hamiltonian Circuit. 

16. 
hard.16.cnf 

629 
4278  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.39, with 50 vertexes and 305 arcs, which does not contain a Hamiltonian Circuit. 

17. 
hard.17.cnf 

639 
4363  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.45, with 50 vertexes and 305 arcs, which does not contain a Hamiltonian Circuit. 

18. 
hard.18.cnf 

631 
4253  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.52, with 50 vertexes and 303 arcs, which does not contain a Hamiltonian Circuit. 

19. 
hard.19.cnf 

623 
4135  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.73, with 50 vertexes and 304 arcs, which does not contain a Hamiltonian Circuit. 

20. 
hard.20.cnf 

643 
4335  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.74, with 50 vertexes and 306 arcs, which does not contain a Hamiltonian Circuit. 

21. 
hard.21.cnf 

631 
4087  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.85, with 50 vertexes and 302 arcs, which does not contain a Hamiltonian Circuit. 

22. 
hard.22.cnf 

605 
3878  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.91, with 50 vertexes and 300 arcs, which does not contain a Hamiltonian Circuit. 

23. 
hard.23.cnf 

623 
4167  
Hamiltonian Circuit problem on a randomly generated graph
v50a310.c.95, with 50 vertexes and 305 arcs, which does not contain a Hamiltonian Circuit. 

24. 
hard.24.cnf 

577 
4457  
Hamiltonian Circuit problem on a randomly generated graph
v40a300.c.21, with 40 vertexes and 293 arcs, which does not contain a Hamiltonian Circuit. 

25. 
hard.25.cnf 

577 
4357  
Hamiltonian Circuit problem on a randomly generated graph
v40a300.c.50, with 40 vertexes and 292 arcs, which does not contain a Hamiltonian Circuit. 

26. 
hard.26.cnf 

589 
4535  
Hamiltonian Circuit problem on a randomly generated graph
v40a300.c.87, with 40 vertexes and 295 arcs, which does not contain a Hamiltonian Circuit. 

27. 
hard.27.cnf 

601 
4711  
Hamiltonian Circuit problem on a randomly generated graph
v40a320.c.84, with 40 vertexes and 314 arcs, which does not contain a Hamiltonian Circuit. 

28. 
hard.28.cnf 

589 
4579  
Hamiltonian Circuit problem on a randomly generated graph
v40a310.c.14, with 40 vertexes and 305 arcs, which does not contain a Hamiltonian Circuit. 

29. 
hard.29.cnf 

577 
4501  
Hamiltonian Circuit problem on a randomly generated graph
v40a310.c.16, with 40 vertexes and 298 arcs, which does not contain a Hamiltonian Circuit. 

30. 
hard.30.cnf 

581 
4317  
Hamiltonian Circuit problem on a randomly generated graph
v40a310.c.47, with 40 vertexes and 300 arcs, which does not contain a Hamiltonian Circuit. 

31. 
hard.31.cnf 

581 
4471  
Hamiltonian Circuit problem on a randomly generated graph
v40a310.c.65, with 40 vertexes and 300 arcs, which does not contain a Hamiltonian Circuit. 

32. 
hard.32.cnf 

587 
4598  
Hamiltonian Circuit problem on a randomly generated graph
v40a310.c.84, with 40 vertexes and 302 arcs, which does not contain a Hamiltonian Circuit. 
