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

195 lines
7.8 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-44.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-44.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.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.018s wall-clock]
Generated 18 rules.
Computing model... [0.070s CPU, 0.064s 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.156s 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...
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.008s 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.050s CPU, 0.049s 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.029s 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.007s 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.302s wall-clock]
planner.py version 0.0.1
Time: 0.07s
Memory: 47MB
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: 47MB (+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.03s
Memory: 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 49MB (+1MB)
UNSAT
Iteration Time: 0.04s
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: 51MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 51MB (+0MB)
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.02s
Memory: 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.14s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.17s
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.02s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.67s
Memory: 55MB (+1MB)
UNKNOWN
Iteration Time: 0.70s
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.02s
Memory: 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.69s
Memory: 57MB (+1MB)
UNKNOWN
Iteration Time: 0.72s
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.02s
Memory: 58MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f1")),1) occurs(action(("board","f1","p7")),2) occurs(action(("board","f1","p8")),2) occurs(action(("up","f1","f14")),3) occurs(action(("board","f14","p4")),4) occurs(action(("down","f14","f13")),5) occurs(action(("board","f13","p1")),6) occurs(action(("up","f13","f15")),7) occurs(action(("down","f15","f3")),8) occurs(action(("depart","f3","p1")),9) occurs(action(("up","f3","f8")),10) occurs(action(("depart","f8","p7")),11) occurs(action(("depart","f8","p8")),11) occurs(action(("down","f8","f6")),12) occurs(action(("board","f6","p2")),13) occurs(action(("board","f6","p3")),13) occurs(action(("board","f6","p5")),13) occurs(action(("up","f6","f15")),14) occurs(action(("depart","f15","p3")),15) occurs(action(("up","f15","f16")),16) occurs(action(("depart","f16","p5")),17) occurs(action(("down","f16","f11")),18) occurs(action(("down","f11","f5")),19) occurs(action(("depart","f5","p2")),20) occurs(action(("up","f5","f11")),21) occurs(action(("board","f11","p0")),22) occurs(action(("down","f11","f7")),23) occurs(action(("depart","f7","p4")),24) occurs(action(("up","f7","f12")),25) occurs(action(("board","f12","p6")),26) occurs(action(("down","f12","f4")),27) occurs(action(("depart","f4","p6")),28) occurs(action(("down","f4","f0")),29) occurs(action(("depart","f0","p0")),30)
Solving Time: 0.08s
Memory: 59MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 7
Time : 1.863s (Solving: 1.58s 1st Model: 0.08s Unsat: 0.14s)
CPU Time : 1.860s
Choices : 28640
Conflicts : 19320 (Analyzed: 19317)
Restarts : 231 (Average: 83.62 Last: 76)
Model-Level : 63.0
Problems : 7 (Average Length: 17.00 Splits: 0)
Lemmas : 19317 (Deleted: 12062)
Binary : 264 (Ratio: 1.37%)
Ternary : 1152 (Ratio: 5.96%)
Conflict : 19317 (Average Length: 12.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 19317 (Average: 1.39 Max: 35 Sum: 26860)
Executed : 19300 (Average: 1.38 Max: 35 Sum: 26735 Ratio: 99.53%)
Bounded : 17 (Average: 7.35 Max: 22 Sum: 125 Ratio: 0.47%)
Rules : 4209
Atoms : 4209
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 12494 (Eliminated: 0 Frozen: 9461)
Constraints : 60586 (Binary: 96.4% Ternary: 2.5% Other: 1.1%)
Memory Peak : 61MB
Max. Length : 30 steps
Sol. Length : 30 steps