195 lines
8.6 KiB
Plaintext
195 lines
8.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-6.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-6.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.013s 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.010s CPU, 0.012s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Generated 24 rules.
|
||
|
|
Computing model... [0.030s CPU, 0.031s wall-clock]
|
||
|
|
231 relevant atoms
|
||
|
|
160 auxiliary atoms
|
||
|
|
391 final queue length
|
||
|
|
520 total queue pushes
|
||
|
|
Completing instantiation... [0.040s CPU, 0.036s wall-clock]
|
||
|
|
Instantiating: [0.090s CPU, 0.091s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
10 initial candidates
|
||
|
|
Finding invariants: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.007s 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.023s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s 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.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.030s CPU, 0.030s 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.020s CPU, 0.017s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
17 of 17 variables necessary.
|
||
|
|
14 of 17 mutex groups necessary.
|
||
|
|
114 of 114 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Translator variables: 17
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 74
|
||
|
|
Translator goal facts: 14
|
||
|
|
Translator mutex groups: 14
|
||
|
|
Translator total mutex groups size: 56
|
||
|
|
Translator operators: 114
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 783
|
||
|
|
Translator peak memory: 33368 KB
|
||
|
|
Writing output... [0.010s CPU, 0.016s wall-clock]
|
||
|
|
Done! [0.200s CPU, 0.201s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.04s
|
||
|
|
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.00s
|
||
|
|
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.02s
|
||
|
|
Memory: 49MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.53s
|
||
|
|
Memory: 50MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.56s
|
||
|
|
|
||
|
|
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: 0.02s
|
||
|
|
Memory: 52MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.79s
|
||
|
|
Memory: 55MB (+3MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.81s
|
||
|
|
|
||
|
|
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.02s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.76s
|
||
|
|
Memory: 57MB (+2MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.79s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 59MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.73s
|
||
|
|
Memory: 60MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.76s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 25
|
||
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 60MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("pick","ball10","rooma","left")),1) occurs(action(("pick","ball1","rooma","right")),1) occurs(action(("move","rooma","roomb")),2) occurs(action(("drop","ball10","roomb","left")),3) occurs(action(("drop","ball1","roomb","right")),3) occurs(action(("move","roomb","rooma")),4) occurs(action(("pick","ball13","rooma","left")),5) occurs(action(("pick","ball12","rooma","right")),5) occurs(action(("move","rooma","roomb")),6) occurs(action(("drop","ball13","roomb","left")),7) occurs(action(("drop","ball12","roomb","right")),7) occurs(action(("move","roomb","rooma")),8) occurs(action(("pick","ball2","rooma","left")),9) occurs(action(("pick","ball11","rooma","right")),9) occurs(action(("move","rooma","roomb")),10) occurs(action(("drop","ball2","roomb","left")),11) occurs(action(("drop","ball11","roomb","right")),11) occurs(action(("move","roomb","rooma")),12) occurs(action(("pick","ball5","rooma","left")),13) occurs(action(("pick","ball14","rooma","right")),13) occurs(action(("move","rooma","roomb")),14) occurs(action(("drop","ball5","roomb","left")),15) occurs(action(("drop","ball14","roomb","right")),15) occurs(action(("move","roomb","rooma")),16) occurs(action(("pick","ball6","rooma","left")),17) occurs(action(("pick","ball3","rooma","right")),17) occurs(action(("move","rooma","roomb")),18) occurs(action(("drop","ball6","roomb","left")),19) occurs(action(("drop","ball3","roomb","right")),19) occurs(action(("move","roomb","rooma")),20) occurs(action(("pick","ball7","rooma","left")),21) occurs(action(("pick","ball4","rooma","right")),21) occurs(action(("move","rooma","roomb")),22) occurs(action(("drop","ball7","roomb","left")),23) occurs(action(("drop","ball4","roomb","right")),23) occurs(action(("move","roomb","rooma")),24) occurs(action(("pick","ball9","rooma","right")),25) occurs(action(("pick","ball8","rooma","left")),25) occurs(action(("move","rooma","roomb")),26) occurs(action(("drop","ball9","roomb","right")),27) occurs(action(("drop","ball8","roomb","left")),27) occurs(action(("move","roomb","rooma")),28) occurs(action(("move","rooma","roomb")),29) occurs(action(("move","roomb","rooma")),30)
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 60MB (+0MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 7
|
||
|
|
Time : 3.022s (Solving: 2.82s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 3.020s
|
||
|
|
|
||
|
|
Choices : 156646 (Domain: 156646)
|
||
|
|
Conflicts : 33487 (Analyzed: 33486)
|
||
|
|
Restarts : 400 (Average: 83.72 Last: 118)
|
||
|
|
Model-Level : 400.0
|
||
|
|
Problems : 7 (Average Length: 17.00 Splits: 0)
|
||
|
|
Lemmas : 33486 (Deleted: 28232)
|
||
|
|
Binary : 247 (Ratio: 0.74%)
|
||
|
|
Ternary : 579 (Ratio: 1.73%)
|
||
|
|
Conflict : 33486 (Average Length: 157.1 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 33486 (Average: 2.74 Max: 284 Sum: 91846)
|
||
|
|
Executed : 33461 (Average: 2.74 Max: 284 Sum: 91653 Ratio: 99.79%)
|
||
|
|
Bounded : 25 (Average: 7.72 Max: 17 Sum: 193 Ratio: 0.21%)
|
||
|
|
|
||
|
|
Rules : 2604
|
||
|
|
Atoms : 2604
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 9251 (Eliminated: 0 Frozen: 4642)
|
||
|
|
Constraints : 45132 (Binary: 87.3% Ternary: 9.4% Other: 3.3%)
|
||
|
|
|
||
|
|
Memory Peak : 61MB
|
||
|
|
Max. Length : 30 steps
|
||
|
|
Sol. Length : 30 steps
|
||
|
|
|
||
|
|
|