Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k5_k4_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
Size317157
Compressed Size21219
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categoryindustrial
First Occurrence—
Generated ByTomas Kolarik
Generated On2024-04-14 00:00:00
Generatorgitlab.com/Tomaqa/mapf_r
Dolmen OK1
strict Dolmen OK1
check-sat calls12
Query 1
Status sat
Inferred Status None
Size 232004
Compressed Size17190
Max. Term Depth15
Asserts 2091
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2016 or3132 and1884
=6402 let3 /878 +56
-44 *44 <=36
Query 2
Status sat
Inferred Status None
Size 245617
Compressed Size17813
Max. Term Depth15
Asserts 2131
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2176 or3331 and1885
=6561 let3 /919 +295
-243 *203 <=116
Query 3
Status sat
Inferred Status None
Size 258982
Compressed Size18387
Max. Term Depth15
Asserts 2170
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2332 or3525 and1886
=6716 let3 /980 +528
-437 *358 <=194
Query 4
Status sat
Inferred Status None
Size 263708
Compressed Size18613
Max. Term Depth15
Asserts 2184
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2386 or3592 and1887
=6769 let3 /1007 +609
-499 *413 <=222
Query 5
Status sat
Inferred Status None
Size 272656
Compressed Size19058
Max. Term Depth15
Asserts 2210
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2490 or3722 and1887
=6873 let3 /1046 +765
-632 *517 <=274
Query 6
Status sat
Inferred Status None
Size 281598
Compressed Size19610
Max. Term Depth15
Asserts 2238
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2592 or3850 and1889
=6973 let3 /1088 +921
-765 *617 <=330
Query 7
Status sat
Inferred Status None
Size 291121
Compressed Size20050
Max. Term Depth15
Asserts 2268
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2700 or3988 and1889
=7081 let3 /1128 +1089
-897 *734 <=390
Query 8
Status sat
Inferred Status None
Size 303061
Compressed Size20468
Max. Term Depth15
Asserts 2306
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2835 or4161 and1889
=7216 let3 /1166 +1300
-1070 *871 <=466
Query 9
Status sat
Inferred Status None
Size 307578
Compressed Size20666
Max. Term Depth15
Asserts 2319
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2887 or4226 and1889
=7268 let3 /1187 +1378
-1134 *923 <=492
Query 10
Status sat
Inferred Status None
Size 312157
Compressed Size20962
Max. Term Depth15
Asserts 2333
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2939 or4292 and1889
=7320 let3 /1202 +1458
-1200 *979 <=520
Query 11
Status sat
Inferred Status None
Size 317045
Compressed Size21198
Max. Term Depth15
Asserts 2347
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2995 or4362 and1889
=7376 let3 /1228 +1542
-1270 *1035 <=548
Query 12
Status sat
Inferred Status None
Size 317141
Compressed Size21227
Max. Term Depth15
Asserts 2349
Declared Functions0
Declared Constants296
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2995 or4362 and1889
=7376 let3 /1229 +1542
-1270 *1035 <=550