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.029s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.024s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.080s CPU, 0.086s wall-clock]
|
|
741 relevant atoms
|
|
490 auxiliary atoms
|
|
1231 final queue length
|
|
1592 total queue pushes
|
|
Completing instantiation... [0.080s CPU, 0.069s wall-clock]
|
|
Instantiating: [0.200s CPU, 0.201s 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.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.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.003s wall-clock]
|
|
Translating task: [0.060s CPU, 0.059s 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.038s 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.020s CPU, 0.031s wall-clock]
|
|
Done! [0.370s CPU, 0.383s 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.04s
|
|
Memory: 92MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 93MB (+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.04s
|
|
Memory: 95MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.25s
|
|
Memory: 97MB (+2MB)
|
|
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.05s
|
|
Memory: 99MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f4")),1) occurs(action(("board","f4","p6")),2) occurs(action(("up","f4","f6")),2) occurs(action(("depart","f6","p6")),3) occurs(action(("board","f6","p1")),3) occurs(action(("down","f6","f2")),3) occurs(action(("board","f2","p7")),4) occurs(action(("up","f2","f5")),4) occurs(action(("board","f5","p3")),5) occurs(action(("up","f5","f11")),5) occurs(action(("board","f11","p4")),6) occurs(action(("board","f11","p5")),6) occurs(action(("up","f11","f14")),6) occurs(action(("depart","f14","p5")),7) occurs(action(("down","f14","f13")),7) occurs(action(("board","f13","p0")),8) occurs(action(("up","f13","f19")),8) occurs(action(("depart","f19","p1")),9) occurs(action(("board","f19","p2")),9) occurs(action(("down","f19","f10")),9) occurs(action(("board","f10","p9")),10) occurs(action(("down","f10","f8")),10) occurs(action(("depart","f8","p2")),11) occurs(action(("depart","f8","p3")),11) occurs(action(("depart","f8","p9")),11) occurs(action(("up","f8","f15")),11) occurs(action(("board","f8","p8")),11) occurs(action(("depart","f15","p0")),12) occurs(action(("down","f15","f12")),12) occurs(action(("depart","f12","p4")),13) occurs(action(("down","f12","f3")),13) occurs(action(("depart","f3","p8")),14) occurs(action(("up","f3","f7")),14) occurs(action(("depart","f7","p7")),15) occurs(action(("up","f7","f8")),15)
|
|
Solving Time: 0.34s
|
|
Memory: 101MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 1.465s (Solving: 0.58s 1st Model: 0.34s Unsat: 0.25s)
|
|
CPU Time : 1.460s
|
|
|
|
Choices : 15891
|
|
Conflicts : 11306 (Analyzed: 11304)
|
|
Restarts : 131 (Average: 86.29 Last: 94)
|
|
Model-Level : 56.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 11304 (Deleted: 6569)
|
|
Binary : 70 (Ratio: 0.62%)
|
|
Ternary : 408 (Ratio: 3.61%)
|
|
Conflict : 11304 (Average Length: 15.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 11304 (Average: 1.28 Max: 16 Sum: 14511)
|
|
Executed : 11296 (Average: 1.28 Max: 16 Sum: 14503 Ratio: 99.94%)
|
|
Bounded : 8 (Average: 1.00 Max: 1 Sum: 8 Ratio: 0.06%)
|
|
|
|
Rules : 431528
|
|
Atoms : 431528
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 10312 (Eliminated: 0 Frozen: 0)
|
|
Constraints : 31296 (Binary: 96.0% Ternary: 3.0% Other: 1.0%)
|
|
|
|
Memory Peak : 101MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|