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

277 lines
11 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-55.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-55.pddl
Parsing...
Parsing: [0.040s CPU, 0.034s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.030s CPU, 0.029s wall-clock]
Generated 18 rules.
Computing model... [0.100s CPU, 0.098s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.080s CPU, 0.077s wall-clock]
Instantiating: [0.230s CPU, 0.227s 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...
22 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.010s 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.004s wall-clock]
Translating task: [0.080s CPU, 0.077s wall-clock]
11 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.044s wall-clock]
Reordering and filtering variables...
23 of 23 variables necessary.
0 of 1 mutex groups necessary.
484 of 484 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
Translator variables: 23
Translator derived variables: 0
Translator facts: 66
Translator goal facts: 11
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 484
Translator axioms: 0
Translator task size: 1574
Translator peak memory: 34136 KB
Writing output... [0.030s CPU, 0.038s wall-clock]
Done! [0.440s CPU, 0.447s wall-clock]
planner.py version 0.0.1
Time: 0.07s
Memory: 49MB
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: 49MB (+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.03s
Memory: 50MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
UNSAT
Iteration Time: 0.04s
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.03s
Memory: 52MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.05s
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.03s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.25s
Memory: 56MB (+2MB)
UNSAT
Iteration Time: 0.28s
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.02s
Memory: 58MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.62s
Memory: 58MB (+0MB)
UNKNOWN
Iteration Time: 0.66s
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.02s
Memory: 60MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.67s
Memory: 61MB (+1MB)
UNKNOWN
Iteration Time: 0.71s
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.02s
Memory: 63MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.72s
Memory: 64MB (+1MB)
UNKNOWN
Iteration Time: 0.76s
Iteration 8
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 0.47s
Memory: 64MB (+0MB)
UNKNOWN
Iteration Time: 0.47s
Iteration 9
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 0.70s
Memory: 64MB (+0MB)
UNKNOWN
Iteration Time: 0.70s
Iteration 10
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 0.73s
Memory: 64MB (+0MB)
UNKNOWN
Iteration Time: 0.73s
Iteration 11
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.02s
Memory: 66MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.79s
Memory: 68MB (+2MB)
UNKNOWN
Iteration Time: 0.83s
Iteration 12
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.03s
Memory: 70MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.88s
Memory: 71MB (+1MB)
UNKNOWN
Iteration Time: 0.93s
Iteration 13
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.02s
Memory: 72MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 1.04s
Memory: 73MB (+1MB)
UNKNOWN
Iteration Time: 1.08s
Iteration 14
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 45
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 0.02s
Memory: 74MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f18")),1) occurs(action(("board","f18","p2")),2) occurs(action(("down","f18","f4")),3) occurs(action(("depart","f4","p2")),4) occurs(action(("up","f4","f21")),5) occurs(action(("board","f21","p4")),6) occurs(action(("down","f21","f16")),7) occurs(action(("board","f16","p3")),8) occurs(action(("down","f16","f15")),9) occurs(action(("depart","f15","p4")),10) occurs(action(("board","f15","p0")),11) occurs(action(("up","f15","f16")),12) occurs(action(("down","f16","f5")),13) occurs(action(("board","f5","p9")),14) occurs(action(("up","f5","f9")),15) occurs(action(("depart","f9","p0")),16) occurs(action(("up","f9","f21")),17) occurs(action(("depart","f21","p9")),18) occurs(action(("board","f21","p4")),19) occurs(action(("board","f21","p7")),20) occurs(action(("depart","f21","p3")),21) occurs(action(("down","f21","f8")),22) occurs(action(("down","f8","f4")),23) occurs(action(("up","f4","f19")),24) occurs(action(("board","f19","p8")),25) occurs(action(("down","f19","f16")),26) occurs(action(("depart","f16","p8")),27) occurs(action(("down","f16","f8")),28) occurs(action(("board","f8","p5")),29) occurs(action(("up","f8","f21")),30) occurs(action(("down","f21","f14")),31) occurs(action(("board","f14","p1")),32) occurs(action(("down","f14","f10")),33) occurs(action(("depart","f10","p5")),34) occurs(action(("down","f10","f4")),35) occurs(action(("depart","f4","p7")),36) occurs(action(("up","f4","f19")),37) occurs(action(("board","f19","p10")),38) occurs(action(("board","f19","p10")),39) occurs(action(("down","f19","f14")),40) occurs(action(("board","f14","p1")),41) occurs(action(("board","f14","p1")),42) occurs(action(("up","f14","f17")),43) occurs(action(("board","f17","p6")),44) occurs(action(("down","f17","f0")),45) occurs(action(("depart","f0","p1")),46) occurs(action(("up","f0","f8")),47) occurs(action(("depart","f8","p6")),48) occurs(action(("up","f8","f16")),49) occurs(action(("depart","f16","p10")),50)
Solving Time: 0.64s
Memory: 77MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 14
Time : 8.005s (Solving: 7.49s 1st Model: 0.64s Unsat: 0.26s)
CPU Time : 8.000s
Choices : 172739
Conflicts : 93269 (Analyzed: 93266)
Restarts : 1014 (Average: 91.98 Last: 161)
Model-Level : 96.0
Problems : 14 (Average Length: 28.07 Splits: 0)
Lemmas : 93266 (Deleted: 63290)
Binary : 4246 (Ratio: 4.55%)
Ternary : 6415 (Ratio: 6.88%)
Conflict : 93266 (Average Length: 17.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 93266 (Average: 1.62 Max: 62 Sum: 151504)
Executed : 93243 (Average: 1.62 Max: 62 Sum: 151260 Ratio: 99.84%)
Bounded : 23 (Average: 10.61 Max: 47 Sum: 244 Ratio: 0.16%)
Rules : 5726
Atoms : 5726
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 29353 (Eliminated: 0 Frozen: 24837)
Constraints : 125161 (Binary: 96.9% Ternary: 2.1% Other: 1.0%)
Memory Peak : 79MB
Max. Length : 50 steps
Sol. Length : 50 steps