Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/grid/grid_02x02_k3_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	17825
Compressed Size	2355
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	5678
Compressed Size	1484
Max. Term Depth	5
Asserts	45
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	22	or	27	and	10	=	59
/	2	+	14	-	12	*	12
<=	8

Query 2

Status	sat
Inferred Status	None
Size	7401
Compressed Size	1600
Max. Term Depth	8
Asserts	50
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	42	or	52	and	10	=	79
/	8	+	44	-	37	*	32
<=	18

Query 3

Status	sat
Inferred Status	None
Size	8010
Compressed Size	1675
Max. Term Depth	8
Asserts	52
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	49	or	60	and	11	=	85
/	10	+	54	-	46	*	38
<=	22

Query 4

Status	unsat
Inferred Status	None
Size	8623
Compressed Size	1730
Max. Term Depth	8
Asserts	54
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	56	or	68	and	12	=	91
/	12	+	64	-	54	*	45
<=	26

Query 5

Status	sat
Inferred Status	None
Size	14480
Compressed Size	2274
Max. Term Depth	8
Asserts	114
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	108	or	138	and	54	=	243
/	20	+	72	-	60	*	51
<=	30

Query 6

Status	unsat
Inferred Status	None
Size	14608
Compressed Size	2315
Max. Term Depth	8
Asserts	117
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	108	or	138	and	54	=	243
/	22	+	72	-	60	*	51
<=	33

Query 7

Status	sat
Inferred Status	None
Size	14573
Compressed Size	2299
Max. Term Depth	8
Asserts	116
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	108	or	138	and	54	=	243
/	21	+	72	-	60	*	51
<=	32