tplp-planning-benchmark/fd-pb-e3/ipc-1998_logistics-round-1-strips_23.out

143 lines
20 KiB
Plaintext
Raw Permalink Normal View History

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-23.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-23.pddl
Parsing...
Parsing: [0.010s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 51 rules.
Computing model... [0.640s CPU, 0.643s wall-clock]
5416 relevant atoms
3476 auxiliary atoms
8892 final queue length
11913 total queue pushes
Completing instantiation... [1.000s CPU, 1.002s wall-clock]
Instantiating: [1.700s CPU, 1.700s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.020s CPU, 0.017s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.100s CPU, 0.105s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.007s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.020s CPU, 0.020s wall-clock]
Building translation key... [0.020s CPU, 0.013s wall-clock]
Computing fact groups: [0.240s CPU, 0.233s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.044s wall-clock]
Translating task: [0.830s CPU, 0.832s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
53 propositions removed
Detecting unreachable propositions: [0.510s CPU, 0.509s wall-clock]
Reordering and filtering variables...
53 of 53 variables necessary.
0 of 53 mutex groups necessary.
3976 of 3976 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.110s CPU, 0.115s wall-clock]
Translator variables: 53
Translator derived variables: 0
Translator facts: 1096
Translator goal facts: 21
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 3976
Translator axioms: 0
Translator task size: 16794
Translator peak memory: 45144 KB
Writing output... [0.340s CPU, 0.375s wall-clock]
Done! [3.800s CPU, 3.843s wall-clock]
planner.py version 0.0.1
Time: 5.01s
Memory: 334MB
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.03s
Memory: 334MB (+0MB)
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: 0.52s
Memory: 381MB (+47MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 389MB (+8MB)
UNSAT
Iteration Time: 0.76s
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.57s
Memory: 415MB (+26MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck25","city5-1","city5-2","city5")),1) occurs(action(("drive-truck","truck8","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck23","city3-1","city3-2","city3")),1) occurs(action(("fly-airplane","plane4","city5-2","city4-2")),1) occurs(action(("load-truck","package1","truck8","city1-1")),1) occurs(action(("load-truck","package18","truck25","city5-1")),1) occurs(action(("load-truck","package20","truck23","city3-1")),1) occurs(action(("load-truck","package21","truck23","city3-1")),1) occurs(action(("load-truck","package3","truck23","city3-1")),1) occurs(action(("load-truck","package5","truck23","city3-1")),1) occurs(action(("load-truck","package13","truck8","city1-1")),1) occurs(action(("load-truck","package9","truck8","city1-1")),1) occurs(action(("load-airplane","package15","plane3","city7-2")),2) occurs(action(("drive-truck","truck11","city6-2","city6-1","city6")),2) occurs(action(("load-airplane","package2","plane1","city1-2")),2) occurs(action(("drive-truck","truck26","city6-1","city6-2","city6")),2) occurs(action(("fly-airplane","plane3","city7-2","city5-2")),2) occurs(action(("drive-truck","truck13","city5-1","city5-2","city5")),2) occurs(action(("fly-airplane","plane2","city3-2","city1-2")),2) occurs(action(("load-airplane","package4","plane2","city3-2")),2) occurs(action(("drive-truck","truck28","city8-1","city8-2","city8")),2) occurs(action(("fly-airplane","plane4","city4-2","city3-2")),2) occurs(action(("unload-truck","package1","truck8","city1-2")),2) occurs(action(("unload-truck","package18","truck25","city5-2")),2) occurs(action(("unload-truck","package20","truck23","city3-2")),2) occurs(action(("unload-truck","package21","truck23","city3-2")),2) occurs(action(("unload-truck","package3","truck23","city3-2")),2) occurs(action(("unload-truck","package5","truck23","city3-2")),2) occurs(action(("drive-truck","truck27","city7-1","city7-2","city7")),2) occurs(action(("drive-truck","truck8","city1-2","city1-1","city1")),2) occurs(action(("drive-truck","truck23","city3-2","city3-1","city3")),2) occurs(action(("drive-truck","truck25","city5-2","city5-1","city5")),2) occurs(action(("load-airplane","package12","plane1","city1-2")),2) occurs(action(("load-airplane","package14","plane4","city4-2")),2) occurs(action(("load-airplane","package17","plane1","city1-2")),2) occurs(action(("load-truck","package6","truck27","city7-1")),2) occurs(action(("load-truck","package7","truck21","city1-1")),2) occurs(action(("unload-truck","package13","truck8","city1-2")),2) occurs(action(("unload-truck","package9","truck8","city1-2")),2) occurs(action(("load-truck","package16","truck26","city6-1")),2) occurs(action(("load-truck","package19","truck28","city8-1")),2) occurs(action(("load-truck","package8","truck26","city6-1")),2) occurs(action(("load-airplane","package1","plane1","city1-2")),3) occurs(action(("load-airplane","package18","plane3","city5-2")),3) occurs(action(("load-airplane","package20","plane4","city3-2")),3) occurs(action(("load-airplane","package21","plane4","city3-2")),3) occurs(action(("load-airplane","package3","plane4","city3-2")),3) occurs(action(("drive-truck","truck19","city1-1","city1-2","city1")),3) occurs(action(("drive-truck","truck21","city1-1","city1-2","city1")),3) occurs(action(("fly-airplane","plane1","city1-2","city8-2")),3) occurs(action(("load-airplane","package5","plane4","city3-2")),3) occurs(action(("fly-airplane","plane2","city1-2","city2-2")),3) occurs(action(("fly-airplane","plane3","city5-2","city2-2")),3) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),3) occurs(action(("drive-truck","truck23","city3-1","city3-2","city3")),3) occurs(action(("unload-airplane","package14","plane4","city3-2")),3) occurs(action(("unload-truck","package6","truck27","city7-2")),3) occurs(action(("drive-truck","truck26","city6-2","city6-1","city6")),3) occurs(action(("drive-truck","truck28","city8-2","city8-1","city8")),3) occurs(action(("fly-airplane","plane4","city3-2","city5-2")),3) occurs(action(("drive-truck","truck13","city5-2","city5-1","city
Solving Time: 0.06s
Memory: 430MB (+15MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 6.684s (Solving: 0.04s 1st Model: 0.03s Unsat: 0.00s)
CPU Time : 6.650s
Choices : 2089
Conflicts : 86 (Analyzed: 86)
Restarts : 1 (Average: 86.00 Last: 25)
Model-Level : 756.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 86 (Deleted: 0)
Binary : 5 (Ratio: 5.81%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 86 (Average Length: 89.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 86 (Average: 13.44 Max: 180 Sum: 1156)
Executed : 86 (Average: 13.44 Max: 180 Sum: 1156 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 2461424
Atoms : 2461424
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 72538 (Eliminated: 0 Frozen: 0)
Constraints : 210282 (Binary: 90.9% Ternary: 7.8% Other: 1.3%)
Memory Peak : 430MB
Max. Length : 10 steps
Sol. Length : 10 steps