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

186 lines
7.1 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-41.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-41.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s 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.000s CPU, 0.011s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 18 rules.
Computing model... [0.070s CPU, 0.066s wall-clock]
613 relevant atoms
405 auxiliary atoms
1018 final queue length
1307 total queue pushes
Completing instantiation... [0.050s CPU, 0.055s wall-clock]
Instantiating: [0.150s CPU, 0.159s 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...
18 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.000s CPU, 0.003s wall-clock]
Translating task: [0.040s CPU, 0.048s wall-clock]
9 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.030s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 1 mutex groups necessary.
324 of 324 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.008s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 54
Translator goal facts: 9
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 324
Translator axioms: 0
Translator task size: 1072
Translator peak memory: 33624 KB
Writing output... [0.020s CPU, 0.026s wall-clock]
Done! [0.290s CPU, 0.307s wall-clock]
planner.py version 0.0.1
Time: 0.05s
Memory: 47MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 49MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 49MB (+0MB)
UNSAT
Iteration Time: 0.04s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.01s
Memory: 49MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+1MB)
UNSAT
Iteration Time: 0.02s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.01s
Memory: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
UNSAT
Iteration Time: 0.02s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.02s
Memory: 52MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.08s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.02s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.64s
Memory: 55MB (+1MB)
UNSAT
Iteration Time: 0.67s
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.03s
Memory: 57MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f6")),1) occurs(action(("board","f6","p8")),2) occurs(action(("up","f6","f10")),3) occurs(action(("board","f10","p3")),4) occurs(action(("up","f10","f12")),5) occurs(action(("depart","f12","p3")),6) occurs(action(("down","f12","f0")),7) occurs(action(("depart","f0","p8")),8) occurs(action(("up","f0","f14")),9) occurs(action(("board","f14","p5")),10) occurs(action(("board","f14","p6")),10) occurs(action(("down","f14","f5")),11) occurs(action(("board","f5","p2")),12) occurs(action(("board","f5","p7")),12) occurs(action(("up","f5","f13")),13) occurs(action(("depart","f13","p5")),14) occurs(action(("down","f13","f4")),15) occurs(action(("depart","f4","p7")),16) occurs(action(("up","f4","f15")),17) occurs(action(("board","f15","p4")),18) occurs(action(("down","f15","f1")),19) occurs(action(("depart","f1","p4")),20) occurs(action(("board","f1","p0")),20) occurs(action(("up","f1","f16")),21) occurs(action(("depart","f16","p0")),22) occurs(action(("down","f16","f14")),23) occurs(action(("down","f14","f9")),24) occurs(action(("board","f9","p1")),25) occurs(action(("down","f9","f7")),26) occurs(action(("depart","f7","p1")),27) occurs(action(("depart","f7","p2")),27) occurs(action(("depart","f7","p6")),27)
Solving Time: 0.34s
Memory: 59MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 1.278s (Solving: 1.04s 1st Model: 0.34s Unsat: 0.70s)
CPU Time : 1.280s
Choices : 16554
Conflicts : 12527 (Analyzed: 12522)
Restarts : 154 (Average: 81.31 Last: 46)
Model-Level : 51.0
Problems : 6 (Average Length: 15.50 Splits: 0)
Lemmas : 12522 (Deleted: 6823)
Binary : 113 (Ratio: 0.90%)
Ternary : 573 (Ratio: 4.58%)
Conflict : 12522 (Average Length: 14.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 12522 (Average: 1.25 Max: 31 Sum: 15616)
Executed : 12498 (Average: 1.24 Max: 31 Sum: 15469 Ratio: 99.06%)
Bounded : 24 (Average: 6.12 Max: 21 Sum: 147 Ratio: 0.94%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 11365 (Eliminated: 0 Frozen: 8396)
Constraints : 54771 (Binary: 96.3% Ternary: 2.6% Other: 1.1%)
Memory Peak : 59MB
Max. Length : 27 steps
Sol. Length : 27 steps