216 lines
8.7 KiB
Plaintext
216 lines
8.7 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-6.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-6.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-2006/domains/trucks-propositional-strips/domains/domain-6.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-6.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [1.890s CPU, 1.896s wall-clock]
|
||
|
|
Normalizing task... [0.300s CPU, 0.300s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.230s CPU, 0.225s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.600s CPU, 0.605s wall-clock]
|
||
|
|
Preparing model... [0.480s CPU, 0.472s wall-clock]
|
||
|
|
Generated 6073 rules.
|
||
|
|
Computing model... [0.200s CPU, 0.202s wall-clock]
|
||
|
|
2412 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
2412 final queue length
|
||
|
|
6086 total queue pushes
|
||
|
|
Completing instantiation... [0.410s CPU, 0.408s wall-clock]
|
||
|
|
Instantiating: [1.940s CPU, 1.940s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
370 initial candidates
|
||
|
|
Finding invariants: [32.560s CPU, 32.559s wall-clock]
|
||
|
|
Checking invariant weight... [0.050s CPU, 0.048s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
304 uncovered facts
|
||
|
|
Choosing groups: [0.040s CPU, 0.035s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Computing fact groups: [32.750s CPU, 32.746s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.020s CPU, 0.029s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.020s CPU, 0.028s wall-clock]
|
||
|
|
Translating task: [1.210s CPU, 1.210s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
4 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.360s CPU, 0.358s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
18 of 316 variables necessary.
|
||
|
|
320 of 335 mutex groups necessary.
|
||
|
|
2040 of 2040 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.110s CPU, 0.117s wall-clock]
|
||
|
|
Translator variables: 18
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 86
|
||
|
|
Translator goal facts: 8
|
||
|
|
Translator mutex groups: 320
|
||
|
|
Translator total mutex groups size: 1614
|
||
|
|
Translator operators: 2040
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 10417
|
||
|
|
Translator peak memory: 64336 KB
|
||
|
|
Writing output... [0.190s CPU, 0.214s wall-clock]
|
||
|
|
Done! [38.840s CPU, 38.853s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.24s
|
||
|
|
Memory: 59MB
|
||
|
|
|
||
|
|
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: 60MB (+1MB)
|
||
|
|
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
|
||
|
|
Expected Memory: 60MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 63MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 64MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.08s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 68.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.05s
|
||
|
|
Memory: 66MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.51s
|
||
|
|
Memory: 67MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.58s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 71.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 71MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.82s
|
||
|
|
Memory: 75MB (+4MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.90s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 83.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 78MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 80MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.24s
|
||
|
|
Memory: 84MB (+4MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.24s
|
||
|
|
Memory: 84MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.56s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 92.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.08s
|
||
|
|
Memory: 86MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.67s
|
||
|
|
Memory: 97MB (+11MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.77s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 25
|
||
|
|
Expected Memory: 110.0MB
|
||
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
|
Grounding Time: 0.08s
|
||
|
|
Memory: 101MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.06s
|
||
|
|
Memory: 103MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 103MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("load_package2_truck1_a1_l1"),1) occurs(action("drive_truck1_l1_l2_t0_t1"),2) occurs(action("unload_package2_truck1_a1_l2"),3) occurs(action("deliver_package2_l2_t1_t9"),4) occurs(action("load_package5_truck1_a1_l2"),4) occurs(action("drive_truck1_l2_l3_t1_t2"),5) occurs(action("unload_package5_truck1_a1_l3"),6) occurs(action("deliver_package5_l3_t2_t9"),7) occurs(action("load_package8_truck1_a2_l3"),7) occurs(action("drive_truck1_l3_l1_t2_t3"),8) occurs(action("unload_package8_truck1_a2_l1"),9) occurs(action("drive_truck1_l1_l3_t3_t4"),10) occurs(action("deliver_package8_l1_t4_t12"),11) occurs(action("load_package3_truck1_a2_l3"),11) occurs(action("drive_truck1_l3_l1_t4_t5"),12) occurs(action("unload_package3_truck1_a2_l1"),13) occurs(action("drive_truck1_l1_l3_t5_t6"),14) occurs(action("deliver_package3_l1_t6_t12"),15) occurs(action("load_package4_truck1_a2_l3"),15) occurs(action("drive_truck1_l3_l1_t6_t7"),16) occurs(action("unload_package4_truck1_a2_l1"),17) occurs(action("drive_truck1_l1_l3_t7_t8"),18) occurs(action("deliver_package4_l1_t8_t9"),19) occurs(action("load_package7_truck1_a2_l3"),19) occurs(action("drive_truck1_l3_l2_t8_t9"),20) occurs(action("unload_package7_truck1_a2_l2"),21) occurs(action("drive_truck1_l2_l1_t9_t10"),22) occurs(action("load_package1_truck1_a2_l1"),23) occurs(action("drive_truck1_l1_l2_t10_t11"),24) occurs(action("unload_package1_truck1_a2_l2"),25) occurs(action("deliver_package1_l2_t11_t12"),26) occurs(action("load_package6_truck1_a2_l2"),26) occurs(action("drive_truck1_l2_l3_t11_t12"),27) occurs(action("unload_package6_truck1_a2_l3"),28) occurs(action("deliver_package6_l3_t12_t12"),29) occurs(action("deliver_package7_l2_t12_t12"),30)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 8
|
||
|
|
Time : 5.144s (Solving: 4.27s 1st Model: 0.05s Unsat: 0.00s)
|
||
|
|
CPU Time : 5.132s
|
||
|
|
|
||
|
|
Choices : 101633 (Domain: 101526)
|
||
|
|
Conflicts : 33236 (Analyzed: 33235)
|
||
|
|
Restarts : 402 (Average: 82.67 Last: 97)
|
||
|
|
Model-Level : 350.5
|
||
|
|
Problems : 8 (Average Length: 17.62 Splits: 0)
|
||
|
|
Lemmas : 33235 (Deleted: 28215)
|
||
|
|
Binary : 328 (Ratio: 0.99%)
|
||
|
|
Ternary : 90 (Ratio: 0.27%)
|
||
|
|
Conflict : 33235 (Average Length: 326.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 33235 (Average: 1.68 Max: 154 Sum: 55898)
|
||
|
|
Executed : 33221 (Average: 1.67 Max: 154 Sum: 55618 Ratio: 99.50%)
|
||
|
|
Bounded : 14 (Average: 20.00 Max: 22 Sum: 280 Ratio: 0.50%)
|
||
|
|
|
||
|
|
Rules : 51298
|
||
|
|
Atoms : 31422
|
||
|
|
Bodies : 18457 (Original: 18456)
|
||
|
|
Count : 203
|
||
|
|
Equivalences : 9391 (Atom=Atom: 40 Body=Body: 0 Other: 9351)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 22741 (Eliminated: 0 Frozen: 16192)
|
||
|
|
Constraints : 157510 (Binary: 96.7% Ternary: 1.7% Other: 1.5%)
|
||
|
|
|
||
|
|
Memory Peak : 105MB
|
||
|
|
Max. Length : 30 steps
|
||
|
|
Sol. Length : 30 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|