202 lines
7.9 KiB
Plaintext
202 lines
7.9 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-4.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-4.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-4.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-4.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.880s CPU, 0.866s wall-clock]
|
||
|
|
Normalizing task... [0.130s CPU, 0.134s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.100s CPU, 0.102s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.280s CPU, 0.282s wall-clock]
|
||
|
|
Preparing model... [0.180s CPU, 0.187s wall-clock]
|
||
|
|
Generated 2773 rules.
|
||
|
|
Computing model... [0.100s CPU, 0.094s wall-clock]
|
||
|
|
1163 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
1163 final queue length
|
||
|
|
2784 total queue pushes
|
||
|
|
Completing instantiation... [0.180s CPU, 0.187s wall-clock]
|
||
|
|
Instantiating: [0.860s CPU, 0.865s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
225 initial candidates
|
||
|
|
Finding invariants: [11.340s CPU, 11.342s wall-clock]
|
||
|
|
Checking invariant weight... [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
174 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Computing fact groups: [11.450s CPU, 11.449s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Translating task: [0.480s CPU, 0.478s 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.160s CPU, 0.167s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
16 of 184 variables necessary.
|
||
|
|
186 of 198 mutex groups necessary.
|
||
|
|
936 of 936 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.060s CPU, 0.058s wall-clock]
|
||
|
|
Translator variables: 16
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 69
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 186
|
||
|
|
Translator total mutex groups size: 942
|
||
|
|
Translator operators: 936
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 5170
|
||
|
|
Translator peak memory: 48084 KB
|
||
|
|
Writing output... [0.100s CPU, 0.104s wall-clock]
|
||
|
|
Done! [14.160s CPU, 14.162s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.15s
|
||
|
|
Memory: 54MB
|
||
|
|
|
||
|
|
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: 54MB (+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: 54MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 57MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 57MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.04s
|
||
|
|
|
||
|
|
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: 60.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 58MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.46s
|
||
|
|
Memory: 59MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.50s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 62.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 62MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 63MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.11s
|
||
|
|
Memory: 64MB (+1MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.71s
|
||
|
|
Memory: 65MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.87s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 69.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.05s
|
||
|
|
Memory: 68MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.00s
|
||
|
|
Memory: 71MB (+3MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.06s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 77.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.05s
|
||
|
|
Memory: 73MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 75MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 75MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("drive_truck1_l2_l3_t0_t1"),1) occurs(action("load_package2_truck1_a2_l3"),2) occurs(action("drive_truck1_l3_l2_t1_t2"),3) occurs(action("unload_package2_truck1_a2_l2"),4) occurs(action("drive_truck1_l2_l1_t2_t3"),5) occurs(action("load_package3_truck1_a1_l1"),6) occurs(action("drive_truck1_l1_l3_t3_t4"),7) occurs(action("unload_package3_truck1_a1_l3"),8) occurs(action("drive_truck1_l3_l1_t4_t5"),9) occurs(action("deliver_package3_l3_t5_t6"),10) occurs(action("load_package4_truck1_a1_l1"),10) occurs(action("drive_truck1_l1_l3_t5_t6"),11) occurs(action("unload_package4_truck1_a1_l3"),12) occurs(action("load_package1_truck1_a1_l3"),13) occurs(action("drive_truck1_l3_l2_t6_t7"),14) occurs(action("unload_package1_truck1_a1_l2"),15) occurs(action("drive_truck1_l2_l3_t7_t8"),16) occurs(action("deliver_package1_l2_t8_t9"),17) occurs(action("load_package5_truck1_a2_l3"),17) occurs(action("load_package6_truck1_a1_l3"),18) occurs(action("drive_truck1_l3_l2_t8_t9"),19) occurs(action("unload_package6_truck1_a1_l2"),20) occurs(action("unload_package5_truck1_a2_l2"),21) occurs(action("deliver_package2_l2_t9_t9"),22) occurs(action("deliver_package5_l2_t9_t9"),23) occurs(action("deliver_package6_l2_t9_t9"),24) occurs(action("deliver_package4_l3_t9_t9"),25)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 7
|
||
|
|
Time : 2.648s (Solving: 2.19s 1st Model: 0.04s Unsat: 0.00s)
|
||
|
|
CPU Time : 2.636s
|
||
|
|
|
||
|
|
Choices : 63572 (Domain: 63565)
|
||
|
|
Conflicts : 24527 (Analyzed: 24526)
|
||
|
|
Restarts : 302 (Average: 81.21 Last: 121)
|
||
|
|
Model-Level : 176.5
|
||
|
|
Problems : 7 (Average Length: 14.86 Splits: 0)
|
||
|
|
Lemmas : 24526 (Deleted: 19497)
|
||
|
|
Binary : 367 (Ratio: 1.50%)
|
||
|
|
Ternary : 126 (Ratio: 0.51%)
|
||
|
|
Conflict : 24526 (Average Length: 148.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 24526 (Average: 1.90 Max: 99 Sum: 46645)
|
||
|
|
Executed : 24502 (Average: 1.89 Max: 99 Sum: 46291 Ratio: 99.24%)
|
||
|
|
Bounded : 24 (Average: 14.75 Max: 17 Sum: 354 Ratio: 0.76%)
|
||
|
|
|
||
|
|
Rules : 23747 (Original: 23719)
|
||
|
|
Atoms : 15603
|
||
|
|
Bodies : 7399 (Original: 7370)
|
||
|
|
Count : 118 (Original: 120)
|
||
|
|
Equivalences : 3803 (Atom=Atom: 30 Body=Body: 0 Other: 3773)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 11490 (Eliminated: 0 Frozen: 7580)
|
||
|
|
Constraints : 76401 (Binary: 95.7% Ternary: 2.3% Other: 2.0%)
|
||
|
|
|
||
|
|
Memory Peak : 75MB
|
||
|
|
Max. Length : 25 steps
|
||
|
|
Sol. Length : 25 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|