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

143 lines
6.0 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-33.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-33.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.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.010s CPU, 0.013s wall-clock]
Generated 18 rules.
Computing model... [0.050s CPU, 0.047s wall-clock]
393 relevant atoms
259 auxiliary atoms
652 final queue length
821 total queue pushes
Completing instantiation... [0.030s CPU, 0.036s wall-clock]
Instantiating: [0.110s CPU, 0.113s 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...
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.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.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.020s CPU, 0.016s wall-clock]
Done! [0.220s CPU, 0.219s wall-clock]
planner.py version 0.0.1
Time: 0.19s
Memory: 55MB
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: 55MB (+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: 57MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 58MB (+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: 59MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p1")),1) occurs(action(("up","f0","f2")),1) occurs(action(("depart","f2","p1")),2) occurs(action(("board","f2","p5")),2) occurs(action(("down","f2","f1")),2) occurs(action(("board","f1","p4")),3) occurs(action(("up","f1","f13")),3) occurs(action(("board","f13","p2")),4) occurs(action(("down","f13","f9")),4) occurs(action(("board","f13","p6")),4) occurs(action(("depart","f9","p5")),5) occurs(action(("board","f9","p0")),5) occurs(action(("down","f9","f8")),5) occurs(action(("depart","f8","p0")),6) occurs(action(("down","f8","f2")),6) occurs(action(("depart","f2","p2")),7) occurs(action(("board","f2","p3")),7) occurs(action(("up","f2","f7")),7) occurs(action(("depart","f7","p4")),8) occurs(action(("down","f7","f6")),8) occurs(action(("depart","f6","p6")),9) occurs(action(("down","f6","f4")),9) occurs(action(("depart","f4","p3")),10) occurs(action(("up","f4","f6")),10)
Solving Time: 0.00s
Memory: 60MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.258s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.260s
Choices : 254
Conflicts : 140 (Analyzed: 139)
Restarts : 1 (Average: 139.00 Last: 70)
Model-Level : 37.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 139 (Deleted: 0)
Binary : 3 (Ratio: 2.16%)
Ternary : 7 (Ratio: 5.04%)
Conflict : 139 (Average Length: 11.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 139 (Average: 1.51 Max: 15 Sum: 210)
Executed : 137 (Average: 1.50 Max: 15 Sum: 208 Ratio: 99.05%)
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.95%)
Rules : 99796
Atoms : 99796
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 3298 (Eliminated: 0 Frozen: 0)
Constraints : 10308 (Binary: 94.6% Ternary: 4.0% Other: 1.4%)
Memory Peak : 60MB
Max. Length : 10 steps
Sol. Length : 10 steps