160 lines
6.1 KiB
Plaintext
160 lines
6.1 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-28.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-28.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-28.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-28.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.090s CPU, 0.096s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Generated 110 rules.
|
||
|
|
Computing model... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
90 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
90 final queue length
|
||
|
|
128 total queue pushes
|
||
|
|
Completing instantiation... [0.020s CPU, 0.012s wall-clock]
|
||
|
|
Instantiating: [0.060s CPU, 0.063s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
42 initial candidates
|
||
|
|
Finding invariants: [0.090s CPU, 0.095s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s 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...
|
||
|
|
9 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.100s CPU, 0.100s 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]
|
||
|
|
20 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
15 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.000s CPU, 0.009s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
16 of 24 variables necessary.
|
||
|
|
0 of 15 mutex groups necessary.
|
||
|
|
31 of 47 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Translator variables: 16
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 35
|
||
|
|
Translator goal facts: 5
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 31
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 253
|
||
|
|
Translator peak memory: 36300 KB
|
||
|
|
Writing output... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Done! [0.300s CPU, 0.308s 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: 51MB (+1MB)
|
||
|
|
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_cb3"),1) occurs(action("wait_cb3-condeff2-yes"),2) occurs(action("wait_cb3-condeff1-no-0"),2) occurs(action("wait_cb3-condeff0-no-0"),2) occurs(action("wait_cb3-endof-condeffs"),3) occurs(action("wait_cb2"),4) occurs(action("wait_cb1"),4) occurs(action("open-sd10"),5) occurs(action("close_cb3"),6) occurs(action("wait_cb3"),7) occurs(action("wait_cb3-condeff2-no-0"),8) occurs(action("wait_cb3-condeff1-no-0"),8) occurs(action("wait_cb3-condeff0-no-0"),8) occurs(action("wait_cb3-condeff2-no-0"),9) occurs(action("wait_cb3-condeff1-no-0"),9) occurs(action("wait_cb3-condeff0-no-0"),9) occurs(action("wait_cb3-endof-condeffs"),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.050s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.048s
|
||
|
|
|
||
|
|
Choices : 79 (Domain: 76)
|
||
|
|
Conflicts : 25 (Analyzed: 24)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 27.5
|
||
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||
|
|
Lemmas : 24 (Deleted: 0)
|
||
|
|
Binary : 1 (Ratio: 4.17%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 24 (Average Length: 19.1 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 24 (Average: 3.04 Max: 17 Sum: 73)
|
||
|
|
Executed : 21 (Average: 2.00 Max: 17 Sum: 48 Ratio: 65.75%)
|
||
|
|
Bounded : 3 (Average: 8.33 Max: 12 Sum: 25 Ratio: 34.25%)
|
||
|
|
|
||
|
|
Rules : 2119 (Original: 1985)
|
||
|
|
Atoms : 1162
|
||
|
|
Bodies : 1085 (Original: 1037)
|
||
|
|
Count : 23 (Original: 78)
|
||
|
|
Equivalences : 444 (Atom=Atom: 87 Body=Body: 0 Other: 357)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1173 (Eliminated: 0 Frozen: 176)
|
||
|
|
Constraints : 4625 (Binary: 85.5% Ternary: 11.4% Other: 3.2%)
|
||
|
|
|
||
|
|
Memory Peak : 51MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|