Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_08x08_k5_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	1687558
Compressed Size	108618
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	1669278
Compressed Size	107478
Max. Term Depth	35
Asserts	15054
Declared Functions	0
Declared Constants	769
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	14961	or	22972	and	14534	=	46387
/	6953	+	75	-	60	*	60
<=	40

Query 2

Status	sat
Inferred Status	None
Size	1669622
Compressed Size	107570
Max. Term Depth	35
Asserts	15055
Declared Functions	0
Declared Constants	769
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	14965	or	22976	and	14535	=	46390
/	6955	+	80	-	65	*	63
<=	42

Query 3

Status	sat
Inferred Status	None
Size	1672094
Compressed Size	107729
Max. Term Depth	35
Asserts	15062
Declared Functions	0
Declared Constants	769
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	14993	or	23011	and	14535	=	46418
/	6969	+	122	-	101	*	91
<=	56

Query 4

Status	sat
Inferred Status	None
Size	1681888
Compressed Size	108318
Max. Term Depth	35
Asserts	15091
Declared Functions	0
Declared Constants	769
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	15106	or	23151	and	14537	=	46529
/	7025	+	291	-	228	*	205
<=	114

Query 5

Status	sat
Inferred Status	None
Size	1682512
Compressed Size	108367
Max. Term Depth	35
Asserts	15093
Declared Functions	0
Declared Constants	769
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	15113	or	23159	and	14538	=	46535
/	7028	+	301	-	237	*	211
<=	118

Query 6

Status	sat
Inferred Status	None
Size	1687430
Compressed Size	108575
Max. Term Depth	35
Asserts	15107
Declared Functions	0
Declared Constants	769
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	15169	or	23229	and	14538	=	46591
/	7056	+	385	-	314	*	267
<=	146

Query 7

Status	sat
Inferred Status	None
Size	1687542
Compressed Size	108613
Max. Term Depth	35
Asserts	15109
Declared Functions	0
Declared Constants	769
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	15169	or	23229	and	14538	=	46591
/	7058	+	385	-	314	*	267
<=	148