1
0
tplp-planning-benchmark/fd-pb-e2/ipc-2002_depots-strips-automatic_17.out

369 lines
17 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-17.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-17.pddl
Parsing...
Parsing: [0.010s CPU, 0.021s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s 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.460s CPU, 0.450s wall-clock]
3667 relevant atoms
1884 auxiliary atoms
5551 final queue length
12993 total queue pushes
Completing instantiation... [1.230s CPU, 1.232s wall-clock]
Instantiating: [1.740s CPU, 1.739s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.050s wall-clock]
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
Instantiating groups... [0.080s CPU, 0.081s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
42 uncovered facts
Choosing groups: [0.020s CPU, 0.017s wall-clock]
Building translation key... [0.010s CPU, 0.006s wall-clock]
Computing fact groups: [0.190s CPU, 0.186s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.007s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.011s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.069s wall-clock]
Translating task: [1.480s CPU, 1.483s wall-clock]
3930 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
56 propositions removed
Detecting unreachable propositions: [0.680s CPU, 0.681s wall-clock]
Reordering and filtering variables...
50 of 50 variables necessary.
36 of 50 mutex groups necessary.
2938 of 2938 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.320s CPU, 0.318s wall-clock]
Translator variables: 50
Translator derived variables: 0
Translator facts: 408
Translator goal facts: 7
Translator mutex groups: 36
Translator total mutex groups size: 556
Translator operators: 2938
Translator axioms: 0
Translator task size: 26125
Translator peak memory: 52684 KB
Writing output... [0.490s CPU, 0.516s wall-clock]
Done! [4.990s CPU, 5.020s wall-clock]
planner.py version 0.0.1
Time: 10.63s
Memory: 633MB
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.05s
Memory: 633MB (+0MB)
UNSAT
Iteration Time: 0.05s
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: 633MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 9.56s
Memory: 1518MB (+885MB)
Unblocking actions...
Solving...
Solving Time: 0.57s
Memory: 1569MB (+51MB)
UNSAT
Iteration Time: 12.56s
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: 2505.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 12.42s
Memory: 2083MB (+514MB)
Unblocking actions...
Solving...
Solving Time: 8.55s
Memory: 2129MB (+46MB)
UNKNOWN
Iteration Time: 23.53s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 3065.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 8.64s
Memory: 2440MB (+311MB)
Unblocking actions...
Solving...
Solving Time: 11.78s
Memory: 2494MB (+54MB)
UNKNOWN
Iteration Time: 23.04s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 3430.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 9.21s
Memory: 2800MB (+306MB)
Unblocking actions...
Solving...
Solving Time: 12.50s
Memory: 2858MB (+58MB)
UNKNOWN
Iteration Time: 24.33s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 3794.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 17.16s
Memory: 3572MB (+714MB)
Unblocking actions...
Solving...
Solving Time: 17.08s
Memory: 3618MB (+46MB)
UNKNOWN
Iteration Time: 36.89s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 4554.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 8.75s
Memory: 3923MB (+305MB)
Unblocking actions...
Solving...
Solving Time: 19.07s
Memory: 3999MB (+76MB)
UNKNOWN
Iteration Time: 30.54s
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: 15.03s
Memory: 3999MB (+0MB)
UNKNOWN
Iteration Time: 15.09s
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: 15.43s
Memory: 3999MB (+0MB)
UNKNOWN
Iteration Time: 15.49s
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: 18.35s
Memory: 3999MB (+0MB)
UNKNOWN
Iteration Time: 18.41s
Iteration 11
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)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 19.13s
Memory: 3999MB (+0MB)
UNKNOWN
Iteration Time: 19.19s
Iteration 12
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)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 19.78s
Memory: 3999MB (+0MB)
UNKNOWN
Iteration Time: 19.85s
Iteration 13
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)]
Grounded Until: 30
Expected Memory: 4935.0MB
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 9.05s
Memory: 4303MB (+304MB)
Unblocking actions...
Solving...
Solving Time: 21.96s
Memory: 4350MB (+47MB)
UNKNOWN
Iteration Time: 33.76s
Iteration 14
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)]
Grounded Until: 35
Expected Memory: 5286.0MB
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 9.39s
Memory: 4652MB (+302MB)
Unblocking actions...
Solving...
Solving Time: 28.12s
Memory: 4728MB (+76MB)
UNKNOWN
Iteration Time: 40.31s
Iteration 15
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)]
Grounded Until: 40
Expected Memory: 5664.0MB
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 9.83s
Memory: 5060MB (+332MB)
Unblocking actions...
Solving...
Solving Time: 26.88s
Memory: 5128MB (+68MB)
UNKNOWN
Iteration Time: 39.54s
Iteration 16
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)]
Grounded Until: 45
Expected Memory: 6064.0MB
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 10.19s
Memory: 5420MB (+292MB)
Unblocking actions...
Solving...
Solving Time: 28.14s
Memory: 5472MB (+52MB)
UNKNOWN
Iteration Time: 41.20s
Iteration 17
Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 50
Expected Memory: 6408.0MB
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 10.84s
Memory: 5769MB (+297MB)
Unblocking actions...
Solving...
Solving Time: 29.89s
Memory: 5832MB (+63MB)
UNKNOWN
Iteration Time: 43.65s
Iteration 18
Queue: [(12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 55
Expected Memory: 6768.0MB
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
Grounding Time: 25.51s
Memory: 6923MB (+1091MB)
Unblocking actions...
Solving...
Solving Time: 28.62s
Memory: 7025MB (+102MB)
UNKNOWN
Iteration Time: 57.11s
Iteration 19
Queue: [(13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 60
Expected Memory: 8218.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 20
Queue: [(14,70,0,True), (15,75,0,True)]
Grounded Until: 60
Expected Memory: 9411.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 21
Queue: [(15,75,0,True)]
Grounded Until: 60
Expected Memory: 10604.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 22
Queue: [(2,10,2,True), (3,15,2,True), (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,1,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 60
Blocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist3","crate7","crate5","distributor1")),1) occurs(action(("drive","truck1","distributor1","distributor0")),1) occurs(action(("lift","hoist2","crate9","pallet2","distributor0")),1) occurs(action(("drive","truck2","depot1","depot0")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("drive","truck3","depot0","distributor1")),1) occurs(action(("lift","hoist6","crate3","pallet6","depot0")),2) occurs(action(("lift","hoist1","crate4","pallet1","depot1")),2) occurs(action(("load","hoist3","crate7","truck0","distributor1")),2) occurs(action(("drive","truck3","distributor1","depot1")),2) occurs(action(("lift","hoist7","crate5","crate0","distributor1")),2) occurs(action(("load","hoist2","crate9","truck1","distributor0")),2) occurs(action(("drive","truck1","distributor0","distributor1")),2) occurs(action(("drive","truck0","distributor1","depot1")),2) occurs(action(("drive","truck2","depot0","depot1")),2) occurs(action(("unload","hoist4","crate7","truck0","depot0")),3) occurs(action(("drop","hoist6","crate3","pallet0","depot0")),3) occurs(action(("lift","hoist3","crate0","pallet3","distributor1")),3) occurs(action(("load","hoist1","crate4","truck0","depot1")),3) occurs(action(("drive","truck0","depot1","depot0")),3) occurs(action(("drive","truck1","distributor1","depot0")),3) occurs(action(("drive","truck2","depot1","distributor1")),3) occurs(action(("drive","truck3","depot1","distributor1")),3) occurs(action(("drop","hoist7","crate5","crate1","distributor1")),3) occurs(action(("unload","hoist0","crate4","truck0","depot0")),4) occurs(action(("lift","hoist6","crate3","pallet0","depot0")),4) occurs(action(("drop","hoist4","crate7","pallet6","depot0")),4) occurs(action(("lift","hoist2","crate2","pallet4","distributor0")),4) occurs(action(("drive","truck2","distributor1","depot0")),4) occurs(action(("drive","truck0","depot0","distributor1")),4) occurs(action(("load","hoist3","crate0","truck3","distributor1")),4) occurs(action(("unload","hoist7","crate9","truck1","distributor1")),4) occurs(action(("drive","truck1","depot0","distributor1")),4) occurs(action(("drive","truck3","distributor1","depot0")),4) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),5) occurs(action(("drop","hoist6","crate3","crate7","depot0")),5) occurs(action(("drive","truck3","depot0","distributor0")),5) occurs(action(("drive","truck0","distributor1","depot0")),5) occurs(action(("drive","truck2","depot0","distributor1")),5) occurs(action(("lift","hoist3","crate8","crate6","distributor1")),5) occurs(action(("drop","hoist7","crate9","pallet3","distributor1")),5) occurs(action(("drop","hoist2","crate2","pallet4","distributor0")),5) occurs(action(("unload","hoist5","crate0","truck3","depot0")),5) occurs(action(("lift","hoist6","crate3","crate7","depot0")),6) occurs(action(("load","hoist3","crate8","truck1","distributor1")),6) occurs(action(("drive","truck0","depot0","distributor0")),6) occurs(action(("lift","hoist2","crate2","pallet4","distributor0")),6) occurs(action(("drive","truck1","distributor1","depot0")),6) occurs(action(("drive","truck2","distributor1","depot0")),6) occurs(action(("drop","hoist5","crate0","crate4","depot0")),6) occurs(action(("lift","hoist7","crate5","crate1","distributor1")),6) occurs(action(("unload","hoist0","crate8","truck1","depot0")),7) occurs(action(("lift","hoist4","crate7","pallet6","depot0")),7) occurs(action(("lift","hoist3","crate6","pallet7","distributor1")),7) occurs(action(("drop","hoist6","crate3","crate0","depot0")),7) occurs(action(("drive","truck1","depot0","depot1")),7) occurs(action(("drive","truck0","distributor0","depot0")),7) occurs(action(("drop","hoist7","crate5","crate9","distributor1")),7) occurs(action(("drop","hoist2","crate2","pallet4","distributor0")),7) occurs(action(("drive","truck2","depot0","depot1")),7) occurs(action(("drive","truck3","distributor0","depot0")),7) occurs(action(("drop","hoist0","crate8","pallet6","depot0")),8) occurs(action(("lift","hoist5","crate3","crate0","depot0")),8) occurs(action(("load","hoist4","crate7","truck1","depot0")),8) occurs(action(("load","hoist3","crate6","truck0","distributor1")),8) occurs(action(("drive","truck2","depot1","distributor0")),8) occurs(action(("drive","truck3","depot0","distributor0")),8) occurs(action(("drive","truck1","depot1","depot0")),8) occurs(action(("drive","truck0","depot0","distributor1")),8) occurs(action(("lift","hoist7","crate5","crate9","distributor1")),8) occurs(action(("drop","hoist5","crate3","crate8","depot0")),9) occurs(action(("unload","hoist4","crate7","truck1","depot0")),9) occurs(action(("unload","hoist1","crate6","truck0","depot1")),9) occurs(action(("lift","hoist3","crate1","pallet5","distributor1")),9) occurs(action(("drive","truck1","depot0","distributor0")),9) occurs(action(("lift","hoist2","crate2","pallet4","distributor0")),9) occurs(action(("drop","hoist7","crate5","crate9","distributor1")),9) occurs(action(("drive","truck0","distributor1","depot1")),9) occurs(action(("drop","hoist4","crate7","crate3","depot0")),10) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),10) occurs(action(("drop","hoist3","crate1","pallet7","distributor1")),10) occurs(action(("drive","truck0","depot1","distributor1")),10) occurs(action(("drive","truck2","distributor0","distributor1")),10) occurs(action(("drive","truck3","distributor0","distributor1")),10) occurs(action(("drop","hoist2","crate2","pallet4","distributor0")),10) occurs(action(("lift","hoist0","crate0","crate4","depot0")),10) occurs(action(("lift","hoist7","crate5","crate9","distributor1")),10) occurs(action(("drive","truck1","distributor0","distributor1")),10)
Solving Time: 3.44s
Memory: 7041MB (+16MB)
SAT
SATISFIABLE
Models : 1+
Calls : 19
Time : 508.627s (Solving: 313.31s 1st Model: 3.22s Unsat: 0.16s)
CPU Time : 508.688s
Choices : 476891
Conflicts : 174115 (Analyzed: 174114)
Restarts : 1614 (Average: 107.88 Last: 209)
Model-Level : 152.0
Problems : 19 (Average Length: 33.58 Splits: 0)
Lemmas : 187485 (Deleted: 115193)
Binary : 21161 (Ratio: 11.29%)
Ternary : 8691 (Ratio: 4.64%)
Conflict : 174114 (Average Length: 82.4 Ratio: 92.87%)
Loop : 13371 (Average Length: 126.6 Ratio: 7.13%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 174114 (Average: 3.02 Max: 153 Sum: 525595)
Executed : 171461 (Average: 2.66 Max: 153 Sum: 462402 Ratio: 87.98%)
Bounded : 2653 (Average: 23.82 Max: 62 Sum: 63193 Ratio: 12.02%)
Rules : 4594338
Atoms : 4594338
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 1125988 (Eliminated: 0 Frozen: 1098047)
Constraints : 3969680 (Binary: 89.9% Ternary: 5.6% Other: 4.5%)
Memory Peak : 7447MB
Max. Length : 60 steps
Sol. Length : 10 steps