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

186 lines
7.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-48.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-48.pddl
Parsing...
Parsing: [0.030s 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.010s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.078s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.060s CPU, 0.066s wall-clock]
Instantiating: [0.190s CPU, 0.187s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s 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...
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.059s 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.030s 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.032s wall-clock]
Done! [0.360s CPU, 0.365s wall-clock]
planner.py version 0.0.1
Time: 0.07s
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.05s
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.03s
Memory: 53MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 54MB (+1MB)
UNSAT
Iteration Time: 0.11s
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.78s
Memory: 57MB (+2MB)
UNSAT
Iteration Time: 0.81s
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: 59MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f3")),1) occurs(action(("board","f3","p0")),2) occurs(action(("board","f3","p5")),2) occurs(action(("up","f3","f11")),3) occurs(action(("depart","f11","p5")),4) occurs(action(("up","f11","f13")),5) occurs(action(("board","f13","p2")),6) occurs(action(("up","f13","f15")),7) occurs(action(("board","f15","p8")),8) occurs(action(("down","f15","f4")),9) occurs(action(("depart","f4","p8")),10) occurs(action(("up","f4","f5")),11) occurs(action(("down","f5","f4")),12) occurs(action(("board","f4","p1")),13) occurs(action(("up","f4","f19")),14) occurs(action(("board","f19","p4")),15) occurs(action(("down","f19","f2")),16) occurs(action(("depart","f2","p1")),17) occurs(action(("board","f2","p6")),17) occurs(action(("up","f2","f10")),18) occurs(action(("depart","f10","p4")),19) occurs(action(("board","f10","p3")),19) occurs(action(("up","f10","f14")),20) occurs(action(("depart","f14","p2")),21) occurs(action(("depart","f14","p3")),21) occurs(action(("board","f14","p7")),21) occurs(action(("down","f14","f0")),22) occurs(action(("depart","f0","p0")),23) occurs(action(("board","f0","p9")),23) occurs(action(("up","f0","f5")),24) occurs(action(("depart","f5","p7")),25) occurs(action(("depart","f5","p9")),25) occurs(action(("up","f5","f6")),26) occurs(action(("depart","f6","p6")),27)
Solving Time: 0.25s
Memory: 61MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 1.385s (Solving: 1.10s 1st Model: 0.25s Unsat: 0.85s)
CPU Time : 1.380s
Choices : 15757
Conflicts : 11886 (Analyzed: 11881)
Restarts : 139 (Average: 85.47 Last: 39)
Model-Level : 48.0
Problems : 6 (Average Length: 15.50 Splits: 0)
Lemmas : 11881 (Deleted: 6824)
Binary : 134 (Ratio: 1.13%)
Ternary : 588 (Ratio: 4.95%)
Conflict : 11881 (Average Length: 13.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 11881 (Average: 1.26 Max: 40 Sum: 14932)
Executed : 11854 (Average: 1.24 Max: 40 Sum: 14750 Ratio: 98.78%)
Bounded : 27 (Average: 6.74 Max: 21 Sum: 182 Ratio: 1.22%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 13657 (Eliminated: 0 Frozen: 10366)
Constraints : 67087 (Binary: 96.7% Ternary: 2.3% Other: 1.0%)
Memory Peak : 62MB
Max. Length : 27 steps
Sol. Length : 27 steps