tplp-planning-benchmark/fd-pb-e3/ipc-2002_depots-strips-automatic_12.out

359 lines
19 KiB
Plaintext
Raw Normal View History

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.010s CPU, 0.021s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 43 rules.
Computing model... [0.640s CPU, 0.645s wall-clock]
4500 relevant atoms
3459 auxiliary atoms
7959 final queue length
17591 total queue pushes
Completing instantiation... [1.560s CPU, 1.550s wall-clock]
Instantiating: [2.250s CPU, 2.254s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.060s CPU, 0.057s 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.228s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.008s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.013s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.090s CPU, 0.085s wall-clock]
Translating task: [1.860s CPU, 1.861s 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.980s CPU, 0.976s 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.550s CPU, 0.599s wall-clock]
Done! [6.420s CPU, 6.473s wall-clock]
planner.py version 0.0.1
Time: 18.30s
Memory: 983MB
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.08s
Memory: 983MB (+0MB)
UNSAT
Iteration Time: 0.08s
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: 983MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 8.61s
Memory: 1845MB (+862MB)
Unblocking actions...
Solving...
Solving Time: 0.35s
Memory: 1850MB (+5MB)
UNSAT
Iteration Time: 10.68s
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: 2717.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 12.35s
Memory: 2378MB (+528MB)
Unblocking actions...
Solving...
Solving Time: 0.39s
Memory: 2384MB (+6MB)
UNSAT
Iteration Time: 14.67s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 3251.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 9.29s
Memory: 2712MB (+328MB)
Unblocking actions...
Solving...
Solving Time: 0.60s
Memory: 2728MB (+16MB)
UNSAT
Iteration Time: 12.03s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 3595.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 9.97s
Memory: 3053MB (+325MB)
Unblocking actions...
Solving...
Solving Time: 3.56s
Memory: 3071MB (+18MB)
UNKNOWN
Iteration Time: 15.69s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 3938.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 16.62s
Memory: 3799MB (+728MB)
Unblocking actions...
Solving...
Solving Time: 5.43s
Memory: 3833MB (+34MB)
UNKNOWN
Iteration Time: 24.27s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 4700.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 9.24s
Memory: 4177MB (+344MB)
Unblocking actions...
Solving...
Solving Time: 6.29s
Memory: 4197MB (+20MB)
UNKNOWN
Iteration Time: 17.75s
Iteration 8
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), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 3.20s
Memory: 4197MB (+0MB)
UNKNOWN
Iteration Time: 3.28s
Iteration 9
Queue: [(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), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 4.84s
Memory: 4197MB (+0MB)
UNKNOWN
Iteration Time: 4.91s
Iteration 10
Queue: [(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), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 5.92s
Memory: 4197MB (+0MB)
UNKNOWN
Iteration Time: 5.99s
Iteration 11
Queue: [(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), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Expected Memory: 5064.0MB
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 9.56s
Memory: 4518MB (+321MB)
Unblocking actions...
Solving...
Solving Time: 7.39s
Memory: 4553MB (+35MB)
UNKNOWN
Iteration Time: 19.21s
Iteration 12
Queue: [(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), (16,80,0,True), (17,85,0,True)]
Grounded Until: 35
Expected Memory: 5420.0MB
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 9.99s
Memory: 4869MB (+316MB)
Unblocking actions...
Solving...
Solving Time: 7.87s
Memory: 4887MB (+18MB)
UNKNOWN
Iteration Time: 20.14s
Iteration 13
Queue: [(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), (16,80,0,True), (17,85,0,True)]
Grounded Until: 40
Expected Memory: 5754.0MB
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 10.36s
Memory: 5207MB (+320MB)
Unblocking actions...
Solving...
Solving Time: 9.15s
Memory: 5236MB (+29MB)
UNKNOWN
Iteration Time: 21.83s
Iteration 14
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 45
Expected Memory: 6103.0MB
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 10.95s
Memory: 5550MB (+314MB)
Unblocking actions...
Solving...
Solving Time: 9.59s
Memory: 5603MB (+53MB)
UNKNOWN
Iteration Time: 22.90s
Iteration 15
Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 50
Expected Memory: 6470.0MB
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 25.70s
Memory: 6710MB (+1107MB)
Unblocking actions...
Solving...
Solving Time: 10.87s
Memory: 6730MB (+20MB)
UNKNOWN
Iteration Time: 38.96s
Iteration 16
Queue: [(12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 55
Expected Memory: 7857.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 17
Queue: [(13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 55
Expected Memory: 8984.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 18
Queue: [(14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 55
Expected Memory: 10111.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 19
Queue: [(15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 55
Expected Memory: 11238.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 20
Queue: [(16,80,0,True), (17,85,0,True)]
Grounded Until: 55
Expected Memory: 12365.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 21
Queue: [(17,85,0,True)]
Grounded Until: 55
Expected Memory: 13492.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 22
Queue: [(4,20,2,True), (5,25,2,True), (6,30,2,True), (7,35,1,True), (8,40,1,True), (9,45,1,True), (10,50,1,True), (11,55,1,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 55
Blocking actions...
Solving...
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","depot1")),1) occurs(action(("drive","truck1","depot1","distributor2")),1) occurs(action(("load","hoist5","crate13","truck1","distributor2")),2) occurs(action(("load","hoist1","crate12","truck0","depot1")),2) occurs(action(("drive","truck0","depot1","distributor0")),2) occurs(action(("drive","truck1","distributor2","distributor1")),2) occurs(action(("lift","hoist1","crate10","crate5","depot1")),3) occurs(action(("lift","hoist5","crate9","crate8","distributor2")),3) occurs(action(("load","hoist4","crate14","truck1","distributor1")),3) occurs(action(("drive","truck0","distributor0","depot1")),3) occurs(action(("drive","truck1","distributor1","distributor2")),3) occurs(action(("load","hoist3","crate4","truck0","distributor0")),3) occurs(action(("lift","hoist3","crate2","pallet3","distributor0")),4) occurs(action(("lift","hoist4","crate11","pallet4","distributor1")),4) occurs(action(("load","hoist5","crate9","truck1","distributor2")),4) occurs(action(("load","hoist1","crate10","truck0","depot1")),4) occurs(action(("drive","truck1","distributor2","depot2")),4) occurs(action(("drive","truck0","depot1","distributor1")),4) occurs(action(("unload","hoist2","crate9","truck1","depot2")),5) occurs(action(("drive","truck0","distributor1","depot1")),5) occurs(action(("drive","truck1","depot2","distributor2")),5) occurs(action(("lift","hoist1","crate5","crate1","depot1")),5) occurs(action(("lift","hoist5","crate8","crate7","distributor2")),5) occurs(action(("load","hoist4","crate11","truck0","distributor1")),5) occurs(action(("drop","hoist3","crate2","pallet3","distributor0")),6) occurs(action(("load","hoist1","crate5","truck0","depot1")),6) occurs(action(("drive","truck0","depot1","depot0")),6) occurs(action(("drive","truck1","distributor2","distributor1")),6) occurs(action(("load","hoist5","crate8","truck1","distributor2")),6) occurs(action(("drop","hoist2","crate9","pallet2","depot2")),7) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),7) occurs(action(("drive","truck0","depot0","depot1")),7) occurs(action(("drive","truck1","distributor1","distributor2")),7) occurs(action(("lift","hoist5","crate7","crate6","distributor2")),7) occurs(action(("unload","hoist0","crate11","truck0","depot0")),7) occurs(action(("unload","hoist4","crate8","truck1","distributor1")),7) occurs(action(("lift","hoist3","crate2","pallet3","distributor0")),8) occurs(action(("drive","truck0","depot1","depot2")),8) occurs(action(("load","hoist1","crate1","truck0","depot1")),8) occurs(action(("drop","hoist0","crate11","pallet0","depot0")),8) occurs(action(("load","hoist5","crate7","truck1","distributor2")),8) occurs(action(("drive","truck1","distributor2","depot1")),8) occurs(action(("lift","hoist5","crate6","crate3","distributor2")),9) occurs(action(("unload","hoist1","crate13","truck1","depot1")),9) occurs(action(("drive","truck0","depot2","distributor0")),9) occurs(action(("drive","truck1","depot1","distributor2")),9) occurs(action(("drop","hoist4","crate8","pallet4","distributor1")),9) occurs(action(("unload","hoist2","crate5","truck0","depot2")),9) occurs(action(("drop","hoist1","crate13","pallet1","depot1")),10) occurs(action(("lift","hoist0","crate11","pallet0","depot0")),10) occurs(action(("load","hoist5","crate6","truck1","distributor2")),10) occurs(action(("drop","hoist2","crate5","crate9","depot2")),10) occurs(action(("load","hoist3","crate2","truck0","distributor0")),10) occurs(action(("drive","truck0","distributor0","depot1")),10) occurs(action(("drive","truck1","distributor2","distributor0")),10) occurs(action(("lift","hoist5","crate3","crate0","distributor2")),11) occurs(action(("lift","hoist2","crate5","crate9","depot2")),11) occurs(action(("unload","hoist3","crate14","truck1","distributor0")),11) occurs(action(("unload"
Solving Time: 1.07s
Memory: 6730MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 16
Time : 251.821s (Solving: 67.58s 1st Model: 0.91s Unsat: 0.14s)
CPU Time : 251.840s
Choices : 1599039
Conflicts : 113703 (Analyzed: 113701)
Restarts : 1120 (Average: 101.52 Last: 243)
Model-Level : 725.0
Problems : 16 (Average Length: 31.69 Splits: 0)
Lemmas : 113701 (Deleted: 77903)
Binary : 5507 (Ratio: 4.84%)
Ternary : 3747 (Ratio: 3.30%)
Conflict : 113701 (Average Length: 224.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 113701 (Average: 12.26 Max: 13642 Sum: 1394056)
Executed : 111816 (Average: 11.80 Max: 13642 Sum: 1341596 Ratio: 96.24%)
Bounded : 1885 (Average: 27.83 Max: 57 Sum: 52460 Ratio: 3.76%)
Rules : 7572937
Atoms : 7572937
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 584967 (Eliminated: 0 Frozen: 535060)
Constraints : 2444718 (Binary: 97.7% Ternary: 1.2% Other: 1.2%)
Memory Peak : 7256MB
Max. Length : 55 steps
Sol. Length : 20 steps