156 lines
6.8 KiB
Plaintext
156 lines
6.8 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-49.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-49.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.026s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.022s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.070s CPU, 0.078s wall-clock]
|
|
741 relevant atoms
|
|
490 auxiliary atoms
|
|
1231 final queue length
|
|
1592 total queue pushes
|
|
Completing instantiation... [0.060s CPU, 0.066s wall-clock]
|
|
Instantiating: [0.180s CPU, 0.187s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
6 initial candidates
|
|
Finding invariants: [0.000s CPU, 0.005s wall-clock]
|
|
Checking invariant weight... [0.010s 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...
|
|
20 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.003s wall-clock]
|
|
Translating task: [0.060s CPU, 0.060s wall-clock]
|
|
10 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.037s wall-clock]
|
|
Reordering and filtering variables...
|
|
21 of 21 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
400 of 400 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
|
|
Translator variables: 21
|
|
Translator derived variables: 0
|
|
Translator facts: 60
|
|
Translator goal facts: 10
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 400
|
|
Translator axioms: 0
|
|
Translator task size: 1311
|
|
Translator peak memory: 33880 KB
|
|
Writing output... [0.030s CPU, 0.030s wall-clock]
|
|
Done! [0.360s CPU, 0.365s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.69s
|
|
Memory: 88MB
|
|
|
|
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: 88MB (+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: 90MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 91MB (+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: 92MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.28s
|
|
Memory: 93MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.31s
|
|
|
|
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: 94MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f2")),1) occurs(action(("board","f2","p7")),2) occurs(action(("up","f2","f11")),2) occurs(action(("board","f11","p4")),3) occurs(action(("board","f11","p5")),3) occurs(action(("down","f11","f4")),3) occurs(action(("board","f4","p6")),4) occurs(action(("up","f4","f7")),4) occurs(action(("depart","f7","p7")),5) occurs(action(("up","f7","f14")),5) occurs(action(("depart","f14","p5")),6) occurs(action(("down","f14","f10")),6) occurs(action(("board","f10","p9")),7) occurs(action(("down","f10","f5")),7) occurs(action(("board","f5","p3")),8) occurs(action(("up","f5","f6")),8) occurs(action(("depart","f6","p6")),9) occurs(action(("board","f6","p1")),9) occurs(action(("up","f6","f13")),9) occurs(action(("board","f13","p0")),10) occurs(action(("down","f13","f12")),10) occurs(action(("depart","f12","p4")),11) occurs(action(("up","f12","f19")),11) occurs(action(("depart","f19","p1")),12) occurs(action(("board","f19","p2")),12) occurs(action(("down","f19","f8")),12) occurs(action(("depart","f8","p2")),13) occurs(action(("depart","f8","p3")),13) occurs(action(("depart","f8","p9")),13) occurs(action(("up","f8","f15")),13) occurs(action(("board","f8","p8")),13) occurs(action(("depart","f15","p0")),14) occurs(action(("down","f15","f3")),14) occurs(action(("depart","f3","p8")),15) occurs(action(("down","f3","f0")),15)
|
|
Solving Time: 0.09s
|
|
Memory: 96MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 1.168s (Solving: 0.37s 1st Model: 0.09s Unsat: 0.27s)
|
|
CPU Time : 1.170s
|
|
|
|
Choices : 12671
|
|
Conflicts : 8457 (Analyzed: 8455)
|
|
Restarts : 106 (Average: 79.76 Last: 41)
|
|
Model-Level : 61.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 8455 (Deleted: 4078)
|
|
Binary : 86 (Ratio: 1.02%)
|
|
Ternary : 376 (Ratio: 4.45%)
|
|
Conflict : 8455 (Average Length: 12.4 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 8455 (Average: 1.39 Max: 33 Sum: 11778)
|
|
Executed : 8449 (Average: 1.39 Max: 33 Sum: 11772 Ratio: 99.95%)
|
|
Bounded : 6 (Average: 1.00 Max: 1 Sum: 6 Ratio: 0.05%)
|
|
|
|
Rules : 431529
|
|
Atoms : 431529
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 7127 (Eliminated: 0 Frozen: 580)
|
|
Constraints : 29706 (Binary: 96.7% Ternary: 2.2% Other: 1.1%)
|
|
|
|
Memory Peak : 96MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|