tplp-planning-benchmark/fd-pb-e0-sh-h/ipc-1998_logistics-round-1-strips_3.out

143 lines
12 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-3.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-3.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 51 rules.
Computing model... [0.530s CPU, 0.528s wall-clock]
3618 relevant atoms
2836 auxiliary atoms
6454 final queue length
8517 total queue pushes
Completing instantiation... [0.640s CPU, 0.632s wall-clock]
Instantiating: [1.220s CPU, 1.221s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.020s CPU, 0.016s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.060s CPU, 0.059s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.020s CPU, 0.012s wall-clock]
Building translation key... [0.000s CPU, 0.007s wall-clock]
Computing fact groups: [0.140s CPU, 0.140s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.029s wall-clock]
Translating task: [0.540s CPU, 0.539s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
27 propositions removed
Detecting unreachable propositions: [0.280s CPU, 0.281s wall-clock]
Reordering and filtering variables...
25 of 27 variables necessary.
0 of 27 mutex groups necessary.
2184 of 2576 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.070s CPU, 0.062s wall-clock]
Translator variables: 25
Translator derived variables: 0
Translator facts: 518
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 2184
Translator axioms: 0
Translator task size: 8474
Translator peak memory: 43980 KB
Writing output... [0.170s CPU, 0.190s wall-clock]
Done! [2.480s CPU, 2.493s wall-clock]
planner.py version 0.0.1
Time: 0.34s
Memory: 70MB
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: 70MB (+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.10s
Memory: 71MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 75MB (+4MB)
UNSAT
Iteration Time: 0.17s
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.11s
Memory: 81MB (+6MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck10","city10-1","city10-3","city10")),1) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck13","city13-1","city13-3","city13")),1) occurs(action(("drive-truck","truck9","city9-2","city9-1","city9")),1) occurs(action(("fly-airplane","plane1","city11-3","city4-3")),1) occurs(action(("fly-airplane","plane2","city11-3","city12-3")),1) occurs(action(("fly-airplane","plane4","city10-3","city12-3")),1) occurs(action(("drive-truck","truck11","city11-1","city11-3","city11")),1) occurs(action(("drive-truck","truck4","city4-2","city4-3","city4")),1) occurs(action(("drive-truck","truck12","city12-1","city12-2","city12")),1) occurs(action(("drive-truck","truck8","city8-2","city8-1","city8")),1) occurs(action(("load-truck","package9","truck4","city4-2")),1) occurs(action(("load-airplane","package3","plane2","city12-3")),2) occurs(action(("fly-airplane","plane2","city12-3","city1-3")),2) occurs(action(("drive-truck","truck1","city1-2","city1-3","city1")),2) occurs(action(("load-truck","package6","truck9","city9-1")),2) occurs(action(("drive-truck","truck9","city9-1","city9-3","city9")),2) occurs(action(("fly-airplane","plane3","city1-3","city6-3")),2) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),2) occurs(action(("load-truck","package7","truck1","city1-2")),2) occurs(action(("drive-truck","truck12","city12-2","city12-3","city12")),2) occurs(action(("drive-truck","truck8","city8-1","city8-3","city8")),2) occurs(action(("load-truck","package8","truck9","city9-1")),2) occurs(action(("drive-truck","truck14","city14-1","city14-2","city14")),2) occurs(action(("drive-truck","truck7","city7-1","city7-2","city7")),2) occurs(action(("unload-truck","package9","truck4","city4-3")),2) occurs(action(("load-truck","package4","truck8","city8-1")),2) occurs(action(("load-truck","package5","truck12","city12-2")),2) occurs(action(("unload-airplane","package3","plane2","city1-3")),3) occurs(action(("unload-truck","package6","truck9","city9-3")),3) occurs(action(("unload-truck","package7","truck1","city1-3")),3) occurs(action(("unload-truck","package8","truck9","city9-3")),3) occurs(action(("fly-airplane","plane1","city4-3","city11-3")),3) occurs(action(("drive-truck","truck9","city9-3","city9-2","city9")),3) occurs(action(("drive-truck","truck1","city1-3","city1-1","city1")),3) occurs(action(("load-airplane","package9","plane1","city4-3")),3) occurs(action(("unload-truck","package4","truck8","city8-3")),3) occurs(action(("unload-truck","package5","truck12","city12-3")),3) occurs(action(("load-airplane","package7","plane2","city1-3")),4) occurs(action(("fly-airplane","plane2","city1-3","city10-3")),4) occurs(action(("fly-airplane","plane1","city11-3","city8-3")),4) occurs(action(("unload-airplane","package9","plane1","city11-3")),4) occurs(action(("fly-airplane","plane4","city12-3","city10-3")),4) occurs(action(("load-airplane","package5","plane4","city12-3")),4) occurs(action(("unload-airplane","package7","plane2","city10-3")),5) occurs(action(("fly-airplane","plane2","city10-3","city9-3")),5) occurs(action(("load-truck","package9","truck11","city11-3")),5) occurs(action(("drive-truck","truck11","city11-3","city11-2","city11")),5) occurs(action(("unload-airplane","package5","plane4","city10-3")),5) occurs(action(("fly-airplane","plane1","city8-3","city13-3")),5) occurs(action(("fly-airplane","plane4","city10-3","city6-3")),5) occurs(action(("load-airplane","package4","plane1","city8-3")),5) occurs(action(("unload-truck","package9","truck11","city11-2")),6) occurs(action(("load-truck","package5","truck10","city10-3")),6) occurs(action(("load-airplane","package8","plane2","city9-3")),6) occurs(action(("fly-airplane","plane2","city9-3","city5-3")),6) occurs(action(("unload-airplane","package4","plane1","city13-3")),6) occurs(action(("fly-airplane","plane1","city13-3","city12-3")),6) occurs(action(("drive-truck","truck11","city11-2","city11-3","city11")),6) occurs(action(("drive-truck","truck10","city10-3","city10-1","city10")),6) occurs(action(("
Solving Time: 0.01s
Memory: 86MB (+5MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.709s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.688s
Choices : 772 (Domain: 692)
Conflicts : 6 (Analyzed: 6)
Restarts : 0
Model-Level : 778.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 6 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 6 (Average Length: 16.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 6 (Average: 1.00 Max: 1 Sum: 6)
Executed : 6 (Average: 1.00 Max: 1 Sum: 6 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 28973
Atoms : 28973
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 27652 (Eliminated: 0 Frozen: 4210)
Constraints : 86261 (Binary: 94.0% Ternary: 3.8% Other: 2.2%)
Memory Peak : 86MB
Max. Length : 10 steps
Sol. Length : 10 steps