Skip to content

Commit

Permalink
add xml benchmarks
Browse files Browse the repository at this point in the history
  • Loading branch information
@Wout4
Wout4 committed May 16, 2024
1 parent df746db commit 2718d4f
Show file tree
Hide file tree
Showing 277 changed files with 3,249,312 additions and 0 deletions.
34 changes: 34 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-03-12_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[12]"> 1..12 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..33 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %0 %1 %2 </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..2] </args>
<args> x[1..3] </args>
<args> x[2..4] </args>
<args> x[3..5] </args>
<args> x[4..6] </args>
<args> x[5..7] </args>
<args> x[6..8] </args>
<args> x[7..9] </args>
<args> x[8..10] </args>
<args> x[9..11] </args>
<args> x[10..11] x[0] </args>
<args> x[11] x[0..1] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[11]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
37 changes: 37 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-05-15_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[15]"> 1..15 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..65 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..4] </args>
<args> x[1..5] </args>
<args> x[2..6] </args>
<args> x[3..7] </args>
<args> x[4..8] </args>
<args> x[5..9] </args>
<args> x[6..10] </args>
<args> x[7..11] </args>
<args> x[8..12] </args>
<args> x[9..13] </args>
<args> x[10..14] </args>
<args> x[11..14] x[0] </args>
<args> x[12..14] x[0..1] </args>
<args> x[13..14] x[0..2] </args>
<args> x[14] x[0..3] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[14]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
37 changes: 37 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-07-15_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[15]"> 1..15 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..84 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..6] </args>
<args> x[1..7] </args>
<args> x[2..8] </args>
<args> x[3..9] </args>
<args> x[4..10] </args>
<args> x[5..11] </args>
<args> x[6..12] </args>
<args> x[7..13] </args>
<args> x[8..14] </args>
<args> x[9..14] x[0] </args>
<args> x[10..14] x[0..1] </args>
<args> x[11..14] x[0..2] </args>
<args> x[12..14] x[0..3] </args>
<args> x[13..14] x[0..4] </args>
<args> x[14] x[0..5] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[14]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
42 changes: 42 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-07-20_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,42 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[20]"> 1..20 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..119 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..6] </args>
<args> x[1..7] </args>
<args> x[2..8] </args>
<args> x[3..9] </args>
<args> x[4..10] </args>
<args> x[5..11] </args>
<args> x[6..12] </args>
<args> x[7..13] </args>
<args> x[8..14] </args>
<args> x[9..15] </args>
<args> x[10..16] </args>
<args> x[11..17] </args>
<args> x[12..18] </args>
<args> x[13..19] </args>
<args> x[14..19] x[0] </args>
<args> x[15..19] x[0..1] </args>
<args> x[16..19] x[0..2] </args>
<args> x[17..19] x[0..3] </args>
<args> x[18..19] x[0..4] </args>
<args> x[19] x[0..5] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[19]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
37 changes: 37 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-10-15_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[15]"> 1..15 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..105 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..9] </args>
<args> x[1..10] </args>
<args> x[2..11] </args>
<args> x[3..12] </args>
<args> x[4..13] </args>
<args> x[5..14] </args>
<args> x[6..14] x[0] </args>
<args> x[7..14] x[0..1] </args>
<args> x[8..14] x[0..2] </args>
<args> x[9..14] x[0..3] </args>
<args> x[10..14] x[0..4] </args>
<args> x[11..14] x[0..5] </args>
<args> x[12..14] x[0..6] </args>
<args> x[13..14] x[0..7] </args>
<args> x[14] x[0..8] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[14]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
42 changes: 42 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-10-20_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,42 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[20]"> 1..20 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..155 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..9] </args>
<args> x[1..10] </args>
<args> x[2..11] </args>
<args> x[3..12] </args>
<args> x[4..13] </args>
<args> x[5..14] </args>
<args> x[6..15] </args>
<args> x[7..16] </args>
<args> x[8..17] </args>
<args> x[9..18] </args>
<args> x[10..19] </args>
<args> x[11..19] x[0] </args>
<args> x[12..19] x[0..1] </args>
<args> x[13..19] x[0..2] </args>
<args> x[14..19] x[0..3] </args>
<args> x[15..19] x[0..4] </args>
<args> x[16..19] x[0..5] </args>
<args> x[17..19] x[0..6] </args>
<args> x[18..19] x[0..7] </args>
<args> x[19] x[0..8] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[19]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
42 changes: 42 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-15-20_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,42 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[20]"> 1..20 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..195 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..14] </args>
<args> x[1..15] </args>
<args> x[2..16] </args>
<args> x[3..17] </args>
<args> x[4..18] </args>
<args> x[5..19] </args>
<args> x[6..19] x[0] </args>
<args> x[7..19] x[0..1] </args>
<args> x[8..19] x[0..2] </args>
<args> x[9..19] x[0..3] </args>
<args> x[10..19] x[0..4] </args>
<args> x[11..19] x[0..5] </args>
<args> x[12..19] x[0..6] </args>
<args> x[13..19] x[0..7] </args>
<args> x[14..19] x[0..8] </args>
<args> x[15..19] x[0..9] </args>
<args> x[16..19] x[0..10] </args>
<args> x[17..19] x[0..11] </args>
<args> x[18..19] x[0..12] </args>
<args> x[19] x[0..13] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[19]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
52 changes: 52 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-15-30_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[30]"> 1..30 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..345 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..14] </args>
<args> x[1..15] </args>
<args> x[2..16] </args>
<args> x[3..17] </args>
<args> x[4..18] </args>
<args> x[5..19] </args>
<args> x[6..20] </args>
<args> x[7..21] </args>
<args> x[8..22] </args>
<args> x[9..23] </args>
<args> x[10..24] </args>
<args> x[11..25] </args>
<args> x[12..26] </args>
<args> x[13..27] </args>
<args> x[14..28] </args>
<args> x[15..29] </args>
<args> x[16..29] x[0] </args>
<args> x[17..29] x[0..1] </args>
<args> x[18..29] x[0..2] </args>
<args> x[19..29] x[0..3] </args>
<args> x[20..29] x[0..4] </args>
<args> x[21..29] x[0..5] </args>
<args> x[22..29] x[0..6] </args>
<args> x[23..29] x[0..7] </args>
<args> x[24..29] x[0..8] </args>
<args> x[25..29] x[0..9] </args>
<args> x[26..29] x[0..10] </args>
<args> x[27..29] x[0..11] </args>
<args> x[28..29] x[0..12] </args>
<args> x[29] x[0..13] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[29]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
47 changes: 47 additions & 0 deletions benchmarks/MiniCOP/ClockTriplet-20-25_c22.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
<instance format="XCSP3" type="COP">
<variables>
<array id="x" note="x[i] is the ith number in the circle" size="[25]"> 1..25 </array>
<var id="z" note="z is the minimal value such that any (circular) subsequence of x of size r is less than or equal to z"> 0..310 </var>
</variables>
<constraints>
<allDifferent note="a permutation is required"> x[] </allDifferent>
<group note="any subsequence of size r must be less than or equal to z">
<sum>
<list> %... </list>
<condition> (le,z) </condition>
</sum>
<args> x[0..19] </args>
<args> x[1..20] </args>
<args> x[2..21] </args>
<args> x[3..22] </args>
<args> x[4..23] </args>
<args> x[5..24] </args>
<args> x[6..24] x[0] </args>
<args> x[7..24] x[0..1] </args>
<args> x[8..24] x[0..2] </args>
<args> x[9..24] x[0..3] </args>
<args> x[10..24] x[0..4] </args>
<args> x[11..24] x[0..5] </args>
<args> x[12..24] x[0..6] </args>
<args> x[13..24] x[0..7] </args>
<args> x[14..24] x[0..8] </args>
<args> x[15..24] x[0..9] </args>
<args> x[16..24] x[0..10] </args>
<args> x[17..24] x[0..11] </args>
<args> x[18..24] x[0..12] </args>
<args> x[19..24] x[0..13] </args>
<args> x[20..24] x[0..14] </args>
<args> x[21..24] x[0..15] </args>
<args> x[22..24] x[0..16] </args>
<args> x[23..24] x[0..17] </args>
<args> x[24] x[0..18] </args>
</group>
<block class="symmetry-breaking">
<intension> eq(x[0],1) </intension>
<intension> lt(x[1],x[24]) </intension>
</block>
</constraints>
<objectives>
<minimize> z </minimize>
</objectives>
</instance>
Loading

0 comments on commit 2718d4f

Please sign in to comment.