Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k7_D.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	306586
Compressed Size	22182
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	188891
Compressed Size	15172
Max. Term Depth	10
Asserts	1921
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1736	or	2317	and	1403	=	4950
+	161	-	126	*	126	<=	84

Query 2

Status	sat
Inferred Status	None
Size	198322
Compressed Size	15980
Max. Term Depth	10
Asserts	1949
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1848	or	2457	and	1403	=	5062
/	19	+	329	-	266	*	238
<=	140

Query 3

Status	sat
Inferred Status	None
Size	220422
Compressed Size	17274
Max. Term Depth	10
Asserts	2019
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2111	or	2787	and	1406	=	5322
/	27	+	729	-	596	*	507
<=	280

Query 4

Status	sat
Inferred Status	None
Size	232240
Compressed Size	18010
Max. Term Depth	10
Asserts	2057
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2251	or	2962	and	1409	=	5459
/	31	+	942	-	771	*	651
<=	356

Query 5

Status	sat
Inferred Status	None
Size	258225
Compressed Size	19322
Max. Term Depth	10
Asserts	2141
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2554	or	3348	and	1410	=	5761
/	43	+	1412	-	1156	*	971
<=	524

Query 6

Status	sat
Inferred Status	None
Size	275909
Compressed Size	20404
Max. Term Depth	10
Asserts	2200
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2757	or	3610	and	1410	=	5964
/	53	+	1733	-	1418	*	1182
<=	642

Query 7

Status	sat
Inferred Status	None
Size	288551
Compressed Size	21075
Max. Term Depth	10
Asserts	2241
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2905	or	3799	and	1410	=	6112
/	59	+	1963	-	1606	*	1332
<=	724

Query 8

Status	sat
Inferred Status	None
Size	298571
Compressed Size	21595
Max. Term Depth	10
Asserts	2272
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	3024	or	3948	and	1411	=	6230
/	69	+	2143	-	1755	*	1455
<=	786

Query 9

Status	sat
Inferred Status	None
Size	304220
Compressed Size	21981
Max. Term Depth	10
Asserts	2290
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	3091	or	4031	and	1413	=	6295
/	76	+	2244	-	1838	*	1521
<=	822

Query 10

Status	sat
Inferred Status	None
Size	306476
Compressed Size	22136
Max. Term Depth	10
Asserts	2298
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	3116	or	4064	and	1413	=	6320
/	76	+	2285	-	1871	*	1547
<=	838

Query 11

Status	sat
Inferred Status	None
Size	306570
Compressed Size	22174
Max. Term Depth	10
Asserts	2300
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	3116	or	4064	and	1413	=	6320
/	77	+	2285	-	1871	*	1547
<=	840