Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k7_A1.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
Size309570
Compressed Size21872
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 calls13
Query 1
Status sat
Inferred Status None
Size 202582
Compressed Size16137
Max. Term Depth10
Asserts 2051
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1866 or2515 and1534 =5400
+161 -126 *126 <=84
Query 2
Status sat
Inferred Status None
Size 212668
Compressed Size16813
Max. Term Depth10
Asserts 2082
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1990 or2665 and1539 =5519
/6 +342 -276 *245
<=146
Query 3
Status sat
Inferred Status None
Size 224962
Compressed Size17534
Max. Term Depth10
Asserts 2119
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2137 or2849 and1539 =5666
/21 +563 -459 *393
<=220
Query 4
Status sat
Inferred Status None
Size 236840
Compressed Size18217
Max. Term Depth10
Asserts 2156
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2280 or3027 and1541 =5807
/31 +778 -637 *535
<=294
Query 5
Status sat
Inferred Status None
Size 250205
Compressed Size18906
Max. Term Depth10
Asserts 2197
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2442 or3227 and1544 =5966
/43 +1019 -834 *695
<=376
Query 6
Status sat
Inferred Status None
Size 265882
Compressed Size19765
Max. Term Depth10
Asserts 2248
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2625 or3461 and1544 =6149
/53 +1304 -1068 *883
<=478
Query 7
Status sat
Inferred Status None
Size 270254
Compressed Size20037
Max. Term Depth10
Asserts 2263
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2675 or3525 and1545 =6198
/55 +1383 -1132 *937
<=508
Query 8
Status sat
Inferred Status None
Size 282738
Compressed Size20466
Max. Term Depth10
Asserts 2304
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2821 or3712 and1545 =6344
/55 +1611 -1319 *1096
<=590
Query 9
Status sat
Inferred Status None
Size 288727
Compressed Size20798
Max. Term Depth10
Asserts 2323
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2892 or3802 and1545 =6415
/57 +1720 -1409 *1167
<=628
Query 10
Status sat
Inferred Status None
Size 301423
Compressed Size21364
Max. Term Depth10
Asserts 2362
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3044 or3993 and1545 =6567
/65 +1950 -1599 *1319
<=706
Query 11
Status sat
Inferred Status None
Size 307417
Compressed Size21686
Max. Term Depth10
Asserts 2382
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3113 or4082 and1545 =6636
/66 +2059 -1688 *1393
<=746
Query 12
Status sat
Inferred Status None
Size 309460
Compressed Size21824
Max. Term Depth10
Asserts 2388
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3137 or4112 and1545 =6660
/70 +2095 -1718 *1417
<=758
Query 13
Status sat
Inferred Status None
Size 309554
Compressed Size21860
Max. Term Depth10
Asserts 2390
Declared Functions0
Declared Constants431
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3137 or4112 and1545 =6660
/71 +2095 -1718 *1417
<=760