1
0
tplp-planning-benchmark/fd-pb-e3/ipc-2002_depots-strips-automatic_6.out

182 lines
13 KiB
Plaintext
Raw 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.020s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s 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.280s 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.650s wall-clock]
Instantiating: [0.990s CPU, 0.983s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.050s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.050s CPU, 0.052s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
27 uncovered facts
Choosing groups: [0.020s CPU, 0.015s wall-clock]
Building translation key... [0.010s CPU, 0.005s wall-clock]
Computing fact groups: [0.150s CPU, 0.154s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s 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.035s wall-clock]
Translating task: [0.730s CPU, 0.728s 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.365s 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.200s 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.262s wall-clock]
Done! [2.740s CPU, 2.758s wall-clock]
planner.py version 0.0.1
Time: 4.80s
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: 3.63s
Memory: 634MB (+334MB)
Unblocking actions...
Solving...
Solving Time: 0.14s
Memory: 646MB (+12MB)
UNSAT
Iteration Time: 4.41s
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: 3.18s
Memory: 763MB (+117MB)
Unblocking actions...
Solving...
Solving Time: 0.15s
Memory: 775MB (+12MB)
UNSAT
Iteration Time: 4.06s
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: 4.78s
Memory: 995MB (+220MB)
Unblocking actions...
Solving...
Solving Time: 0.23s
Memory: 1011MB (+16MB)
UNSAT
Iteration Time: 5.82s
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: 3.18s
Memory: 1128MB (+117MB)
Unblocking actions...
Solving...
Solving Time: 0.30s
Memory: 1147MB (+19MB)
UNSAT
Iteration Time: 4.31s
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: 3.31s
Memory: 1263MB (+116MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate11","crate6","depot0")),1) occurs(action(("drive","truck0","distributor1","depot0")),1) occurs(action(("drive","truck1","depot0","distributor0")),1) occurs(action(("lift","hoist1","crate14","crate13","distributor0")),1) occurs(action(("lift","hoist2","crate10","crate5","distributor1")),2) occurs(action(("load","hoist0","crate11","truck0","depot0")),2) occurs(action(("drive","truck1","distributor0","distributor1")),2) occurs(action(("load","hoist1","crate14","truck1","distributor0")),2) occurs(action(("drive","truck0","depot0","distributor1")),2) occurs(action(("lift","hoist1","crate13","crate12","distributor0")),3) occurs(action(("lift","hoist0","crate6","crate1","depot0")),3) occurs(action(("load","hoist2","crate10","truck0","distributor1")),3) occurs(action(("drive","truck0","distributor1","depot0")),3) occurs(action(("drive","truck1","distributor1","distributor0")),3) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),4) occurs(action(("drive","truck1","distributor0","distributor1")),4) occurs(action(("load","hoist0","crate6","truck0","depot0")),4) occurs(action(("load","hoist1","crate13","truck1","distributor0")),4) occurs(action(("drive","truck0","depot0","distributor1")),4) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),5) occurs(action(("lift","hoist1","crate12","crate9","distributor0")),5) occurs(action(("load","hoist2","crate5","truck0","distributor1")),5) occurs(action(("drive","truck0","distributor1","distributor0")),5) occurs(action(("drive","truck1","distributor1","depot0")),5) occurs(action(("lift","hoist2","crate2","crate0","distributor1")),6) occurs(action(("load","hoist1","crate12","truck0","distributor0")),6) occurs(action(("load","hoist0","crate1","truck1","depot0")),6) occurs(action(("drive","truck0","distributor0","distributor1")),6) occurs(action(("lift","hoist1","crate9","crate8","distributor0")),7) occurs(action(("load","hoist2","crate2","truck0","distributor1")),7) occurs(action(("drive","truck1","depot0","distributor0")),7) occurs(action(("unload","hoist0","crate14","truck1","depot0")),7) occurs(action(("unload","hoist2","crate12","truck0","distributor1")),8) occurs(action(("load","hoist1","crate9","truck1","distributor0")),8) occurs(action(("drive","truck1","distributor0","distributor1")),8) occurs(action(("load","hoist2","crate12","truck1","distributor1")),9) occurs(action(("drive","truck0","distributor1","distributor0")),9) occurs(action(("lift","hoist1","crate8","crate7","distributor0")),9) occurs(action(("drive","truck1","distributor1","depot0")),9) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),10) occurs(action(("load","hoist1","crate8","truck0","distributor0")),10) occurs(action(("drive","truck0","distributor0","depot0")),10) occurs(action(("drive","truck1","depot0","distributor1")),10) occurs(action(("load","hoist0","crate14","truck1","depot0")),10) occurs(action(("unload","hoist0","crate8","truck0","depot0")),11) occurs(action(("lift","hoist1","crate7","crate4","distributor0")),11) occurs(action(("drive","truck0","depot0","distributor0")),11) occurs(action(("load","hoist2","crate0","truck1","distributor1")),11) occurs(action(("drop","hoist0","crate8","pallet0","depot0")),12) occurs(action(("unload","hoist2","crate12","truck1","distributor1")),12) occurs(action(("load","hoist1","crate7","truck0","distributor0")),12) occurs(action(("drive","truck1","distributor1","depot0")),12) occurs(action(("drop","hoist2","crate12","pallet2","distributor1")),13) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),13) occurs(action(("unload","hoist0","crate0","truck1","depot0")),13) occurs(action(("drive","truck1","depot0","distributor1")),13) occurs(action(("drop","hoist0","crate0","crate8","depot0")),14) occurs(action(("load","hoist1","crate4","truck0","distributor0")),14) occurs(action(("drive","truck0","distributor0","depot0")),14) occurs(action(("unload","hoist2","crate14","truck1","distributor1")),14) occurs(action(("lift","hoist1","crate3","pallet1","distributor0")),15) occurs(action(("unload","h
Solving Time: 0.86s
Memory: 1291MB (+28MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 28.495s (Solving: 0.71s 1st Model: 0.57s Unsat: 0.14s)
CPU Time : 28.420s
Choices : 7225
Conflicts : 1970 (Analyzed: 1967)
Restarts : 22 (Average: 89.41 Last: 66)
Model-Level : 175.0
Problems : 6 (Average Length: 14.50 Splits: 0)
Lemmas : 1967 (Deleted: 0)
Binary : 92 (Ratio: 4.68%)
Ternary : 89 (Ratio: 4.52%)
Conflict : 1967 (Average Length: 168.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1967 (Average: 4.05 Max: 216 Sum: 7960)
Executed : 1914 (Average: 3.58 Max: 216 Sum: 7048 Ratio: 88.54%)
Bounded : 53 (Average: 17.21 Max: 27 Sum: 912 Ratio: 11.46%)
Rules : 2139898
Atoms : 2139898
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 128455 (Eliminated: 0 Frozen: 113483)
Constraints : 438999 (Binary: 96.1% Ternary: 1.9% Other: 2.0%)
Memory Peak : 1295MB
Max. Length : 25 steps
Sol. Length : 25 steps