307 lines
18 KiB
Plaintext
307 lines
18 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-20.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-20.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.023s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.990s CPU, 0.997s wall-clock]
|
||
|
|
7130 relevant atoms
|
||
|
|
5437 auxiliary atoms
|
||
|
|
12567 final queue length
|
||
|
|
27375 total queue pushes
|
||
|
|
Completing instantiation... [2.500s CPU, 2.498s wall-clock]
|
||
|
|
Instantiating: [3.570s CPU, 3.563s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.060s CPU, 0.062s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Instantiating groups... [0.140s CPU, 0.142s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
51 uncovered facts
|
||
|
|
Choosing groups: [0.030s CPU, 0.030s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.010s wall-clock]
|
||
|
|
Computing fact groups: [0.300s CPU, 0.310s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.110s CPU, 0.105s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.018s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.140s CPU, 0.134s wall-clock]
|
||
|
|
Translating task: [3.000s CPU, 2.996s wall-clock]
|
||
|
|
8070 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
70 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.390s CPU, 1.389s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
67 of 67 variables necessary.
|
||
|
|
48 of 67 mutex groups necessary.
|
||
|
|
5894 of 5894 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.660s CPU, 0.659s wall-clock]
|
||
|
|
Translator variables: 67
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 773
|
||
|
|
Translator goal facts: 14
|
||
|
|
Translator mutex groups: 48
|
||
|
|
Translator total mutex groups size: 993
|
||
|
|
Translator operators: 5894
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 52919
|
||
|
|
Translator peak memory: 69068 KB
|
||
|
|
Writing output... [0.890s CPU, 0.951s wall-clock]
|
||
|
|
Done! [10.070s CPU, 10.131s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 41.00s
|
||
|
|
Memory: 1981MB
|
||
|
|
|
||
|
|
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.18s
|
||
|
|
Memory: 1981MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.18s
|
||
|
|
|
||
|
|
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: 1981MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 19.46s
|
||
|
|
Memory: 3617MB (+1636MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.72s
|
||
|
|
Memory: 3671MB (+54MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 23.87s
|
||
|
|
|
||
|
|
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: 5361.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 26.74s
|
||
|
|
Memory: 4712MB (+1041MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.83s
|
||
|
|
Memory: 4776MB (+64MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 31.86s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 6466.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 20.67s
|
||
|
|
Memory: 5410MB (+634MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 4.94s
|
||
|
|
Memory: 5495MB (+85MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 30.11s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 7185.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 37.52s
|
||
|
|
Memory: 6924MB (+1429MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 7.10s
|
||
|
|
Memory: 6993MB (+69MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 49.19s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 8683.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 10373.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [(3,15,1,True), (4,20,1,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 4.01s
|
||
|
|
Memory: 6993MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 4.13s
|
||
|
|
|
||
|
|
Iteration 9
|
||
|
|
Queue: [(4,20,1,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 6.12s
|
||
|
|
Memory: 6993MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 6.24s
|
||
|
|
|
||
|
|
Iteration 10
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 8683.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 11
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 10373.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 12
|
||
|
|
Queue: [(3,15,2,True), (4,20,2,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 4.19s
|
||
|
|
Memory: 6993MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 4.31s
|
||
|
|
|
||
|
|
Iteration 13
|
||
|
|
Queue: [(4,20,2,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 5.99s
|
||
|
|
Memory: 6993MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 6.11s
|
||
|
|
|
||
|
|
Iteration 14
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 8683.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 15
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 10373.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 16
|
||
|
|
Queue: [(3,15,3,True), (4,20,3,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 4.54s
|
||
|
|
Memory: 6993MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 4.66s
|
||
|
|
|
||
|
|
Iteration 17
|
||
|
|
Queue: [(4,20,3,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 6.55s
|
||
|
|
Memory: 6993MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 6.67s
|
||
|
|
|
||
|
|
Iteration 18
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 8683.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 19
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 10373.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 20
|
||
|
|
Queue: [(3,15,4,True), (4,20,4,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist5","crate9","crate1","distributor1")),1) occurs(action(("lift","hoist3","crate5","crate2","depot3")),1) occurs(action(("lift","hoist7","crate10","crate0","distributor3")),1) occurs(action(("lift","hoist1","crate14","crate12","depot1")),1) occurs(action(("drive","truck2","depot1","distributor1")),1) occurs(action(("drive","truck3","distributor1","distributor2")),1) occurs(action(("drive","truck1","depot0","distributor3")),1) occurs(action(("drive","truck0","distributor2","depot3")),1) occurs(action(("lift","hoist6","crate8","crate7","distributor2")),1) occurs(action(("lift","hoist0","crate13","crate4","depot0")),2) occurs(action(("drop","hoist1","crate14","crate11","depot1")),2) occurs(action(("load","hoist5","crate9","truck2","distributor1")),2) occurs(action(("load","hoist6","crate8","truck3","distributor2")),2) occurs(action(("load","hoist3","crate5","truck0","depot3")),2) occurs(action(("drive","truck3","distributor2","depot0")),2) occurs(action(("drive","truck1","distributor3","depot2")),2) occurs(action(("drive","truck0","depot3","distributor1")),2) occurs(action(("drive","truck2","distributor1","distributor3")),2) occurs(action(("load","hoist7","crate10","truck1","distributor3")),2) occurs(action(("unload","hoist7","crate9","truck2","distributor3")),3) occurs(action(("unload","hoist5","crate5","truck0","distributor1")),3) occurs(action(("lift","hoist6","crate7","pallet6","distributor2")),3) occurs(action(("lift","hoist3","crate2","pallet3","depot3")),3) occurs(action(("load","hoist0","crate13","truck3","depot0")),3) occurs(action(("drive","truck3","depot0","depot1")),3) occurs(action(("drive","truck1","depot2","distributor2")),3) occurs(action(("drive","truck2","distributor3","depot3")),3) occurs(action(("lift","hoist1","crate12","crate6","depot1")),3) occurs(action(("unload","hoist2","crate10","truck1","depot2")),3) occurs(action(("drop","hoist7","crate9","crate0","distributor3")),4) occurs(action(("load","hoist6","crate7","truck1","distributor2")),4) occurs(action(("load","hoist5","crate5","truck0","distributor1")),4) occurs(action(("load","hoist3","crate2","truck2","depot3")),4) occurs(action(("drive","truck1","distributor2","depot1")),4) occurs(action(("drive","truck3","depot1","distributor0")),4) occurs(action(("drive","truck2","depot3","distributor2")),4) occurs(action(("load","hoist1","crate12","truck3","depot1")),4) occurs(action(("lift","hoist7","crate9","crate0","distributor3")),5) occurs(action(("unload","hoist5","crate5","truck0","distributor1")),5) occurs(action(("lift","hoist0","crate4","crate3","depot0")),5) occurs(action(("unload","hoist6","crate2","truck2","distributor2")),5) occurs(action(("lift","hoist1","crate6","pallet1","depot1")),5) occurs(action(("unload","hoist4","crate13","truck3","distributor0")),5) occurs(action(("drive","truck2","distributor2","depot0")),5) occurs(action(("drive","truck0","distributor1","depot1")),5) occurs(action(("drive","truck1","depot1","distributor0")),5) occurs(action(("drive","truck3","distributor0","distributor3")),5) occurs(action(("drop","hoist6","crate2","pallet6","distributor2")),6) occurs(action(("drop","hoist5","crate5","crate1","distributor1")),6) occurs(action(("load","hoist7","crate9","truck3","distributor3")),6) occurs(action(("load","hoist1","crate6","truck0","depot1")),6) occurs(action(("load","hoist0","crate4","truck2","depot0")),6) occurs(action(("load","hoist4","crate13","truck1","distributor0")),6) occurs(action(("drive","truck2","depot0","depot2")),6) occurs(action(("drive","truck0","depot1","distributor0")),6) occurs(action(("drive","truck1","distributor0","distributor2")),6) occurs(action(("drive","truck3","distributor3","depot3")),6) occurs(action(("drop","hoist2","crate10","pallet9","depot2")),6) occurs(action(("lift","hoist7","crate0","pallet7","distributor3")),7) occurs(action(("unload","hoist4","crate6","truck0","distributor0")),7) occurs(action(("lift","hoist5","crate5","crate1","distributor1")),7) occurs(action(("unload","hoist2","crate4","truck2","depot2")),7) occurs(action(("lift","hoist0","crate3","pallet
|
||
|
|
Solving Time: 2.12s
|
||
|
|
Memory: 6993MB (+0MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 12
|
||
|
|
Time : 210.631s (Solving: 42.95s 1st Model: 2.02s Unsat: 0.01s)
|
||
|
|
CPU Time : 210.560s
|
||
|
|
|
||
|
|
Choices : 177547
|
||
|
|
Conflicts : 76841 (Analyzed: 76840)
|
||
|
|
Restarts : 846 (Average: 90.83 Last: 115)
|
||
|
|
Model-Level : 197.0
|
||
|
|
Problems : 12 (Average Length: 17.83 Splits: 0)
|
||
|
|
Lemmas : 76840 (Deleted: 53799)
|
||
|
|
Binary : 4577 (Ratio: 5.96%)
|
||
|
|
Ternary : 2958 (Ratio: 3.85%)
|
||
|
|
Conflict : 76840 (Average Length: 209.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 76840 (Average: 2.86 Max: 127 Sum: 219944)
|
||
|
|
Executed : 74184 (Average: 2.28 Max: 127 Sum: 174971 Ratio: 79.55%)
|
||
|
|
Bounded : 2656 (Average: 16.93 Max: 22 Sum: 44973 Ratio: 20.45%)
|
||
|
|
|
||
|
|
Rules : 16811348
|
||
|
|
Atoms : 16811348
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 313859 (Eliminated: 0 Frozen: 281277)
|
||
|
|
Constraints : 1202622 (Binary: 98.0% Ternary: 1.0% Other: 1.0%)
|
||
|
|
|
||
|
|
Memory Peak : 7758MB
|
||
|
|
Max. Length : 20 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
|
||
|
|
|