188 lines
7.2 KiB
Plaintext
188 lines
7.2 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-30.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-30.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-30.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-30.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.150s CPU, 0.152s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Generated 222 rules.
|
||
|
|
Computing model... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
159 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
159 final queue length
|
||
|
|
247 total queue pushes
|
||
|
|
Completing instantiation... [0.010s CPU, 0.019s wall-clock]
|
||
|
|
Instantiating: [0.090s CPU, 0.097s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
60 initial candidates
|
||
|
|
Finding invariants: [0.400s CPU, 0.395s 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...
|
||
|
|
9 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.410s CPU, 0.403s 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.002s wall-clock]
|
||
|
|
Translating task: [0.030s CPU, 0.028s wall-clock]
|
||
|
|
33 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
22 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
19 of 31 variables necessary.
|
||
|
|
0 of 22 mutex groups necessary.
|
||
|
|
74 of 98 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.000s CPU, 0.009s wall-clock]
|
||
|
|
Translator variables: 19
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 45
|
||
|
|
Translator goal facts: 8
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 74
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 504
|
||
|
|
Translator peak memory: 37068 KB
|
||
|
|
Writing output... [0.020s CPU, 0.012s wall-clock]
|
||
|
|
Done! [0.730s CPU, 0.735s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.02s
|
||
|
|
Memory: 50MB
|
||
|
|
|
||
|
|
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 (+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
|
||
|
|
Expected Memory: 50MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.02s
|
||
|
|
|
||
|
|
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: 52.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.02s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 53.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.02s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.05s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 54.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("wait_cb2"),1) occurs(action("wait_cb2-condeff2-yes"),2) occurs(action("wait_cb2-condeff1-yes"),2) occurs(action("wait_cb2-condeff0-no-0"),2) occurs(action("wait_cb2-endof-condeffs"),3) occurs(action("wait_cb1"),4) occurs(action("wait_cb1-condeff0-yes"),5) occurs(action("wait_cb1-endof-condeffs"),6) occurs(action("wait_cb3"),7) occurs(action("open-sd11"),8) occurs(action("open-sd10"),8) occurs(action("open-sd1"),8) occurs(action("close_cb2"),9) occurs(action("wait_cb2"),10) occurs(action("wait_cb2-condeff2-no-0"),11) occurs(action("wait_cb2-condeff1-no-0"),11) occurs(action("wait_cb2-condeff0-no-0"),11) occurs(action("wait_cb2-endof-condeffs"),12) occurs(action("close_cb1"),13) occurs(action("wait_cb1"),14) occurs(action("wait_cb1-condeff0-no-0"),15) occurs(action("wait_cb1-condeff0-no-0"),16) occurs(action("wait_cb1-condeff0-no-0"),17) occurs(action("wait_cb1-condeff0-no-0"),18) occurs(action("wait_cb1-condeff0-no-0"),19) occurs(action("wait_cb1-endof-condeffs"),20)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 6
|
||
|
|
Time : 0.114s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.01s)
|
||
|
|
CPU Time : 0.104s
|
||
|
|
|
||
|
|
Choices : 657 (Domain: 657)
|
||
|
|
Conflicts : 273 (Analyzed: 270)
|
||
|
|
Restarts : 1 (Average: 270.00 Last: 76)
|
||
|
|
Model-Level : 57.0
|
||
|
|
Problems : 6 (Average Length: 12.83 Splits: 0)
|
||
|
|
Lemmas : 270 (Deleted: 0)
|
||
|
|
Binary : 5 (Ratio: 1.85%)
|
||
|
|
Ternary : 7 (Ratio: 2.59%)
|
||
|
|
Conflict : 270 (Average Length: 92.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 270 (Average: 2.56 Max: 23 Sum: 692)
|
||
|
|
Executed : 257 (Average: 2.12 Max: 23 Sum: 572 Ratio: 82.66%)
|
||
|
|
Bounded : 13 (Average: 9.23 Max: 15 Sum: 120 Ratio: 17.34%)
|
||
|
|
|
||
|
|
Rules : 5295 (Original: 5079)
|
||
|
|
Atoms : 2210
|
||
|
|
Bodies : 3212 (Original: 3136)
|
||
|
|
Count : 62 (Original: 123)
|
||
|
|
Equivalences : 877 (Atom=Atom: 96 Body=Body: 0 Other: 781)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 3682 (Eliminated: 0 Frozen: 1349)
|
||
|
|
Constraints : 18317 (Binary: 90.1% Ternary: 7.5% Other: 2.4%)
|
||
|
|
|
||
|
|
Memory Peak : 54MB
|
||
|
|
Max. Length : 20 steps
|
||
|
|
Sol. Length : 20 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|