148 lines
6.7 KiB
Plaintext
148 lines
6.7 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-2.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-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.020s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.012s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.060s CPU, 0.066s wall-clock]
|
||
|
|
360 relevant atoms
|
||
|
|
362 auxiliary atoms
|
||
|
|
722 final queue length
|
||
|
|
1160 total queue pushes
|
||
|
|
Completing instantiation... [0.080s CPU, 0.079s wall-clock]
|
||
|
|
Instantiating: [0.180s CPU, 0.188s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.049s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
16 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.080s CPU, 0.075s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Translating task: [0.080s CPU, 0.083s wall-clock]
|
||
|
|
216 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
22 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.040s CPU, 0.040s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
20 of 20 variables necessary.
|
||
|
|
14 of 20 mutex groups necessary.
|
||
|
|
180 of 180 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.030s CPU, 0.022s wall-clock]
|
||
|
|
Translator variables: 20
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 86
|
||
|
|
Translator goal facts: 4
|
||
|
|
Translator mutex groups: 14
|
||
|
|
Translator total mutex groups size: 98
|
||
|
|
Translator operators: 180
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1648
|
||
|
|
Translator peak memory: 37068 KB
|
||
|
|
Writing output... [0.030s CPU, 0.032s wall-clock]
|
||
|
|
Done! [0.460s CPU, 0.470s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.07s
|
||
|
|
Memory: 52MB
|
||
|
|
|
||
|
|
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.00s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
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.02s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.03s
|
||
|
|
|
||
|
|
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.02s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 56MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.05s
|
||
|
|
Memory: 58MB (+2MB)
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist0","crate0","pallet0","depot0")),1) occurs(action(("lift","hoist2","crate2","crate1","distributor1")),1) occurs(action(("drive","truck0","depot0","distributor1")),1) occurs(action(("load","hoist2","crate2","truck0","distributor1")),2) occurs(action(("load","hoist0","crate0","truck1","depot0")),2) occurs(action(("drive","truck1","depot0","distributor1")),2) occurs(action(("drive","truck0","distributor1","depot0")),2) occurs(action(("unload","hoist0","crate2","truck0","depot0")),3) occurs(action(("lift","hoist2","crate1","pallet2","distributor1")),3) occurs(action(("drive","truck0","depot0","distributor1")),3) occurs(action(("drop","hoist0","crate2","pallet0","depot0")),4) occurs(action(("drive","truck0","distributor1","distributor0")),4) occurs(action(("load","hoist2","crate1","truck0","distributor1")),4) occurs(action(("unload","hoist1","crate1","truck0","distributor0")),5) occurs(action(("unload","hoist2","crate0","truck1","distributor1")),5) occurs(action(("drive","truck0","distributor0","depot0")),5) occurs(action(("drive","truck1","distributor1","depot0")),5) occurs(action(("drop","hoist1","crate1","crate3","distributor0")),6) occurs(action(("drop","hoist2","crate0","pallet2","distributor1")),6) occurs(action(("drive","truck0","depot0","distributor1")),7) occurs(action(("drive","truck0","distributor1","depot0")),8) occurs(action(("drive","truck0","depot0","distributor1")),9) occurs(action(("drive","truck0","distributor1","depot0")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.135s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.132s
|
||
|
|
|
||
|
|
Choices : 98 (Domain: 94)
|
||
|
|
Conflicts : 6 (Analyzed: 5)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 72.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 5 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 40.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 5 (Average Length: 2.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 5 (Average: 11.40 Max: 35 Sum: 57)
|
||
|
|
Executed : 3 (Average: 7.60 Max: 35 Sum: 38 Ratio: 66.67%)
|
||
|
|
Bounded : 2 (Average: 9.50 Max: 12 Sum: 19 Ratio: 33.33%)
|
||
|
|
|
||
|
|
Rules : 4923
|
||
|
|
Atoms : 4923
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 3349 (Eliminated: 0 Frozen: 585)
|
||
|
|
Constraints : 16801 (Binary: 92.0% Ternary: 4.4% Other: 3.6%)
|
||
|
|
|
||
|
|
Memory Peak : 58MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 1
|
||
|
|
|
||
|
|
|