223 lines
7.6 KiB
Plaintext
223 lines
7.6 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.014s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Preparing model... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Generated 24 rules.
|
||
|
|
Computing model... [0.030s CPU, 0.028s wall-clock]
|
||
|
|
171 relevant atoms
|
||
|
|
120 auxiliary atoms
|
||
|
|
291 final queue length
|
||
|
|
384 total queue pushes
|
||
|
|
Completing instantiation... [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Instantiating: [0.080s CPU, 0.084s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
10 initial candidates
|
||
|
|
Finding invariants: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.020s CPU, 0.021s 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.002s wall-clock]
|
||
|
|
Translating task: [0.020s CPU, 0.025s 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.014s 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.010s CPU, 0.006s 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.010s CPU, 0.013s wall-clock]
|
||
|
|
Done! [0.170s CPU, 0.182s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.04s
|
||
|
|
Memory: 46MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [0]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 46MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [5]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 47MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 47MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.03s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [10]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 48MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.09s
|
||
|
|
Memory: 48MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.12s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [15]
|
||
|
|
Grounded Until: 10
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 49MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.37s
|
||
|
|
Memory: 50MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.39s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [15]
|
||
|
|
Grounded Until: 15
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.44s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.44s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [15]
|
||
|
|
Grounded Until: 15
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.48s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.48s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [15]
|
||
|
|
Grounded Until: 15
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.56s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.56s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [15]
|
||
|
|
Grounded Until: 15
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.55s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.55s
|
||
|
|
|
||
|
|
Iteration 9
|
||
|
|
Queue: [15]
|
||
|
|
Grounded Until: 15
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.58s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.58s
|
||
|
|
|
||
|
|
Iteration 10
|
||
|
|
Queue: [15]
|
||
|
|
Grounded Until: 15
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.02s
|
||
|
|
|
||
|
|
Iteration 11
|
||
|
|
Queue: [20]
|
||
|
|
Grounded Until: 15
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("pick","ball7","rooma","right")),1) occurs(action(("pick","ball6","rooma","left")),2) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball7","roomb","right")),4) occurs(action(("drop","ball6","roomb","left")),4) occurs(action(("move","roomb","rooma")),5) occurs(action(("pick","ball5","rooma","left")),6) occurs(action(("pick","ball1","rooma","right")),6) occurs(action(("move","rooma","roomb")),7) occurs(action(("drop","ball5","roomb","left")),8) occurs(action(("drop","ball1","roomb","right")),8) occurs(action(("move","roomb","rooma")),9) occurs(action(("pick","ball9","rooma","right")),10) occurs(action(("pick","ball10","rooma","left")),10) occurs(action(("move","rooma","roomb")),11) occurs(action(("drop","ball9","roomb","right")),12) occurs(action(("drop","ball10","roomb","left")),12) occurs(action(("move","roomb","rooma")),13) occurs(action(("pick","ball3","rooma","right")),14) occurs(action(("pick","ball2","rooma","left")),14) occurs(action(("move","rooma","roomb")),15) occurs(action(("drop","ball3","roomb","right")),16) occurs(action(("drop","ball2","roomb","left")),16) occurs(action(("move","roomb","rooma")),17) occurs(action(("pick","ball8","rooma","right")),18) occurs(action(("pick","ball4","rooma","left")),18) occurs(action(("move","rooma","roomb")),19) occurs(action(("drop","ball8","roomb","right")),20) occurs(action(("drop","ball4","roomb","left")),20)
|
||
|
|
Solving Time: 0.29s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 11
|
||
|
|
Time : 3.505s (Solving: 3.37s 1st Model: 0.29s Unsat: 0.11s)
|
||
|
|
CPU Time : 3.510s
|
||
|
|
|
||
|
|
Choices : 78574
|
||
|
|
Conflicts : 59198 (Analyzed: 59195)
|
||
|
|
Restarts : 693 (Average: 85.42 Last: 108)
|
||
|
|
Model-Level : 55.0
|
||
|
|
Problems : 11 (Average Length: 14.73 Splits: 0)
|
||
|
|
Lemmas : 59195 (Deleted: 45830)
|
||
|
|
Binary : 330 (Ratio: 0.56%)
|
||
|
|
Ternary : 770 (Ratio: 1.30%)
|
||
|
|
Conflict : 59195 (Average Length: 17.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 59195 (Average: 1.26 Max: 39 Sum: 74305)
|
||
|
|
Executed : 59153 (Average: 1.25 Max: 39 Sum: 74027 Ratio: 99.63%)
|
||
|
|
Bounded : 42 (Average: 6.62 Max: 22 Sum: 278 Ratio: 0.37%)
|
||
|
|
|
||
|
|
Rules : 1876
|
||
|
|
Atoms : 1876
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 4479 (Eliminated: 0 Frozen: 2210)
|
||
|
|
Constraints : 21203 (Binary: 87.0% Ternary: 9.5% Other: 3.5%)
|
||
|
|
|
||
|
|
Memory Peak : 52MB
|
||
|
|
Max. Length : 20 steps
|
||
|
|
Sol. Length : 20 steps
|
||
|
|
|
||
|
|
|