Merge branch 'master' of github.com:Gbury/mSAT

This commit is contained in:
Guillaume Bury 2018-07-24 23:02:59 +02:00
commit 8cdfe65048
5 changed files with 10 additions and 10 deletions

View file

@ -2,8 +2,8 @@ c File: hole10.cnf
c
c SOURCE: John Hooker (jh38+@andrew.cmu.edu)
c
c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons
c in n+1 holes without placing 2 pigeons in the same hole
c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons
c in n holes without placing 2 pigeons in the same hole
c
c NOTE: Part of the collection at the Forschungsinstitut fuer
c anwendungsorientierte Wissensverarbeitung in Ulm Germany.

View file

@ -2,8 +2,8 @@ c File: hole6.cnf
c
c SOURCE: John Hooker (jh38+@andrew.cmu.edu)
c
c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons
c in n+1 holes without placing 2 pigeons in the same hole
c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons
c in n holes without placing 2 pigeons in the same hole
c
c NOTE: Part of the collection at the Forschungsinstitut fuer
c anwendungsorientierte Wissensverarbeitung in Ulm Germany.

View file

@ -2,8 +2,8 @@ c File: hole7.cnf
c
c SOURCE: John Hooker (jh38+@andrew.cmu.edu)
c
c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons
c in n+1 holes without placing 2 pigeons in the same hole
c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons
c in n holes without placing 2 pigeons in the same hole
c
c NOTE: Part of the collection at the Forschungsinstitut fuer
c anwendungsorientierte Wissensverarbeitung in Ulm Germany.

View file

@ -2,8 +2,8 @@ c File: hole8.cnf
c
c SOURCE: John Hooker (jh38+@andrew.cmu.edu)
c
c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons
c in n+1 holes without placing 2 pigeons in the same hole
c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons
c in n holes without placing 2 pigeons in the same hole
c
c NOTE: Part of the collection at the Forschungsinstitut fuer
c anwendungsorientierte Wissensverarbeitung in Ulm Germany.

View file

@ -2,8 +2,8 @@ c File: hole9.cnf
c
c SOURCE: John Hooker (jh38+@andrew.cmu.edu)
c
c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons
c in n+1 holes without placing 2 pigeons in the same hole
c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons
c in n holes without placing 2 pigeons in the same hole
c
c NOTE: Part of the collection at the Forschungsinstitut fuer
c anwendungsorientierte Wissensverarbeitung in Ulm Germany.