Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_02x02_k2_C.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	25263
Compressed Size	2876
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	12

Query 1

Status	sat
Inferred Status	None
Size	5108
Compressed Size	1416
Max. Term Depth	5
Asserts	41
Declared Functions	0
Declared Constants	38
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	18	or	21	and	6	=	47
+	14	-	12	*	12	<=	8

Query 2

Status	sat
Inferred Status	None
Size	6143
Compressed Size	1527
Max. Term Depth	8
Asserts	44
Declared Functions	0
Declared Constants	38
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	30	or	36	and	6	=	59
/	2	+	32	-	27	*	24
<=	14

Query 3

Status	sat
Inferred Status	None
Size	6732
Compressed Size	1583
Max. Term Depth	8
Asserts	46
Declared Functions	0
Declared Constants	38
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	37	or	44	and	7	=	65
/	2	+	42	-	35	*	30
<=	18

Query 4

Status	unsat
Inferred Status	None
Size	7329
Compressed Size	1643
Max. Term Depth	8
Asserts	48
Declared Functions	0
Declared Constants	38
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	44	or	52	and	8	=	71
/	2	+	52	-	43	*	37
<=	22

Query 5

Status	unsat
Inferred Status	None
Size	10864
Compressed Size	1972
Max. Term Depth	8
Asserts	86
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	74	or	90	and	30	=	157
/	2	+	60	-	49	*	43
<=	26

Query 6

Status	sat
Inferred Status	None
Size	15224
Compressed Size	2372
Max. Term Depth	8
Asserts	132
Declared Functions	0
Declared Constants	72
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	112	or	138	and	58	=	265
/	2	+	68	-	55	*	49
<=	30

Query 7

Status	sat
Inferred Status	None
Size	16259
Compressed Size	2452
Max. Term Depth	8
Asserts	135
Declared Functions	0
Declared Constants	72
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	124	or	153	and	58	=	277
/	4	+	86	-	70	*	61
<=	36

Query 8

Status	sat
Inferred Status	None
Size	17546
Compressed Size	2548
Max. Term Depth	8
Asserts	139
Declared Functions	0
Declared Constants	72
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	139	or	172	and	58	=	292
/	4	+	109	-	89	*	76
<=	44

Query 9

Status	sat
Inferred Status	None
Size	18839
Compressed Size	2626
Max. Term Depth	8
Asserts	143
Declared Functions	0
Declared Constants	72
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	154	or	191	and	58	=	307
/	4	+	132	-	108	*	92
<=	52

Query 10

Status	sat
Inferred Status	None
Size	18953
Compressed Size	2655
Max. Term Depth	8
Asserts	146
Declared Functions	0
Declared Constants	72
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	154	or	191	and	58	=	307
/	5	+	132	-	108	*	92
<=	55

Query 11

Status	unsat
Inferred Status	None
Size	19045
Compressed Size	2669
Max. Term Depth	8
Asserts	148
Declared Functions	0
Declared Constants	72
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	154	or	191	and	58	=	307
/	6	+	132	-	108	*	92
<=	57

Query 12

Status	sat
Inferred Status	None
Size	22529
Compressed Size	2763
Max. Term Depth	8
Asserts	158
Declared Functions	0
Declared Constants	72
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	196	or	244	and	58	=	349
/	8	+	196	-	161	*	135
<=	78