174 lines
6.8 KiB
Plaintext
174 lines
6.8 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-16.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-16.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-16.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-16.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.120s CPU, 0.120s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.030s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Generated 254 rules.
|
||
|
|
Computing model... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
158 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
158 final queue length
|
||
|
|
271 total queue pushes
|
||
|
|
Completing instantiation... [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Instantiating: [0.100s CPU, 0.099s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
44 initial candidates
|
||
|
|
Finding invariants: [0.340s CPU, 0.338s 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...
|
||
|
|
8 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.340s CPU, 0.343s 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.010s CPU, 0.002s wall-clock]
|
||
|
|
Translating task: [0.040s CPU, 0.035s wall-clock]
|
||
|
|
40 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
15 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
17 of 23 variables necessary.
|
||
|
|
0 of 15 mutex groups necessary.
|
||
|
|
101 of 113 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Translator variables: 17
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 40
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 101
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 689
|
||
|
|
Translator peak memory: 37068 KB
|
||
|
|
Writing output... [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Done! [0.650s CPU, 0.653s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.03s
|
||
|
|
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: 52MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
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.02s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.03s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.05s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff2-yes"),2) occurs(action("wait_cb1-condeff1-no-2"),2) 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-1"),5) occurs(action("wait_cb2-condeff0-no-1"),5) occurs(action("wait_cb2-endof-condeffs"),6) occurs(action("close_sd6"),7) occurs(action("close_sd6-condeff2-no-2"),8) occurs(action("close_sd6-condeff1-no-2"),8) occurs(action("close_sd6-condeff0-no-2"),8) occurs(action("close_sd6-endof-condeffs"),9) occurs(action("open-sd7"),10) occurs(action("open-sd11"),10) occurs(action("open-sd1"),10) occurs(action("close_cb2"),11) occurs(action("wait_cb2"),12) occurs(action("wait_cb2-condeff2-no-0"),13) occurs(action("wait_cb2-condeff1-no-0"),13) occurs(action("wait_cb2-condeff0-no-0"),13) occurs(action("wait_cb2-endof-condeffs"),14) occurs(action("reach-goal-15"),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 0.180s (Solving: 0.07s 1st Model: 0.07s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.176s
|
||
|
|
|
||
|
|
Choices : 2767 (Domain: 2701)
|
||
|
|
Conflicts : 1252 (Analyzed: 1250)
|
||
|
|
Restarts : 15 (Average: 83.33 Last: 63)
|
||
|
|
Model-Level : 44.0
|
||
|
|
Problems : 5 (Average Length: 11.00 Splits: 0)
|
||
|
|
Lemmas : 1250 (Deleted: 0)
|
||
|
|
Binary : 25 (Ratio: 2.00%)
|
||
|
|
Ternary : 15 (Ratio: 1.20%)
|
||
|
|
Conflict : 1250 (Average Length: 115.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1250 (Average: 2.25 Max: 28 Sum: 2807)
|
||
|
|
Executed : 1233 (Average: 2.12 Max: 28 Sum: 2656 Ratio: 94.62%)
|
||
|
|
Bounded : 17 (Average: 8.88 Max: 13 Sum: 151 Ratio: 5.38%)
|
||
|
|
|
||
|
|
Rules : 6947 (Original: 6913)
|
||
|
|
Atoms : 2590
|
||
|
|
Bodies : 4432 (Original: 4415)
|
||
|
|
Count : 77 (Original: 82)
|
||
|
|
Equivalences : 797 (Atom=Atom: 78 Body=Body: 0 Other: 719)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 2715 (Eliminated: 0 Frozen: 1170)
|
||
|
|
Constraints : 16611 (Binary: 94.0% Ternary: 4.2% Other: 1.9%)
|
||
|
|
|
||
|
|
Memory Peak : 54MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|