tplp-planning-benchmark/fd-pc-e1-sh/ipc-1998_logistics-round-1-strips_11.out

147 lines
13 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-11.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-11.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.027s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 51 rules.
Computing model... [0.250s CPU, 0.248s wall-clock]
2133 relevant atoms
1362 auxiliary atoms
3495 final queue length
4747 total queue pushes
Completing instantiation... [0.340s CPU, 0.348s wall-clock]
Instantiating: [0.650s CPU, 0.651s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.013s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.040s CPU, 0.038s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.080s CPU, 0.085s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.016s wall-clock]
Translating task: [0.280s CPU, 0.281s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
36 propositions removed
Detecting unreachable propositions: [0.150s CPU, 0.153s wall-clock]
Reordering and filtering variables...
36 of 36 variables necessary.
0 of 36 mutex groups necessary.
1512 of 1512 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.039s wall-clock]
Translator variables: 36
Translator derived variables: 0
Translator facts: 380
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1512
Translator axioms: 0
Translator task size: 6304
Translator peak memory: 37720 KB
Writing output... [0.120s CPU, 0.127s wall-clock]
Done! [1.360s CPU, 1.379s wall-clock]
planner.py version 0.0.1
Time: 0.25s
Memory: 60MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.07s
Memory: 60MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+3MB)
UNSAT
Iteration Time: 0.10s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.03s
Memory: 65MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 66MB (+1MB)
UNSAT
Iteration Time: 0.05s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.03s
Memory: 66MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck13","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck20","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck1","city2-3","city2-1","city2")),1) occurs(action(("drive-truck","truck12","city2-2","city2-1","city2")),1) occurs(action(("drive-truck","truck14","city2-2","city2-1","city2")),1) occurs(action(("drive-truck","truck16","city2-1","city2-2","city2")),1) occurs(action(("drive-truck","truck21","city2-1","city2-2","city2")),1) occurs(action(("drive-truck","truck3","city2-2","city2-1","city2")),1) occurs(action(("drive-truck","truck2","city1-1","city1-3","city1")),1) occurs(action(("drive-truck","truck4","city3-2","city3-1","city3")),1) occurs(action(("load-truck","package2","truck22","city3-2")),1) occurs(action(("load-truck","package8","truck18","city1-2")),1) occurs(action(("load-truck","package3","truck17","city2-2")),1) occurs(action(("load-truck","package1","truck2","city1-3")),2) occurs(action(("drive-truck","truck17","city2-2","city2-3","city2")),2) occurs(action(("drive-truck","truck22","city3-2","city3-3","city3")),2) occurs(action(("drive-truck","truck15","city2-3","city2-1","city2")),2) occurs(action(("drive-truck","truck7","city2-3","city2-2","city2")),2) occurs(action(("drive-truck","truck18","city1-2","city1-3","city1")),2) occurs(action(("drive-truck","truck11","city3-3","city3-1","city3")),2) occurs(action(("drive-truck","truck8","city3-3","city3-1","city3")),2) occurs(action(("drive-truck","truck3","city2-1","city2-2","city2")),2) occurs(action(("drive-truck","truck21","city2-2","city2-1","city2")),2) occurs(action(("drive-truck","truck16","city2-2","city2-1","city2")),2) occurs(action(("drive-truck","truck14","city2-1","city2-2","city2")),2) occurs(action(("drive-truck","truck12","city2-1","city2-2","city2")),2) occurs(action(("load-truck","package7","truck1","city2-1")),2) occurs(action(("drive-truck","truck2","city1-3","city1-2","city1")),3) occurs(action(("fly-airplane","plane1","city1-3","city3-3")),3) occurs(action(("fly-airplane","plane3","city2-3","city3-3")),3) occurs(action(("fly-airplane","plane5","city1-3","city3-3")),3) occurs(action(("unload-truck","package2","truck22","city3-3")),3) occurs(action(("drive-truck","truck9","city2-3","city2-1","city2")),3) occurs(action(("fly-airplane","plane2","city2-3","city1-3")),3) occurs(action(("unload-truck","package8","truck18","city1-3")),3) occurs(action(("drive-truck","truck13","city1-1","city1-2","city1")),3) occurs(action(("drive-truck","truck20","city1-1","city1-2","city1")),3) occurs(action(("drive-truck","truck4","city3-1","city3-2","city3")),3) occurs(action(("drive-truck","truck15","city2-1","city2-3","city2")),3) occurs(action(("drive-truck","truck7","city2-2","city2-3","city2")),3) occurs(action(("drive-truck","truck11","city3-1","city3-3","city3")),3) occurs(action(("drive-truck","truck8","city3-1","city3-3","city3")),3) occurs(action(("unload-truck","package3","truck17","city2-3")),3) occurs(action(("unload-truck","package7","truck1","city2-1")),3) occurs(action(("fly-airplane","plane1","city3-3","city2-3")),4) occurs(action(("load-airplane","package2","plane5","city3-3")),4) occurs(action(("load-airplane","package8","plane2","city1-3")),4) occurs(action(("unload-truck","package1","truck2","city1-2")),4) occurs(action(("drive-truck","truck1","city2-1","city2-2","city2")),4) occurs(action(("drive-truck","truck15","city2-3","city2-2","city2")),4) occurs(action(("drive-truck","truck16","city2-1","city2-2","city2")),4) occurs(action(("drive-truck","truck19","city2-3","city2-2","city2")),4) occurs(action(("drive-truck","truck21","city2-1","city2-2","city2")),4) occurs(action(("drive-truck","truck5","city2-3","city2-2","city2")),4) occurs(action(("drive-truck","truck6","city2-3","city2-2","city2")),4) occurs(action(("drive-truck","truck7","city2-3","city2-2","city2")),4) occurs(action(("fly-airplane","plane3","city3-3","city1-3")),4) occurs(action(("fly-airplane","plane4","city3-3","city1-3")),4) occurs(action(("drive-truck","truck18","city1-3","city1-2","city1")),4) occur
Solving Time: 0.02s
Memory: 68MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.500s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 0.470s
Choices : 2851
Conflicts : 166 (Analyzed: 165)
Restarts : 2 (Average: 82.50 Last: 34)
Model-Level : 459.0
Problems : 3 (Average Length: 9.00 Splits: 0)
Lemmas : 165 (Deleted: 0)
Binary : 24 (Ratio: 14.55%)
Ternary : 15 (Ratio: 9.09%)
Conflict : 165 (Average Length: 30.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 165 (Average: 16.45 Max: 141 Sum: 2714)
Executed : 134 (Average: 14.56 Max: 141 Sum: 2403 Ratio: 88.54%)
Bounded : 31 (Average: 10.03 Max: 11 Sum: 311 Ratio: 11.46%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 18419 (Eliminated: 0 Frozen: 7394)
Constraints : 68624 (Binary: 88.3% Ternary: 9.5% Other: 2.2%)
Memory Peak : 68MB
Max. Length : 9 steps
Sol. Length : 9 steps