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

209 lines
8.2 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-49.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-49.pddl
Parsing...
Parsing: [0.020s CPU, 0.026s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.080s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.070s CPU, 0.065s wall-clock]
Instantiating: [0.190s CPU, 0.189s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s 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...
20 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.060s CPU, 0.062s wall-clock]
10 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.036s wall-clock]
Reordering and filtering variables...
21 of 21 variables necessary.
0 of 1 mutex groups necessary.
400 of 400 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
Translator variables: 21
Translator derived variables: 0
Translator facts: 60
Translator goal facts: 10
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 400
Translator axioms: 0
Translator task size: 1311
Translator peak memory: 33880 KB
Writing output... [0.030s CPU, 0.031s wall-clock]
Done! [0.360s CPU, 0.368s wall-clock]
planner.py version 0.0.1
Time: 0.06s
Memory: 48MB
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 (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+1MB)
UNSAT
Iteration Time: 0.04s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.01s
Memory: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+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: 51MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+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: 53MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 54MB (+1MB)
UNSAT
Iteration Time: 0.09s
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: 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.81s
Memory: 57MB (+2MB)
UNKNOWN
Iteration Time: 0.84s
Iteration 6
Queue: [27, 19]
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: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.85s
Memory: 61MB (+2MB)
UNKNOWN
Iteration Time: 0.90s
Iteration 7
Queue: [19, 39, 27]
Grounded Until: 27
Blocking actions...
Solving...
Solving Time: 0.12s
Memory: 61MB (+0MB)
UNSAT
Iteration Time: 0.12s
Iteration 8
Queue: [39, 27, 55]
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.06s
Memory: 65MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f11")),1) occurs(action(("board","f11","p4")),2) occurs(action(("board","f11","p5")),2) occurs(action(("up","f11","f12")),3) occurs(action(("depart","f12","p4")),4) occurs(action(("down","f12","f6")),5) occurs(action(("board","f6","p1")),6) occurs(action(("down","f6","f4")),7) occurs(action(("board","f4","p6")),8) occurs(action(("down","f4","f2")),9) occurs(action(("board","f2","p7")),10) occurs(action(("up","f2","f7")),11) occurs(action(("depart","f7","p7")),12) occurs(action(("up","f7","f19")),13) occurs(action(("depart","f19","p1")),14) occurs(action(("board","f19","p2")),14) occurs(action(("down","f19","f6")),15) occurs(action(("down","f6","f2")),16) occurs(action(("up","f2","f10")),17) occurs(action(("board","f10","p9")),18) occurs(action(("board","f10","p9")),19) occurs(action(("up","f10","f15")),20) occurs(action(("down","f15","f6")),21) occurs(action(("depart","f6","p6")),22) occurs(action(("board","f6","p1")),22) occurs(action(("down","f6","f5")),23) occurs(action(("board","f5","p3")),24) occurs(action(("down","f5","f0")),25) occurs(action(("up","f0","f8")),26) occurs(action(("depart","f8","p2")),27) occurs(action(("depart","f8","p3")),27) occurs(action(("depart","f8","p9")),27) occurs(action(("board","f8","p8")),27) occurs(action(("down","f8","f3")),28) occurs(action(("depart","f3","p8")),29) occurs(action(("up","f3","f15")),30) occurs(action(("down","f15","f14")),31) occurs(action(("depart","f14","p5")),32) occurs(action(("up","f14","f19")),33) occurs(action(("down","f19","f14")),34) occurs(action(("down","f14","f13")),35) occurs(action(("board","f13","p0")),36) occurs(action(("up","f13","f15")),37) occurs(action(("depart","f15","p0")),38) occurs(action(("down","f15","f13")),39)
Solving Time: 0.13s
Memory: 68MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 8
Time : 2.322s (Solving: 1.97s 1st Model: 0.13s Unsat: 0.18s)
CPU Time : 2.320s
Choices : 29048
Conflicts : 20330 (Analyzed: 20325)
Restarts : 242 (Average: 83.99 Last: 135)
Model-Level : 108.0
Problems : 8 (Average Length: 20.38 Splits: 0)
Lemmas : 20325 (Deleted: 11578)
Binary : 177 (Ratio: 0.87%)
Ternary : 1281 (Ratio: 6.30%)
Conflict : 20325 (Average Length: 15.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 20325 (Average: 1.33 Max: 48 Sum: 27010)
Executed : 20303 (Average: 1.32 Max: 48 Sum: 26850 Ratio: 99.41%)
Bounded : 22 (Average: 7.27 Max: 21 Sum: 160 Ratio: 0.59%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 19836 (Eliminated: 0 Frozen: 15178)
Constraints : 97887 (Binary: 96.7% Ternary: 2.3% Other: 1.0%)
Memory Peak : 68MB
Max. Length : 39 steps
Sol. Length : 39 steps