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

199 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-53.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-53.pddl
Parsing...
Parsing: [0.020s CPU, 0.025s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock]
Preparing model... [0.020s CPU, 0.024s wall-clock]
Generated 18 rules.
Computing model... [0.090s CPU, 0.087s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.080s CPU, 0.075s wall-clock]
Instantiating: [0.210s CPU, 0.204s 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.010s 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.000s 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.010s 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.400s CPU, 0.415s wall-clock]
planner.py version 0.0.1
Time: 0.08s
Memory: 49MB
Iteration 1
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 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.01s
Memory: 51MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
UNSAT
Iteration Time: 0.02s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.01s
Memory: 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 52MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.03s
Memory: 54MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.09s
Memory: 56MB (+2MB)
UNSAT
Iteration Time: 0.13s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.03s
Memory: 57MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.60s
Memory: 59MB (+2MB)
UNSAT
Iteration Time: 0.65s
Iteration 6
Queue: [27]
Grounded Until: 19
Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])]
Grounding Time: 0.04s
Memory: 62MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 1.00s
Memory: 64MB (+2MB)
UNKNOWN
Iteration Time: 1.06s
Iteration 7
Queue: [39, 27]
Grounded Until: 27
Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])]
Grounding Time: 0.07s
Memory: 69MB (+5MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f4")),1) occurs(action(("down","f4","f3")),2) occurs(action(("board","f3","p4")),3) occurs(action(("up","f3","f9")),4) occurs(action(("board","f9","p8")),5) occurs(action(("down","f9","f7")),6) occurs(action(("depart","f7","p4")),7) occurs(action(("board","f7","p6")),7) occurs(action(("down","f7","f3")),8) occurs(action(("up","f3","f16")),9) occurs(action(("board","f16","p5")),10) occurs(action(("board","f16","p9")),10) occurs(action(("down","f16","f1")),11) occurs(action(("depart","f1","p8")),12) occurs(action(("depart","f1","p5")),13) occurs(action(("up","f1","f17")),14) occurs(action(("down","f17","f12")),15) occurs(action(("down","f12","f8")),16) occurs(action(("down","f8","f2")),17) occurs(action(("board","f2","p1")),18) occurs(action(("down","f2","f0")),19) occurs(action(("depart","f0","p1")),20) occurs(action(("up","f0","f4")),21) occurs(action(("board","f4","p10")),22) occurs(action(("up","f4","f21")),23) occurs(action(("board","f21","p0")),24) occurs(action(("board","f21","p2")),24) occurs(action(("down","f21","f8")),25) occurs(action(("depart","f8","p2")),26) occurs(action(("up","f8","f14")),27) occurs(action(("depart","f14","p10")),28) occurs(action(("down","f14","f12")),29) occurs(action(("depart","f12","p0")),30) occurs(action(("board","f12","p3")),30) occurs(action(("up","f12","f18")),31) occurs(action(("board","f18","p7")),32) occurs(action(("down","f18","f17")),33) occurs(action(("depart","f17","p9")),34) occurs(action(("down","f17","f10")),35) occurs(action(("depart","f10","p7")),36) occurs(action(("depart","f10","p6")),37) occurs(action(("up","f10","f20")),38) occurs(action(("depart","f20","p3")),39)
Solving Time: 0.44s
Memory: 73MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 7
Time : 2.566s (Solving: 2.13s 1st Model: 0.43s Unsat: 0.70s)
CPU Time : 2.560s
Choices : 28628
Conflicts : 18363 (Analyzed: 18358)
Restarts : 212 (Average: 86.59 Last: 69)
Model-Level : 80.0
Problems : 7 (Average Length: 19.14 Splits: 0)
Lemmas : 18358 (Deleted: 11006)
Binary : 205 (Ratio: 1.12%)
Ternary : 1106 (Ratio: 6.02%)
Conflict : 18358 (Average Length: 14.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 18358 (Average: 1.42 Max: 88 Sum: 25978)
Executed : 18332 (Average: 1.40 Max: 88 Sum: 25770 Ratio: 99.20%)
Bounded : 26 (Average: 8.00 Max: 29 Sum: 208 Ratio: 0.80%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 23474 (Eliminated: 0 Frozen: 18364)
Constraints : 117682 (Binary: 97.0% Ternary: 2.1% Other: 0.9%)
Memory Peak : 73MB
Max. Length : 39 steps
Sol. Length : 39 steps