160 lines
5.9 KiB
Plaintext
160 lines
5.9 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-21.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-21.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-2004/domains/psr-small-strips/domains/domain-21.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-21.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.060s CPU, 0.060s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Generated 110 rules.
|
||
|
|
Computing model... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
95 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
95 final queue length
|
||
|
|
131 total queue pushes
|
||
|
|
Completing instantiation... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Instantiating: [0.050s CPU, 0.050s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
45 initial candidates
|
||
|
|
Finding invariants: [0.060s CPU, 0.056s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
7 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.060s CPU, 0.061s 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.000s CPU, 0.000s 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.016s wall-clock]
|
||
|
|
14 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
18 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
13 of 25 variables necessary.
|
||
|
|
0 of 18 mutex groups necessary.
|
||
|
|
25 of 49 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Translator variables: 13
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 28
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 25
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 205
|
||
|
|
Translator peak memory: 36300 KB
|
||
|
|
Writing output... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Done! [0.210s CPU, 0.218s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.02s
|
||
|
|
Memory: 49MB
|
||
|
|
|
||
|
|
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: 50MB (+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
|
||
|
|
Expected Memory: 50MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 50MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.01s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("wait_cb2"),1) occurs(action("wait_cb2-condeff0-yes"),2) occurs(action("wait_cb2-endof-condeffs"),3) occurs(action("wait_cb3"),4) occurs(action("wait_cb1"),4) occurs(action("open-sd6"),5) occurs(action("close_cb2"),6) occurs(action("wait_cb2"),7) occurs(action("wait_cb2-condeff0-no-0"),8) occurs(action("wait_cb2-condeff0-no-0"),9) occurs(action("wait_cb2-endof-condeffs"),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.049s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.048s
|
||
|
|
|
||
|
|
Choices : 71 (Domain: 71)
|
||
|
|
Conflicts : 21 (Analyzed: 20)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 24.5
|
||
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||
|
|
Lemmas : 20 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 10.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 20 (Average Length: 21.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 20 (Average: 3.40 Max: 17 Sum: 68)
|
||
|
|
Executed : 17 (Average: 2.30 Max: 17 Sum: 46 Ratio: 67.65%)
|
||
|
|
Bounded : 3 (Average: 7.33 Max: 12 Sum: 22 Ratio: 32.35%)
|
||
|
|
|
||
|
|
Rules : 1916 (Original: 1610)
|
||
|
|
Atoms : 938
|
||
|
|
Bodies : 1032 (Original: 867)
|
||
|
|
Count : 7 (Original: 66)
|
||
|
|
Equivalences : 346 (Atom=Atom: 67 Body=Body: 0 Other: 279)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1095 (Eliminated: 0 Frozen: 91)
|
||
|
|
Constraints : 4313 (Binary: 84.0% Ternary: 13.0% Other: 3.0%)
|
||
|
|
|
||
|
|
Memory Peak : 51MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|