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-40.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-40.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-40.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-40.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [1.330s CPU, 1.328s wall-clock]
|
||
|
|
Normalizing task... [0.100s CPU, 0.106s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.090s CPU, 0.088s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.270s CPU, 0.275s wall-clock]
|
||
|
|
Preparing model... [0.380s CPU, 0.371s wall-clock]
|
||
|
|
Generated 1577 rules.
|
||
|
|
Computing model... [0.200s CPU, 0.203s wall-clock]
|
||
|
|
829 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
829 final queue length
|
||
|
|
1600 total queue pushes
|
||
|
|
Completing instantiation... [0.240s CPU, 0.246s wall-clock]
|
||
|
|
Instantiating: [1.200s CPU, 1.201s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
66 initial candidates
|
||
|
|
Finding invariants: [1.860s CPU, 1.855s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s 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: [1.870s CPU, 1.863s 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.030s CPU, 0.034s wall-clock]
|
||
|
|
Translating task: [0.480s CPU, 0.478s wall-clock]
|
||
|
|
68 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
20 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.220s CPU, 0.219s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
29 of 29 variables necessary.
|
||
|
|
0 of 20 mutex groups necessary.
|
||
|
|
762 of 762 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.060s CPU, 0.067s wall-clock]
|
||
|
|
Translator variables: 29
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 75
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 762
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 12225
|
||
|
|
Translator peak memory: 44748 KB
|
||
|
|
Writing output... [0.170s CPU, 0.177s wall-clock]
|
||
|
|
Done! [5.440s CPU, 5.452s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.30s
|
||
|
|
Memory: 63MB
|
||
|
|
|
||
|
|
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: 63MB (+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: 63MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.07s
|
||
|
|
Memory: 67MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 68MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.10s
|
||
|
|
|
||
|
|
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: 73.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.07s
|
||
|
|
Memory: 72MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 74MB (+2MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.12s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 80.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.07s
|
||
|
|
Memory: 76MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.05s
|
||
|
|
Memory: 79MB (+3MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.34s
|
||
|
|
Memory: 87MB (+8MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.19s
|
||
|
|
Memory: 88MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 88MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff1-yes"),2) occurs(action("wait_cb1-condeff0-no-0"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("wait_cb3"),4) occurs(action("wait_cb3-condeff1-yes"),5) occurs(action("wait_cb3-condeff0-no-0"),5) occurs(action("wait_cb3-condeff0-no-3"),5) occurs(action("wait_cb3-endof-condeffs"),6) occurs(action("open-sd6"),7) occurs(action("open-sd16"),7) occurs(action("close_cb1"),8) occurs(action("wait_cb1"),9) occurs(action("wait_cb1-condeff1-no-0"),10) occurs(action("wait_cb1-condeff0-no-0"),10) occurs(action("wait_cb1-endof-condeffs"),11) occurs(action("close_sd11"),12) occurs(action("close_sd11-condeff1-no-0"),13) occurs(action("close_sd11-condeff1-no-6"),13) occurs(action("close_sd11-condeff0-no-0"),13) occurs(action("close_sd11-endof-condeffs"),14) occurs(action("reach-goal-0"),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 1.057s (Solving: 0.19s 1st Model: 0.18s Unsat: 0.01s)
|
||
|
|
CPU Time : 1.036s
|
||
|
|
|
||
|
|
Choices : 7450 (Domain: 4310)
|
||
|
|
Conflicts : 1187 (Analyzed: 1185)
|
||
|
|
Restarts : 12 (Average: 98.75 Last: 60)
|
||
|
|
Model-Level : 52.0
|
||
|
|
Problems : 5 (Average Length: 11.00 Splits: 0)
|
||
|
|
Lemmas : 1185 (Deleted: 0)
|
||
|
|
Binary : 28 (Ratio: 2.36%)
|
||
|
|
Ternary : 15 (Ratio: 1.27%)
|
||
|
|
Conflict : 1185 (Average Length: 555.1 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1185 (Average: 6.76 Max: 511 Sum: 8015)
|
||
|
|
Executed : 1130 (Average: 6.22 Max: 511 Sum: 7370 Ratio: 91.95%)
|
||
|
|
Bounded : 55 (Average: 11.73 Max: 16 Sum: 645 Ratio: 8.05%)
|
||
|
|
|
||
|
|
Rules : 158609 (Original: 158542)
|
||
|
|
Atoms : 29557
|
||
|
|
Bodies : 129151 (Original: 129114)
|
||
|
|
Count : 75 (Original: 83)
|
||
|
|
Equivalences : 1610 (Atom=Atom: 115 Body=Body: 0 Other: 1495)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 12969 (Eliminated: 0 Frozen: 3200)
|
||
|
|
Constraints : 301519 (Binary: 99.4% Ternary: 0.5% Other: 0.1%)
|
||
|
|
|
||
|
|
Memory Peak : 91MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|