Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k4_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	46461
Compressed Size	4590
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	7

Query 1

Status	sat
Inferred Status	None
Size	8994
Compressed Size	1722
Max. Term Depth	10
Asserts	63
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	40	or	55	and	28
=	115	let	1	/	10	+	12
-	10	*	10	<=	10

Query 2

Status	sat
Inferred Status	None
Size	10755
Compressed Size	1889
Max. Term Depth	10
Asserts	68
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	60	or	80	and	28
=	135	let	1	/	20	+	42
-	35	*	30	<=	20

Query 3

Status	sat
Inferred Status	None
Size	11098
Compressed Size	1946
Max. Term Depth	10
Asserts	69
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	64	or	84	and	29
=	138	let	1	/	22	+	47
-	40	*	33	<=	22

Query 4

Status	unsat
Inferred Status	None
Size	11443
Compressed Size	1976
Max. Term Depth	10
Asserts	70
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	68	or	88	and	30
=	141	let	1	/	24	+	52
-	45	*	36	<=	24

Query 5

Status	sat
Inferred Status	None
Size	42725
Compressed Size	4371
Max. Term Depth	15
Asserts	360
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	350	or	516	and	292
=	1019	let	1	/	128	+	60
-	51	*	42	<=	28

Query 6

Status	sat
Inferred Status	None
Size	43632
Compressed Size	4483
Max. Term Depth	15
Asserts	363
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	360	or	528	and	293
=	1028	let	1	/	133	+	75
-	65	*	51	<=	34

Query 7

Status	sat
Inferred Status	None
Size	43736
Compressed Size	4510
Max. Term Depth	15
Asserts	365
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	360	or	528	and	293
=	1028	let	1	/	135	+	75
-	65	*	51	<=	36