1
0
Fork 0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2000_elevator-strips-si...

164 lines
7.1 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.030s CPU, 0.029s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.030s CPU, 0.027s wall-clock]
Generated 18 rules.
Computing model... [0.090s CPU, 0.095s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.090s CPU, 0.086s wall-clock]
Instantiating: [0.230s CPU, 0.229s 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.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
22 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.011s 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.010s CPU, 0.004s wall-clock]
Translating task: [0.090s CPU, 0.085s 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.050s CPU, 0.049s 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.012s 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: 37324 KB
Writing output... [0.040s CPU, 0.040s wall-clock]
Done! [0.460s CPU, 0.462s wall-clock]
planner.py version 0.0.1
Time: 0.07s
Memory: 52MB
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: 53MB (+1MB)
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
Expected Memory: 53MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.02s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 54MB (+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
Expected Memory: 55.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.02s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.39s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.43s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 60.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.03s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 61MB (+2MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.04s
Memory: 62MB (+1MB)
Answer: 1
occurs(action(("up","f0","f8")),1) occurs(action(("board","f8","p5")),2) occurs(action(("up","f8","f10")),2) occurs(action(("depart","f10","p5")),3) occurs(action(("up","f10","f19")),3) occurs(action(("board","f19","p10")),4) occurs(action(("board","f19","p8")),4) occurs(action(("down","f19","f16")),4) occurs(action(("depart","f16","p10")),5) occurs(action(("depart","f16","p8")),5) occurs(action(("board","f16","p3")),5) occurs(action(("up","f16","f17")),5) occurs(action(("board","f17","p6")),6) occurs(action(("down","f17","f8")),6) occurs(action(("depart","f8","p6")),7) occurs(action(("board","f8","p5")),7) occurs(action(("down","f8","f5")),7) occurs(action(("board","f5","p9")),8) occurs(action(("up","f5","f21")),8) occurs(action(("depart","f21","p3")),9) occurs(action(("depart","f21","p9")),9) occurs(action(("board","f21","p4")),9) occurs(action(("board","f21","p7")),9) occurs(action(("down","f21","f14")),9) occurs(action(("board","f14","p1")),10) occurs(action(("down","f14","f0")),10) occurs(action(("depart","f0","p1")),11) occurs(action(("up","f0","f18")),11) occurs(action(("board","f18","p2")),12) occurs(action(("down","f18","f4")),12) occurs(action(("depart","f4","p2")),13) occurs(action(("depart","f4","p7")),13) occurs(action(("up","f4","f15")),13) occurs(action(("depart","f15","p4")),14) occurs(action(("board","f15","p0")),14) occurs(action(("down","f15","f9")),14) occurs(action(("depart","f9","p0")),15) occurs(action(("down","f9","f6")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.589s (Solving: 0.41s 1st Model: 0.02s Unsat: 0.39s)
CPU Time : 0.584s
Choices : 13564 (Domain: 13543)
Conflicts : 7981 (Analyzed: 7979)
Restarts : 101 (Average: 79.00 Last: 54)
Model-Level : 85.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 7979 (Deleted: 4392)
Binary : 3 (Ratio: 0.04%)
Ternary : 29 (Ratio: 0.36%)
Conflict : 7979 (Average Length: 26.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7979 (Average: 1.58 Max: 19 Sum: 12580)
Executed : 7962 (Average: 1.57 Max: 19 Sum: 12563 Ratio: 99.86%)
Bounded : 17 (Average: 1.00 Max: 1 Sum: 17 Ratio: 0.14%)
Rules : 5726
Atoms : 5726
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 8451 (Eliminated: 0 Frozen: 330)
Constraints : 35751 (Binary: 97.0% Ternary: 2.0% Other: 1.0%)
Memory Peak : 62MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1