Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_B.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	50355
Compressed Size	4715
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	46845
Compressed Size	4405
Max. Term Depth	6
Asserts	467
Declared Functions	0
Declared Constants	126
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	412	or	543	and	328	=	1163
+	46	-	36	*	36	<=	24

Query 2

Status	sat
Inferred Status	None
Size	47891
Compressed Size	4523
Max. Term Depth	8
Asserts	470
Declared Functions	0
Declared Constants	126
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	424	or	558	and	328	=	1175
/	2	+	64	-	51	*	48
<=	30

Query 3

Status	sat
Inferred Status	None
Size	48547
Compressed Size	4611
Max. Term Depth	8
Asserts	472
Declared Functions	0
Declared Constants	126
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	432	or	567	and	329	=	1182
/	2	+	75	-	60	*	55
<=	34

Query 4

Status	sat
Inferred Status	None
Size	49203
Compressed Size	4655
Max. Term Depth	8
Asserts	474
Declared Functions	0
Declared Constants	126
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	440	or	576	and	330	=	1189
/	2	+	86	-	69	*	62
<=	38

Query 5

Status	sat
Inferred Status	None
Size	50246
Compressed Size	4699
Max. Term Depth	8
Asserts	477
Declared Functions	0
Declared Constants	126
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	452	or	591	and	330	=	1201
/	4	+	104	-	84	*	74
<=	44

Query 6

Status	sat
Inferred Status	None
Size	50339
Compressed Size	4720
Max. Term Depth	8
Asserts	479
Declared Functions	0
Declared Constants	126
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	452	or	591	and	330	=	1201
/	5	+	104	-	84	*	74
<=	46