160 lines
5.8 KiB
Plaintext
160 lines
5.8 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-14.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-14.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-14.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-14.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.050s CPU, 0.056s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Generated 90 rules.
|
||
|
|
Computing model... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
76 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
76 final queue length
|
||
|
|
106 total queue pushes
|
||
|
|
Completing instantiation... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Instantiating: [0.040s CPU, 0.045s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
35 initial candidates
|
||
|
|
Finding invariants: [0.070s CPU, 0.066s 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...
|
||
|
|
5 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.070s CPU, 0.071s 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.001s wall-clock]
|
||
|
|
Translating task: [0.010s CPU, 0.011s wall-clock]
|
||
|
|
11 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
14 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
10 of 19 variables necessary.
|
||
|
|
0 of 14 mutex groups necessary.
|
||
|
|
22 of 40 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Translator variables: 10
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 22
|
||
|
|
Translator goal facts: 5
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 22
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 164
|
||
|
|
Translator peak memory: 36300 KB
|
||
|
|
Writing output... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Done! [0.200s CPU, 0.207s 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: 50MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("wait_cb2"),1) occurs(action("wait_cb2-condeff0-yes"),2) occurs(action("wait_cb2-endof-condeffs"),3) occurs(action("wait_cb1"),4) occurs(action("open-sd8"),5) occurs(action("close_cb2"),6) occurs(action("wait_cb2"),7) occurs(action("wait_cb2-condeff0-no-0"),8) occurs(action("wait_cb2-condeff0-no-0"),9) occurs(action("wait_cb2-endof-condeffs"),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.051s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.052s
|
||
|
|
|
||
|
|
Choices : 44 (Domain: 44)
|
||
|
|
Conflicts : 11 (Analyzed: 10)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 21.5
|
||
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||
|
|
Lemmas : 10 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 20.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 10 (Average Length: 13.1 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 10 (Average: 4.70 Max: 17 Sum: 47)
|
||
|
|
Executed : 7 (Average: 2.50 Max: 17 Sum: 25 Ratio: 53.19%)
|
||
|
|
Bounded : 3 (Average: 7.33 Max: 12 Sum: 22 Ratio: 46.81%)
|
||
|
|
|
||
|
|
Rules : 1522 (Original: 1252)
|
||
|
|
Atoms : 755
|
||
|
|
Bodies : 806 (Original: 641)
|
||
|
|
Count : 7 (Original: 48)
|
||
|
|
Equivalences : 271 (Atom=Atom: 48 Body=Body: 0 Other: 223)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 914 (Eliminated: 0 Frozen: 91)
|
||
|
|
Constraints : 3513 (Binary: 83.7% Ternary: 13.2% Other: 3.1%)
|
||
|
|
|
||
|
|
Memory Peak : 51MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|