Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.5/corridor/corridor_000_k2_F2.smt2

Publications: Tomas Kolarik, Stefan Ratschan and Pavel Surynek: "Multi-Agent Path-Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic" in ICAART, SCITEPRESS, 2024.
The benchmarks mimic MAPF problems with continuous time where the objective time must be sub-optimal, bounded by a user-specified coefficient. In the original solver, a simulator checks whether there are collisions between particular agents, according to the current model. This check is missing in the case of the final 'check-sat'. The benchmarks also lack commands for preferring certain variables during the search which is of huge importance when searching for short paths in a graph. However, the final plan must still avoid all collisions encountered by the original solver and the objective time must obey the sub-optimal coefficient. Producing models is crucial for the application since the intended solver communicates values of particular variables with the simulator. This communication is ommited though for simplicity. The final 'get-value' allows to compare with the original solver that the objective time indeed obeys the coefficient. Filenames without the extensions correspond to filenames of resulting plans of the original solver.

Benchmark
Size	31225
Compressed Size	3247
License	Creative Commons Attribution 4.0 International (CC-BY-4.0)
Category	industrial
First Occurrence	—
Generated By	Tomas Kolarik
Generated On	2024-04-14 00:00:00
Generator	gitlab.com/Tomaqa/mapf_r
Dolmen OK	1
strict Dolmen OK	1
`check-sat` calls	17

Query 1

Status	sat
Inferred Status	None
Size	5393
Compressed Size	1462
Max. Term Depth	5
Asserts	42
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	19	`or`	22	`and`	7
`=`	49	`let`	1	`+`	12	`-`	10
`*`	10	`<=`	10

Query 2

Status	sat
Inferred Status	None
Size	6092
Compressed Size	1546
Max. Term Depth	8
Asserts	44
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	27	`or`	32	`and`	7
`=`	57	`let`	1	`/`	1	`+`	24
`-`	20	`*`	18	`<=`	14

Query 3

Status	sat
Inferred Status	None
Size	6681
Compressed Size	1608
Max. Term Depth	8
Asserts	46
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	34	`or`	40	`and`	8
`=`	63	`let`	1	`/`	1	`+`	34
`-`	28	`*`	24	`<=`	18

Query 4

Status	unsat
Inferred Status	None
Size	7278
Compressed Size	1664
Max. Term Depth	8
Asserts	48
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	41	`or`	48	`and`	9
`=`	69	`let`	1	`/`	1	`+`	44
`-`	36	`*`	31	`<=`	22

Query 5

Status	unsat
Inferred Status	None
Size	10736
Compressed Size	1978
Max. Term Depth	8
Asserts	85
Declared Functions	0
Declared Constants	61
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	70	`or`	83	`and`	30
`=`	149	`let`	1	`/`	1	`+`	52
`-`	42	`*`	37	`<=`	26

Query 6

Status	sat
Inferred Status	None
Size	14783
Compressed Size	2309
Max. Term Depth	8
Asserts	128
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	105	`or`	124	`and`	55
`=`	243	`let`	1	`/`	1	`+`	60
`-`	48	`*`	43	`<=`	30

Query 7

Status	sat
Inferred Status	None
Size	15390
Compressed Size	2349
Max. Term Depth	8
Asserts	130
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	113	`or`	132	`and`	57
`=`	249	`let`	1	`/`	1	`+`	70
`-`	56	`*`	49	`<=`	34

Query 8

Status	sat
Inferred Status	None
Size	16089
Compressed Size	2413
Max. Term Depth	8
Asserts	132
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	121	`or`	142	`and`	57
`=`	257	`let`	1	`/`	2	`+`	82
`-`	66	`*`	57	`<=`	38

Query 9

Status	sat
Inferred Status	None
Size	16660
Compressed Size	2462
Max. Term Depth	8
Asserts	134
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	127	`or`	150	`and`	57
`=`	263	`let`	1	`/`	2	`+`	92
`-`	74	`*`	63	`<=`	42

Query 10

Status	sat
Inferred Status	None
Size	17773
Compressed Size	2527
Max. Term Depth	8
Asserts	138
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	139	`or`	166	`and`	57
`=`	275	`let`	1	`/`	2	`+`	112
`-`	90	`*`	76	`<=`	50

Query 11

Status	sat
Inferred Status	None
Size	18808
Compressed Size	2618
Max. Term Depth	8
Asserts	141
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	151	`or`	181	`and`	57
`=`	287	`let`	1	`/`	4	`+`	130
`-`	105	`*`	88	`<=`	56

Query 12

Status	unsat
Inferred Status	None
Size	18935
Compressed Size	2656
Max. Term Depth	8
Asserts	144
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	151	`or`	181	`and`	57
`=`	287	`let`	1	`/`	6	`+`	130
`-`	105	`*`	88	`<=`	59

Query 13

Status	sat
Inferred Status	None
Size	22785
Compressed Size	2849
Max. Term Depth	8
Asserts	157
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	197	`or`	238	`and`	59
`=`	331	`let`	1	`/`	9	`+`	200
`-`	162	`*`	133	`<=`	85

Query 14

Status	sat
Inferred Status	None
Size	24044
Compressed Size	2920
Max. Term Depth	8
Asserts	161
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	212	`or`	256	`and`	60
`=`	345	`let`	1	`/`	10	`+`	222
`-`	180	`*`	148	`<=`	93

Query 15

Status	sat
Inferred Status	None
Size	25079
Compressed Size	2975
Max. Term Depth	8
Asserts	164
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	224	`or`	271	`and`	60
`=`	357	`let`	1	`/`	12	`+`	240
`-`	195	`*`	160	`<=`	99

Query 16

Status	unsat
Inferred Status	None
Size	25780
Compressed Size	3023
Max. Term Depth	8
Asserts	166
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	232	`or`	281	`and`	60
`=`	365	`let`	1	`/`	13	`+`	252
`-`	205	`*`	168	`<=`	103

Query 17

Status	sat
Inferred Status	None
Size	25640
Compressed Size	2994
Max. Term Depth	8
Asserts	165
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`ite`	2	`not`	232	`or`	281	`and`	60
`=`	365	`let`	1	`/`	12	`+`	252
`-`	205	`*`	168	`<=`	102