174 lines
6.5 KiB
Plaintext
174 lines
6.5 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-11.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-11.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-11.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-11.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.060s CPU, 0.067s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.007s 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 96 rules.
|
||
|
|
Computing model... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
76 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
76 final queue length
|
||
|
|
110 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...
|
||
|
|
34 initial candidates
|
||
|
|
Finding invariants: [0.130s CPU, 0.136s 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...
|
||
|
|
6 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.140s CPU, 0.140s 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.010s CPU, 0.012s wall-clock]
|
||
|
|
16 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
12 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
12 of 18 variables necessary.
|
||
|
|
0 of 12 mutex groups necessary.
|
||
|
|
29 of 41 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Translator variables: 12
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 28
|
||
|
|
Translator goal facts: 5
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 29
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 211
|
||
|
|
Translator peak memory: 36300 KB
|
||
|
|
Writing output... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Done! [0.280s CPU, 0.295s 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: 51MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 52.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.01s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff0-yes"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("wait_cb2"),4) occurs(action("wait_cb2-condeff1-yes"),5) occurs(action("wait_cb2-condeff0-yes"),5) occurs(action("wait_cb2-endof-condeffs"),6) occurs(action("open-sd6"),7) occurs(action("open-sd1"),7) occurs(action("open-sd5"),7) occurs(action("close_cb1"),8) occurs(action("wait_cb1"),9) occurs(action("wait_cb1-condeff0-no-0"),10) occurs(action("wait_cb1-endof-condeffs"),11) occurs(action("close_cb2"),12) occurs(action("wait_cb2"),13) occurs(action("wait_cb2-condeff1-no-0"),14) occurs(action("wait_cb2-condeff0-no-0"),14) occurs(action("wait_cb2-endof-condeffs"),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 0.071s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.064s
|
||
|
|
|
||
|
|
Choices : 201 (Domain: 199)
|
||
|
|
Conflicts : 67 (Analyzed: 65)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 38.0
|
||
|
|
Problems : 5 (Average Length: 11.00 Splits: 0)
|
||
|
|
Lemmas : 65 (Deleted: 0)
|
||
|
|
Binary : 9 (Ratio: 13.85%)
|
||
|
|
Ternary : 3 (Ratio: 4.62%)
|
||
|
|
Conflict : 65 (Average Length: 26.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 65 (Average: 3.77 Max: 20 Sum: 245)
|
||
|
|
Executed : 56 (Average: 2.45 Max: 20 Sum: 159 Ratio: 64.90%)
|
||
|
|
Bounded : 9 (Average: 9.56 Max: 12 Sum: 86 Ratio: 35.10%)
|
||
|
|
|
||
|
|
Rules : 2604 (Original: 2100)
|
||
|
|
Atoms : 1084
|
||
|
|
Bodies : 1468 (Original: 1221)
|
||
|
|
Count : 25 (Original: 91)
|
||
|
|
Equivalences : 503 (Atom=Atom: 67 Body=Body: 0 Other: 436)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1688 (Eliminated: 0 Frozen: 272)
|
||
|
|
Constraints : 6927 (Binary: 84.9% Ternary: 12.1% Other: 3.0%)
|
||
|
|
|
||
|
|
Memory Peak : 51MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|