148 lines
11 KiB
Plaintext
148 lines
11 KiB
Plaintext
|
INFO Running translator.
|
||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-19.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-2002/domains/zenotravel-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-19.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.020s CPU, 0.026s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
|
||
|
Preparing model... [0.030s CPU, 0.021s wall-clock]
|
||
|
Generated 40 rules.
|
||
|
Computing model... [2.700s CPU, 2.699s wall-clock]
|
||
|
28538 relevant atoms
|
||
|
4485 auxiliary atoms
|
||
|
33023 final queue length
|
||
|
81898 total queue pushes
|
||
|
Completing instantiation... [8.630s CPU, 8.626s wall-clock]
|
||
|
Instantiating: [11.420s CPU, 11.411s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
9 initial candidates
|
||
|
Finding invariants: [0.190s CPU, 0.184s wall-clock]
|
||
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
Instantiating groups... [0.050s CPU, 0.049s wall-clock]
|
||
|
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
|
||
|
Choosing groups...
|
||
|
0 uncovered facts
|
||
|
Choosing groups: [0.020s CPU, 0.015s wall-clock]
|
||
|
Building translation key... [0.000s CPU, 0.009s wall-clock]
|
||
|
Computing fact groups: [0.300s CPU, 0.299s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.004s wall-clock]
|
||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
Building mutex information...
|
||
|
Building mutex information: [0.010s CPU, 0.005s wall-clock]
|
||
|
Translating task...
|
||
|
Processing axioms...
|
||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
Processing axioms: [0.360s CPU, 0.363s wall-clock]
|
||
|
Translating task: [7.410s CPU, 7.407s wall-clock]
|
||
|
0 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
35 propositions removed
|
||
|
Detecting unreachable propositions: [3.910s CPU, 3.907s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
35 of 35 variables necessary.
|
||
|
0 of 35 mutex groups necessary.
|
||
|
27600 of 27600 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [1.000s CPU, 1.007s wall-clock]
|
||
|
Translator variables: 35
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 760
|
||
|
Translator goal facts: 27
|
||
|
Translator mutex groups: 0
|
||
|
Translator total mutex groups size: 0
|
||
|
Translator operators: 27600
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 132122
|
||
|
Translator peak memory: 129716 KB
|
||
|
Writing output... [2.440s CPU, 2.644s wall-clock]
|
||
|
Done! [26.850s CPU, 27.041s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 5.75s
|
||
|
Memory: 427MB
|
||
|
|
||
|
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.02s
|
||
|
Memory: 428MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
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: 1.94s
|
||
|
Memory: 428MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 3.94s
|
||
|
Memory: 450MB (+22MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 7.22s
|
||
|
|
||
|
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: 1.81s
|
||
|
Memory: 468MB (+18MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 7.19s
|
||
|
Memory: 543MB (+75MB)
|
||
|
SAT
|
||
|
Testing...
|
||
|
SERIALIZABLE
|
||
|
Testing Time: 4.40s
|
||
|
Memory: 543MB (+0MB)
|
||
|
Answer: 1
|
||
|
occurs(action(("board","person10","plane3","city16")),1) occurs(action(("board","person18","plane1","city0")),1) occurs(action(("board","person19","plane2","city1")),1) occurs(action(("fly","plane4","city10","city12","fl2","fl1")),1) occurs(action(("board","person4","plane3","city16")),1) occurs(action(("fly","plane1","city0","city2","fl1","fl0")),1) occurs(action(("fly","plane2","city1","city6","fl1","fl0")),1) occurs(action(("fly","plane3","city16","city8","fl5","fl4")),1) occurs(action(("fly","plane5","city1","city19","fl1","fl0")),1) occurs(action(("board","person1","plane5","city19")),2) occurs(action(("board","person11","plane1","city2")),2) occurs(action(("board","person12","plane2","city6")),2) occurs(action(("board","person13","plane3","city8")),2) occurs(action(("zoom","plane3","city8","city3","fl4","fl3","fl2")),2) occurs(action(("board","person15","plane3","city8")),2) occurs(action(("board","person20","plane4","city12")),2) occurs(action(("fly","plane4","city12","city14","fl1","fl0")),2) occurs(action(("board","person21","plane3","city8")),2) occurs(action(("board","person24","plane2","city6")),2) occurs(action(("board","person3","plane2","city6")),2) occurs(action(("board","person6","plane2","city6")),2) occurs(action(("refuel","plane2","city6","fl0","fl1")),2) occurs(action(("refuel","plane1","city2","fl0","fl1")),2) occurs(action(("refuel","plane5","city19","fl0","fl1")),2) occurs(action(("debark","person13","plane3","city3")),3) occurs(action(("debark","person20","plane4","city14")),3) occurs(action(("fly","plane5","city19","city10","fl1","fl0")),3) occurs(action(("board","person2","plane3","city3")),3) occurs(action(("fly","plane3","city3","city13","fl2","fl1")),3) occurs(action(("board","person8","plane3","city3")),3) occurs(action(("fly","plane1","city2","city13","fl1","fl0")),3) occurs(action(("fly","plane2","city6","city17","fl1","fl0")),3) occurs(action(("refuel","plane4","city14","fl0","fl1")),3) occurs(action(("debark","person1","plane5","city10")),4) occurs(action(("debark","person10","plane3","city13")),4) occurs(action(("debark","person11","plane1","city13")),4) occurs(action(("debark","person12","plane2","city17")),4) occurs(action(("debark","person15","plane3","city13")),4) occurs(action(("debark","person19","plane2","city17")),4) occurs(action(("board","person25","plane2","city17")),4) occurs(action(("fly","plane4","city14","city9","fl1","fl0")),4) occurs(action(("board","person5","plane3","city13")),4) occurs(action(("fly","plane3","city13","city0","fl1","fl0")),4) occurs(action(("board","person9","plane3","city13")),4) occurs(action(("refuel","plane2","city17","fl0","fl1")),4) occurs(action(("refuel","plane1","city13","fl0","fl1")),4) occurs(action(("debark","person4","plane3","city13")),4) occurs(action(("debark","person6","plane2","city17")),4) occurs(action(("refuel","plane5","city10","fl0","fl1")),4) occurs(action(("debark","person5","plane3","city0")),5) occurs(action(("debark","person8","plane3","city0")),5) occurs(action(("board","person17","plane4","city9")),5) occurs(action(("board","person4","plane1","city13")),5) occurs(action(("fly","plane1","city13","city4","fl1","fl0")),5) occurs(action(("fly","plane2","city17","city13","fl1","fl0")),5) occurs(action(("debark","person2","plane3","city0")),5) occurs(action(("refuel","plane3","city0","fl0","fl1")),5) occurs(action(("refuel","plane4","city9","fl0","fl1")),5) occurs(action(("fly","plane5","city10","city15","fl1","fl0")),5) occurs(action(("debark","person18","plane1","city4")),6) occurs(action(("debark","person24","plane2","city13")),6) occurs(action(("debark","person3","plane2","city13")),6) occurs(action(("board","person22","plane5","city15")),6) occurs(action(("board","person23","plane1","city4")),6) occurs(action(("fly","plane4","city9","city0","fl1","fl0")),6) occurs(action(("fly","plane3","city0","city17","fl1","fl0")),6) occurs(action(("refuel","plane2","city13","fl0","fl1")),6) occurs(action(("refuel","plane1","city4","fl0","fl1")),6) occurs(action(("debark","person4","plane1","city4")),6) occurs(action(("refuel","plane5
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 3
|
||
|
Time : 23.119s (Solving: 10.73s 1st Model: 7.09s Unsat: 0.00s)
|
||
|
CPU Time : 22.920s
|
||
|
|
||
|
Choices : 145591 (Domain: 144985)
|
||
|
Conflicts : 18751 (Analyzed: 18751)
|
||
|
Restarts : 183 (Average: 102.46 Last: 164)
|
||
|
Model-Level : 710.0
|
||
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
Lemmas : 18751 (Deleted: 15227)
|
||
|
Binary : 128 (Ratio: 0.68%)
|
||
|
Ternary : 59 (Ratio: 0.31%)
|
||
|
Conflict : 18751 (Average Length: 1482.4 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 18751 (Average: 5.25 Max: 656 Sum: 98386)
|
||
|
Executed : 18588 (Average: 5.19 Max: 656 Sum: 97230 Ratio: 98.83%)
|
||
|
Bounded : 163 (Average: 7.09 Max: 12 Sum: 1156 Ratio: 1.17%)
|
||
|
|
||
|
Rules : 423996
|
||
|
Atoms : 423996
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 256564 (Eliminated: 0 Frozen: 6285)
|
||
|
Constraints : 1570920 (Binary: 99.3% Ternary: 0.3% Other: 0.4%)
|
||
|
|
||
|
Memory Peak : 801MB
|
||
|
Max. Length : 10 steps
|
||
|
Sol. Length : 10 steps
|
||
|
Models : 1
|
||
|
|
||
|
|