tplp-planning-benchmark/gc-ta5-tt1/ipc-2002_driverlog-strips-automatic_14.out

289 lines
12 KiB
Plaintext

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-14.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-14.pddl
Parsing...
Parsing: [0.020s CPU, 0.027s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.021s wall-clock]
Preparing model... [0.030s CPU, 0.023s wall-clock]
Generated 35 rules.
Computing model... [0.200s CPU, 0.199s wall-clock]
1580 relevant atoms
947 auxiliary atoms
2527 final queue length
3598 total queue pushes
Completing instantiation... [0.220s CPU, 0.229s wall-clock]
Instantiating: [0.490s CPU, 0.484s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.010s CPU, 0.019s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.020s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.056s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.013s wall-clock]
Translating task: [0.240s CPU, 0.249s wall-clock]
90 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [0.130s CPU, 0.133s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
3 of 15 mutex groups necessary.
1158 of 1158 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.035s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 195
Translator goal facts: 9
Translator mutex groups: 3
Translator total mutex groups size: 12
Translator operators: 1158
Translator axioms: 0
Translator task size: 4965
Translator peak memory: 39628 KB
Writing output... [0.100s CPU, 0.108s wall-clock]
Done! [1.090s CPU, 1.108s wall-clock]
planner.py version 0.0.1
Time: 0.20s
Memory: 61MB
Iteration 1
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 61MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.05s
Memory: 61MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+2MB)
UNSAT
Iteration Time: 0.09s
Iteration 3
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.06s
Memory: 67MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 70MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.17s
Memory: 77MB (+7MB)
Solving...
Solving Time: 0.07s
Memory: 77MB (+0MB)
UNSAT
Iteration Time: 0.34s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.07s
Memory: 75MB (+-2MB)
Unblocking actions...
Solving...
Solving Time: 1.02s
Memory: 78MB (+3MB)
UNKNOWN
Iteration Time: 1.12s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.07s
Memory: 82MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 1.34s
Memory: 86MB (+4MB)
UNKNOWN
Iteration Time: 1.45s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.08s
Memory: 93MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 1.87s
Memory: 98MB (+5MB)
UNKNOWN
Iteration Time: 2.00s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.07s
Memory: 104MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 3.02s
Memory: 106MB (+2MB)
UNKNOWN
Iteration Time: 3.14s
Iteration 8
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 1.16s
Memory: 107MB (+1MB)
UNKNOWN
Iteration Time: 1.16s
Iteration 9
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 1.69s
Memory: 108MB (+1MB)
UNKNOWN
Iteration Time: 1.70s
Iteration 10
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 2.15s
Memory: 113MB (+5MB)
UNKNOWN
Iteration Time: 2.16s
Iteration 11
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 2.78s
Memory: 115MB (+2MB)
UNKNOWN
Iteration Time: 2.78s
Iteration 12
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.06s
Memory: 115MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 3.75s
Memory: 119MB (+4MB)
UNKNOWN
Iteration Time: 3.87s
Iteration 13
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.06s
Memory: 119MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 3.35s
Memory: 122MB (+3MB)
UNKNOWN
Iteration Time: 3.47s
Iteration 14
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.07s
Memory: 125MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 129MB (+4MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 129MB (+0MB)
Answer: 2
occurs(action(("board-truck","driver2","truck1","s2")),1) occurs(action(("drive-truck","truck1","s2","s0","driver2")),2) occurs(action(("drive-truck","truck1","s0","s8","driver2")),3) occurs(action(("disembark-truck","driver2","truck1","s8")),4) occurs(action(("board-truck","driver2","truck3","s8")),5) occurs(action(("drive-truck","truck3","s8","s9","driver2")),6) occurs(action(("drive-truck","truck3","s9","s3","driver2")),7) occurs(action(("disembark-truck","driver2","truck3","s3")),8) occurs(action(("walk","driver2","s3","p8-3")),9) occurs(action(("walk","driver2","p8-3","s8")),10) occurs(action(("board-truck","driver2","truck1","s8")),11) occurs(action(("drive-truck","truck1","s8","s6","driver2")),12) occurs(action(("disembark-truck","driver2","truck1","s6")),13) occurs(action(("walk","driver2","s6","p6-2")),14) occurs(action(("walk","driver2","p6-2","s2")),15) occurs(action(("walk","driver2","s2","p1-2")),16) occurs(action(("walk","driver2","p1-2","s1")),17) occurs(action(("board-truck","driver2","truck2","s1")),18) occurs(action(("drive-truck","truck2","s1","s5","driver2")),19) occurs(action(("load-truck","package1","truck2","s5")),20) occurs(action(("drive-truck","truck2","s5","s0","driver2")),21) occurs(action(("unload-truck","package1","truck2","s0")),22) occurs(action(("drive-truck","truck2","s0","s5","driver2")),23) occurs(action(("load-truck","package2","truck2","s5")),24) occurs(action(("drive-truck","truck2","s5","s0","driver2")),25) occurs(action(("unload-truck","package2","truck2","s0")),26) occurs(action(("drive-truck","truck2","s0","s3","driver2")),27) occurs(action(("load-truck","package4","truck2","s3")),28) occurs(action(("drive-truck","truck2","s3","s9","driver2")),29) occurs(action(("drive-truck","truck2","s9","s4","driver2")),30) occurs(action(("unload-truck","package4","truck2","s4")),31) occurs(action(("load-truck","package6","truck2","s4")),32) occurs(action(("drive-truck","truck2","s4","s5","driver2")),33) occurs(action(("unload-truck","package6","truck2","s5")),34) occurs(action(("drive-truck","truck2","s5","s4","driver2")),35) occurs(action(("drive-truck","truck2","s4","s9","driver2")),36) occurs(action(("load-truck","package3","truck2","s9")),37) occurs(action(("drive-truck","truck2","s9","s4","driver2")),38) occurs(action(("unload-truck","package3","truck2","s4")),39) occurs(action(("drive-truck","truck2","s4","s1","driver2")),40) occurs(action(("load-truck","package5","truck2","s1")),41) occurs(action(("drive-truck","truck2","s1","s3","driver2")),42) occurs(action(("unload-truck","package5","truck2","s3")),43) occurs(action(("walk","driver3","s2","p1-2")),44) occurs(action(("walk","driver3","p1-2","s1")),45)
SATISFIABLE
Models : 1+
Calls : 15
Time : 23.477s (Solving: 22.15s 1st Model: 0.02s Unsat: 0.07s)
CPU Time : 23.468s
Choices : 3714355 (Domain: 3714345)
Conflicts : 95098 (Analyzed: 95097)
Restarts : 1013 (Average: 93.88 Last: 140)
Model-Level : 556.5
Problems : 15 (Average Length: 25.67 Splits: 0)
Lemmas : 95097 (Deleted: 79535)
Binary : 2093 (Ratio: 2.20%)
Ternary : 387 (Ratio: 0.41%)
Conflict : 95097 (Average Length: 266.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 95097 (Average: 35.50 Max: 1453 Sum: 3376027)
Executed : 95015 (Average: 35.50 Max: 1453 Sum: 3375750 Ratio: 99.99%)
Bounded : 82 (Average: 3.38 Max: 32 Sum: 277 Ratio: 0.01%)
Rules : 16364
Atoms : 16354
Bodies : 21 (Original: 20)
Count : 10
Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20)
Tight : Yes
Variables : 68717 (Eliminated: 0 Frozen: 55156)
Constraints : 310287 (Binary: 94.5% Ternary: 3.2% Other: 2.3%)
Memory Peak : 136MB
Max. Length : 45 steps
Sol. Length : 45 steps
Models : 2