143 lines
6.5 KiB
Plaintext
143 lines
6.5 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-4.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/gripper-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-4.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.000s CPU, 0.011s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Generated 24 rules.
|
||
|
|
Computing model... [0.020s CPU, 0.021s wall-clock]
|
||
|
|
171 relevant atoms
|
||
|
|
120 auxiliary atoms
|
||
|
|
291 final queue length
|
||
|
|
384 total queue pushes
|
||
|
|
Completing instantiation... [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Instantiating: [0.070s CPU, 0.063s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
10 initial candidates
|
||
|
|
Finding invariants: [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Translating task: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
3 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
13 of 13 variables necessary.
|
||
|
|
10 of 13 mutex groups necessary.
|
||
|
|
82 of 82 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Translator variables: 13
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 54
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 10
|
||
|
|
Translator total mutex groups size: 40
|
||
|
|
Translator operators: 82
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 563
|
||
|
|
Translator peak memory: 33112 KB
|
||
|
|
Writing output... [0.000s CPU, 0.013s wall-clock]
|
||
|
|
Done! [0.140s CPU, 0.145s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.06s
|
||
|
|
Memory: 47MB
|
||
|
|
|
||
|
|
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: 47MB (+0MB)
|
||
|
|
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: 48MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 48MB (+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.01s
|
||
|
|
Memory: 49MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("pick","ball4","rooma","left")),1) occurs(action(("pick","ball3","rooma","right")),1) occurs(action(("move","rooma","roomb")),1) occurs(action(("drop","ball4","roomb","left")),2) occurs(action(("drop","ball3","roomb","right")),2) occurs(action(("move","roomb","rooma")),2) occurs(action(("pick","ball8","rooma","right")),3) occurs(action(("pick","ball5","rooma","left")),3) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball8","roomb","right")),4) occurs(action(("drop","ball5","roomb","left")),4) occurs(action(("move","roomb","rooma")),4) occurs(action(("pick","ball6","rooma","left")),5) occurs(action(("pick","ball10","rooma","right")),5) occurs(action(("move","rooma","roomb")),5) occurs(action(("drop","ball6","roomb","left")),6) occurs(action(("drop","ball10","roomb","right")),6) occurs(action(("move","roomb","rooma")),6) occurs(action(("pick","ball9","rooma","right")),7) occurs(action(("pick","ball2","rooma","left")),7) occurs(action(("move","rooma","roomb")),7) occurs(action(("drop","ball9","roomb","right")),8) occurs(action(("drop","ball2","roomb","left")),8) occurs(action(("move","roomb","rooma")),8) occurs(action(("pick","ball7","rooma","right")),9) occurs(action(("pick","ball1","rooma","left")),9) occurs(action(("move","rooma","roomb")),9) occurs(action(("drop","ball7","roomb","right")),10) occurs(action(("drop","ball1","roomb","left")),10)
|
||
|
|
Solving Time: 0.09s
|
||
|
|
Memory: 49MB (+0MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.195s (Solving: 0.09s 1st Model: 0.09s Unsat: 0.01s)
|
||
|
|
CPU Time : 0.200s
|
||
|
|
|
||
|
|
Choices : 5149
|
||
|
|
Conflicts : 3509 (Analyzed: 3508)
|
||
|
|
Restarts : 40 (Average: 87.70 Last: 44)
|
||
|
|
Model-Level : 36.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 3508 (Deleted: 1092)
|
||
|
|
Binary : 39 (Ratio: 1.11%)
|
||
|
|
Ternary : 135 (Ratio: 3.85%)
|
||
|
|
Conflict : 3508 (Average Length: 16.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 3508 (Average: 1.35 Max: 21 Sum: 4733)
|
||
|
|
Executed : 3506 (Average: 1.35 Max: 21 Sum: 4731 Ratio: 99.96%)
|
||
|
|
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.04%)
|
||
|
|
|
||
|
|
Rules : 11680
|
||
|
|
Atoms : 11680
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1929 (Eliminated: 0 Frozen: 619)
|
||
|
|
Constraints : 8060 (Binary: 86.7% Ternary: 11.5% Other: 1.8%)
|
||
|
|
|
||
|
|
Memory Peak : 50MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|