Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k5_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	67566
Compressed Size	5807
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	9706
Compressed Size	1776
Max. Term Depth	13
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

not	46	or	67	and	34	=	139
/	16	+	14	-	12	*	12
<=	8

Query 2

Status	sat
Inferred Status	None
Size	13544
Compressed Size	2039
Max. Term Depth	13
Asserts	80
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

not	90	or	122	and	34	=	183
/	38	+	80	-	67	*	56
<=	30

Query 3

Status	sat
Inferred Status	None
Size	13887
Compressed Size	2110
Max. Term Depth	13
Asserts	81
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

not	94	or	126	and	35	=	186
/	40	+	85	-	72	*	59
<=	32

Query 4

Status	unsat
Inferred Status	None
Size	14232
Compressed Size	2137
Max. Term Depth	13
Asserts	82
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

not	98	or	130	and	36	=	189
/	42	+	90	-	77	*	62
<=	34

Query 5

Status	sat
Inferred Status	None
Size	61229
Compressed Size	5651
Max. Term Depth	15
Asserts	512
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

not	520	or	788	and	432	=	1533
/	228	+	98	-	83	*	68
<=	38

Query 6

Status	sat
Inferred Status	None
Size	62714
Compressed Size	5786
Max. Term Depth	15
Asserts	517
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

not	536	or	808	and	433	=	1548
/	237	+	123	-	107	*	83
<=	48

Query 7

Status	sat
Inferred Status	None
Size	62818
Compressed Size	5815
Max. Term Depth	15
Asserts	519
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

not	536	or	808	and	433	=	1548
/	239	+	123	-	107	*	83
<=	50