174 lines
6.6 KiB
Plaintext
174 lines
6.6 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-44.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-44.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-44.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-44.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.100s CPU, 0.107s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Generated 182 rules.
|
||
|
|
Computing model... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
123 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
123 final queue length
|
||
|
|
199 total queue pushes
|
||
|
|
Completing instantiation... [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Instantiating: [0.080s CPU, 0.078s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
45 initial candidates
|
||
|
|
Finding invariants: [0.400s CPU, 0.394s 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...
|
||
|
|
11 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.400s CPU, 0.399s 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.023s wall-clock]
|
||
|
|
34 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
13 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
23 of 24 variables necessary.
|
||
|
|
0 of 13 mutex groups necessary.
|
||
|
|
75 of 77 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Translator variables: 23
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 54
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 75
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 555
|
||
|
|
Translator peak memory: 37068 KB
|
||
|
|
Writing output... [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Done! [0.650s CPU, 0.658s 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: 53MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.02s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("wait_cb4"),1) occurs(action("wait_cb4-condeff0-yes"),2) occurs(action("wait_cb4-endof-condeffs"),3) occurs(action("wait_cb3"),4) occurs(action("wait_cb2"),4) occurs(action("open-sd3"),5) occurs(action("open-sd8"),5) occurs(action("open-sd7"),5) occurs(action("close_cb4"),6) occurs(action("wait_cb4"),7) occurs(action("wait_cb4-condeff0-no-0"),8) occurs(action("wait_cb4-endof-condeffs"),9) occurs(action("close_sd2"),10) occurs(action("close_sd2-condeff1-no-0"),11) occurs(action("close_sd2-condeff1-no-1"),11) occurs(action("close_sd2-condeff0-no-0"),11) occurs(action("close_sd2-endof-condeffs"),12) occurs(action("close_sd5"),13) occurs(action("close_sd5-condeff0-no-0"),14) occurs(action("close_sd5-endof-condeffs"),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 0.089s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.084s
|
||
|
|
|
||
|
|
Choices : 304 (Domain: 300)
|
||
|
|
Conflicts : 111 (Analyzed: 109)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 54.5
|
||
|
|
Problems : 5 (Average Length: 11.00 Splits: 0)
|
||
|
|
Lemmas : 109 (Deleted: 0)
|
||
|
|
Binary : 11 (Ratio: 10.09%)
|
||
|
|
Ternary : 1 (Ratio: 0.92%)
|
||
|
|
Conflict : 109 (Average Length: 41.7 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 109 (Average: 2.28 Max: 17 Sum: 249)
|
||
|
|
Executed : 106 (Average: 2.10 Max: 17 Sum: 229 Ratio: 91.97%)
|
||
|
|
Bounded : 3 (Average: 6.67 Max: 12 Sum: 20 Ratio: 8.03%)
|
||
|
|
|
||
|
|
Rules : 6029 (Original: 5668)
|
||
|
|
Atoms : 2473
|
||
|
|
Bodies : 3744 (Original: 3576)
|
||
|
|
Count : 48 (Original: 144)
|
||
|
|
Equivalences : 1041 (Atom=Atom: 137 Body=Body: 0 Other: 904)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 3106 (Eliminated: 0 Frozen: 868)
|
||
|
|
Constraints : 14564 (Binary: 89.0% Ternary: 8.9% Other: 2.1%)
|
||
|
|
|
||
|
|
Memory Peak : 53MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|