problem(CONSTRAINT-3COL[N=25,E=35])
description(3col - CSP like encoding - 25 nodes, 35 edges)
options(-instantiate)
files(constraint-3col graph2535)

problem(CONSTRAINT-3COL[N=30,E=40])
description(3col - CSP like encoding - 30 nodes, 40 edges)
options(-instantiate)
files(constraint-3col graph3040)

problem(CONSTRAINT-5COL[N=20,E=30])
description(5col - CSP like encoding - 20 nodes, 30 edges)
options(-instantiate)
files(constraint-5col graph2030)

problem(SCHEDULING)
description(scheduling)
options(-instantiate)
files(scheduling)

problem(SCHEDULING-ALTERNATE)
description(A modified version of scheduling)
options(-instantiate)
files(scheduling-alternate)

problem(CRISTAL)
description("Deductive database use as done by Christoph Koch in CERN")
options(-N=85 -instantiate)
files(cristal_extract_viewpoint.dl cristal_vp3_supermodule_subunits.dl)

problem(2QBF1)
description(2QBF, 1000 all-quantified, 20 existentially-quantified variables)
description(10000 clauses, 5CNF)
options(-FB -instantiate)
files(2qbf_1000x_20y_10000rules_5cnf.dl)

problem(ANCESTOR)
description(Double ancestor board of size 20x20)
options()
files(ancestor.double-board.20)

problem(3COL-SIMPLEX1)
description(3COL simplex graph, |edges| = 1980, |nodes| = 1035, one model)
options(-instantiate)
files(simplex.44 3col)

problem(3COL-LADDER)
description(3COL ladder graph, |edges| = 8998, |nodes| = 6000, one model)
options(-instantiate)
files(ladder.3000 3col)

problem(3COL-N-LADDER)
description(3COL ladder graph, propositional/Niemela style, |nodes| = 12000, one model)
options(-instantiate)
files(3col-niemela-ladder.6000)

problem(3COL-RANDOM1)
description(3COL random graph, |edges| = 1100, |nodes| = 500, one model)
options(-instantiate)
files(random_graph(500,1100,0,0,0,0,0,0,0,138) 3col)

problem(HP-RANDOM1)
description(Hamiltonian Path on a random graph, |edges| = 700, |nodes| = 85, one model)
description(generated with Stanford Graph Base random_graph(85,700,0,0,0,0,0,1,1,33))
description(undirected graph, represented as a directed one)
options(-instantiate)
files(random_graph_85_700_0_0_0_0_0_1_1_33.d ham-path)

problem(DECOMP2)
description(query decomposition (k=3), one model)
options(-instantiate -pfilter=k_decomposable)
files(kdecomp.k3 kdecomp.decision)

problem(HANOI-Towers)
description("Towers of Hanoi" with 3 stacks, 4 disks, and 15 steps.)
options(-FB -N=4322 -instantiate)
files(hanoi)

problem(RAMSEY)
description("Ramsey(3,6) != 17" ordered)
options(-OGo0 -instantiate -N=17)
files(ramseyT36ord)

problem(RAMSEY-NOT-ORDERED)
description("Ramsey(3,6) != 17" not ordered)
options(-instantiate -N=17 -n=1)
files(ramseyT36)

problem(RAMSEY(3,7))
description("Ramsey(3,7) != 19" not ordered)
options(-instantiate -N=19 -n=1)
files(ramseyT37)

problem(21-QUEENS)
description("N-Queens with 21 queens")
options(-instantiate -n=1)
files(21queens)

problem(TIMETABLING)
description(A timetable problem of the first year of the faculty of Science)
description(of University of Calabria for four classes, one model)
options(-instantiate -n=1)
files(time_tabling_2C)

problem(TIMETABLING_4Groups)
description(Like the previous with a larger number of classes)
options(-instantiate -n=1)
files(time_tabling_4C)
