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

143 lines
6.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-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.010s CPU, 0.016s 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.000s CPU, 0.010s wall-clock]
Preparing model... [0.020s CPU, 0.013s wall-clock]
Generated 18 rules.
Computing model... [0.040s CPU, 0.046s wall-clock]
393 relevant atoms
259 auxiliary atoms
652 final queue length
821 total queue pushes
Completing instantiation... [0.040s CPU, 0.035s wall-clock]
Instantiating: [0.110s CPU, 0.109s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s 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.000s CPU, 0.008s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.002s wall-clock]
Translating task: [0.030s CPU, 0.031s 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.000s 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.200s CPU, 0.209s wall-clock]
planner.py version 0.0.1
Time: 0.16s
Memory: 54MB
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: 54MB (+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.09s
Memory: 64MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 66MB (+2MB)
UNSAT
Iteration Time: 0.12s
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.07s
Memory: 70MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p1")),1) occurs(action(("board","f13","p2")),1) occurs(action(("board","f13","p6")),1) occurs(action(("up","f0","f13")),1) occurs(action(("board","f9","p0")),2) occurs(action(("down","f13","f9")),2) occurs(action(("board","f9","p0")),3) occurs(action(("down","f9","f6")),3) occurs(action(("depart","f6","p6")),4) occurs(action(("board","f1","p4")),4) occurs(action(("down","f6","f1")),4) occurs(action(("up","f1","f8")),5) occurs(action(("board","f1","p4")),5) occurs(action(("depart","f8","p0")),6) occurs(action(("down","f8","f2")),6) occurs(action(("board","f2","p5")),6) occurs(action(("depart","f2","p1")),7) occurs(action(("depart","f2","p2")),7) occurs(action(("board","f2","p3")),7) occurs(action(("board","f1","p4")),7) occurs(action(("down","f2","f1")),7) occurs(action(("board","f1","p4")),8) occurs(action(("up","f1","f7")),8) occurs(action(("depart","f7","p4")),9) occurs(action(("down","f7","f4")),9) occurs(action(("depart","f4","p3")),10) occurs(action(("depart","f9","p5")),10) occurs(action(("up","f4","f9")),10)
Solving Time: 0.03s
Memory: 72MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.405s (Solving: 0.04s 1st Model: 0.03s Unsat: 0.01s)
CPU Time : 0.410s
Choices : 841
Conflicts : 471 (Analyzed: 470)
Restarts : 5 (Average: 94.00 Last: 50)
Model-Level : 40.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 482 (Deleted: 0)
Binary : 26 (Ratio: 5.39%)
Ternary : 12 (Ratio: 2.49%)
Conflict : 470 (Average Length: 34.8 Ratio: 97.51%)
Loop : 12 (Average Length: 18.2 Ratio: 2.49%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 470 (Average: 1.71 Max: 47 Sum: 806)
Executed : 465 (Average: 1.66 Max: 47 Sum: 778 Ratio: 96.53%)
Bounded : 5 (Average: 5.60 Max: 12 Sum: 28 Ratio: 3.47%)
Rules : 68529
Atoms : 68529
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 10655 (Eliminated: 0 Frozen: 9882)
Constraints : 22956 (Binary: 88.1% Ternary: 10.6% Other: 1.3%)
Memory Peak : 72MB
Max. Length : 10 steps
Sol. Length : 10 steps