tplp-planning-benchmark/fd-pb-e4/ipc-2002_depots-strips-automatic_6.out

182 lines
13 KiB
Plaintext
Raw Permalink Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-6.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/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-6.pddl
Parsing...
Parsing: [0.010s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 43 rules.
Computing model... [0.290s CPU, 0.288s wall-clock]
2274 relevant atoms
1737 auxiliary atoms
4011 final queue length
8420 total queue pushes
Completing instantiation... [0.650s CPU, 0.651s wall-clock]
Instantiating: [0.990s CPU, 0.984s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.042s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.060s CPU, 0.053s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
27 uncovered facts
Choosing groups: [0.010s CPU, 0.015s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.150s CPU, 0.148s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.009s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.036s wall-clock]
Translating task: [0.730s CPU, 0.733s wall-clock]
2295 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
44 propositions removed
Detecting unreachable propositions: [0.360s CPU, 0.361s wall-clock]
Reordering and filtering variables...
53 of 53 variables necessary.
36 of 53 mutex groups necessary.
1632 of 1632 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.200s CPU, 0.201s wall-clock]
Translator variables: 53
Translator derived variables: 0
Translator facts: 438
Translator goal facts: 11
Translator mutex groups: 36
Translator total mutex groups size: 516
Translator operators: 1632
Translator axioms: 0
Translator task size: 15724
Translator peak memory: 42840 KB
Writing output... [0.240s CPU, 0.261s wall-clock]
Done! [2.730s CPU, 2.755s wall-clock]
planner.py version 0.0.1
Time: 4.95s
Memory: 300MB
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: 300MB (+0MB)
UNSAT
Iteration Time: 0.02s
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.91s
Memory: 348MB (+48MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 350MB (+2MB)
UNSAT
Iteration Time: 1.14s
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.94s
Memory: 369MB (+19MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 400MB (+31MB)
UNSAT
Iteration Time: 1.23s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.96s
Memory: 430MB (+30MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 493MB (+63MB)
UNSAT
Iteration Time: 1.31s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.97s
Memory: 493MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 543MB (+50MB)
UNSAT
Iteration Time: 1.33s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.98s
Memory: 561MB (+18MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist2","crate10","crate5","distributor1")),1) occurs(action(("drive","truck1","depot0","distributor0")),1) occurs(action(("lift","hoist1","crate14","crate13","distributor0")),1) occurs(action(("lift","hoist0","crate11","crate6","depot0")),2) occurs(action(("load","hoist2","crate10","truck0","distributor1")),2) occurs(action(("drive","truck0","distributor1","depot0")),2) occurs(action(("drive","truck1","distributor0","distributor1")),2) occurs(action(("load","hoist1","crate14","truck1","distributor0")),2) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),3) occurs(action(("lift","hoist1","crate13","crate12","distributor0")),3) occurs(action(("load","hoist0","crate11","truck0","depot0")),3) occurs(action(("drive","truck1","distributor1","distributor0")),3) occurs(action(("drive","truck0","depot0","distributor1")),3) occurs(action(("lift","hoist0","crate6","crate1","depot0")),4) occurs(action(("load","hoist2","crate5","truck0","distributor1")),4) occurs(action(("drive","truck0","distributor1","depot0")),4) occurs(action(("drive","truck1","distributor0","distributor1")),4) occurs(action(("load","hoist1","crate13","truck1","distributor0")),4) occurs(action(("lift","hoist2","crate2","crate0","distributor1")),5) occurs(action(("lift","hoist1","crate12","crate9","distributor0")),5) occurs(action(("drive","truck0","depot0","distributor0")),5) occurs(action(("load","hoist0","crate6","truck0","depot0")),5) occurs(action(("load","hoist2","crate2","truck1","distributor1")),6) occurs(action(("load","hoist1","crate12","truck0","distributor0")),6) occurs(action(("drive","truck0","distributor0","depot0")),6) occurs(action(("drive","truck1","distributor1","distributor0")),6) occurs(action(("lift","hoist1","crate9","crate8","distributor0")),7) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),7) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),7) occurs(action(("drive","truck0","depot0","distributor0")),7) occurs(action(("drive","truck1","distributor0","distributor1")),7) occurs(action(("load","hoist1","crate9","truck0","distributor0")),8) occurs(action(("drive","truck1","distributor1","distributor0")),8) occurs(action(("load","hoist2","crate0","truck1","distributor1")),8) occurs(action(("drive","truck0","distributor0","distributor1")),8) occurs(action(("unload","hoist2","crate12","truck0","distributor1")),9) occurs(action(("drive","truck0","distributor1","depot0")),9) occurs(action(("lift","hoist1","crate8","crate7","distributor0")),9) occurs(action(("drop","hoist2","crate12","pallet2","distributor1")),10) occurs(action(("load","hoist1","crate8","truck1","distributor0")),10) occurs(action(("load","hoist0","crate1","truck0","depot0")),10) occurs(action(("drive","truck0","depot0","distributor1")),10) occurs(action(("drive","truck1","distributor0","depot0")),10) occurs(action(("unload","hoist0","crate8","truck1","depot0")),11) occurs(action(("unload","hoist2","crate11","truck0","distributor1")),11) occurs(action(("lift","hoist1","crate7","crate4","distributor0")),11) occurs(action(("drive","truck0","distributor1","distributor0")),11) occurs(action(("drop","hoist0","crate8","pallet0","depot0")),12) occurs(action(("drive","truck0","distributor0","depot0")),12) occurs(action(("load","hoist1","crate7","truck0","distributor0")),12) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),13) occurs(action(("drop","hoist2","crate11","crate12","distributor1")),13) occurs(action(("unload","hoist0","crate0","truck1","depot0")),13) occurs(action(("drive","truck1","depot0","distributor0")),13) occurs(action(("drive","truck0","depot0","distributor1")),13) occurs(action(("drop","hoist0","crate0","crate8","depot0")),14) occurs(action(("load","hoist1","crate4","truck1","distributor0")),14) occurs(action(("drive","truck0","distributor1","depot0")),14) occurs(action(("drive","truck1","distributor0","depot0")),14) occurs(action(("lift","hoist1","crate3","pallet1","distributor0")),15) occurs(action(("unload","hoist0","crate5","truck0","depot0")),15) occurs(action(("lift","hoist2","c
Solving Time: 1.41s
Memory: 575MB (+14MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 12.727s (Solving: 1.39s 1st Model: 1.37s Unsat: 0.02s)
CPU Time : 12.680s
Choices : 11711
Conflicts : 4479 (Analyzed: 4476)
Restarts : 53 (Average: 84.45 Last: 67)
Model-Level : 93.0
Problems : 6 (Average Length: 14.50 Splits: 0)
Lemmas : 4476 (Deleted: 2296)
Binary : 174 (Ratio: 3.89%)
Ternary : 186 (Ratio: 4.16%)
Conflict : 4476 (Average Length: 159.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 4476 (Average: 3.08 Max: 94 Sum: 13807)
Executed : 4366 (Average: 2.55 Max: 94 Sum: 11434 Ratio: 82.81%)
Bounded : 110 (Average: 21.57 Max: 27 Sum: 2373 Ratio: 17.19%)
Rules : 2139898
Atoms : 2139898
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 59624 (Eliminated: 0 Frozen: 43852)
Constraints : 438999 (Binary: 96.1% Ternary: 1.9% Other: 2.0%)
Memory Peak : 603MB
Max. Length : 25 steps
Sol. Length : 25 steps