Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/grid/grid_04x04_k2_k3_B.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	124861
Compressed Size	10376
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	107530
Compressed Size	9340
Max. Term Depth	7
Asserts	1086
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	993	or	1328	and	813	=	2849
+	81	-	63	*	63	<=	42

Query 2

Status	sat
Inferred Status	None
Size	110209
Compressed Size	9524
Max. Term Depth	8
Asserts	1094
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1025	or	1368	and	813	=	2881
+	129	-	103	*	95	<=	58

Query 3

Status	sat
Inferred Status	None
Size	111926
Compressed Size	9626
Max. Term Depth	8
Asserts	1099
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1045	or	1393	and	813	=	2901
/	4	+	159	-	128	*	115
<=	68

Query 4

Status	sat
Inferred Status	None
Size	112523
Compressed Size	9701
Max. Term Depth	8
Asserts	1101
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1052	or	1401	and	814	=	2907
/	4	+	169	-	136	*	122
<=	72

Query 5

Status	sat
Inferred Status	None
Size	113910
Compressed Size	9774
Max. Term Depth	8
Asserts	1106
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1067	or	1421	and	814	=	2922
/	4	+	194	-	156	*	137
<=	82

Query 6

Status	sat
Inferred Status	None
Size	115626
Compressed Size	9880
Max. Term Depth	8
Asserts	1111
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1087	or	1446	and	814	=	2942
/	8	+	224	-	181	*	157
<=	92

Query 7

Status	sat
Inferred Status	None
Size	117037
Compressed Size	9961
Max. Term Depth	8
Asserts	1116
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1102	or	1466	and	814	=	2957
/	8	+	249	-	201	*	176
<=	102

Query 8

Status	sat
Inferred Status	None
Size	119648
Compressed Size	10078
Max. Term Depth	8
Asserts	1124
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1133	or	1505	and	814	=	2988
/	8	+	296	-	240	*	208
<=	118

Query 9

Status	sat
Inferred Status	None
Size	119773
Compressed Size	10111
Max. Term Depth	8
Asserts	1127
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1133	or	1505	and	814	=	2988
/	10	+	296	-	240	*	208
<=	121

Query 10

Status	sat
Inferred Status	None
Size	123791
Compressed Size	10315
Max. Term Depth	8
Asserts	1139
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1181	or	1565	and	814	=	3036
/	12	+	368	-	299	*	256
<=	145

Query 11

Status	sat
Inferred Status	None
Size	124837
Compressed Size	10377
Max. Term Depth	8
Asserts	1142
Declared Functions	0
Declared Constants	217
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1193	or	1580	and	814	=	3048
/	14	+	386	-	314	*	268
<=	151