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

169 lines
7.5 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-51.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-51.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s 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.000s CPU, 0.008s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.080s 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.190s CPU, 0.195s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s CPU, 0.004s wall-clock]
Checking invariant weight... [0.010s 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.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.010s CPU, 0.004s wall-clock]
Translating task: [0.070s CPU, 0.074s 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.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.040s CPU, 0.037s wall-clock]
Done! [0.390s CPU, 0.399s wall-clock]
planner.py version 0.0.1
Time: 1.04s
Memory: 106MB
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.01s
Memory: 106MB (+0MB)
UNSAT
Iteration Time: 0.01s
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.05s
Memory: 111MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 112MB (+1MB)
UNSAT
Iteration Time: 0.07s
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.05s
Memory: 115MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.42s
Memory: 117MB (+2MB)
UNSAT
Iteration Time: 0.49s
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.05s
Memory: 119MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.43s
Memory: 121MB (+2MB)
UNKNOWN
Iteration Time: 0.51s
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.06s
Memory: 124MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f20")),1) occurs(action(("board","f20","p8")),2) occurs(action(("down","f20","f17")),2) occurs(action(("board","f17","p0")),3) occurs(action(("board","f17","p1")),3) occurs(action(("down","f17","f16")),3) occurs(action(("down","f16","f1")),4) occurs(action(("board","f16","p6")),4) occurs(action(("board","f1","p2")),5) occurs(action(("up","f1","f20")),5) occurs(action(("board","f20","p8")),6) occurs(action(("down","f20","f2")),6) occurs(action(("up","f2","f13")),7) occurs(action(("board","f2","p9")),7) occurs(action(("depart","f13","p1")),8) occurs(action(("up","f13","f15")),8) occurs(action(("down","f15","f7")),9) occurs(action(("up","f7","f15")),10) occurs(action(("depart","f15","p2")),11) occurs(action(("down","f15","f10")),11) occurs(action(("depart","f10","p0")),12) occurs(action(("depart","f10","p8")),12) occurs(action(("down","f10","f0")),12) occurs(action(("depart","f0","p9")),13) occurs(action(("board","f0","p3")),13) occurs(action(("up","f0","f21")),13) occurs(action(("board","f21","p10")),14) occurs(action(("down","f21","f8")),14) occurs(action(("depart","f8","p10")),15) occurs(action(("board","f8","p5")),15) occurs(action(("down","f8","f7")),15) occurs(action(("depart","f7","p5")),16) occurs(action(("down","f7","f3")),16) occurs(action(("board","f7","p7")),16) occurs(action(("depart","f3","p6")),17) occurs(action(("up","f3","f6")),17) occurs(action(("board","f3","p4")),17) occurs(action(("depart","f6","p3")),18) occurs(action(("down","f6","f1")),18) occurs(action(("depart","f1","p4")),19) occurs(action(("up","f1","f4")),19) occurs(action(("depart","f4","p7")),20) occurs(action(("up","f4","f10")),20)
Solving Time: 0.21s
Memory: 126MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 2.417s (Solving: 1.06s 1st Model: 0.21s Unsat: 0.42s)
CPU Time : 2.410s
Choices : 27201
Conflicts : 18781 (Analyzed: 18779)
Restarts : 236 (Average: 79.57 Last: 69)
Model-Level : 89.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 18779 (Deleted: 13096)
Binary : 120 (Ratio: 0.64%)
Ternary : 439 (Ratio: 2.34%)
Conflict : 18779 (Average Length: 16.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 18779 (Average: 1.27 Max: 27 Sum: 23770)
Executed : 18768 (Average: 1.27 Max: 27 Sum: 23759 Ratio: 99.95%)
Bounded : 11 (Average: 1.00 Max: 1 Sum: 11 Ratio: 0.05%)
Rules : 637310
Atoms : 637310
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 16944 (Eliminated: 0 Frozen: 0)
Constraints : 50908 (Binary: 96.3% Ternary: 2.8% Other: 0.9%)
Memory Peak : 127MB
Max. Length : 20 steps
Sol. Length : 20 steps