174 lines
6.6 KiB
Plaintext
174 lines
6.6 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-1.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-1.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-1.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-1.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.260s CPU, 0.267s wall-clock]
|
||
|
|
Normalizing task... [0.040s CPU, 0.037s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.030s CPU, 0.028s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.080s CPU, 0.077s wall-clock]
|
||
|
|
Preparing model... [0.050s CPU, 0.051s wall-clock]
|
||
|
|
Generated 766 rules.
|
||
|
|
Computing model... [0.030s CPU, 0.026s wall-clock]
|
||
|
|
353 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
353 final queue length
|
||
|
|
774 total queue pushes
|
||
|
|
Completing instantiation... [0.050s CPU, 0.054s wall-clock]
|
||
|
|
Instantiating: [0.240s CPU, 0.239s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
90 initial candidates
|
||
|
|
Finding invariants: [1.910s CPU, 1.905s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
62 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [1.940s CPU, 1.941s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Translating task: [0.120s CPU, 0.114s wall-clock]
|
||
|
|
18 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
2 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.040s CPU, 0.047s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
10 of 67 variables necessary.
|
||
|
|
5 of 75 mutex groups necessary.
|
||
|
|
261 of 261 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Translator variables: 10
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 41
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 5
|
||
|
|
Translator total mutex groups size: 26
|
||
|
|
Translator operators: 261
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1262
|
||
|
|
Translator peak memory: 39116 KB
|
||
|
|
Writing output... [0.030s CPU, 0.028s wall-clock]
|
||
|
|
Done! [2.700s CPU, 2.706s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.04s
|
||
|
|
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.01s
|
||
|
|
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: 52MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.03s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.06s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 54.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("drive_truck1_l3_l2_t0_t1"),1) occurs(action("load_package1_truck1_a2_l2"),2) occurs(action("drive_truck1_l2_l3_t1_t2"),3) occurs(action("unload_package1_truck1_a2_l3"),4) occurs(action("deliver_package1_l3_t2_t3"),5) occurs(action("drive_truck1_l3_l2_t2_t3"),6) occurs(action("load_package2_truck1_a2_l2"),7) occurs(action("drive_truck1_l2_l1_t3_t4"),8) occurs(action("unload_package2_truck1_a2_l1"),9) occurs(action("deliver_package2_l1_t4_t6"),10) occurs(action("drive_truck1_l1_l2_t4_t5"),11) occurs(action("load_package3_truck1_a2_l2"),12) occurs(action("drive_truck1_l2_l1_t5_t6"),13) occurs(action("unload_package3_truck1_a2_l1"),14) occurs(action("deliver_package3_l1_t6_t6"),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 0.121s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.01s)
|
||
|
|
CPU Time : 0.116s
|
||
|
|
|
||
|
|
Choices : 1097 (Domain: 1075)
|
||
|
|
Conflicts : 540 (Analyzed: 538)
|
||
|
|
Restarts : 5 (Average: 107.60 Last: 57)
|
||
|
|
Model-Level : 46.5
|
||
|
|
Problems : 5 (Average Length: 10.00 Splits: 0)
|
||
|
|
Lemmas : 538 (Deleted: 0)
|
||
|
|
Binary : 23 (Ratio: 4.28%)
|
||
|
|
Ternary : 21 (Ratio: 3.90%)
|
||
|
|
Conflict : 538 (Average Length: 64.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 538 (Average: 2.10 Max: 26 Sum: 1131)
|
||
|
|
Executed : 522 (Average: 1.87 Max: 26 Sum: 1005 Ratio: 88.86%)
|
||
|
|
Bounded : 16 (Average: 7.88 Max: 12 Sum: 126 Ratio: 11.14%)
|
||
|
|
|
||
|
|
Rules : 5934 (Original: 5930)
|
||
|
|
Atoms : 4172
|
||
|
|
Bodies : 1499 (Original: 1494)
|
||
|
|
Count : 49 (Original: 51)
|
||
|
|
Equivalences : 845 (Atom=Atom: 20 Body=Body: 0 Other: 825)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 2799 (Eliminated: 0 Frozen: 1421)
|
||
|
|
Constraints : 15008 (Binary: 92.8% Ternary: 3.7% Other: 3.5%)
|
||
|
|
|
||
|
|
Memory Peak : 54MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|