205 lines
11 KiB
Plaintext
205 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-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-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-8.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.025s 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.030s CPU, 0.028s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
|
Generated 43 rules.
|
|
Computing model... [0.210s CPU, 0.211s wall-clock]
|
|
1365 relevant atoms
|
|
1130 auxiliary atoms
|
|
2495 final queue length
|
|
4859 total queue pushes
|
|
Completing instantiation... [0.340s CPU, 0.349s wall-clock]
|
|
Instantiating: [0.620s CPU, 0.619s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
16 initial candidates
|
|
Finding invariants: [0.040s CPU, 0.043s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
|
Instantiating groups... [0.040s CPU, 0.040s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
28 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.010s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.110s CPU, 0.115s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.005s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.030s CPU, 0.021s wall-clock]
|
|
Translating task: [0.410s CPU, 0.406s wall-clock]
|
|
1290 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
40 propositions removed
|
|
Detecting unreachable propositions: [0.200s CPU, 0.203s wall-clock]
|
|
Reordering and filtering variables...
|
|
41 of 41 variables necessary.
|
|
29 of 41 mutex groups necessary.
|
|
912 of 912 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.120s CPU, 0.111s wall-clock]
|
|
Translator variables: 41
|
|
Translator derived variables: 0
|
|
Translator facts: 284
|
|
Translator goal facts: 7
|
|
Translator mutex groups: 29
|
|
Translator total mutex groups size: 329
|
|
Translator operators: 912
|
|
Translator axioms: 0
|
|
Translator task size: 8767
|
|
Translator peak memory: 38488 KB
|
|
Writing output... [0.130s CPU, 0.145s wall-clock]
|
|
Done! [1.630s CPU, 1.655s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 1.77s
|
|
Memory: 148MB
|
|
|
|
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.01s
|
|
Memory: 148MB (+0MB)
|
|
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: 1.74s
|
|
Memory: 337MB (+189MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.10s
|
|
Memory: 344MB (+7MB)
|
|
UNSAT
|
|
Iteration Time: 2.18s
|
|
|
|
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: 1.47s
|
|
Memory: 415MB (+71MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.97s
|
|
Memory: 420MB (+5MB)
|
|
UNSAT
|
|
Iteration Time: 2.82s
|
|
|
|
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: 1.61s
|
|
Memory: 489MB (+69MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 4.95s
|
|
Memory: 501MB (+12MB)
|
|
UNKNOWN
|
|
Iteration Time: 6.96s
|
|
|
|
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: 2.18s
|
|
Memory: 617MB (+116MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 6.64s
|
|
Memory: 634MB (+17MB)
|
|
UNKNOWN
|
|
Iteration Time: 9.22s
|
|
|
|
Iteration 6
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 20
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
|
Grounding Time: 1.55s
|
|
Memory: 695MB (+61MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 8.07s
|
|
Memory: 714MB (+19MB)
|
|
UNKNOWN
|
|
Iteration Time: 10.03s
|
|
|
|
Iteration 7
|
|
Queue: [(6,30,0,True)]
|
|
Grounded Until: 25
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
|
Grounding Time: 1.63s
|
|
Memory: 770MB (+56MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 10.50s
|
|
Memory: 808MB (+38MB)
|
|
UNKNOWN
|
|
Iteration Time: 12.56s
|
|
|
|
Iteration 8
|
|
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), (16,80,0,True)]
|
|
Grounded Until: 30
|
|
Blocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("lift","hoist0","crate2","pallet0","depot0")),1) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),1) occurs(action(("lift","hoist2","crate9","pallet2","distributor1")),1) occurs(action(("drive","truck0","distributor0","depot0")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("load","hoist2","crate9","truck1","distributor1")),2) occurs(action(("drive","truck0","depot0","distributor1")),2) occurs(action(("load","hoist1","crate0","truck1","distributor0")),2) occurs(action(("load","hoist0","crate2","truck0","depot0")),2) occurs(action(("drive","truck1","distributor1","distributor0")),2) occurs(action(("unload","hoist0","crate9","truck1","depot0")),3) occurs(action(("drive","truck1","distributor0","depot0")),3) occurs(action(("lift","hoist2","crate7","crate4","distributor1")),3) occurs(action(("lift","hoist1","crate6","crate5","distributor0")),3) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),4) occurs(action(("load","hoist2","crate7","truck0","distributor1")),4) occurs(action(("load","hoist1","crate6","truck0","distributor0")),4) occurs(action(("drive","truck1","depot0","distributor1")),4) occurs(action(("drive","truck0","distributor1","distributor0")),4) occurs(action(("lift","hoist2","crate4","pallet3","distributor1")),5) occurs(action(("drive","truck1","distributor1","depot0")),5) occurs(action(("lift","hoist1","crate5","crate1","distributor0")),5) occurs(action(("lift","hoist0","crate9","pallet0","depot0")),6) occurs(action(("drop","hoist2","crate4","pallet2","distributor1")),6) occurs(action(("drive","truck0","distributor0","distributor1")),6) occurs(action(("drive","truck1","depot0","distributor1")),6) occurs(action(("load","hoist1","crate5","truck0","distributor0")),6) occurs(action(("lift","hoist1","crate1","pallet1","distributor0")),7) occurs(action(("unload","hoist2","crate0","truck1","distributor1")),7) occurs(action(("load","hoist0","crate9","truck0","depot0")),7) occurs(action(("drive","truck0","distributor1","depot0")),7) occurs(action(("drive","truck1","distributor1","distributor0")),7) occurs(action(("drop","hoist2","crate0","pallet3","distributor1")),8) occurs(action(("load","hoist1","crate1","truck1","distributor0")),8) occurs(action(("unload","hoist0","crate6","truck0","depot0")),8) occurs(action(("lift","hoist1","crate8","crate3","distributor0")),9) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),9) occurs(action(("drop","hoist0","crate6","pallet0","depot0")),9) occurs(action(("drive","truck1","distributor0","distributor1")),9) occurs(action(("drive","truck0","depot0","distributor0")),9) occurs(action(("drop","hoist1","crate8","pallet4","distributor0")),10) occurs(action(("drop","hoist2","crate1","crate0","distributor1")),10) occurs(action(("drive","truck0","distributor0","depot0")),10) occurs(action(("drive","truck1","distributor1","distributor0")),10) occurs(action(("lift","hoist0","crate6","pallet0","depot0")),11) occurs(action(("unload","hoist1","crate7","truck0","distributor0")),11) occurs(action(("lift","hoist2","crate4","pallet2","distributor1")),11) occurs(action(("drive","truck1","distributor0","distributor1")),11) occurs(action(("drive","truck0","depot0","distributor0")),11) occurs(action(("drop","hoist1","crate7","pallet1","distributor0")),12) occurs(action(("load","hoist0","crate6","truck0","depot0")),12) occurs(action(("drive","truck0","distributor0","depot0")),12) occurs(action(("drop","hoist2","crate4","crate1","distributor1")),12) occurs(action(("drive","truck1","distributor1","distributor0")),12) occurs(action(("unload","hoist0","crate9","truck0","depot0")),13) occurs(action(("unload","hoist2","crate6","truck0","distributor1")),13) occurs(action(("drive","truck0","depot0","distributor1")),13) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),14) occurs(action(("lift","hoist1","crate3","pallet5","distributor0")),14) occurs(action(("drive","truck1","distributor0","distributor1")),14) occurs(action(("drop","hoist2","crate6","pallet2","distributor1")),15) occurs(action(("drop","hoist1","crate3","crate8","distributor0")),15) occurs(action(("drive","truck1","distributor1","distributor0")),15)
|
|
Solving Time: 1.26s
|
|
Memory: 808MB (+0MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 8
|
|
Time : 46.825s (Solving: 31.71s 1st Model: 1.23s Unsat: 0.89s)
|
|
CPU Time : 46.820s
|
|
|
|
Choices : 102686
|
|
Conflicts : 45588 (Analyzed: 45586)
|
|
Restarts : 445 (Average: 102.44 Last: 177)
|
|
Model-Level : 97.0
|
|
Problems : 8 (Average Length: 18.88 Splits: 0)
|
|
Lemmas : 51188 (Deleted: 25520)
|
|
Binary : 6144 (Ratio: 12.00%)
|
|
Ternary : 3306 (Ratio: 6.46%)
|
|
Conflict : 45586 (Average Length: 44.8 Ratio: 89.06%)
|
|
Loop : 5602 (Average Length: 54.0 Ratio: 10.94%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 45586 (Average: 2.62 Max: 86 Sum: 119627)
|
|
Executed : 44451 (Average: 2.19 Max: 86 Sum: 100001 Ratio: 83.59%)
|
|
Bounded : 1135 (Average: 17.29 Max: 32 Sum: 19626 Ratio: 16.41%)
|
|
|
|
Rules : 701761
|
|
Atoms : 701761
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 187646 (Eliminated: 0 Frozen: 178789)
|
|
Constraints : 594735 (Binary: 88.4% Ternary: 6.1% Other: 5.5%)
|
|
|
|
Memory Peak : 808MB
|
|
Max. Length : 30 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|