1
0
Fork 0
tplp-planning-benchmark/fd-pa-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-37.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-37.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 18 rules.
Computing model... [0.050s CPU, 0.055s wall-clock]
497 relevant atoms
328 auxiliary atoms
825 final queue length
1050 total queue pushes
Completing instantiation... [0.050s CPU, 0.043s wall-clock]
Instantiating: [0.130s CPU, 0.131s 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.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
16 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.000s CPU, 0.002s wall-clock]
Translating task: [0.040s CPU, 0.040s wall-clock]
8 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.024s wall-clock]
Reordering and filtering variables...
17 of 17 variables necessary.
0 of 1 mutex groups necessary.
256 of 256 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.006s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 48
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 256
Translator axioms: 0
Translator task size: 857
Translator peak memory: 33624 KB
Writing output... [0.020s CPU, 0.022s wall-clock]
Done! [0.250s CPU, 0.254s wall-clock]
planner.py version 0.0.1
Time: 0.05s
Memory: 47MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 47MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.02s
Memory: 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 3
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.02s
Memory: 49MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 50MB (+1MB)
UNSAT
Iteration Time: 0.03s
Iteration 4
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.02s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.10s
Iteration 5
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.02s
Memory: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.45s
Memory: 53MB (+1MB)
UNKNOWN
Iteration Time: 0.47s
Iteration 6
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.02s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p2")),1) occurs(action(("up","f0","f8")),2) occurs(action(("board","f8","p0")),3) occurs(action(("down","f8","f4")),4) occurs(action(("board","f4","p5")),5) occurs(action(("up","f4","f5")),6) occurs(action(("depart","f5","p0")),7) occurs(action(("board","f5","p4")),7) occurs(action(("up","f5","f13")),8) occurs(action(("depart","f13","p5")),9) occurs(action(("board","f13","p7")),9) occurs(action(("down","f13","f7")),10) occurs(action(("depart","f7","p2")),11) occurs(action(("board","f7","p1")),11) occurs(action(("down","f7","f3")),12) occurs(action(("depart","f3","p4")),13) occurs(action(("board","f3","p6")),13) occurs(action(("board","f3","p6")),14) occurs(action(("up","f3","f12")),15) occurs(action(("depart","f12","p1")),16) occurs(action(("up","f12","f14")),17) occurs(action(("down","f14","f1")),18) occurs(action(("board","f1","p3")),19) occurs(action(("up","f1","f6")),20) occurs(action(("depart","f6","p3")),21) occurs(action(("down","f6","f4")),22) occurs(action(("depart","f4","p7")),23) occurs(action(("down","f4","f2")),24) occurs(action(("depart","f2","p6")),25)
Solving Time: 0.01s
Memory: 55MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 0.714s (Solving: 0.53s 1st Model: 0.00s Unsat: 0.08s)
CPU Time : 0.710s
Choices : 13825
Conflicts : 9806 (Analyzed: 9803)
Restarts : 113 (Average: 86.75 Last: 61)
Model-Level : 68.0
Problems : 6 (Average Length: 14.50 Splits: 0)
Lemmas : 9803 (Deleted: 4792)
Binary : 151 (Ratio: 1.54%)
Ternary : 660 (Ratio: 6.73%)
Conflict : 9803 (Average Length: 10.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 9803 (Average: 1.36 Max: 35 Sum: 13378)
Executed : 9787 (Average: 1.35 Max: 35 Sum: 13281 Ratio: 99.27%)
Bounded : 16 (Average: 6.06 Max: 17 Sum: 97 Ratio: 0.73%)
Rules : 3358
Atoms : 3358
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 8451 (Eliminated: 0 Frozen: 6200)
Constraints : 39992 (Binary: 96.0% Ternary: 2.7% Other: 1.3%)
Memory Peak : 55MB
Max. Length : 25 steps
Sol. Length : 25 steps