Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_08x08_k5_k2_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	1251579
Compressed Size	78114
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	6

Query 1

Status	sat
Inferred Status	None
Size	1183052
Compressed Size	76028
Max. Term Depth	34
Asserts	10718
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	10671	or	16350	and	10366	=	33010
/	4929	+	38	-	30	*	30
<=	20

Query 2

Status	sat
Inferred Status	None
Size	1202383
Compressed Size	76668
Max. Term Depth	34
Asserts	10774
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	10895	or	16630	and	10366	=	33234
/	5015	+	374	-	311	*	254
<=	132

Query 3

Status	sat
Inferred Status	None
Size	1227483
Compressed Size	77188
Max. Term Depth	34
Asserts	10846
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	11183	or	16990	and	10366	=	33522
/	5123	+	806	-	669	*	542
<=	276

Query 4

Status	sat
Inferred Status	None
Size	1240652
Compressed Size	77635
Max. Term Depth	34
Asserts	10884
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	11335	or	17180	and	10366	=	33674
/	5183	+	1034	-	869	*	694
<=	352

Query 5

Status	sat
Inferred Status	None
Size	1251458
Compressed Size	78079
Max. Term Depth	34
Asserts	10915
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	11459	or	17335	and	10366	=	33798
/	5243	+	1220	-	1024	*	818
<=	414

Query 6

Status	sat
Inferred Status	None
Size	1251563
Compressed Size	78112
Max. Term Depth	34
Asserts	10917
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	11459	or	17335	and	10366	=	33798
/	5245	+	1220	-	1024	*	818
<=	416