Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/grid/grid_02x02_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	16648
Compressed Size	2152
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	7630
Compressed Size	1608
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	10353
Compressed Size	1791
Max. Term Depth	8
Asserts	74
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	65	or	81	and	15	=	120
/	11	+	69	-	58	*	50
<=	28

Query 3

Status	sat
Inferred Status	None
Size	11218
Compressed Size	1871
Max. Term Depth	8
Asserts	77
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	75	or	93	and	16	=	129
/	12	+	84	-	70	*	59
<=	34

Query 4

Status	sat
Inferred Status	None
Size	12095
Compressed Size	1949
Max. Term Depth	8
Asserts	80
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	85	or	105	and	17	=	138
/	13	+	99	-	82	*	70
<=	40

Query 5

Status	unsat
Inferred Status	None
Size	12221
Compressed Size	1982
Max. Term Depth	8
Asserts	83
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	85	or	105	and	17	=	138
/	15	+	99	-	82	*	70
<=	43

Query 6

Status	sat
Inferred Status	None
Size	16548
Compressed Size	2044
Max. Term Depth	8
Asserts	96
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	137	or	169	and	19	=	188
/	24	+	177	-	146	*	122
<=	70