problem(STRATCOMP1-ALL)
description(STRATCOMP, random instance, |companies| = 60, |products| = 180,)
description(all sets)
options()
files(strat-comp.c60.p180 strat-comp)

problem(STRATCOMP-770.2-Q)
description(STRATCOMP, random instance, |companies| = |products| = 770,)
description(first model, with query)
files(stratcomp.query stratcomp-770.2)
options(-n=1)

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

problem(PRIMEIMPL2)
description(Prime Implicants with 180 variables and 774 clauses (all models [246]))
options()
files(prime-impl.v180.c774)

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

problem(3COL-RANDOM1)
description(3COL random graph, |edges| = 1100, |nodes| = 500, one model)
options(-n=1)
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(-n=1)
files(random_graph_85_700_0_0_0_0_0_1_1_33.d ham-path)

problem(HAMCYCLE-FREE)
description(Hamiltonian Cycle with a free guess.)
description(n = 60, one model)
options(-n=1)
files(ham-cycle-freeguess hamilton-60.0)

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

problem(BW-P5-nopush)
description(blocksworld problem P5 with Axel's C-translation without push)
options(-n=1 -N=11)
files(P5.idb bw_nopush)

problem(BW-P5-pushbin)
description(blocksworld problem P5 with Axel's pushed and binarised C-translation)
options(-n=1 -N=11)
files(P5.idb bw_push_binary)

problem(BW-P5-nopushbin)
description(blocksworld problem P5 with Axel's binarised C-translation without push)
options(-n=1 -N=11)
files(P5.idb bw_nopush_binary)


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

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

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

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

problem(MSTDir[V=13,A=40])
description(min spanning tree [prim], directed graph with 13 vertices and 40 arcs)
options()
files(min_sp_13.40 min_sp_prim)

problem(MSTDir[V=15,A=40])
description(min spanning tree [prim], directed graph with 15 vertices and 40 arcs)
options()
files(min_sp_15.40 min_sp_prim)

problem(MSTUndir[V=13,A=40])
description(min spanning tree [prim], undirected graph with 13 vertices and 40 arcs)
options()
files(min_sp_13.40 min_sp_prim.undirected)

problem(TIMETABLING)
description(A timetable problem of the first year of the faculty of Science)
description(of University of Calabria for 1 class, one model)
options(-n=1 -costbound=0,0)
files(time_tabling_1C)
