1
0
Fork 0
tplp-planning-benchmark/fd-pa-e1-sh/ipc-2000_elevator-strips-si...

195 lines
8.0 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-52.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-52.pddl
Parsing...
Parsing: [0.020s CPU, 0.021s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.008s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.081s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.080s CPU, 0.076s wall-clock]
Instantiating: [0.190s CPU, 0.194s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.004s 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.010s CPU, 0.009s 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.075s 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.044s 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.030s CPU, 0.038s wall-clock]
Done! [0.390s CPU, 0.400s wall-clock]
planner.py version 0.0.1
Time: 0.08s
Memory: 49MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 49MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
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, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
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, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
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.23s
Memory: 57MB (+2MB)
UNSAT
Iteration Time: 0.28s
Iteration 5
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
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: 0.99s
Memory: 59MB (+1MB)
UNKNOWN
Iteration Time: 1.03s
Iteration 6
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.03s
Memory: 60MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 1.03s
Memory: 62MB (+2MB)
UNKNOWN
Iteration Time: 1.07s
Iteration 7
Queue: [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20, 25]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.03s
Memory: 63MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p0")),1) occurs(action(("up","f0","f11")),2) occurs(action(("board","f11","p1")),3) occurs(action(("up","f11","f16")),4) occurs(action(("depart","f16","p1")),5) occurs(action(("board","f16","p10")),5) occurs(action(("down","f16","f4")),6) occurs(action(("board","f4","p2")),7) occurs(action(("board","f4","p7")),7) occurs(action(("down","f4","f1")),8) occurs(action(("depart","f1","p0")),9) occurs(action(("up","f1","f17")),10) occurs(action(("board","f17","p4")),11) occurs(action(("up","f17","f20")),12) occurs(action(("board","f20","p5")),13) occurs(action(("down","f20","f14")),14) occurs(action(("board","f14","p8")),15) occurs(action(("board","f14","p9")),15) occurs(action(("down","f14","f13")),16) occurs(action(("depart","f13","p10")),17) occurs(action(("board","f13","p3")),17) occurs(action(("board","f13","p3")),18) occurs(action(("up","f13","f17")),19) occurs(action(("depart","f17","p2")),20) occurs(action(("board","f17","p4")),20) occurs(action(("down","f17","f15")),21) occurs(action(("depart","f15","p7")),22) occurs(action(("board","f15","p6")),22) occurs(action(("down","f15","f7")),23) occurs(action(("depart","f7","p4")),24) occurs(action(("up","f7","f18")),25) occurs(action(("depart","f18","p3")),26) occurs(action(("down","f18","f17")),27) occurs(action(("depart","f17","p6")),28) occurs(action(("depart","f17","p9")),28) occurs(action(("down","f17","f2")),29) occurs(action(("depart","f2","p5")),30) occurs(action(("depart","f2","p8")),30)
Solving Time: 0.65s
Memory: 65MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 7
Time : 3.256s (Solving: 2.90s 1st Model: 0.64s Unsat: 0.24s)
CPU Time : 3.250s
Choices : 35839
Conflicts : 24235 (Analyzed: 24232)
Restarts : 282 (Average: 85.93 Last: 106)
Model-Level : 64.0
Problems : 7 (Average Length: 17.00 Splits: 0)
Lemmas : 24232 (Deleted: 15770)
Binary : 314 (Ratio: 1.30%)
Ternary : 1397 (Ratio: 5.77%)
Conflict : 24232 (Average Length: 14.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 24232 (Average: 1.34 Max: 46 Sum: 32454)
Executed : 24218 (Average: 1.33 Max: 46 Sum: 32260 Ratio: 99.40%)
Bounded : 14 (Average: 13.86 Max: 27 Sum: 194 Ratio: 0.60%)
Rules : 6199
Atoms : 6199
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 17790 (Eliminated: 0 Frozen: 14109)
Constraints : 89334 (Binary: 97.1% Ternary: 2.1% Other: 0.9%)
Memory Peak : 66MB
Max. Length : 30 steps
Sol. Length : 30 steps