143 lines
6.1 KiB
Plaintext
143 lines
6.1 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.028s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.023s wall-clock]
|
||
|
|
Generated 46 rules.
|
||
|
|
Computing model... [0.320s CPU, 0.325s wall-clock]
|
||
|
|
3114 relevant atoms
|
||
|
|
1522 auxiliary atoms
|
||
|
|
4636 final queue length
|
||
|
|
9238 total queue pushes
|
||
|
|
Completing instantiation... [0.790s CPU, 0.795s wall-clock]
|
||
|
|
Instantiating: [1.170s CPU, 1.180s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
1 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.050s CPU, 0.046s 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.002s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.040s CPU, 0.038s wall-clock]
|
||
|
|
Translating task: [0.640s CPU, 0.637s wall-clock]
|
||
|
|
225 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
69 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.310s CPU, 0.310s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
19 of 19 variables necessary.
|
||
|
|
1 of 19 mutex groups necessary.
|
||
|
|
2384 of 2384 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.100s CPU, 0.100s wall-clock]
|
||
|
|
Translator variables: 19
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 277
|
||
|
|
Translator goal facts: 1
|
||
|
|
Translator mutex groups: 1
|
||
|
|
Translator total mutex groups size: 10
|
||
|
|
Translator operators: 2384
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 14119
|
||
|
|
Translator peak memory: 42584 KB
|
||
|
|
Writing output... [0.220s CPU, 0.244s wall-clock]
|
||
|
|
Done! [2.550s CPU, 2.582s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 8.43s
|
||
|
|
Memory: 545MB
|
||
|
|
|
||
|
|
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.04s
|
||
|
|
Memory: 545MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.04s
|
||
|
|
|
||
|
|
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: 10.41s
|
||
|
|
Memory: 1531MB (+986MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.83s
|
||
|
|
Memory: 1586MB (+55MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 20.04s
|
||
|
|
|
||
|
|
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: 13.72s
|
||
|
|
Memory: 2129MB (+543MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("move","node2-4","node1-4")),1) occurs(action(("move","node1-4","node0-4")),2) occurs(action(("move","node0-4","node0-3")),3) occurs(action(("pickup","node0-4","key2")),3) occurs(action(("move","node0-3","node0-2")),4) occurs(action(("putdown","node0-2","key2")),4) occurs(action(("pickup","node0-2","key3")),5) occurs(action(("move","node0-2","node1-2")),5) occurs(action(("unlock","node1-2","node2-2","key3","square")),5) occurs(action(("move","node1-2","node2-2")),6) occurs(action(("pickup-and-loose","node2-2","key8","key3")),6) occurs(action(("unlock","node2-2","node2-3","key3","square")),6) occurs(action(("pickup-and-loose","node2-3","key0","key8")),7) occurs(action(("move","node2-2","node2-3")),7) occurs(action(("move","node2-3","node1-3")),8) occurs(action(("move","node1-3","node1-2")),9) occurs(action(("putdown","node1-1","key0")),10) occurs(action(("move","node1-2","node1-1")),10)
|
||
|
|
Solving Time: 5.16s
|
||
|
|
Memory: 2180MB (+51MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 62.737s (Solving: 4.81s 1st Model: 4.54s Unsat: 0.26s)
|
||
|
|
CPU Time : 62.700s
|
||
|
|
|
||
|
|
Choices : 5612
|
||
|
|
Conflicts : 2632 (Analyzed: 2631)
|
||
|
|
Restarts : 31 (Average: 84.87 Last: 53)
|
||
|
|
Model-Level : 27.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 3542 (Deleted: 1227)
|
||
|
|
Binary : 263 (Ratio: 7.43%)
|
||
|
|
Ternary : 116 (Ratio: 3.27%)
|
||
|
|
Conflict : 2631 (Average Length: 186.0 Ratio: 74.28%)
|
||
|
|
Loop : 911 (Average Length: 47.4 Ratio: 25.72%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 2631 (Average: 2.10 Max: 28 Sum: 5535)
|
||
|
|
Executed : 2615 (Average: 2.03 Max: 28 Sum: 5349 Ratio: 96.64%)
|
||
|
|
Bounded : 16 (Average: 11.62 Max: 12 Sum: 186 Ratio: 3.36%)
|
||
|
|
|
||
|
|
Rules : 3560306
|
||
|
|
Atoms : 3560306
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 155502 (Eliminated: 0 Frozen: 147423)
|
||
|
|
Constraints : 401731 (Binary: 87.0% Ternary: 7.1% Other: 5.9%)
|
||
|
|
|
||
|
|
Memory Peak : 2266MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|