Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.5/grid/grid_08x08_k5_k3_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	306031
Compressed Size	20447
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	282829
Compressed Size	19394
Max. Term Depth	34
Asserts	2486
Declared Functions	0
Declared Constants	349
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2441	or	3756	and	2361	=	7585
/	1142	+	33	-	27	*	27
<=	18

Query 2

Status	sat
Inferred Status	None
Size	283174
Compressed Size	19480
Max. Term Depth	34
Asserts	2487
Declared Functions	0
Declared Constants	349
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2445	or	3760	and	2362	=	7588
/	1144	+	38	-	32	*	30
<=	20

Query 3

Status	sat
Inferred Status	None
Size	294966
Compressed Size	20015
Max. Term Depth	34
Asserts	2522
Declared Functions	0
Declared Constants	349
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2580	or	3929	and	2363	=	7722
/	1208	+	242	-	188	*	169
<=	90

Query 4

Status	sat
Inferred Status	None
Size	305517
Compressed Size	20373
Max. Term Depth	34
Asserts	2553
Declared Functions	0
Declared Constants	349
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2700	or	4080	and	2363	=	7842
/	1269	+	424	-	321	*	293
<=	152

Query 5

Status	sat
Inferred Status	None
Size	305862
Compressed Size	20393
Max. Term Depth	34
Asserts	2554
Declared Functions	0
Declared Constants	349
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2704	or	4084	and	2364	=	7845
/	1271	+	429	-	326	*	296
<=	154

Query 6

Status	sat
Inferred Status	None
Size	306007
Compressed Size	20444
Max. Term Depth	34
Asserts	2557
Declared Functions	0
Declared Constants	349
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2704	or	4084	and	2364	=	7845
/	1274	+	429	-	326	*	296
<=	157