537 lines
12 KiB
Plaintext
537 lines
12 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-55.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-2000/domains/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-55.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.033s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.030s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.100s CPU, 0.101s wall-clock]
|
|
881 relevant atoms
|
|
583 auxiliary atoms
|
|
1464 final queue length
|
|
1905 total queue pushes
|
|
Completing instantiation... [0.070s CPU, 0.078s wall-clock]
|
|
Instantiating: [0.240s CPU, 0.233s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
6 initial candidates
|
|
Finding invariants: [0.000s CPU, 0.005s 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...
|
|
22 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.000s CPU, 0.010s 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.004s wall-clock]
|
|
Translating task: [0.080s CPU, 0.076s wall-clock]
|
|
11 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
1 propositions removed
|
|
Detecting unreachable propositions: [0.040s CPU, 0.043s wall-clock]
|
|
Reordering and filtering variables...
|
|
23 of 23 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
484 of 484 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.011s wall-clock]
|
|
Translator variables: 23
|
|
Translator derived variables: 0
|
|
Translator facts: 66
|
|
Translator goal facts: 11
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 484
|
|
Translator axioms: 0
|
|
Translator task size: 1574
|
|
Translator peak memory: 34136 KB
|
|
Writing output... [0.030s CPU, 0.038s wall-clock]
|
|
Done! [0.440s CPU, 0.451s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.08s
|
|
Memory: 49MB
|
|
|
|
Iteration 1
|
|
Queue: [0]
|
|
Grounded Until: 0
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 49MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 2
|
|
Queue: [5]
|
|
Grounded Until: 0
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.04s
|
|
Memory: 50MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 51MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.05s
|
|
|
|
Iteration 3
|
|
Queue: [10]
|
|
Grounded Until: 5
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.03s
|
|
Memory: 52MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 53MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.05s
|
|
|
|
Iteration 4
|
|
Queue: [15]
|
|
Grounded Until: 10
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.03s
|
|
Memory: 55MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.25s
|
|
Memory: 57MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.30s
|
|
|
|
Iteration 5
|
|
Queue: [20]
|
|
Grounded Until: 15
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.03s
|
|
Memory: 58MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 1.03s
|
|
Memory: 59MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.07s
|
|
|
|
Iteration 6
|
|
Queue: [20]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Solving Time: 0.79s
|
|
Memory: 59MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.79s
|
|
|
|
Iteration 7
|
|
Queue: [20]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Solving Time: 0.27s
|
|
Memory: 59MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.28s
|
|
|
|
Iteration 8
|
|
Queue: [25]
|
|
Grounded Until: 20
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
|
Grounding Time: 0.03s
|
|
Memory: 61MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 1.12s
|
|
Memory: 62MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.17s
|
|
|
|
Iteration 9
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 1.18s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.18s
|
|
|
|
Iteration 10
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 1.16s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.16s
|
|
|
|
Iteration 11
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.99s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.99s
|
|
|
|
Iteration 12
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.72s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.72s
|
|
|
|
Iteration 13
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.66s
|
|
Memory: 63MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.66s
|
|
|
|
Iteration 14
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.59s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.59s
|
|
|
|
Iteration 15
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.58s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.58s
|
|
|
|
Iteration 16
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.53s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.53s
|
|
|
|
Iteration 17
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.52s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.52s
|
|
|
|
Iteration 18
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.53s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.53s
|
|
|
|
Iteration 19
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.47s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.47s
|
|
|
|
Iteration 20
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.52s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.52s
|
|
|
|
Iteration 21
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.52s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.52s
|
|
|
|
Iteration 22
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.49s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.49s
|
|
|
|
Iteration 23
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.47s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.47s
|
|
|
|
Iteration 24
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.50s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.50s
|
|
|
|
Iteration 25
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.49s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.49s
|
|
|
|
Iteration 26
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.47s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.47s
|
|
|
|
Iteration 27
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.52s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.52s
|
|
|
|
Iteration 28
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.48s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.48s
|
|
|
|
Iteration 29
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.50s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.50s
|
|
|
|
Iteration 30
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.52s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.52s
|
|
|
|
Iteration 31
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.51s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.51s
|
|
|
|
Iteration 32
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.51s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.51s
|
|
|
|
Iteration 33
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.63s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.63s
|
|
|
|
Iteration 34
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.80s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.80s
|
|
|
|
Iteration 35
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.77s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.77s
|
|
|
|
Iteration 36
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.72s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.73s
|
|
|
|
Iteration 37
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.57s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.57s
|
|
|
|
Iteration 38
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.62s
|
|
Memory: 64MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.62s
|
|
|
|
Iteration 39
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.60s
|
|
Memory: 64MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.60s
|
|
|
|
Iteration 40
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.57s
|
|
Memory: 64MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.57s
|
|
|
|
Iteration 41
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.61s
|
|
Memory: 64MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.61s
|
|
|
|
Iteration 42
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.64s
|
|
Memory: 64MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.64s
|
|
|
|
Iteration 43
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.58s
|
|
Memory: 64MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.58s
|
|
|
|
Iteration 44
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 64MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
Iteration 45
|
|
Queue: [30]
|
|
Grounded Until: 25
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
|
Grounding Time: 0.03s
|
|
Memory: 66MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f15")),1) occurs(action(("board","f15","p0")),2) occurs(action(("down","f15","f9")),3) occurs(action(("depart","f9","p0")),4) occurs(action(("up","f9","f19")),5) occurs(action(("board","f19","p10")),6) occurs(action(("board","f19","p8")),6) occurs(action(("down","f19","f16")),7) occurs(action(("depart","f16","p10")),8) occurs(action(("depart","f16","p8")),8) occurs(action(("board","f16","p3")),8) occurs(action(("up","f16","f21")),9) occurs(action(("board","f21","p4")),10) occurs(action(("down","f21","f14")),11) occurs(action(("board","f14","p1")),12) occurs(action(("up","f14","f15")),13) occurs(action(("depart","f15","p4")),14) occurs(action(("board","f15","p0")),14) occurs(action(("down","f15","f0")),15) occurs(action(("depart","f0","p1")),16) occurs(action(("up","f0","f17")),17) occurs(action(("board","f17","p6")),18) occurs(action(("down","f17","f8")),19) occurs(action(("depart","f8","p6")),20) occurs(action(("board","f8","p5")),20) occurs(action(("up","f8","f10")),21) occurs(action(("depart","f10","p5")),22) occurs(action(("up","f10","f18")),23) occurs(action(("board","f18","p2")),24) occurs(action(("down","f18","f5")),25) occurs(action(("board","f5","p9")),26) occurs(action(("up","f5","f21")),27) occurs(action(("depart","f21","p3")),28) occurs(action(("depart","f21","p9")),28) occurs(action(("board","f21","p7")),28) occurs(action(("down","f21","f4")),29) occurs(action(("depart","f4","p2")),30) occurs(action(("depart","f4","p7")),30)
|
|
Solving Time: 0.10s
|
|
Memory: 67MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 45
|
|
Time : 25.511s (Solving: 25.03s 1st Model: 0.09s Unsat: 0.56s)
|
|
CPU Time : 25.520s
|
|
|
|
Choices : 418222
|
|
Conflicts : 320087 (Analyzed: 320082)
|
|
Restarts : 3887 (Average: 82.35 Last: 142)
|
|
Model-Level : 56.0
|
|
Problems : 45 (Average Length: 25.22 Splits: 0)
|
|
Lemmas : 320082 (Deleted: 284581)
|
|
Binary : 315 (Ratio: 0.10%)
|
|
Ternary : 2100 (Ratio: 0.66%)
|
|
Conflict : 320082 (Average Length: 14.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 320082 (Average: 1.22 Max: 59 Sum: 389435)
|
|
Executed : 320050 (Average: 1.22 Max: 59 Sum: 389264 Ratio: 99.96%)
|
|
Bounded : 32 (Average: 5.34 Max: 22 Sum: 171 Ratio: 0.04%)
|
|
|
|
Rules : 6199
|
|
Atoms : 6199
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 17788 (Eliminated: 0 Frozen: 14109)
|
|
Constraints : 89324 (Binary: 97.1% Ternary: 2.1% Other: 0.9%)
|
|
|
|
Memory Peak : 69MB
|
|
Max. Length : 30 steps
|
|
Sol. Length : 30 steps
|
|
|
|
|