375 lines
10 KiB
Plaintext
375 lines
10 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-51.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-51.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.036s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s 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.099s wall-clock]
|
|
881 relevant atoms
|
|
583 auxiliary atoms
|
|
1464 final queue length
|
|
1905 total queue pushes
|
|
Completing instantiation... [0.080s CPU, 0.080s wall-clock]
|
|
Instantiating: [0.230s 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.010s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.000s CPU, 0.001s 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.010s 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.070s CPU, 0.073s 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.050s CPU, 0.045s 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.010s CPU, 0.012s 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.040s CPU, 0.036s wall-clock]
|
|
Done! [0.440s CPU, 0.453s 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.17s
|
|
Memory: 57MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.22s
|
|
|
|
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.00s
|
|
Memory: 59MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.04s
|
|
|
|
Iteration 6
|
|
Queue: [20]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Solving Time: 0.71s
|
|
Memory: 59MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.71s
|
|
|
|
Iteration 7
|
|
Queue: [20]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Solving Time: 0.37s
|
|
Memory: 59MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.37s
|
|
|
|
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: 0.83s
|
|
Memory: 62MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.87s
|
|
|
|
Iteration 9
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.69s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.69s
|
|
|
|
Iteration 10
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.61s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.61s
|
|
|
|
Iteration 11
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.57s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.57s
|
|
|
|
Iteration 12
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.51s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.51s
|
|
|
|
Iteration 13
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.51s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.51s
|
|
|
|
Iteration 14
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.48s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.48s
|
|
|
|
Iteration 15
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.49s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.49s
|
|
|
|
Iteration 16
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.48s
|
|
Memory: 62MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.48s
|
|
|
|
Iteration 17
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.51s
|
|
Memory: 63MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.51s
|
|
|
|
Iteration 18
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.51s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.51s
|
|
|
|
Iteration 19
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.48s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.48s
|
|
|
|
Iteration 20
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.50s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.50s
|
|
|
|
Iteration 21
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.48s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.48s
|
|
|
|
Iteration 22
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.50s
|
|
Memory: 63MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.50s
|
|
|
|
Iteration 23
|
|
Queue: [25]
|
|
Grounded Until: 25
|
|
Solving...
|
|
Solving Time: 0.43s
|
|
Memory: 63MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.43s
|
|
|
|
Iteration 24
|
|
Queue: [30]
|
|
Grounded Until: 25
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
|
Grounding Time: 0.03s
|
|
Memory: 65MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 1.09s
|
|
Memory: 67MB (+2MB)
|
|
UNKNOWN
|
|
Iteration Time: 1.13s
|
|
|
|
Iteration 25
|
|
Queue: [30]
|
|
Grounded Until: 30
|
|
Solving...
|
|
Solving Time: 0.98s
|
|
Memory: 67MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.98s
|
|
|
|
Iteration 26
|
|
Queue: [30]
|
|
Grounded Until: 30
|
|
Solving...
|
|
Solving Time: 0.96s
|
|
Memory: 67MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.96s
|
|
|
|
Iteration 27
|
|
Queue: [30]
|
|
Grounded Until: 30
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f16")),1) occurs(action(("board","f16","p6")),2) occurs(action(("down","f16","f3")),3) occurs(action(("depart","f3","p6")),4) occurs(action(("board","f3","p4")),4) occurs(action(("up","f3","f17")),5) occurs(action(("board","f17","p0")),6) occurs(action(("board","f17","p1")),6) occurs(action(("down","f17","f13")),7) occurs(action(("depart","f13","p1")),8) occurs(action(("down","f13","f1")),9) occurs(action(("depart","f1","p4")),10) occurs(action(("board","f1","p2")),10) occurs(action(("up","f1","f20")),11) occurs(action(("board","f20","p8")),12) occurs(action(("down","f20","f10")),13) occurs(action(("depart","f10","p0")),14) occurs(action(("depart","f10","p8")),14) occurs(action(("up","f10","f21")),15) occurs(action(("board","f21","p10")),16) occurs(action(("down","f21","f8")),17) occurs(action(("depart","f8","p10")),18) occurs(action(("board","f8","p5")),18) occurs(action(("down","f8","f7")),19) occurs(action(("depart","f7","p5")),20) occurs(action(("board","f7","p7")),20) occurs(action(("down","f7","f2")),21) occurs(action(("board","f2","p9")),22) occurs(action(("down","f2","f0")),23) occurs(action(("depart","f0","p9")),24) occurs(action(("board","f0","p3")),24) occurs(action(("up","f0","f6")),25) occurs(action(("depart","f6","p3")),26) occurs(action(("down","f6","f4")),27) occurs(action(("depart","f4","p7")),28) occurs(action(("up","f4","f15")),29) occurs(action(("depart","f15","p2")),30)
|
|
Solving Time: 0.56s
|
|
Memory: 67MB (+0MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 27
|
|
Time : 14.773s (Solving: 14.36s 1st Model: 0.55s Unsat: 0.98s)
|
|
CPU Time : 14.780s
|
|
|
|
Choices : 250101
|
|
Conflicts : 187055 (Analyzed: 187050)
|
|
Restarts : 2217 (Average: 84.37 Last: 125)
|
|
Model-Level : 52.0
|
|
Problems : 27 (Average Length: 24.59 Splits: 0)
|
|
Lemmas : 187050 (Deleted: 156647)
|
|
Binary : 404 (Ratio: 0.22%)
|
|
Ternary : 2548 (Ratio: 1.36%)
|
|
Conflict : 187050 (Average Length: 13.4 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 187050 (Average: 1.25 Max: 42 Sum: 234545)
|
|
Executed : 187015 (Average: 1.25 Max: 42 Sum: 234335 Ratio: 99.91%)
|
|
Bounded : 35 (Average: 6.00 Max: 27 Sum: 210 Ratio: 0.09%)
|
|
|
|
Rules : 6199
|
|
Atoms : 6199
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 17790 (Eliminated: 0 Frozen: 14109)
|
|
Constraints : 89332 (Binary: 97.1% Ternary: 2.1% Other: 0.9%)
|
|
|
|
Memory Peak : 68MB
|
|
Max. Length : 30 steps
|
|
Sol. Length : 30 steps
|
|
|
|
|