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

195 lines
7.6 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.020s 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.017s wall-clock]
Generated 18 rules.
Computing model... [0.060s CPU, 0.059s wall-clock]
497 relevant atoms
328 auxiliary atoms
825 final queue length
1050 total queue pushes
Completing instantiation... [0.050s CPU, 0.046s wall-clock]
Instantiating: [0.140s CPU, 0.139s 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...
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.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.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.030s 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.000s 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.010s CPU, 0.021s wall-clock]
Done! [0.250s CPU, 0.263s wall-clock]
planner.py version 0.0.1
Time: 0.05s
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: 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+0MB)
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: 49MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 50MB (+1MB)
UNSAT
Iteration Time: 0.04s
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: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.13s
Memory: 52MB (+2MB)
UNSAT
Iteration Time: 0.15s
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: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.38s
Memory: 53MB (+1MB)
UNKNOWN
Iteration Time: 0.40s
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: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.39s
Memory: 55MB (+1MB)
UNKNOWN
Iteration Time: 0.42s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.01s
Memory: 55MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f1")),1) occurs(action(("board","f1","p3")),2) occurs(action(("up","f1","f6")),3) occurs(action(("depart","f6","p3")),4) occurs(action(("down","f6","f4")),5) occurs(action(("board","f4","p5")),6) occurs(action(("up","f4","f13")),7) occurs(action(("board","f13","p7")),8) occurs(action(("depart","f13","p5")),9) occurs(action(("down","f13","f0")),10) occurs(action(("board","f0","p2")),11) occurs(action(("up","f0","f8")),12) occurs(action(("board","f8","p0")),13) occurs(action(("down","f8","f7")),14) occurs(action(("board","f7","p1")),15) occurs(action(("down","f7","f5")),16) occurs(action(("board","f5","p4")),17) occurs(action(("down","f5","f4")),18) occurs(action(("depart","f4","p7")),19) occurs(action(("up","f4","f5")),20) occurs(action(("depart","f5","p0")),21) occurs(action(("up","f5","f12")),22) occurs(action(("depart","f12","p1")),23) occurs(action(("down","f12","f3")),24) occurs(action(("board","f3","p6")),25) occurs(action(("depart","f3","p4")),26) occurs(action(("up","f3","f7")),27) occurs(action(("depart","f7","p2")),28) occurs(action(("down","f7","f2")),29) occurs(action(("depart","f2","p6")),30)
Solving Time: 0.24s
Memory: 56MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 7
Time : 1.356s (Solving: 1.15s 1st Model: 0.24s Unsat: 0.14s)
CPU Time : 1.350s
Choices : 42547
Conflicts : 25139 (Analyzed: 25136)
Restarts : 288 (Average: 87.28 Last: 92)
Model-Level : 57.0
Problems : 7 (Average Length: 17.00 Splits: 0)
Lemmas : 25136 (Deleted: 15121)
Binary : 1432 (Ratio: 5.70%)
Ternary : 2180 (Ratio: 8.67%)
Conflict : 25136 (Average Length: 13.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 25136 (Average: 1.55 Max: 56 Sum: 38879)
Executed : 25117 (Average: 1.54 Max: 56 Sum: 38732 Ratio: 99.62%)
Bounded : 19 (Average: 7.74 Max: 27 Sum: 147 Ratio: 0.38%)
Rules : 3110
Atoms : 3110
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 9905 (Eliminated: 0 Frozen: 7920)
Constraints : 39967 (Binary: 95.7% Ternary: 2.8% Other: 1.5%)
Memory Peak : 57MB
Max. Length : 30 steps
Sol. Length : 30 steps