Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k3_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	136231
Compressed Size	10270
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	7

Query 1

Status	sat
Inferred Status	None
Size	102375
Compressed Size	8651
Max. Term Depth	11
Asserts	960
Declared Functions	0
Declared Constants	232
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	885	or	1277	and	782	=	2660
/	206	+	60	-	48	*	48
<=	32

Query 2

Status	sat
Inferred Status	None
Size	105784
Compressed Size	8862
Max. Term Depth	11
Asserts	970
Declared Functions	0
Declared Constants	232
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	925	or	1327	and	782	=	2700
/	218	+	120	-	98	*	88
<=	52

Query 3

Status	sat
Inferred Status	None
Size	111388
Compressed Size	9140
Max. Term Depth	11
Asserts	987
Declared Functions	0
Declared Constants	232
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	991	or	1409	and	783	=	2765
/	237	+	219	-	180	*	153
<=	86

Query 4

Status	sat
Inferred Status	None
Size	121148
Compressed Size	9599
Max. Term Depth	11
Asserts	1016
Declared Functions	0
Declared Constants	232
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1106	or	1553	and	783	=	2880
/	269	+	392	-	322	*	269
<=	144

Query 5

Status	sat
Inferred Status	None
Size	127950
Compressed Size	9900
Max. Term Depth	11
Asserts	1036
Declared Functions	0
Declared Constants	232
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1185	or	1651	and	784	=	2958
/	295	+	510	-	421	*	347
<=	184

Query 6

Status	sat
Inferred Status	None
Size	136114
Compressed Size	10214
Max. Term Depth	11
Asserts	1060
Declared Functions	0
Declared Constants	232
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1280	or	1770	and	784	=	3053
/	323	+	653	-	544	*	442
<=	232

Query 7

Status	sat
Inferred Status	None
Size	136215
Compressed Size	10252
Max. Term Depth	11
Asserts	1062
Declared Functions	0
Declared Constants	232
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1280	or	1770	and	784	=	3053
/	325	+	653	-	544	*	442
<=	234