184 lines
24 KiB
Plaintext
184 lines
24 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-21.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-21.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.050s CPU, 0.075s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.040s CPU, 0.044s wall-clock]
|
||
|
|
Preparing model... [0.080s CPU, 0.077s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [2.430s CPU, 2.416s wall-clock]
|
||
|
|
20976 relevant atoms
|
||
|
|
10799 auxiliary atoms
|
||
|
|
31775 final queue length
|
||
|
|
47040 total queue pushes
|
||
|
|
Completing instantiation... [4.560s CPU, 4.557s wall-clock]
|
||
|
|
Instantiating: [7.150s CPU, 7.148s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.045s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Instantiating groups... [0.330s CPU, 0.334s wall-clock]
|
||
|
|
Collecting mutex groups... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.040s CPU, 0.046s wall-clock]
|
||
|
|
Building translation key... [0.040s CPU, 0.030s wall-clock]
|
||
|
|
Computing fact groups: [0.640s CPU, 0.629s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.180s CPU, 0.182s wall-clock]
|
||
|
|
Translating task: [3.700s CPU, 3.707s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
64 propositions removed
|
||
|
|
Detecting unreachable propositions: [2.050s CPU, 2.045s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
64 of 64 variables necessary.
|
||
|
|
0 of 64 mutex groups necessary.
|
||
|
|
17170 of 17170 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.440s CPU, 0.437s wall-clock]
|
||
|
|
Translator variables: 64
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 2511
|
||
|
|
Translator goal facts: 11
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 17170
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 66020
|
||
|
|
Translator peak memory: 85460 KB
|
||
|
|
Writing output... [1.340s CPU, 1.476s wall-clock]
|
||
|
|
Done! [15.580s CPU, 15.724s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 73.05s
|
||
|
|
Memory: 3718MB
|
||
|
|
|
||
|
|
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.30s
|
||
|
|
Memory: 3718MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.30s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 3718MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 21.73s
|
||
|
|
Memory: 5709MB (+1991MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.82s
|
||
|
|
Memory: 6016MB (+307MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 30.66s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 8314.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 10612.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 12910.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 15208.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 17506.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [(2,10,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 40.72s
|
||
|
|
Memory: 7562MB (+1546MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package9","truck3","city2-5")),1) occurs(action(("fly-airplane","plane1","city2-9","city1-9")),1) occurs(action(("fly-airplane","plane10","city5-9","city1-9")),1) occurs(action(("fly-airplane","plane11","city2-9","city5-9")),1) occurs(action(("fly-airplane","plane7","city5-9","city10-9")),1) occurs(action(("drive-truck","truck11","city6-2","city6-6","city6")),1) occurs(action(("drive-truck","truck28","city2-7","city2-5","city2")),1) occurs(action(("drive-truck","truck3","city2-6","city2-5","city2")),1) occurs(action(("drive-truck","truck4","city1-3","city1-1","city1")),1) occurs(action(("drive-truck","truck14","city4-9","city4-8","city4")),1) occurs(action(("drive-truck","truck31","city5-7","city5-8","city5")),1) occurs(action(("load-truck","package2","truck36","city10-1")),1) occurs(action(("load-truck","package3","truck31","city5-8")),1) occurs(action(("load-truck","package8","truck11","city6-6")),1) occurs(action(("drive-truck","truck37","city11-5","city11-6","city11")),2) occurs(action(("drive-truck","truck8","city11-7","city11-6","city11")),2) occurs(action(("fly-airplane","plane11","city5-9","city12-9")),2) occurs(action(("fly-airplane","plane4","city7-9","city12-9")),2) occurs(action(("fly-airplane","plane5","city11-9","city12-9")),2) occurs(action(("fly-airplane","plane8","city7-9","city12-9")),2) occurs(action(("fly-airplane","plane9","city2-9","city12-9")),2) occurs(action(("drive-truck","truck24","city9-7","city9-8","city9")),2) occurs(action(("drive-truck","truck25","city9-1","city9-8","city9")),2) occurs(action(("drive-truck","truck35","city9-3","city9-8","city9")),2) occurs(action(("drive-truck","truck32","city6-3","city6-2","city6")),2) occurs(action(("drive-truck","truck39","city13-7","city13-2","city13")),2) occurs(action(("drive-truck","truck40","city14-3","city14-8","city14")),2) occurs(action(("drive-truck","truck38","city12-7","city12-6","city12")),2) occurs(action(("drive-truck","truck12","city2-8","city2-3","city2")),2) occurs(action(("drive-truck","truck13","city2-1","city2-3","city2")),2) occurs(action(("drive-truck","truck2","city2-9","city2-3","city2")),2) occurs(action(("drive-truck","truck20","city2-6","city2-3","city2")),2) occurs(action(("fly-airplane","plane1","city1-9","city9-9")),2) occurs(action(("fly-airplane","plane10","city1-9","city9-9")),2) occurs(action(("fly-airplane","plane12","city4-9","city8-9")),2) occurs(action(("fly-airplane","plane13","city8-9","city10-9")),2) occurs(action(("fly-airplane","plane3","city6-9","city13-9")),2) occurs(action(("fly-airplane","plane6","city3-9","city9-9")),2) occurs(action(("fly-airplane","plane7","city10-9","city6-9")),2) occurs(action(("drive-truck","truck11","city6-6","city6-9","city6")),2) occurs(action(("drive-truck","truck19","city13-3","city13-9","city13")),2) occurs(action(("drive-truck","truck1","city12-9","city12-1","city12")),2) occurs(action(("drive-truck","truck36","city10-1","city10-9","city10")),2) occurs(action(("drive-truck","truck28","city2-5","city2-9","city2")),2) occurs(action(("unload-truck","package9","truck3","city2-9")),2) occurs(action(("drive-truck","truck3","city2-5","city2-9","city2")),2) occurs(action(("drive-truck","truck27","city1-5","city1-9","city1")),2) occurs(action(("drive-truck","truck4","city1-1","city1-9","city1")),2) occurs(action(("drive-truck","truck22","city3-3","city3-9","city3")),2) occurs(action(("load-truck","package10","truck9","city3-1")),2) occurs(action(("drive-truck","truck9","city3-1","city3-9","city3")),2) occurs(action(("drive-truck","truck17","city4-5","city4-9","city4")),2) occurs(action(("drive-truck","truck23","city4-4","city4-9","city4")),2) occurs(action(("drive-truck","truck26","city4-6","city4-9","city4")),2) occurs(action(("drive-truck","truck30","city4-4","city4-9","city4")),2) occurs(action(("drive-truck","truck6","city4-7","city4-9","city4")),2) occurs(action(("drive-truck","truck18","city5-5","city5-9","city5")),2) occurs(action(("drive-truck","truck31","city5-8","city5-9","city5")),2) occurs(action(("drive-truck","truck15","city7-8","city7-9","cit
|
||
|
|
Solving Time: 16.86s
|
||
|
|
Memory: 7824MB (+262MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 169.632s (Solving: 16.18s 1st Model: 15.50s Unsat: 0.64s)
|
||
|
|
CPU Time : 169.540s
|
||
|
|
|
||
|
|
Choices : 1242689
|
||
|
|
Conflicts : 1919 (Analyzed: 1918)
|
||
|
|
Restarts : 18 (Average: 106.56 Last: 60)
|
||
|
|
Model-Level : 21303.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 4853 (Deleted: 0)
|
||
|
|
Binary : 465 (Ratio: 9.58%)
|
||
|
|
Ternary : 662 (Ratio: 13.64%)
|
||
|
|
Conflict : 1918 (Average Length: 160.2 Ratio: 39.52%)
|
||
|
|
Loop : 2935 (Average Length: 49.0 Ratio: 60.48%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1918 (Average: 594.64 Max: 20813 Sum: 1140517)
|
||
|
|
Executed : 1906 (Average: 594.63 Max: 20813 Sum: 1140499 Ratio: 100.00%)
|
||
|
|
Bounded : 12 (Average: 1.50 Max: 7 Sum: 18 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 28349781
|
||
|
|
Atoms : 28349781
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1066626 (Eliminated: 0 Frozen: 1013195)
|
||
|
|
Constraints : 2418846 (Binary: 84.5% Ternary: 13.8% Other: 1.8%)
|
||
|
|
|
||
|
|
Memory Peak : 8237MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|