156 lines
6.5 KiB
Plaintext
156 lines
6.5 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-31.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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-31.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.023s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.012s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [0.060s CPU, 0.065s wall-clock]
|
||
|
|
352 relevant atoms
|
||
|
|
400 auxiliary atoms
|
||
|
|
752 final queue length
|
||
|
|
881 total queue pushes
|
||
|
|
Completing instantiation... [0.040s CPU, 0.042s wall-clock]
|
||
|
|
Instantiating: [0.140s CPU, 0.146s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.009s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.020s CPU, 0.021s 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.002s wall-clock]
|
||
|
|
Translating task: [0.030s CPU, 0.031s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
10 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
10 of 10 variables necessary.
|
||
|
|
0 of 10 mutex groups necessary.
|
||
|
|
170 of 170 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Translator variables: 10
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 71
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 170
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 714
|
||
|
|
Translator peak memory: 33624 KB
|
||
|
|
Writing output... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Done! [0.250s CPU, 0.256s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.04s
|
||
|
|
Memory: 47MB
|
||
|
|
|
||
|
|
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: 47MB (+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: 47MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 48MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.03s
|
||
|
|
|
||
|
|
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: 49MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 49MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.05s
|
||
|
|
|
||
|
|
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: 50MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package1","truck4","city4-1")),1) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("unload-truck","package1","truck4","city4-2")),3) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),4) occurs(action(("load-truck","package2","truck1","city1-2")),5) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),6) occurs(action(("fly-airplane","plane1","city2-2","city4-2")),7) occurs(action(("load-airplane","package1","plane1","city4-2")),8) occurs(action(("load-truck","package3","truck1","city1-1")),9) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),10) occurs(action(("unload-truck","package3","truck1","city1-2")),11) occurs(action(("fly-airplane","plane1","city4-2","city3-2")),12) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),13) occurs(action(("unload-truck","package2","truck1","city1-1")),14) occurs(action(("unload-airplane","package1","plane1","city3-2")),15)
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.154s (Solving: 0.03s 1st Model: 0.01s Unsat: 0.02s)
|
||
|
|
CPU Time : 0.140s
|
||
|
|
|
||
|
|
Choices : 1512
|
||
|
|
Conflicts : 802 (Analyzed: 800)
|
||
|
|
Restarts : 8 (Average: 100.00 Last: 68)
|
||
|
|
Model-Level : 37.0
|
||
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||
|
|
Lemmas : 800 (Deleted: 0)
|
||
|
|
Binary : 113 (Ratio: 14.12%)
|
||
|
|
Ternary : 69 (Ratio: 8.62%)
|
||
|
|
Conflict : 800 (Average Length: 14.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 800 (Average: 2.01 Max: 34 Sum: 1610)
|
||
|
|
Executed : 778 (Average: 1.81 Max: 34 Sum: 1452 Ratio: 90.19%)
|
||
|
|
Bounded : 22 (Average: 7.18 Max: 17 Sum: 158 Ratio: 9.81%)
|
||
|
|
|
||
|
|
Rules : 2448
|
||
|
|
Atoms : 2448
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 4264 (Eliminated: 0 Frozen: 3090)
|
||
|
|
Constraints : 13055 (Binary: 88.8% Ternary: 7.5% Other: 3.8%)
|
||
|
|
|
||
|
|
Memory Peak : 50MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
|
||
|
|
|