Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_02x02_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	56188
Compressed Size	4388
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	13

Query 1

Status	sat
Inferred Status	None
Size	7630
Compressed Size	1605
Max. Term Depth	6
Asserts	66
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

not	33	or	41	and	15	=	88
/	3	+	21	-	18	*	18
<=	12

Query 2

Status	sat
Inferred Status	None
Size	12761
Compressed Size	1886
Max. Term Depth	8
Asserts	81
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

not	93	or	116	and	15	=	148
/	25	+	111	-	93	*	78
<=	42

Query 3

Status	sat
Inferred Status	None
Size	15046
Compressed Size	2041
Max. Term Depth	8
Asserts	89
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

not	120	or	148	and	18	=	172
/	31	+	151	-	126	*	102
<=	58

Query 4

Status	unsat
Inferred Status	None
Size	17359
Compressed Size	2232
Max. Term Depth	8
Asserts	97
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

not	147	or	180	and	21	=	196
/	37	+	191	-	158	*	131
<=	74

Query 5

Status	sat
Inferred Status	None
Size	26184
Compressed Size	2906
Max. Term Depth	8
Asserts	187
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	225	or	285	and	84	=	424
/	49	+	203	-	167	*	140
<=	80

Query 6

Status	sat
Inferred Status	None
Size	31069
Compressed Size	3287
Max. Term Depth	8
Asserts	202
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	283	or	357	and	85	=	481
/	58	+	290	-	239	*	199
<=	110

Query 7

Status	sat
Inferred Status	None
Size	33618
Compressed Size	3460
Max. Term Depth	8
Asserts	210
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	313	or	394	and	86	=	510
/	63	+	335	-	276	*	230
<=	126

Query 8

Status	sat
Inferred Status	None
Size	38573
Compressed Size	3785
Max. Term Depth	8
Asserts	226
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	371	or	466	and	88	=	566
/	76	+	423	-	349	*	286
<=	158

Query 9

Status	sat
Inferred Status	None
Size	41100
Compressed Size	3919
Max. Term Depth	8
Asserts	234
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	401	or	502	and	90	=	594
/	83	+	467	-	385	*	316
<=	174

Query 10

Status	sat
Inferred Status	None
Size	43823
Compressed Size	4081
Max. Term Depth	8
Asserts	242
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	433	or	542	and	90	=	626
/	91	+	515	-	425	*	348
<=	190

Query 11

Status	sat
Inferred Status	None
Size	45214
Compressed Size	4159
Max. Term Depth	8
Asserts	246
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	449	or	562	and	90	=	642
/	96	+	539	-	445	*	364
<=	198

Query 12

Status	sat
Inferred Status	None
Size	46079
Compressed Size	4227
Max. Term Depth	8
Asserts	249
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	459	or	574	and	91	=	651
/	97	+	554	-	457	*	373
<=	204

Query 13

Status	sat
Inferred Status	None
Size	46180
Compressed Size	4257
Max. Term Depth	8
Asserts	251
Declared Functions	0
Declared Constants	89
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	459	or	574	and	91	=	651
/	99	+	554	-	457	*	373
<=	206