Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k4_A.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	89896
Compressed Size	7705
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	11

Query 1

Status	sat
Inferred Status	None
Size	77873
Compressed Size	6968
Max. Term Depth	7
Asserts	778
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	687	`or`	925	`and`	556	`=`	1984
`+`	76	`-`	60	`*`	60	`<=`	40

Query 2

Status	sat
Inferred Status	None
Size	80532
Compressed Size	7074
Max. Term Depth	8
Asserts	786
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	719	`or`	965	`and`	556	`=`	2016
`+`	124	`-`	100	`*`	92	`<=`	56

Query 3

Status	sat
Inferred Status	None
Size	81181
Compressed Size	7173
Max. Term Depth	8
Asserts	788
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	727	`or`	974	`and`	557	`=`	2023
`+`	135	`-`	109	`*`	99	`<=`	60

Query 4

Status	sat
Inferred Status	None
Size	82216
Compressed Size	7271
Max. Term Depth	8
Asserts	791
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	739	`or`	989	`and`	557	`=`	2035
`/`	2	`+`	153	`-`	124	`*`	111
`<=`	66

Query 5

Status	sat
Inferred Status	None
Size	84219
Compressed Size	7350
Max. Term Depth	8
Asserts	797
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	763	`or`	1019	`and`	557	`=`	2059
`/`	2	`+`	189	`-`	154	`*`	135
`<=`	78

Query 6

Status	sat
Inferred Status	None
Size	85332
Compressed Size	7406
Max. Term Depth	8
Asserts	801
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	775	`or`	1035	`and`	557	`=`	2071
`/`	2	`+`	209	`-`	170	`*`	148
`<=`	86

Query 7

Status	sat
Inferred Status	None
Size	86367
Compressed Size	7470
Max. Term Depth	8
Asserts	804
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	787	`or`	1050	`and`	557	`=`	2083
`/`	4	`+`	227	`-`	185	`*`	160
`<=`	92

Query 8

Status	sat
Inferred Status	None
Size	87492
Compressed Size	7514
Max. Term Depth	8
Asserts	808
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	799	`or`	1066	`and`	557	`=`	2095
`/`	4	`+`	247	`-`	201	`*`	175
`<=`	100

Query 9

Status	sat
Inferred Status	None
Size	88087
Compressed Size	7553
Max. Term Depth	8
Asserts	810
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	806	`or`	1074	`and`	558	`=`	2101
`/`	4	`+`	257	`-`	209	`*`	182
`<=`	104

Query 10

Status	sat
Inferred Status	None
Size	89787
Compressed Size	7691
Max. Term Depth	8
Asserts	815
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	826	`or`	1099	`and`	558	`=`	2121
`/`	7	`+`	287	`-`	234	`*`	202
`<=`	114

Query 11

Status	sat
Inferred Status	None
Size	89880
Compressed Size	7713
Max. Term Depth	8
Asserts	817
Declared Functions	0
Declared Constants	208
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

`not`	826	`or`	1099	`and`	558	`=`	2121
`/`	8	`+`	287	`-`	234	`*`	202
`<=`	116