195 lines
8.3 KiB
Plaintext
195 lines
8.3 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.024s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.190s CPU, 0.191s wall-clock]
|
||
|
|
1580 relevant atoms
|
||
|
|
947 auxiliary atoms
|
||
|
|
2527 final queue length
|
||
|
|
3598 total queue pushes
|
||
|
|
Completing instantiation... [0.220s CPU, 0.228s wall-clock]
|
||
|
|
Instantiating: [0.460s CPU, 0.469s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.060s 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.000s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.020s CPU, 0.013s wall-clock]
|
||
|
|
Translating task: [0.250s 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.070s CPU, 1.089s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.19s
|
||
|
|
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.06s
|
||
|
|
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: 68MB (+5MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 70MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.16s
|
||
|
|
Memory: 77MB (+7MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 76MB (+-1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.16s
|
||
|
|
Memory: 78MB (+2MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 78MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.16s
|
||
|
|
Memory: 78MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 78MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.16s
|
||
|
|
Memory: 79MB (+1MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.37s
|
||
|
|
Memory: 79MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.16s
|
||
|
|
|
||
|
|
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: 79MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 81MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.14s
|
||
|
|
Memory: 88MB (+7MB)
|
||
|
|
Answer: 5
|
||
|
|
occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("walk","driver3","s2","p1-2")),1) occurs(action(("board-truck","driver2","truck1","s2")),1) occurs(action(("walk","driver1","s9","p9-4")),1) occurs(action(("walk","driver3","p1-2","s1")),2) occurs(action(("drive-truck","truck1","s2","s3","driver2")),2) occurs(action(("walk","driver1","p9-4","s4")),2) occurs(action(("drive-truck","truck1","s3","s6","driver2")),3) occurs(action(("walk","driver1","s4","p4-6")),3) occurs(action(("walk","driver1","p4-6","s6")),4) occurs(action(("disembark-truck","driver2","truck1","s6")),4) occurs(action(("walk","driver1","s6","p6-2")),5) occurs(action(("walk","driver2","s6","p6-8")),5) occurs(action(("walk","driver1","p6-2","s2")),6) occurs(action(("walk","driver2","p6-8","s8")),6) occurs(action(("board-truck","driver2","truck3","s8")),7) occurs(action(("walk","driver1","s2","p1-2")),7) occurs(action(("drive-truck","truck3","s8","s9","driver2")),8) occurs(action(("walk","driver1","p1-2","s1")),8) occurs(action(("drive-truck","truck3","s9","s3","driver2")),9) occurs(action(("board-truck","driver1","truck2","s1")),9) occurs(action(("drive-truck","truck2","s1","s3","driver1")),10) occurs(action(("unload-truck","package5","truck2","s3")),11) occurs(action(("load-truck","package4","truck2","s3")),11) occurs(action(("drive-truck","truck2","s3","s9","driver1")),11) occurs(action(("load-truck","package3","truck2","s9")),12) occurs(action(("drive-truck","truck2","s9","s4","driver1")),12) occurs(action(("unload-truck","package3","truck2","s4")),13) occurs(action(("unload-truck","package4","truck2","s4")),13) occurs(action(("load-truck","package6","truck2","s4")),13) occurs(action(("drive-truck","truck2","s4","s5","driver1")),13) occurs(action(("unload-truck","package6","truck2","s5")),14) occurs(action(("load-truck","package1","truck2","s5")),14) occurs(action(("load-truck","package2","truck2","s5")),14) occurs(action(("drive-truck","truck2","s5","s0","driver1")),14) occurs(action(("unload-truck","package1","truck2","s0")),15) occurs(action(("unload-truck","package2","truck2","s0")),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 8
|
||
|
|
Time : 0.980s (Solving: 0.41s 1st Model: 0.03s Unsat: 0.37s)
|
||
|
|
CPU Time : 0.968s
|
||
|
|
|
||
|
|
Choices : 10782 (Domain: 10759)
|
||
|
|
Conflicts : 2933 (Analyzed: 2932)
|
||
|
|
Restarts : 33 (Average: 88.85 Last: 56)
|
||
|
|
Model-Level : 136.6
|
||
|
|
Problems : 8 (Average Length: 10.75 Splits: 0)
|
||
|
|
Lemmas : 2932 (Deleted: 1064)
|
||
|
|
Binary : 39 (Ratio: 1.33%)
|
||
|
|
Ternary : 20 (Ratio: 0.68%)
|
||
|
|
Conflict : 2932 (Average Length: 148.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 2932 (Average: 3.44 Max: 112 Sum: 10094)
|
||
|
|
Executed : 2897 (Average: 3.32 Max: 112 Sum: 9740 Ratio: 96.49%)
|
||
|
|
Bounded : 35 (Average: 10.11 Max: 12 Sum: 354 Ratio: 3.51%)
|
||
|
|
|
||
|
|
Rules : 28147 (Original: 28140)
|
||
|
|
Atoms : 17851
|
||
|
|
Bodies : 10127 (Original: 10119)
|
||
|
|
Count : 84 (Original: 86)
|
||
|
|
Equivalences : 5638 (Atom=Atom: 44 Body=Body: 0 Other: 5594)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 22100 (Eliminated: 0 Frozen: 14017)
|
||
|
|
Constraints : 96248 (Binary: 94.9% Ternary: 2.8% Other: 2.2%)
|
||
|
|
|
||
|
|
Memory Peak : 88MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 5
|
||
|
|
|
||
|
|
|