174 lines
6.7 KiB
Plaintext
174 lines
6.7 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-2.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-2.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-2.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.340s CPU, 0.343s wall-clock]
|
||
|
|
Normalizing task... [0.050s CPU, 0.049s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.030s CPU, 0.036s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.100s CPU, 0.094s wall-clock]
|
||
|
|
Preparing model... [0.060s CPU, 0.069s wall-clock]
|
||
|
|
Generated 985 rules.
|
||
|
|
Computing model... [0.030s CPU, 0.033s wall-clock]
|
||
|
|
454 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
454 final queue length
|
||
|
|
994 total queue pushes
|
||
|
|
Completing instantiation... [0.070s CPU, 0.068s wall-clock]
|
||
|
|
Instantiating: [0.300s CPU, 0.305s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
116 initial candidates
|
||
|
|
Finding invariants: [3.490s CPU, 3.482s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
82 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [3.540s CPU, 3.531s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Translating task: [0.140s CPU, 0.148s wall-clock]
|
||
|
|
24 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
2 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.060s CPU, 0.061s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
11 of 88 variables necessary.
|
||
|
|
5 of 97 mutex groups necessary.
|
||
|
|
336 of 336 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.030s CPU, 0.023s wall-clock]
|
||
|
|
Translator variables: 11
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 48
|
||
|
|
Translator goal facts: 4
|
||
|
|
Translator mutex groups: 5
|
||
|
|
Translator total mutex groups size: 28
|
||
|
|
Translator operators: 336
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1594
|
||
|
|
Translator peak memory: 40652 KB
|
||
|
|
Writing output... [0.030s CPU, 0.035s wall-clock]
|
||
|
|
Done! [4.510s CPU, 4.515s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.06s
|
||
|
|
Memory: 51MB
|
||
|
|
|
||
|
|
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: 51MB (+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
|
||
|
|
Expected Memory: 51MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.02s
|
||
|
|
|
||
|
|
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: 53.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.04s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.10s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 55.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("drive_truck1_l2_l1_t0_t1"),1) occurs(action("load_package1_truck1_a2_l1"),2) occurs(action("load_package2_truck1_a1_l1"),3) occurs(action("drive_truck1_l1_l2_t1_t2"),4) occurs(action("unload_package2_truck1_a1_l2"),5) occurs(action("deliver_package2_l2_t2_t3"),6) occurs(action("unload_package1_truck1_a2_l2"),6) occurs(action("deliver_package1_l2_t2_t3"),7) occurs(action("drive_truck1_l2_l1_t2_t3"),8) occurs(action("load_package4_truck1_a2_l1"),9) occurs(action("load_package3_truck1_a1_l1"),10) occurs(action("drive_truck1_l1_l2_t3_t4"),11) occurs(action("unload_package3_truck1_a1_l2"),12) occurs(action("drive_truck1_l2_l3_t4_t5"),13) occurs(action("deliver_package3_l2_t5_t6"),14) occurs(action("unload_package4_truck1_a2_l3"),14) occurs(action("deliver_package4_l3_t5_t6"),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 0.187s (Solving: 0.05s 1st Model: 0.02s Unsat: 0.03s)
|
||
|
|
CPU Time : 0.184s
|
||
|
|
|
||
|
|
Choices : 1996 (Domain: 1988)
|
||
|
|
Conflicts : 1095 (Analyzed: 1093)
|
||
|
|
Restarts : 13 (Average: 84.08 Last: 55)
|
||
|
|
Model-Level : 45.0
|
||
|
|
Problems : 5 (Average Length: 10.00 Splits: 0)
|
||
|
|
Lemmas : 1093 (Deleted: 0)
|
||
|
|
Binary : 27 (Ratio: 2.47%)
|
||
|
|
Ternary : 23 (Ratio: 2.10%)
|
||
|
|
Conflict : 1093 (Average Length: 61.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1093 (Average: 1.85 Max: 28 Sum: 2021)
|
||
|
|
Executed : 1068 (Average: 1.68 Max: 28 Sum: 1831 Ratio: 90.60%)
|
||
|
|
Bounded : 25 (Average: 7.60 Max: 12 Sum: 190 Ratio: 9.40%)
|
||
|
|
|
||
|
|
Rules : 7304 (Original: 7294)
|
||
|
|
Atoms : 5214
|
||
|
|
Bodies : 1801 (Original: 1790)
|
||
|
|
Count : 57 (Original: 59)
|
||
|
|
Equivalences : 969 (Atom=Atom: 20 Body=Body: 0 Other: 949)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 3231 (Eliminated: 0 Frozen: 1622)
|
||
|
|
Constraints : 17504 (Binary: 92.7% Ternary: 3.9% Other: 3.4%)
|
||
|
|
|
||
|
|
Memory Peak : 55MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|