tplp-planning-benchmark/gc-ta1-tt1/ipc-2006_trucks-propositional-strips_5.out

202 lines
8.1 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-5.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-5.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-5.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-5.pddl
Parsing...
Parsing: [1.680s CPU, 1.685s wall-clock]
Normalizing task... [0.260s CPU, 0.265s wall-clock]
Instantiating...
Generating Datalog program... [0.190s CPU, 0.196s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.530s CPU, 0.533s wall-clock]
Preparing model... [0.360s CPU, 0.358s wall-clock]
Generated 5341 rules.
Computing model... [0.180s CPU, 0.177s wall-clock]
2122 relevant atoms
0 auxiliary atoms
2122 final queue length
5353 total queue pushes
Completing instantiation... [0.410s CPU, 0.407s wall-clock]
Instantiating: [1.700s CPU, 1.697s wall-clock]
Computing fact groups...
Finding invariants...
326 initial candidates
Finding invariants: [16.850s CPU, 16.846s wall-clock]
Checking invariant weight... [0.040s CPU, 0.040s wall-clock]
Instantiating groups... [0.010s CPU, 0.014s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
Choosing groups...
266 uncovered facts
Choosing groups: [0.030s CPU, 0.030s wall-clock]
Building translation key... [0.010s CPU, 0.009s wall-clock]
Computing fact groups: [17.020s CPU, 17.008s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.015s wall-clock]
Building mutex information...
Building mutex information: [0.040s CPU, 0.029s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.023s wall-clock]
Translating task: [1.050s CPU, 1.057s 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.370s CPU, 0.372s wall-clock]
Reordering and filtering variables...
17 of 277 variables necessary.
280 of 295 mutex groups necessary.
1794 of 1794 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.110s CPU, 0.104s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 79
Translator goal facts: 7
Translator mutex groups: 280
Translator total mutex groups size: 1413
Translator operators: 1794
Translator axioms: 0
Translator task size: 9259
Translator peak memory: 55524 KB
Writing output... [0.180s CPU, 0.192s wall-clock]
Done! [22.440s CPU, 22.447s wall-clock]
planner.py version 0.0.1
Time: 0.22s
Memory: 58MB
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: 58MB (+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: 58MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.05s
Memory: 61MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 62MB (+1MB)
UNSAT
Iteration Time: 0.06s
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: 66.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.06s
Memory: 65MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.56s
Memory: 66MB (+1MB)
UNKNOWN
Iteration Time: 0.63s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 70.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.05s
Memory: 70MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 72MB (+2MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.20s
Memory: 72MB (+0MB)
Solving...
Solving Time: 1.03s
Memory: 74MB (+2MB)
UNKNOWN
Iteration Time: 1.31s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 80.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.09s
Memory: 80MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 1.23s
Memory: 84MB (+4MB)
UNKNOWN
Iteration Time: 1.34s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 94.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.08s
Memory: 87MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 90MB (+3MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 90MB (+0MB)
Answer: 2
occurs(action("load_package3_truck1_a2_l2"),1) occurs(action("drive_truck1_l2_l1_t0_t1"),2) occurs(action("unload_package3_truck1_a2_l1"),3) occurs(action("deliver_package3_l1_t1_t6"),4) occurs(action("load_package1_truck1_a2_l1"),4) occurs(action("drive_truck1_l1_l3_t1_t2"),5) occurs(action("unload_package1_truck1_a2_l3"),6) occurs(action("deliver_package1_l3_t2_t9"),7) occurs(action("load_package6_truck1_a2_l3"),7) occurs(action("drive_truck1_l3_l2_t2_t3"),8) occurs(action("unload_package6_truck1_a2_l2"),9) occurs(action("deliver_package6_l2_t3_t9"),10) occurs(action("load_package7_truck1_a2_l2"),10) occurs(action("drive_truck1_l2_l1_t3_t4"),11) occurs(action("unload_package7_truck1_a2_l1"),12) occurs(action("deliver_package7_l1_t4_t9"),13) occurs(action("load_package2_truck1_a2_l1"),13) occurs(action("drive_truck1_l1_l2_t4_t5"),14) occurs(action("unload_package2_truck1_a2_l2"),15) occurs(action("drive_truck1_l2_l3_t5_t6"),16) occurs(action("deliver_package2_l2_t6_t8"),17) occurs(action("load_package5_truck1_a2_l3"),17) occurs(action("drive_truck1_l3_l2_t6_t7"),18) occurs(action("unload_package5_truck1_a2_l2"),19) occurs(action("deliver_package5_l2_t7_t9"),20) occurs(action("load_package4_truck1_a2_l2"),20) occurs(action("drive_truck1_l2_l3_t7_t8"),21) occurs(action("unload_package4_truck1_a2_l3"),22) occurs(action("deliver_package4_l3_t8_t10"),23) occurs(action("drive_truck1_l3_l2_t8_t9"),24) occurs(action("drive_truck1_l2_l3_t9_t10"),25)
SATISFIABLE
Models : 1+
Calls : 7
Time : 3.550s (Solving: 2.83s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 3.528s
Choices : 66676 (Domain: 66605)
Conflicts : 24431 (Analyzed: 24430)
Restarts : 301 (Average: 81.16 Last: 93)
Model-Level : 258.0
Problems : 7 (Average Length: 14.86 Splits: 0)
Lemmas : 24430 (Deleted: 19805)
Binary : 264 (Ratio: 1.08%)
Ternary : 85 (Ratio: 0.35%)
Conflict : 24430 (Average Length: 199.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 24430 (Average: 1.80 Max: 127 Sum: 43986)
Executed : 24395 (Average: 1.78 Max: 127 Sum: 43426 Ratio: 98.73%)
Bounded : 35 (Average: 16.00 Max: 17 Sum: 560 Ratio: 1.27%)
Rules : 40740 (Original: 40736)
Atoms : 27933
Bodies : 11908 (Original: 11903)
Count : 136 (Original: 138)
Equivalences : 6069 (Atom=Atom: 30 Body=Body: 0 Other: 6039)
Tight : Yes
Variables : 17694 (Eliminated: 0 Frozen: 12385)
Constraints : 120757 (Binary: 96.9% Ternary: 1.7% Other: 1.5%)
Memory Peak : 90MB
Max. Length : 25 steps
Sol. Length : 25 steps
Models : 2