169 lines
11 KiB
Plaintext
169 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-5.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-5.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.020s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.170s CPU, 0.161s wall-clock]
|
||
|
|
1194 relevant atoms
|
||
|
|
992 auxiliary atoms
|
||
|
|
2186 final queue length
|
||
|
|
4280 total queue pushes
|
||
|
|
Completing instantiation... [0.300s CPU, 0.305s wall-clock]
|
||
|
|
Instantiating: [0.500s CPU, 0.507s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.047s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.040s CPU, 0.031s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
22 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.110s CPU, 0.106s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Translating task: [0.350s CPU, 0.351s wall-clock]
|
||
|
|
1080 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
34 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.170s CPU, 0.173s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
38 of 38 variables necessary.
|
||
|
|
26 of 38 mutex groups necessary.
|
||
|
|
792 of 792 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.100s CPU, 0.096s wall-clock]
|
||
|
|
Translator variables: 38
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 248
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 26
|
||
|
|
Translator total mutex groups size: 296
|
||
|
|
Translator operators: 792
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 7558
|
||
|
|
Translator peak memory: 37720 KB
|
||
|
|
Writing output... [0.120s CPU, 0.127s wall-clock]
|
||
|
|
Done! [1.390s CPU, 1.402s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 1.29s
|
||
|
|
Memory: 116MB
|
||
|
|
|
||
|
|
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: 116MB (+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: 0.85s
|
||
|
|
Memory: 205MB (+89MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 207MB (+2MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.00s
|
||
|
|
|
||
|
|
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.76s
|
||
|
|
Memory: 240MB (+33MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 242MB (+2MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.94s
|
||
|
|
|
||
|
|
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.11s
|
||
|
|
Memory: 301MB (+59MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.08s
|
||
|
|
Memory: 308MB (+7MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.34s
|
||
|
|
|
||
|
|
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.75s
|
||
|
|
Memory: 339MB (+31MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist1","crate8","crate7","distributor0")),1) occurs(action(("lift","hoist0","crate4","crate3","depot0")),1) occurs(action(("lift","hoist2","crate9","crate5","distributor1")),2) occurs(action(("load","hoist1","crate8","truck1","distributor0")),2) occurs(action(("load","hoist0","crate4","truck0","depot0")),2) occurs(action(("drive","truck0","depot0","distributor0")),2) occurs(action(("drive","truck1","distributor0","distributor1")),2) occurs(action(("lift","hoist1","crate7","crate6","distributor0")),3) occurs(action(("lift","hoist0","crate3","crate1","depot0")),3) occurs(action(("load","hoist2","crate9","truck1","distributor1")),3) occurs(action(("drive","truck1","distributor1","depot0")),3) occurs(action(("load","hoist1","crate7","truck0","distributor0")),4) occurs(action(("load","hoist0","crate3","truck1","depot0")),4) occurs(action(("drive","truck0","distributor0","distributor1")),4) occurs(action(("drive","truck1","depot0","distributor0")),4) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),5) occurs(action(("unload","hoist1","crate8","truck1","distributor0")),5) occurs(action(("unload","hoist2","crate7","truck0","distributor1")),5) occurs(action(("drive","truck1","distributor0","depot0")),5) occurs(action(("drive","truck0","distributor1","distributor0")),5) occurs(action(("drop","hoist1","crate8","crate6","distributor0")),6) occurs(action(("load","hoist0","crate1","truck1","depot0")),6) occurs(action(("drive","truck1","depot0","distributor1")),6) occurs(action(("drive","truck0","distributor0","depot0")),6) occurs(action(("lift","hoist1","crate8","crate6","distributor0")),7) occurs(action(("unload","hoist0","crate4","truck0","depot0")),7) occurs(action(("load","hoist2","crate7","truck1","distributor1")),7) occurs(action(("drive","truck1","distributor1","distributor0")),7) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),8) occurs(action(("load","hoist1","crate8","truck1","distributor0")),8) occurs(action(("load","hoist0","crate4","truck0","depot0")),8) occurs(action(("drive","truck1","distributor0","depot0")),8) occurs(action(("drive","truck0","depot0","distributor1")),8) occurs(action(("unload","hoist0","crate9","truck1","depot0")),9) occurs(action(("lift","hoist1","crate6","pallet1","distributor0")),9) occurs(action(("load","hoist2","crate5","truck0","distributor1")),9) occurs(action(("drive","truck1","depot0","distributor0")),9) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),10) occurs(action(("unload","hoist2","crate4","truck0","distributor1")),10) occurs(action(("load","hoist1","crate6","truck1","distributor0")),10) occurs(action(("drive","truck1","distributor0","depot0")),10) occurs(action(("unload","hoist0","crate6","truck1","depot0")),11) occurs(action(("load","hoist2","crate4","truck0","distributor1")),11) occurs(action(("drive","truck1","depot0","distributor0")),11) occurs(action(("drop","hoist0","crate6","crate9","depot0")),12) occurs(action(("unload","hoist1","crate1","truck1","distributor0")),12) occurs(action(("drive","truck1","distributor0","distributor1")),12) occurs(action(("lift","hoist2","crate2","crate0","distributor1")),12) occurs(action(("drive","truck0","distributor1","depot0")),12) occurs(action(("drop","hoist1","crate1","pallet1","distributor0")),13) occurs(action(("unload","hoist0","crate4","truck0","depot0")),13) occurs(action(("load","hoist2","crate2","truck1","distributor1")),13) occurs(action(("drive","truck1","distributor1","distributor0")),13) occurs(action(("drop","hoist0","crate4","crate6","depot0")),14) occurs(action(("unload","hoist1","crate7","truck1","distributor0")),14) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),14) occurs(action(("drive","truck1","distributor0","distributor1")),14) occurs(action(("drop","hoist1","crate7","crate1","distributor0")),15) occurs(action(("unload","hoist0","crate5","truck0","depot0")),15) occurs(action(("drive","truck0","depot0","distributor1")),15) occurs(action(("drive","truck1","distributor1","distributor0")),15) occurs(action(("drop","hoist0","crate5","crate4
|
||
|
|
Solving Time: 0.16s
|
||
|
|
Memory: 345MB (+6MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 5.678s (Solving: 0.13s 1st Model: 0.11s Unsat: 0.03s)
|
||
|
|
CPU Time : 5.650s
|
||
|
|
|
||
|
|
Choices : 2299
|
||
|
|
Conflicts : 680 (Analyzed: 678)
|
||
|
|
Restarts : 8 (Average: 84.75 Last: 52)
|
||
|
|
Model-Level : 71.0
|
||
|
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||
|
|
Lemmas : 678 (Deleted: 0)
|
||
|
|
Binary : 103 (Ratio: 15.19%)
|
||
|
|
Ternary : 50 (Ratio: 7.37%)
|
||
|
|
Conflict : 678 (Average Length: 44.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 678 (Average: 4.85 Max: 68 Sum: 3289)
|
||
|
|
Executed : 612 (Average: 3.31 Max: 68 Sum: 2243 Ratio: 68.20%)
|
||
|
|
Bounded : 66 (Average: 15.85 Max: 22 Sum: 1046 Ratio: 31.80%)
|
||
|
|
|
||
|
|
Rules : 595437
|
||
|
|
Atoms : 595437
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 50318 (Eliminated: 0 Frozen: 42890)
|
||
|
|
Constraints : 174480 (Binary: 95.3% Ternary: 2.3% Other: 2.4%)
|
||
|
|
|
||
|
|
Memory Peak : 345MB
|
||
|
|
Max. Length : 20 steps
|
||
|
|
Sol. Length : 20 steps
|
||
|
|
|
||
|
|
|