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

238 lines
9.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-43.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-43.pddl
Parsing...
Parsing: [0.030s CPU, 0.025s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
Preparing model... [0.020s CPU, 0.022s wall-clock]
Generated 18 rules.
Computing model... [0.070s CPU, 0.073s wall-clock]
613 relevant atoms
405 auxiliary atoms
1018 final queue length
1307 total queue pushes
Completing instantiation... [0.060s CPU, 0.059s wall-clock]
Instantiating: [0.170s CPU, 0.175s 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...
18 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.000s CPU, 0.003s wall-clock]
Translating task: [0.050s CPU, 0.050s wall-clock]
9 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.029s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 1 mutex groups necessary.
324 of 324 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 54
Translator goal facts: 9
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 324
Translator axioms: 0
Translator task size: 1072
Translator peak memory: 33624 KB
Writing output... [0.020s CPU, 0.025s wall-clock]
Done! [0.320s CPU, 0.327s wall-clock]
planner.py version 0.0.1
Time: 0.06s
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: 49MB (+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: 50MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 51MB (+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: 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.15s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.17s
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: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.43s
Memory: 54MB (+0MB)
UNKNOWN
Iteration Time: 0.46s
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: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.53s
Memory: 57MB (+1MB)
UNKNOWN
Iteration Time: 0.56s
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: 58MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.58s
Memory: 59MB (+1MB)
UNKNOWN
Iteration Time: 0.61s
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.32s
Memory: 59MB (+0MB)
UNKNOWN
Iteration Time: 0.32s
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.51s
Memory: 59MB (+0MB)
UNKNOWN
Iteration Time: 0.51s
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.50s
Memory: 59MB (+0MB)
UNKNOWN
Iteration Time: 0.50s
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: 60MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p7")),1) occurs(action(("up","f0","f7")),2) occurs(action(("board","f7","p4")),3) occurs(action(("up","f7","f16")),4) occurs(action(("board","f16","p1")),5) occurs(action(("down","f16","f8")),6) occurs(action(("board","f8","p5")),7) occurs(action(("down","f8","f5")),8) occurs(action(("depart","f5","p5")),9) occurs(action(("down","f5","f3")),10) occurs(action(("board","f3","p2")),11) occurs(action(("depart","f3","p4")),12) occurs(action(("up","f3","f12")),13) occurs(action(("depart","f12","p7")),14) occurs(action(("down","f12","f0")),15) occurs(action(("depart","f0","p1")),16) occurs(action(("up","f0","f2")),17) occurs(action(("board","f2","p3")),18) occurs(action(("up","f2","f14")),19) occurs(action(("depart","f14","p3")),20) occurs(action(("down","f14","f13")),21) occurs(action(("board","f13","p6")),22) occurs(action(("down","f13","f9")),23) occurs(action(("up","f9","f13")),24) occurs(action(("board","f13","p0")),25) occurs(action(("board","f13","p6")),26) occurs(action(("down","f13","f1")),27) occurs(action(("board","f1","p8")),28) occurs(action(("up","f1","f12")),29) occurs(action(("depart","f12","p0")),30) occurs(action(("depart","f12","p2")),31) occurs(action(("down","f12","f9")),32) occurs(action(("depart","f9","p8")),33) occurs(action(("down","f9","f8")),34) occurs(action(("depart","f8","p6")),35)
Solving Time: 0.20s
Memory: 62MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 3.498s (Solving: 3.22s 1st Model: 0.20s Unsat: 0.16s)
CPU Time : 3.490s
Choices : 100489
Conflicts : 60689 (Analyzed: 60686)
Restarts : 674 (Average: 90.04 Last: 169)
Model-Level : 69.0
Problems : 11 (Average Length: 22.91 Splits: 0)
Lemmas : 60686 (Deleted: 43867)
Binary : 2197 (Ratio: 3.62%)
Ternary : 3377 (Ratio: 5.56%)
Conflict : 60686 (Average Length: 14.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 60686 (Average: 1.51 Max: 50 Sum: 91494)
Executed : 60669 (Average: 1.50 Max: 50 Sum: 91328 Ratio: 99.82%)
Bounded : 17 (Average: 9.76 Max: 27 Sum: 166 Ratio: 0.18%)
Rules : 3894
Atoms : 3894
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 14261 (Eliminated: 0 Frozen: 11664)
Constraints : 58826 (Binary: 96.2% Ternary: 2.5% Other: 1.3%)
Memory Peak : 62MB
Max. Length : 35 steps
Sol. Length : 35 steps