1
0
tplp-planning-benchmark/fd-pa-e1-sh/ipc-2002_driverlog-strips-automatic_18.out

247 lines
26 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-18.pddl']
INFO translator arguments: []
INFO translator time limit: None
INFO translator memory limit: None
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-18.pddl
Parsing...
Parsing: [0.030s CPU, 0.034s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.014s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.016s wall-clock]
Preparing model... [0.040s CPU, 0.037s wall-clock]
Generated 35 rules.
Computing model... [0.870s CPU, 0.873s wall-clock]
10402 relevant atoms
3678 auxiliary atoms
14080 final queue length
22680 total queue pushes
Completing instantiation... [1.620s CPU, 1.621s wall-clock]
Instantiating: [2.570s CPU, 2.573s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.040s CPU, 0.038s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.090s CPU, 0.089s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
Choosing groups...
5 uncovered facts
Choosing groups: [0.020s CPU, 0.016s wall-clock]
Building translation key... [0.000s CPU, 0.010s wall-clock]
Computing fact groups: [0.200s CPU, 0.208s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.005s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.100s CPU, 0.097s wall-clock]
Translating task: [1.790s CPU, 1.788s wall-clock]
500 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
30 propositions removed
Detecting unreachable propositions: [0.900s CPU, 0.906s wall-clock]
Reordering and filtering variables...
32 of 35 variables necessary.
5 of 35 mutex groups necessary.
8360 of 8960 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.230s CPU, 0.224s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 825
Translator goal facts: 23
Translator mutex groups: 5
Translator total mutex groups size: 30
Translator operators: 8360
Translator axioms: 0
Translator task size: 35190
Translator peak memory: 59480 KB
Writing output... [0.680s CPU, 0.747s wall-clock]
Done! [6.500s CPU, 6.571s wall-clock]
planner.py version 0.0.1
Time: 1.17s
Memory: 131MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.01s
Memory: 131MB (+0MB)
UNSAT
Iteration Time: 0.01s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.64s
Memory: 132MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 153MB (+21MB)
UNSAT
Iteration Time: 1.06s
Iteration 3
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.69s
Memory: 172MB (+19MB)
Unblocking actions...
Solving...
Solving Time: 0.60s
Memory: 192MB (+20MB)
UNSAT
Iteration Time: 1.63s
Iteration 4
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.72s
Memory: 216MB (+24MB)
Unblocking actions...
Solving...
Solving Time: 9.77s
Memory: 253MB (+37MB)
UNKNOWN
Iteration Time: 10.85s
Iteration 5
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.67s
Memory: 267MB (+14MB)
Unblocking actions...
Solving...
Solving Time: 13.66s
Memory: 287MB (+20MB)
UNKNOWN
Iteration Time: 14.72s
Iteration 6
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15, 20]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.67s
Memory: 307MB (+20MB)
Unblocking actions...
Solving...
Solving Time: 16.69s
Memory: 342MB (+35MB)
UNKNOWN
Iteration Time: 17.79s
Iteration 7
Queue: [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15, 20, 25]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.84s
Memory: 367MB (+25MB)
Unblocking actions...
Solving...
Solving Time: 22.16s
Memory: 391MB (+24MB)
UNKNOWN
Iteration Time: 23.44s
Iteration 8
Queue: [35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15, 20, 25, 30]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.68s
Memory: 416MB (+25MB)
Unblocking actions...
Solving...
Solving Time: 24.72s
Memory: 460MB (+44MB)
UNKNOWN
Iteration Time: 25.87s
Iteration 9
Queue: [40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15, 20, 25, 30, 35]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.66s
Memory: 467MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 30.95s
Memory: 493MB (+26MB)
UNKNOWN
Iteration Time: 32.10s
Iteration 10
Queue: [45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15, 20, 25, 30, 35, 40]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.67s
Memory: 509MB (+16MB)
Unblocking actions...
Solving...
Solving Time: 36.37s
Memory: 532MB (+23MB)
UNKNOWN
Iteration Time: 37.53s
Iteration 11
Queue: [50, 55, 60, 65, 70, 75, 80, 85, 90, 15, 20, 25, 30, 35, 40, 45]
Grounded Until: 45
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 0.68s
Memory: 548MB (+16MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package10","truck2","s3")),1) occurs(action(("load-truck","package16","truck5","s2")),1) occurs(action(("load-truck","package4","truck5","s2")),1) occurs(action(("load-truck","package5","truck2","s3")),1) occurs(action(("board-truck","driver4","truck5","s2")),1) occurs(action(("walk","driver1","s11","p11-8")),1) occurs(action(("walk","driver2","s6","p6-10")),1) occurs(action(("walk","driver3","s1","p1-7")),1) occurs(action(("walk","driver5","s4","p18-4")),1) occurs(action(("load-truck","package1","truck2","s3")),2) occurs(action(("drive-truck","truck5","s2","s14","driver4")),2) occurs(action(("walk","driver1","p11-8","s8")),2) occurs(action(("walk","driver2","p6-10","s10")),2) occurs(action(("walk","driver3","p1-7","s7")),2) occurs(action(("walk","driver5","p18-4","s18")),2) occurs(action(("load-truck","package15","truck2","s3")),3) occurs(action(("drive-truck","truck5","s14","s4","driver4")),3) occurs(action(("board-truck","driver1","truck3","s8")),3) occurs(action(("unload-truck","package5","truck2","s3")),3) occurs(action(("unload-truck","package1","truck2","s3")),3) occurs(action(("walk","driver2","s10","p2-10")),3) occurs(action(("walk","driver3","s7","p7-4")),3) occurs(action(("walk","driver5","s18","p18-8")),3) occurs(action(("load-truck","package5","truck2","s3")),4) occurs(action(("drive-truck","truck3","s8","s7","driver1")),4) occurs(action(("walk","driver2","p2-10","s2")),4) occurs(action(("walk","driver3","p7-4","s4")),4) occurs(action(("disembark-truck","driver4","truck5","s4")),4) occurs(action(("walk","driver5","p18-8","s8")),4) occurs(action(("load-truck","package7","truck3","s7")),5) occurs(action(("board-truck","driver5","truck4","s8")),5) occurs(action(("board-truck","driver3","truck5","s4")),5) occurs(action(("unload-truck","package5","truck2","s3")),5) occurs(action(("walk","driver2","s2","p2-12")),5) occurs(action(("walk","driver4","s4","p18-4")),5) occurs(action(("drive-truck","truck3","s7","s3","driver1")),6) occurs(action(("load-truck","package5","truck2","s3")),6) occurs(action(("drive-truck","truck4","s8","s17","driver5")),6) occurs(action(("drive-truck","truck5","s4","s17","driver3")),6) occurs(action(("walk","driver2","p2-12","s12")),6) occurs(action(("load-truck","package1","truck2","s3")),7) occurs(action(("board-truck","driver2","truck1","s12")),7) occurs(action(("unload-truck","package4","truck5","s17")),7) occurs(action(("disembark-truck","driver1","truck3","s3")),7) occurs(action(("disembark-truck","driver3","truck5","s17")),7) occurs(action(("walk","driver4","p18-4","s18")),7) occurs(action(("disembark-truck","driver5","truck4","s17")),7) occurs(action(("board-truck","driver5","truck5","s17")),8) occurs(action(("board-truck","driver3","truck4","s17")),8) occurs(action(("drive-truck","truck1","s12","s14","driver2")),8) occurs(action(("unload-truck","package5","truck2","s3")),8) occurs(action(("walk","driver4","s18","p3-18")),8) occurs(action(("drive-truck","truck5","s17","s8","driver5")),9) occurs(action(("board-truck","driver1","truck2","s3")),9) occurs(action(("drive-truck","truck1","s14","s8","driver2")),9) occurs(action(("walk","driver4","p3-18","s3")),9) occurs(action(("drive-truck","truck4","s17","s8","driver3")),9) occurs(action(("load-truck","package5","truck3","s3")),10) occurs(action(("drive-truck","truck2","s3","s1","driver1")),10) occurs(action(("board-truck","driver4","truck3","s3")),10) occurs(action(("disembark-truck","driver3","truck4","s8")),10) occurs(action(("drive-truck","truck1","s8","s6","driver2")),10) occurs(action(("disembark-truck","driver5","truck5","s8")),10) occurs(action(("drive-truck","truck3","s3","s18","driver4")),11) occurs(action(("drive-truck","truck2","s1","s13","driver1")),11) occurs(action(("board-truck","driver3","truck4","s8")),11) occurs(action(("walk","driver5","s8","p11-8")),11) occurs(action(("drive-truck","truck1","s6","s2","driver2")),12) occurs(action(("drive-truck","truck3","s18","s10","driver4")),12) occurs(action(("unload-truck","package15","truck2","s13")),12) occurs(action(("drive-truck","truck4","s8","s0
Solving Time: 24.17s
Memory: 611MB (+63MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 191.705s (Solving: 178.65s 1st Model: 24.05s Unsat: 0.58s)
CPU Time : 191.530s
Choices : 4005423
Conflicts : 88066 (Analyzed: 88064)
Restarts : 777 (Average: 113.34 Last: 318)
Model-Level : 5591.0
Problems : 11 (Average Length: 27.00 Splits: 0)
Lemmas : 88064 (Deleted: 68520)
Binary : 2214 (Ratio: 2.51%)
Ternary : 814 (Ratio: 0.92%)
Conflict : 88064 (Average Length: 178.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 88064 (Average: 41.50 Max: 9879 Sum: 3654947)
Executed : 87317 (Average: 41.35 Max: 9879 Sum: 3641008 Ratio: 99.62%)
Bounded : 747 (Average: 18.66 Max: 52 Sum: 13939 Ratio: 0.38%)
Rules : 123769
Atoms : 123769
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 495356 (Eliminated: 0 Frozen: 448138)
Constraints : 3176574 (Binary: 97.5% Ternary: 1.4% Other: 1.1%)
Memory Peak : 621MB
Max. Length : 50 steps
Sol. Length : 50 steps