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

182 lines
7.3 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-35.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-35.pddl
Parsing...
Parsing: [0.020s CPU, 0.013s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.008s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 18 rules.
Computing model... [0.030s CPU, 0.036s wall-clock]
393 relevant atoms
259 auxiliary atoms
652 final queue length
821 total queue pushes
Completing instantiation... [0.030s CPU, 0.031s wall-clock]
Instantiating: [0.080s CPU, 0.090s 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.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
14 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.010s CPU, 0.002s wall-clock]
Translating task: [0.030s CPU, 0.032s wall-clock]
7 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.020s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
0 of 1 mutex groups necessary.
196 of 196 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 42
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 196
Translator axioms: 0
Translator task size: 666
Translator peak memory: 33368 KB
Writing output... [0.010s CPU, 0.016s wall-clock]
Done! [0.180s CPU, 0.187s wall-clock]
planner.py version 0.0.1
Time: 0.04s
Memory: 47MB
Iteration 1
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 47MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.02s
Memory: 47MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+1MB)
UNSAT
Iteration Time: 0.03s
Iteration 3
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.02s
Memory: 48MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 49MB (+1MB)
UNSAT
Iteration Time: 0.03s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.02s
Memory: 49MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.12s
Memory: 50MB (+1MB)
UNSAT
Iteration Time: 0.14s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.01s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.49s
Memory: 52MB (+1MB)
UNKNOWN
Iteration Time: 0.51s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.01s
Memory: 53MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p2")),1) occurs(action(("up","f0","f3")),2) occurs(action(("board","f3","p4")),3) occurs(action(("up","f3","f5")),4) occurs(action(("board","f5","p0")),5) occurs(action(("up","f5","f7")),6) occurs(action(("board","f7","p3")),7) occurs(action(("up","f7","f13")),8) occurs(action(("depart","f13","p0")),9) occurs(action(("down","f13","f6")),10) occurs(action(("depart","f6","p2")),11) occurs(action(("down","f6","f4")),12) occurs(action(("depart","f4","p4")),13) occurs(action(("up","f4","f8")),14) occurs(action(("board","f8","p5")),15) occurs(action(("board","f8","p6")),15) occurs(action(("board","f8","p5")),16) occurs(action(("board","f8","p6")),16) occurs(action(("board","f8","p5")),17) occurs(action(("board","f8","p6")),17) occurs(action(("up","f8","f12")),18) occurs(action(("board","f12","p1")),19) occurs(action(("down","f12","f1")),20) occurs(action(("depart","f1","p3")),21) occurs(action(("depart","f1","p6")),21) occurs(action(("up","f1","f11")),22) occurs(action(("depart","f11","p5")),23) occurs(action(("down","f11","f10")),24) occurs(action(("depart","f10","p1")),25)
Solving Time: 0.01s
Memory: 53MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 0.776s (Solving: 0.61s 1st Model: 0.01s Unsat: 0.12s)
CPU Time : 0.770s
Choices : 14291
Conflicts : 9795 (Analyzed: 9792)
Restarts : 120 (Average: 81.60 Last: 107)
Model-Level : 51.0
Problems : 6 (Average Length: 14.50 Splits: 0)
Lemmas : 9792 (Deleted: 5018)
Binary : 162 (Ratio: 1.65%)
Ternary : 565 (Ratio: 5.77%)
Conflict : 9792 (Average Length: 12.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 9792 (Average: 1.38 Max: 41 Sum: 13540)
Executed : 9774 (Average: 1.37 Max: 41 Sum: 13410 Ratio: 99.04%)
Bounded : 18 (Average: 7.22 Max: 22 Sum: 130 Ratio: 0.96%)
Rules : 2603
Atoms : 2603
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 6739 (Eliminated: 0 Frozen: 4756)
Constraints : 30958 (Binary: 95.4% Ternary: 3.1% Other: 1.5%)
Memory Peak : 54MB
Max. Length : 25 steps
Sol. Length : 25 steps