169 lines
7.6 KiB
Plaintext
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-58.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-58.pddl
|
|
Parsing...
|
|
Parsing: [0.040s CPU, 0.038s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.035s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.120s CPU, 0.118s wall-clock]
|
|
1033 relevant atoms
|
|
684 auxiliary atoms
|
|
1717 final queue length
|
|
2246 total queue pushes
|
|
Completing instantiation... [0.100s CPU, 0.091s wall-clock]
|
|
Instantiating: [0.270s CPU, 0.268s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
6 initial candidates
|
|
Finding invariants: [0.000s CPU, 0.004s 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...
|
|
24 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.000s 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.100s CPU, 0.090s wall-clock]
|
|
12 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...
|
|
25 of 25 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
576 of 576 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock]
|
|
Translator variables: 25
|
|
Translator derived variables: 0
|
|
Translator facts: 72
|
|
Translator goal facts: 12
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 576
|
|
Translator axioms: 0
|
|
Translator task size: 1861
|
|
Translator peak memory: 34392 KB
|
|
Writing output... [0.040s CPU, 0.045s wall-clock]
|
|
Done! [0.510s CPU, 0.522s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 1.49s
|
|
Memory: 136MB
|
|
|
|
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: 136MB (+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.03s
|
|
Memory: 138MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 139MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.06s
|
|
|
|
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.03s
|
|
Memory: 141MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.21s
|
|
Memory: 142MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.26s
|
|
|
|
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.03s
|
|
Memory: 144MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.46s
|
|
Memory: 146MB (+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.03s
|
|
Memory: 148MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board","f0","p9")),1) occurs(action(("up","f0","f4")),1) occurs(action(("board","f4","p1")),2) occurs(action(("up","f4","f19")),2) occurs(action(("board","f19","p0")),3) occurs(action(("down","f19","f0")),3) occurs(action(("depart","f0","p0")),4) occurs(action(("board","f0","p11")),4) occurs(action(("up","f0","f15")),4) occurs(action(("board","f15","p4")),5) occurs(action(("down","f15","f2")),5) occurs(action(("board","f15","p8")),5) occurs(action(("depart","f2","p4")),6) occurs(action(("up","f2","f6")),6) occurs(action(("board","f2","p6")),6) occurs(action(("board","f6","p7")),7) occurs(action(("up","f6","f9")),7) occurs(action(("board","f9","p2")),8) occurs(action(("down","f9","f6")),8) occurs(action(("depart","f6","p2")),9) occurs(action(("board","f6","p7")),9) occurs(action(("up","f6","f9")),9) occurs(action(("board","f9","p2")),10) occurs(action(("down","f9","f1")),10) occurs(action(("depart","f1","p7")),11) occurs(action(("depart","f1","p9")),11) occurs(action(("up","f1","f14")),11) occurs(action(("down","f14","f6")),12) occurs(action(("board","f14","p3")),12) occurs(action(("depart","f6","p2")),13) occurs(action(("up","f6","f8")),13) occurs(action(("board","f8","p10")),14) occurs(action(("up","f8","f17")),14) occurs(action(("depart","f17","p11")),15) occurs(action(("down","f17","f12")),15) occurs(action(("depart","f12","p8")),16) occurs(action(("down","f12","f11")),16) occurs(action(("up","f11","f16")),17) occurs(action(("board","f11","p5")),17) occurs(action(("depart","f16","p10")),18) occurs(action(("down","f16","f7")),18) occurs(action(("depart","f7","p3")),19) occurs(action(("depart","f7","p5")),19) occurs(action(("up","f7","f18")),19) occurs(action(("depart","f18","p1")),20) occurs(action(("depart","f18","p6")),20) occurs(action(("down","f18","f4")),20)
|
|
Solving Time: 0.10s
|
|
Memory: 150MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 5
|
|
Time : 2.506s (Solving: 0.77s 1st Model: 0.10s Unsat: 0.21s)
|
|
CPU Time : 2.500s
|
|
|
|
Choices : 24809
|
|
Conflicts : 14792 (Analyzed: 14790)
|
|
Restarts : 176 (Average: 84.03 Last: 126)
|
|
Model-Level : 72.0
|
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
|
Lemmas : 14790 (Deleted: 7304)
|
|
Binary : 132 (Ratio: 0.89%)
|
|
Ternary : 519 (Ratio: 3.51%)
|
|
Conflict : 14790 (Average Length: 14.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 14790 (Average: 1.51 Max: 30 Sum: 22323)
|
|
Executed : 14784 (Average: 1.51 Max: 30 Sum: 22317 Ratio: 99.97%)
|
|
Bounded : 6 (Average: 1.00 Max: 1 Sum: 6 Ratio: 0.03%)
|
|
|
|
Rules : 909325
|
|
Atoms : 909325
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 13387 (Eliminated: 0 Frozen: 938)
|
|
Constraints : 57530 (Binary: 97.2% Ternary: 1.9% Other: 0.9%)
|
|
|
|
Memory Peak : 150MB
|
|
Max. Length : 20 steps
|
|
Sol. Length : 20 steps
|
|
|
|
|