320 lines
13 KiB
Plaintext
320 lines
13 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-46.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-46.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-46.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-46.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.150s CPU, 0.160s wall-clock]
|
||
|
|
Normalizing task... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.050s CPU, 0.048s wall-clock]
|
||
|
|
Preparing model... [0.040s CPU, 0.043s wall-clock]
|
||
|
|
Generated 231 rules.
|
||
|
|
Computing model... [0.020s CPU, 0.021s wall-clock]
|
||
|
|
159 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
159 final queue length
|
||
|
|
254 total queue pushes
|
||
|
|
Completing instantiation... [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Instantiating: [0.150s CPU, 0.157s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
60 initial candidates
|
||
|
|
Finding invariants: [0.800s CPU, 0.798s 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...
|
||
|
|
13 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.810s CPU, 0.805s 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.002s wall-clock]
|
||
|
|
Translating task: [0.030s CPU, 0.032s wall-clock]
|
||
|
|
44 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
18 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
28 of 31 variables necessary.
|
||
|
|
0 of 18 mutex groups necessary.
|
||
|
|
92 of 98 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Translator variables: 28
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 67
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 92
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 746
|
||
|
|
Translator peak memory: 38092 KB
|
||
|
|
Writing output... [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Done! [1.210s CPU, 1.217s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.04s
|
||
|
|
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.02s
|
||
|
|
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.02s
|
||
|
|
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: 53MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.08s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.10s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 54.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.19s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.21s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 57.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 56MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.57s
|
||
|
|
Memory: 57MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.59s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 25
|
||
|
|
Expected Memory: 59.0MB
|
||
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 58MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.63s
|
||
|
|
Memory: 59MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.65s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.40s
|
||
|
|
Memory: 59MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.04s
|
||
|
|
Memory: 60MB (+1MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.34s
|
||
|
|
Memory: 61MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.79s
|
||
|
|
|
||
|
|
Iteration 9
|
||
|
|
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.92s
|
||
|
|
Memory: 62MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.92s
|
||
|
|
|
||
|
|
Iteration 10
|
||
|
|
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Expected Memory: 64.0MB
|
||
|
|
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 62MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.95s
|
||
|
|
Memory: 63MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.98s
|
||
|
|
|
||
|
|
Iteration 11
|
||
|
|
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 35
|
||
|
|
Expected Memory: 65.0MB
|
||
|
|
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 63MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.06s
|
||
|
|
Memory: 65MB (+2MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.09s
|
||
|
|
|
||
|
|
Iteration 12
|
||
|
|
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 40
|
||
|
|
Expected Memory: 67.0MB
|
||
|
|
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 66MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.97s
|
||
|
|
Memory: 67MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.00s
|
||
|
|
|
||
|
|
Iteration 13
|
||
|
|
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 45
|
||
|
|
Expected Memory: 69.0MB
|
||
|
|
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 68MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.96s
|
||
|
|
Memory: 68MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.99s
|
||
|
|
|
||
|
|
Iteration 14
|
||
|
|
Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 50
|
||
|
|
Expected Memory: 70.0MB
|
||
|
|
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 68MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.00s
|
||
|
|
Memory: 68MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.03s
|
||
|
|
|
||
|
|
Iteration 15
|
||
|
|
Queue: [(12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True)]
|
||
|
|
Grounded Until: 55
|
||
|
|
Expected Memory: 70.0MB
|
||
|
|
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 68MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.20s
|
||
|
|
Memory: 70MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 70MB (+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-condeff0-no-1"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("wait_cb3"),4) occurs(action("wait_cb3-condeff0-yes"),5) occurs(action("wait_cb3-endof-condeffs"),6) occurs(action("wait_cb2"),7) occurs(action("wait_cb2-condeff0-yes"),8) occurs(action("wait_cb2-endof-condeffs"),9) occurs(action("wait_cb4"),10) occurs(action("wait_cb4-condeff0-yes"),11) occurs(action("wait_cb4-endof-condeffs"),12) occurs(action("open-sd6"),13) occurs(action("open-sd8"),13) occurs(action("open-sd11"),13) occurs(action("open-sd2"),13) occurs(action("close_cb2"),14) occurs(action("wait_cb2"),15) occurs(action("wait_cb2-condeff0-no-0"),16) occurs(action("wait_cb2-endof-condeffs"),17) occurs(action("close_cb3"),18) occurs(action("wait_cb3"),19) occurs(action("wait_cb3-condeff0-no-0"),20) occurs(action("wait_cb3-endof-condeffs"),21) occurs(action("close_cb4"),22) occurs(action("wait_cb4"),23) occurs(action("wait_cb4-condeff0-no-0"),24) occurs(action("wait_cb4-endof-condeffs"),25) occurs(action("close_sd1"),26) occurs(action("close_sd1-condeff1-no-0"),27) occurs(action("close_sd1-condeff0-no-0"),27) occurs(action("close_sd1-condeff0-no-1"),27) occurs(action("close_sd1-endof-condeffs"),28) occurs(action("reach-goal-3"),29) occurs(action("reach-goal-3"),30) occurs(action("reach-goal-3"),31) occurs(action("reach-goal-3"),32) occurs(action("reach-goal-3"),33) occurs(action("reach-goal-3"),34) occurs(action("reach-goal-3"),35) occurs(action("reach-goal-3"),36) occurs(action("reach-goal-3"),37) occurs(action("reach-goal-3"),38) occurs(action("reach-goal-3"),39) occurs(action("reach-goal-3"),40) occurs(action("reach-goal-3"),41) occurs(action("reach-goal-3"),42) occurs(action("reach-goal-3"),43) occurs(action("reach-goal-3"),44) occurs(action("reach-goal-3"),45) occurs(action("reach-goal-3"),46) occurs(action("reach-goal-3"),47) occurs(action("reach-goal-3"),48) occurs(action("reach-goal-3"),49) occurs(action("reach-goal-3"),50) occurs(action("reach-goal-3"),51) occurs(action("reach-goal-3"),52) occurs(action("reach-goal-3"),53) occurs(action("reach-goal-3"),54) occurs(action("reach-goal-3"),55) occurs(action("reach-goal-3"),56) occurs(action("reach-goal-3"),57) occurs(action("reach-goal-3"),58) occurs(action("reach-goal-3"),59) occurs(action("reach-goal-3"),60)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 16
|
||
|
|
Time : 8.622s (Solving: 8.26s 1st Model: 0.60s Unsat: 0.61s)
|
||
|
|
CPU Time : 8.628s
|
||
|
|
|
||
|
|
Choices : 169612 (Domain: 168992)
|
||
|
|
Conflicts : 74936 (Analyzed: 74931)
|
||
|
|
Restarts : 963 (Average: 77.81 Last: 112)
|
||
|
|
Model-Level : 146.5
|
||
|
|
Problems : 16 (Average Length: 32.00 Splits: 0)
|
||
|
|
Lemmas : 74931 (Deleted: 69287)
|
||
|
|
Binary : 267 (Ratio: 0.36%)
|
||
|
|
Ternary : 319 (Ratio: 0.43%)
|
||
|
|
Conflict : 74931 (Average Length: 182.7 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 74931 (Average: 1.80 Max: 149 Sum: 134915)
|
||
|
|
Executed : 74846 (Average: 1.78 Max: 149 Sum: 133240 Ratio: 98.76%)
|
||
|
|
Bounded : 85 (Average: 19.71 Max: 57 Sum: 1675 Ratio: 1.24%)
|
||
|
|
|
||
|
|
Rules : 14772 (Original: 13650)
|
||
|
|
Atoms : 3835
|
||
|
|
Bodies : 10826 (Original: 10337)
|
||
|
|
Count : 137 (Original: 314)
|
||
|
|
Equivalences : 2442 (Atom=Atom: 251 Body=Body: 0 Other: 2191)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 15363 (Eliminated: 0 Frozen: 5138)
|
||
|
|
Constraints : 86270 (Binary: 90.3% Ternary: 7.5% Other: 2.2%)
|
||
|
|
|
||
|
|
Memory Peak : 71MB
|
||
|
|
Max. Length : 60 steps
|
||
|
|
Sol. Length : 60 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|