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-27.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-27.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-27.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-27.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.100s CPU, 0.100s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.016s wall-clock]
|
||
|
|
Generated 150 rules.
|
||
|
|
Computing model... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
110 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
110 final queue length
|
||
|
|
168 total queue pushes
|
||
|
|
Completing instantiation... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Instantiating: [0.070s CPU, 0.070s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
45 initial candidates
|
||
|
|
Finding invariants: [0.300s CPU, 0.305s 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.000s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.310s CPU, 0.311s 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.019s wall-clock]
|
||
|
|
27 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
15 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
18 of 24 variables necessary.
|
||
|
|
0 of 15 mutex groups necessary.
|
||
|
|
52 of 64 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Translator variables: 18
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 42
|
||
|
|
Translator goal facts: 7
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 52
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 380
|
||
|
|
Translator peak memory: 36812 KB
|
||
|
|
Writing output... [0.000s CPU, 0.010s wall-clock]
|
||
|
|
Done! [0.530s CPU, 0.541s 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: 50MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
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: 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: 51MB (+0MB)
|
||
|
|
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: 52MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.02s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.04s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 53.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 53MB (+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-condeff2-yes"),5) occurs(action("wait_cb2-condeff1-no-0"),5) occurs(action("wait_cb2-condeff0-no-0"),5) occurs(action("wait_cb2-endof-condeffs"),6) occurs(action("wait_cb3"),7) occurs(action("open-sd8"),8) occurs(action("open-sd1"),8) occurs(action("close_cb1"),9) occurs(action("wait_cb1"),10) occurs(action("wait_cb1-condeff0-no-0"),11) occurs(action("wait_cb1-endof-condeffs"),12) occurs(action("close_cb2"),13) occurs(action("wait_cb2"),14) occurs(action("wait_cb2-condeff2-no-0"),15) occurs(action("wait_cb2-condeff1-no-0"),15) occurs(action("wait_cb2-condeff0-no-0"),15) occurs(action("wait_cb2-endof-condeffs"),16) occurs(action("close_cb3"),17) occurs(action("wait_cb3"),18) occurs(action("close_cb3"),19) occurs(action("wait_cb3"),20)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 6
|
||
|
|
Time : 0.098s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.01s)
|
||
|
|
CPU Time : 0.096s
|
||
|
|
|
||
|
|
Choices : 788 (Domain: 788)
|
||
|
|
Conflicts : 291 (Analyzed: 288)
|
||
|
|
Restarts : 1 (Average: 288.00 Last: 62)
|
||
|
|
Model-Level : 51.5
|
||
|
|
Problems : 6 (Average Length: 12.83 Splits: 0)
|
||
|
|
Lemmas : 288 (Deleted: 0)
|
||
|
|
Binary : 12 (Ratio: 4.17%)
|
||
|
|
Ternary : 4 (Ratio: 1.39%)
|
||
|
|
Conflict : 288 (Average Length: 58.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 288 (Average: 2.77 Max: 17 Sum: 799)
|
||
|
|
Executed : 277 (Average: 2.47 Max: 17 Sum: 712 Ratio: 89.11%)
|
||
|
|
Bounded : 11 (Average: 7.91 Max: 12 Sum: 87 Ratio: 10.89%)
|
||
|
|
|
||
|
|
Rules : 4095 (Original: 3867)
|
||
|
|
Atoms : 1794
|
||
|
|
Bodies : 2447 (Original: 2355)
|
||
|
|
Count : 50 (Original: 119)
|
||
|
|
Equivalences : 811 (Atom=Atom: 111 Body=Body: 0 Other: 700)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 3154 (Eliminated: 0 Frozen: 943)
|
||
|
|
Constraints : 14276 (Binary: 87.9% Ternary: 9.4% Other: 2.7%)
|
||
|
|
|
||
|
|
Memory Peak : 53MB
|
||
|
|
Max. Length : 20 steps
|
||
|
|
Sol. Length : 20 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|