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

169 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-54.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-54.pddl
Parsing...
Parsing: [0.020s CPU, 0.025s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.020s CPU, 0.024s wall-clock]
Generated 18 rules.
Computing model... [0.100s CPU, 0.093s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.080s CPU, 0.086s wall-clock]
Instantiating: [0.220s CPU, 0.222s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.006s 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.010s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.020s CPU, 0.012s 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.005s wall-clock]
Translating task: [0.080s CPU, 0.084s 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.051s 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.030s CPU, 0.040s wall-clock]
Done! [0.440s CPU, 0.453s 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: 52MB (+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: 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 54MB (+1MB)
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.02s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.43s
Memory: 56MB (+0MB)
UNSAT
Iteration Time: 0.46s
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: 59MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.49s
Memory: 61MB (+2MB)
UNKNOWN
Iteration Time: 0.52s
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: 62MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f14")),1) occurs(action(("board","f14","p10")),2) occurs(action(("board","f14","p9")),2) occurs(action(("down","f14","f4")),2) occurs(action(("depart","f4","p9")),3) occurs(action(("up","f4","f18")),3) occurs(action(("board","f18","p7")),4) occurs(action(("down","f18","f11")),4) occurs(action(("depart","f11","p10")),5) occurs(action(("depart","f11","p7")),5) occurs(action(("down","f11","f6")),5) occurs(action(("board","f6","p1")),6) occurs(action(("board","f6","p6")),6) occurs(action(("up","f6","f10")),6) occurs(action(("depart","f10","p6")),7) occurs(action(("down","f10","f9")),7) occurs(action(("board","f9","p5")),8) occurs(action(("down","f9","f8")),8) occurs(action(("depart","f8","p5")),9) occurs(action(("board","f8","p8")),9) occurs(action(("up","f8","f15")),9) occurs(action(("board","f15","p4")),10) occurs(action(("up","f15","f18")),10) occurs(action(("depart","f18","p4")),11) occurs(action(("board","f18","p7")),11) occurs(action(("down","f18","f9")),11) occurs(action(("depart","f9","p8")),12) occurs(action(("board","f9","p5")),12) occurs(action(("up","f9","f17")),12) occurs(action(("board","f17","p3")),13) occurs(action(("down","f17","f12")),13) occurs(action(("depart","f12","p3")),14) occurs(action(("down","f12","f1")),14) occurs(action(("board","f1","p2")),15) occurs(action(("up","f1","f8")),15) occurs(action(("depart","f8","p2")),16) occurs(action(("depart","f8","p5")),16) occurs(action(("up","f8","f13")),16) occurs(action(("board","f13","p0")),17) occurs(action(("up","f13","f19")),17) occurs(action(("depart","f19","p0")),18) occurs(action(("up","f19","f21")),18) occurs(action(("depart","f21","p1")),19) occurs(action(("down","f21","f6")),19) occurs(action(("board","f6","p6")),20) occurs(action(("up","f6","f16")),20)
Solving Time: 0.00s
Memory: 63MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 1.130s (Solving: 0.91s 1st Model: 0.00s Unsat: 0.43s)
CPU Time : 1.124s
Choices : 34535 (Domain: 34509)
Conflicts : 15909 (Analyzed: 15907)
Restarts : 198 (Average: 80.34 Last: 106)
Model-Level : 140.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 15907 (Deleted: 11086)
Binary : 1 (Ratio: 0.01%)
Ternary : 10 (Ratio: 0.06%)
Conflict : 15907 (Average Length: 25.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 15907 (Average: 1.89 Max: 22 Sum: 30082)
Executed : 15897 (Average: 1.89 Max: 22 Sum: 30072 Ratio: 99.97%)
Bounded : 10 (Average: 1.00 Max: 1 Sum: 10 Ratio: 0.03%)
Rules : 5726
Atoms : 5726
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 11437 (Eliminated: 0 Frozen: 440)
Constraints : 48531 (Binary: 97.0% Ternary: 2.1% Other: 1.0%)
Memory Peak : 64MB
Max. Length : 20 steps
Sol. Length : 20 steps