236 lines
9.4 KiB
Plaintext
236 lines
9.4 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-8.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-8.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-8.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-8.pddl
|
|
Parsing...
|
|
Parsing: [2.320s CPU, 2.330s wall-clock]
|
|
Normalizing task... [0.370s CPU, 0.368s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.330s CPU, 0.324s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.740s CPU, 0.745s wall-clock]
|
|
Preparing model... [0.510s CPU, 0.503s wall-clock]
|
|
Generated 7405 rules.
|
|
Computing model... [0.250s CPU, 0.246s wall-clock]
|
|
2931 relevant atoms
|
|
0 auxiliary atoms
|
|
2931 final queue length
|
|
7418 total queue pushes
|
|
Completing instantiation... [0.570s CPU, 0.571s wall-clock]
|
|
Instantiating: [2.430s CPU, 2.425s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
433 initial candidates
|
|
Finding invariants: [60.420s CPU, 60.391s wall-clock]
|
|
Checking invariant weight... [0.070s CPU, 0.071s wall-clock]
|
|
Instantiating groups... [0.020s CPU, 0.022s wall-clock]
|
|
Collecting mutex groups... [0.010s CPU, 0.008s wall-clock]
|
|
Choosing groups...
|
|
357 uncovered facts
|
|
Choosing groups: [0.050s CPU, 0.050s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.013s wall-clock]
|
|
Computing fact groups: [60.680s CPU, 60.658s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
|
|
Building dictionary for full mutex groups... [0.030s CPU, 0.028s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.050s CPU, 0.044s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.030s CPU, 0.032s wall-clock]
|
|
Translating task: [1.750s CPU, 1.752s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
5 propositions removed
|
|
Detecting unreachable propositions: [0.440s CPU, 0.443s wall-clock]
|
|
Reordering and filtering variables...
|
|
19 of 369 variables necessary.
|
|
371 of 387 mutex groups necessary.
|
|
2496 of 2496 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.150s CPU, 0.145s wall-clock]
|
|
Translator variables: 19
|
|
Translator derived variables: 0
|
|
Translator facts: 97
|
|
Translator goal facts: 7
|
|
Translator mutex groups: 371
|
|
Translator total mutex groups size: 2611
|
|
Translator operators: 2496
|
|
Translator axioms: 0
|
|
Translator task size: 13404
|
|
Translator peak memory: 87236 KB
|
|
Writing output... [0.250s CPU, 0.266s wall-clock]
|
|
Done! [68.500s CPU, 68.495s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.30s
|
|
Memory: 63MB
|
|
|
|
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: 63MB (+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: 63MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.05s
|
|
Memory: 64MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 65MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.07s
|
|
|
|
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: 67.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.05s
|
|
Memory: 67MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.66s
|
|
Memory: 70MB (+3MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.72s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 75.0MB
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.05s
|
|
Memory: 73MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.95s
|
|
Memory: 76MB (+3MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.02s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 15
|
|
Expected Memory: 82.0MB
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.05s
|
|
Memory: 78MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 1.26s
|
|
Memory: 88MB (+10MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.34s
|
|
|
|
Iteration 6
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 20
|
|
Expected Memory: 100.0MB
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
|
Grounding Time: 0.07s
|
|
Memory: 90MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 1.47s
|
|
Memory: 94MB (+4MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.57s
|
|
|
|
Iteration 7
|
|
Queue: [(6,30,0,True)]
|
|
Grounded Until: 25
|
|
Expected Memory: 106.0MB
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
|
Grounding Time: 0.06s
|
|
Memory: 95MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 2.02s
|
|
Memory: 105MB (+10MB)
|
|
UNKNOWN
|
|
Iteration Time: 2.10s
|
|
|
|
Iteration 8
|
|
Queue: [(2,10,1,True), (3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
|
|
Grounded Until: 30
|
|
Blocking actions...
|
|
Solving...
|
|
Solving Time: 1.40s
|
|
Memory: 105MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.41s
|
|
|
|
Iteration 9
|
|
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
|
|
Grounded Until: 30
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 1.21s
|
|
Memory: 105MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.21s
|
|
|
|
Iteration 10
|
|
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
|
|
Grounded Until: 30
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.65s
|
|
Memory: 105MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.20s
|
|
Memory: 105MB (+0MB)
|
|
Answer: 1
|
|
occurs(action("drive_truck1_l1_l2_t0_t1"),1) occurs(action("load_package5_truck1_a2_l1"),1) occurs(action("drive_truck1_l2_l1_t1_t2"),2) occurs(action("load_package1_truck1_a1_l2"),2) occurs(action("unload_package1_truck1_a1_l1"),3) occurs(action("drive_truck1_l1_l2_t2_t3"),3) occurs(action("deliver_package1_l1_t3_t4"),4) occurs(action("drive_truck1_l2_l1_t3_t4"),4) occurs(action("load_package2_truck1_a1_l2"),4) occurs(action("unload_package2_truck1_a1_l1"),5) occurs(action("deliver_package2_l1_t4_t4"),6) occurs(action("drive_truck1_l1_l2_t4_t5"),6) occurs(action("load_package4_truck1_a1_l1"),6) occurs(action("unload_package4_truck1_a1_l2"),7) occurs(action("drive_truck1_l2_l4_t5_t6"),7) occurs(action("deliver_package4_l2_t6_t8"),8) occurs(action("unload_package5_truck1_a2_l4"),8) occurs(action("drive_truck1_l4_l1_t6_t7"),8) occurs(action("deliver_package5_l4_t7_t8"),9) occurs(action("drive_truck1_l1_l4_t7_t8"),9) occurs(action("load_package6_truck1_a2_l1"),9) occurs(action("unload_package6_truck1_a2_l4"),10) occurs(action("deliver_package6_l4_t8_t8"),11) occurs(action("drive_truck1_l4_l2_t8_t9"),11) occurs(action("drive_truck1_l2_l3_t9_t10"),12) occurs(action("load_package3_truck1_a2_l2"),12) occurs(action("unload_package3_truck1_a2_l3"),13) occurs(action("drive_truck1_l3_l1_t10_t11"),13) occurs(action("load_package7_truck1_a2_l1"),14) occurs(action("unload_package7_truck1_a2_l1"),15) occurs(action("load_package7_truck1_a2_l1"),16) occurs(action("drive_truck1_l1_l3_t11_t12"),17) occurs(action("unload_package7_truck1_a2_l3"),18) occurs(action("deliver_package7_l3_t12_t12"),19) occurs(action("deliver_package3_l3_t12_t12"),20)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 10
|
|
Time : 10.400s (Solving: 9.60s 1st Model: 0.65s Unsat: 0.00s)
|
|
CPU Time : 10.380s
|
|
|
|
Choices : 161282 (Domain: 161163)
|
|
Conflicts : 62985 (Analyzed: 62984)
|
|
Restarts : 766 (Average: 82.22 Last: 91)
|
|
Model-Level : 306.0
|
|
Problems : 10 (Average Length: 21.50 Splits: 0)
|
|
Lemmas : 62984 (Deleted: 57901)
|
|
Binary : 181 (Ratio: 0.29%)
|
|
Ternary : 44 (Ratio: 0.07%)
|
|
Conflict : 62984 (Average Length: 477.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 62984 (Average: 1.40 Max: 168 Sum: 88071)
|
|
Executed : 62979 (Average: 1.40 Max: 168 Sum: 87947 Ratio: 99.86%)
|
|
Bounded : 5 (Average: 24.80 Max: 32 Sum: 124 Ratio: 0.14%)
|
|
|
|
Rules : 37494
|
|
Atoms : 37494
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 18230 (Eliminated: 0 Frozen: 2174)
|
|
Constraints : 106123 (Binary: 94.8% Ternary: 2.2% Other: 3.1%)
|
|
|
|
Memory Peak : 105MB
|
|
Max. Length : 30 steps
|
|
Sol. Length : 20 steps
|
|
Models : 1
|
|
|
|
|