174 lines
11 KiB
Plaintext
174 lines
11 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-12.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-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-12.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.024s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.021s wall-clock]
|
|
Generated 43 rules.
|
|
Computing model... [0.650s CPU, 0.646s wall-clock]
|
|
4500 relevant atoms
|
|
3459 auxiliary atoms
|
|
7959 final queue length
|
|
17591 total queue pushes
|
|
Completing instantiation... [1.550s CPU, 1.543s wall-clock]
|
|
Instantiating: [2.250s CPU, 2.252s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
16 initial candidates
|
|
Finding invariants: [0.060s CPU, 0.056s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.006s wall-clock]
|
|
Instantiating groups... [0.100s CPU, 0.094s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
|
Choosing groups...
|
|
39 uncovered facts
|
|
Choosing groups: [0.020s CPU, 0.023s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
|
Computing fact groups: [0.230s CPU, 0.227s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.008s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.020s CPU, 0.015s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.080s CPU, 0.084s wall-clock]
|
|
Translating task: [1.870s CPU, 1.864s wall-clock]
|
|
5130 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
56 propositions removed
|
|
Detecting unreachable propositions: [0.970s CPU, 0.977s wall-clock]
|
|
Reordering and filtering variables...
|
|
59 of 59 variables necessary.
|
|
42 of 59 mutex groups necessary.
|
|
3570 of 3570 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.430s CPU, 0.435s wall-clock]
|
|
Translator variables: 59
|
|
Translator derived variables: 0
|
|
Translator facts: 591
|
|
Translator goal facts: 11
|
|
Translator mutex groups: 42
|
|
Translator total mutex groups size: 747
|
|
Translator operators: 3570
|
|
Translator axioms: 0
|
|
Translator task size: 33628
|
|
Translator peak memory: 57036 KB
|
|
Writing output... [0.560s CPU, 0.599s wall-clock]
|
|
Done! [6.440s CPU, 6.479s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 1.32s
|
|
Memory: 136MB
|
|
|
|
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: 137MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.01s
|
|
|
|
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
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.47s
|
|
Memory: 137MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 141MB (+4MB)
|
|
UNSAT
|
|
Iteration Time: 0.69s
|
|
|
|
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
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.55s
|
|
Memory: 157MB (+16MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 168MB (+11MB)
|
|
UNSAT
|
|
Iteration Time: 0.79s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.48s
|
|
Memory: 181MB (+13MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 192MB (+11MB)
|
|
UNSAT
|
|
Iteration Time: 0.72s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 15
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.50s
|
|
Memory: 207MB (+15MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.11s
|
|
Memory: 219MB (+12MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 1.07s
|
|
Memory: 273MB (+54MB)
|
|
Answer: 1
|
|
occurs(action(("lift","hoist3","crate4","crate2","distributor0")),1) occurs(action(("lift","hoist5","crate13","crate9","distributor2")),1) occurs(action(("lift","hoist4","crate14","crate11","distributor1")),1) occurs(action(("lift","hoist1","crate12","crate10","depot1")),1) occurs(action(("drive","truck0","distributor1","distributor2")),1) occurs(action(("drive","truck1","depot1","distributor1")),1) occurs(action(("load","hoist4","crate14","truck1","distributor1")),2) occurs(action(("load","hoist5","crate13","truck0","distributor2")),2) occurs(action(("drive","truck1","distributor1","distributor2")),2) occurs(action(("drive","truck0","distributor2","distributor1")),2) occurs(action(("lift","hoist4","crate11","pallet4","distributor1")),3) occurs(action(("lift","hoist5","crate9","crate8","distributor2")),3) occurs(action(("load","hoist5","crate9","truck1","distributor2")),4) occurs(action(("drive","truck0","distributor1","depot1")),4) occurs(action(("load","hoist4","crate11","truck0","distributor1")),4) occurs(action(("load","hoist1","crate12","truck0","depot1")),5) occurs(action(("lift","hoist5","crate8","crate7","distributor2")),5) occurs(action(("lift","hoist1","crate10","crate5","depot1")),6) occurs(action(("load","hoist5","crate8","truck1","distributor2")),6) occurs(action(("load","hoist1","crate10","truck0","depot1")),7) occurs(action(("lift","hoist5","crate7","crate6","distributor2")),7) occurs(action(("lift","hoist1","crate5","crate1","depot1")),8) occurs(action(("load","hoist5","crate7","truck1","distributor2")),8) occurs(action(("lift","hoist5","crate6","crate3","distributor2")),9) occurs(action(("load","hoist1","crate5","truck0","depot1")),9) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),10) occurs(action(("load","hoist5","crate6","truck1","distributor2")),10) occurs(action(("lift","hoist5","crate3","crate0","distributor2")),11) occurs(action(("load","hoist1","crate1","truck0","depot1")),11) occurs(action(("unload","hoist1","crate13","truck0","depot1")),12) occurs(action(("load","hoist5","crate3","truck1","distributor2")),12) occurs(action(("drive","truck0","depot1","distributor0")),12) occurs(action(("drop","hoist1","crate13","pallet1","depot1")),13) occurs(action(("lift","hoist5","crate0","pallet5","distributor2")),13) occurs(action(("drive","truck0","distributor0","depot1")),13) occurs(action(("load","hoist3","crate4","truck0","distributor0")),13) occurs(action(("lift","hoist3","crate2","pallet3","distributor0")),14) occurs(action(("unload","hoist1","crate10","truck0","depot1")),14) occurs(action(("drive","truck0","depot1","distributor0")),14) occurs(action(("load","hoist5","crate0","truck1","distributor2")),14) occurs(action(("drive","truck1","distributor2","distributor1")),14) occurs(action(("drop","hoist1","crate10","crate13","depot1")),15) occurs(action(("unload","hoist4","crate0","truck1","distributor1")),15) occurs(action(("load","hoist3","crate2","truck0","distributor0")),15) occurs(action(("drive","truck1","distributor1","depot2")),15) occurs(action(("drive","truck0","distributor0","distributor2")),15) occurs(action(("drop","hoist4","crate0","pallet4","distributor1")),16) occurs(action(("unload","hoist2","crate9","truck1","depot2")),16) occurs(action(("unload","hoist5","crate12","truck0","distributor2")),16) occurs(action(("drive","truck0","distributor2","distributor1")),16) occurs(action(("drive","truck1","depot2","depot1")),16) occurs(action(("drop","hoist2","crate9","pallet2","depot2")),17) occurs(action(("drop","hoist5","crate12","pallet5","distributor2")),17) occurs(action(("unload","hoist4","crate2","truck0","distributor1")),17) occurs(action(("unload","hoist1","crate14","truck1","depot1")),17) occurs(action(("drive","truck0","distributor1","depot0")),17) occurs(action(("drive","truck1","depot1","depot2")),17) occurs(action(("drop","hoist4","crate2","crate0","distributor1")),18) occurs(action(("drop","hoist1","crate14","crate10","depot1")),18) occurs(action(("unload","hoist0","crate5","truck0","depot0")),18) occurs(action(("unload","hoist2","crate3","truck1","depot2")),18) occurs(action(("drive","truck0","depot0","distributor2")),18) occurs(action(("drive","truck1","depot2","distributor1")),18) occurs(action(("drop","hoist0","crate5","pallet0","depot0")),19) occurs(action(("drop","hoist2","crate3","crate9","depot2")),19) occurs(action(("unload","hoist4","crate6","truck1","distributor1")),19) occurs(action(("unload","hoist5","crate1","truck0","distributor2")),19) occurs(action(("drive","truck0","distributor2","depot0")),19) occurs(action(("drive","truck1","distributor1","depot0")),19) occurs(action(("drop","hoist4","crate6","crate2","distributor1")),20) occurs(action(("drop","hoist5","crate1","crate12","distributor2")),20) occurs(action(("drive","truck0","depot0","depot1")),20)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 5
|
|
Time : 4.425s (Solving: 0.08s 1st Model: 0.07s Unsat: 0.00s)
|
|
CPU Time : 4.344s
|
|
|
|
Choices : 953 (Domain: 939)
|
|
Conflicts : 101 (Analyzed: 99)
|
|
Restarts : 0
|
|
Model-Level : 145.0
|
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
|
Lemmas : 99 (Deleted: 0)
|
|
Binary : 3 (Ratio: 3.03%)
|
|
Ternary : 3 (Ratio: 3.03%)
|
|
Conflict : 99 (Average Length: 122.2 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 99 (Average: 14.15 Max: 74 Sum: 1401)
|
|
Executed : 70 (Average: 8.38 Max: 74 Sum: 830 Ratio: 59.24%)
|
|
Bounded : 29 (Average: 19.69 Max: 22 Sum: 571 Ratio: 40.76%)
|
|
|
|
Rules : 99157
|
|
Atoms : 99157
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 88344 (Eliminated: 0 Frozen: 10660)
|
|
Constraints : 735526 (Binary: 97.6% Ternary: 1.2% Other: 1.2%)
|
|
|
|
Memory Peak : 273MB
|
|
Max. Length : 20 steps
|
|
Sol. Length : 20 steps
|
|
Models : 1
|
|
|
|
|