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

205 lines
14 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-12.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-12.pddl
Parsing...
Parsing: [0.000s CPU, 0.017s wall-clock]
Normalizing task... [0.010s 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.019s wall-clock]
Preparing model... [0.010s CPU, 0.016s wall-clock]
Generated 43 rules.
Computing model... [0.570s CPU, 0.571s wall-clock]
4500 relevant atoms
3459 auxiliary atoms
7959 final queue length
17591 total queue pushes
Completing instantiation... [1.410s CPU, 1.404s wall-clock]
Instantiating: [2.020s CPU, 2.024s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.047s wall-clock]
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
Instantiating groups... [0.090s CPU, 0.082s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
39 uncovered facts
Choosing groups: [0.020s CPU, 0.021s wall-clock]
Building translation key... [0.010s CPU, 0.007s wall-clock]
Computing fact groups: [0.200s CPU, 0.199s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.007s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.012s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.070s CPU, 0.077s wall-clock]
Translating task: [1.660s CPU, 1.660s wall-clock]
5130 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
56 propositions removed
Detecting unreachable propositions: [0.870s CPU, 0.882s wall-clock]
Reordering and filtering variables...
59 of 59 variables necessary.
42 of 59 mutex groups necessary.
3570 of 3570 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.390s CPU, 0.391s wall-clock]
Translator variables: 59
Translator derived variables: 0
Translator facts: 591
Translator goal facts: 11
Translator mutex groups: 42
Translator total mutex groups size: 747
Translator operators: 3570
Translator axioms: 0
Translator task size: 33628
Translator peak memory: 53848 KB
Writing output... [0.520s CPU, 0.559s wall-clock]
Done! [5.770s CPU, 5.822s wall-clock]
planner.py version 0.0.1
Time: 18.73s
Memory: 973MB
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.08s
Memory: 973MB (+0MB)
UNSAT
Iteration Time: 0.08s
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: 2.35s
Memory: 1053MB (+80MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 1108MB (+55MB)
UNSAT
Iteration Time: 3.01s
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: 2.45s
Memory: 1193MB (+85MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 1214MB (+21MB)
UNSAT
Iteration Time: 3.26s
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: 2.49s
Memory: 1245MB (+31MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 1300MB (+55MB)
UNSAT
Iteration Time: 3.37s
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: 2.54s
Memory: 1361MB (+61MB)
Unblocking actions...
Solving...
Solving Time: 4.36s
Memory: 1438MB (+77MB)
UNKNOWN
Iteration Time: 7.74s
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: 2.50s
Memory: 1534MB (+96MB)
Unblocking actions...
Solving...
Solving Time: 5.01s
Memory: 1596MB (+62MB)
UNKNOWN
Iteration Time: 8.41s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 2.52s
Memory: 1683MB (+87MB)
Unblocking actions...
Solving...
Solving Time: 6.10s
Memory: 1706MB (+23MB)
UNKNOWN
Iteration Time: 9.46s
Iteration 8
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist3","crate4","crate2","distributor0")),1) occurs(action(("lift","hoist5","crate13","crate9","distributor2")),1) occurs(action(("lift","hoist4","crate14","crate11","distributor1")),1) occurs(action(("lift","hoist1","crate12","crate10","depot1")),1) occurs(action(("drive","truck0","distributor1","depot1")),1) occurs(action(("drive","truck1","depot1","distributor2")),1) occurs(action(("load","hoist5","crate13","truck1","distributor2")),2) occurs(action(("load","hoist1","crate12","truck0","depot1")),2) occurs(action(("drive","truck1","distributor2","distributor0")),2) occurs(action(("drive","truck0","depot1","distributor1")),2) occurs(action(("lift","hoist1","crate10","crate5","depot1")),3) occurs(action(("lift","hoist5","crate9","crate8","distributor2")),3) occurs(action(("load","hoist4","crate14","truck0","distributor1")),3) occurs(action(("drive","truck0","distributor1","depot1")),3) occurs(action(("drive","truck1","distributor0","distributor2")),3) occurs(action(("load","hoist3","crate4","truck1","distributor0")),3) occurs(action(("lift","hoist4","crate11","pallet4","distributor1")),4) occurs(action(("load","hoist5","crate9","truck1","distributor2")),4) occurs(action(("load","hoist1","crate10","truck0","depot1")),4) occurs(action(("drive","truck1","distributor2","depot2")),4) occurs(action(("drive","truck0","depot1","distributor1")),4) occurs(action(("unload","hoist2","crate9","truck1","depot2")),5) occurs(action(("drive","truck0","distributor1","depot1")),5) occurs(action(("drive","truck1","depot2","distributor2")),5) occurs(action(("lift","hoist1","crate5","crate1","depot1")),5) occurs(action(("lift","hoist5","crate8","crate7","distributor2")),5) occurs(action(("load","hoist4","crate11","truck0","distributor1")),5) occurs(action(("drop","hoist2","crate9","pallet2","depot2")),6) occurs(action(("lift","hoist3","crate2","pallet3","distributor0")),6) occurs(action(("load","hoist1","crate5","truck0","depot1")),6) occurs(action(("drive","truck0","depot1","depot0")),6) occurs(action(("drive","truck1","distributor2","distributor0")),6) occurs(action(("load","hoist5","crate8","truck1","distributor2")),6) occurs(action(("lift","hoist2","crate9","pallet2","depot2")),7) occurs(action(("unload","hoist0","crate5","truck0","depot0")),7) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),7) occurs(action(("load","hoist3","crate2","truck1","distributor0")),7) occurs(action(("drive","truck0","depot0","distributor2")),7) occurs(action(("lift","hoist5","crate7","crate6","distributor2")),7) occurs(action(("drive","truck1","distributor0","depot1")),7) occurs(action(("drop","hoist2","crate9","pallet2","depot2")),8) occurs(action(("drop","hoist0","crate5","pallet0","depot0")),8) occurs(action(("drive","truck0","distributor2","depot0")),8) occurs(action(("drive","truck1","depot1","depot2")),8) occurs(action(("load","hoist1","crate1","truck1","depot1")),8) occurs(action(("load","hoist5","crate7","truck0","distributor2")),8) occurs(action(("lift","hoist5","crate6","crate3","distributor2")),9) occurs(action(("unload","hoist2","crate2","truck1","depot2")),9) occurs(action(("drive","truck0","depot0","distributor2")),9) occurs(action(("drive","truck1","depot2","distributor2")),9) occurs(action(("unload","hoist0","crate11","truck0","depot0")),9) occurs(action(("drop","hoist2","crate2","crate9","depot2")),10) occurs(action(("load","hoist5","crate6","truck0","distributor2")),10) occurs(action(("drive","truck0","distributor2","depot2")),10) occurs(action(("drop","hoist0","crate11","crate5","depot0")),10) occurs(action(("drive","truck1","distributor2","depot1")),10) occurs(action(("lift","hoist5","crate3","crate0","distributor2")),11) occurs(action(("unload","hoist2","crate14","truck0","depot2")),11) occurs(action(("unload","hoist1","crate13","truck1","depot1")),11) occurs(action(("drive","truck1","depot1","depot2")),11) occurs(action(("drive","truck0","depot2","distributor2")),11) occurs(action(("drop","hoist1","crate13","pallet1","depot1")),12) occurs(action(("load","hoist5","crate3","truck0","distributor2")),12) o
Solving Time: 1.19s
Memory: 1706MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 8
Time : 55.349s (Solving: 16.40s 1st Model: 1.16s Unsat: 0.01s)
CPU Time : 55.290s
Choices : 831723
Conflicts : 33362 (Analyzed: 33360)
Restarts : 325 (Average: 102.65 Last: 82)
Model-Level : 553.0
Problems : 8 (Average Length: 18.88 Splits: 0)
Lemmas : 33360 (Deleted: 27214)
Binary : 825 (Ratio: 2.47%)
Ternary : 643 (Ratio: 1.93%)
Conflict : 33360 (Average Length: 336.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 33360 (Average: 22.62 Max: 3045 Sum: 754600)
Executed : 33007 (Average: 22.38 Max: 3045 Sum: 746682 Ratio: 98.95%)
Bounded : 353 (Average: 22.43 Max: 32 Sum: 7918 Ratio: 1.05%)
Rules : 7572937
Atoms : 7572937
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 135576 (Eliminated: 0 Frozen: 109356)
Constraints : 1137915 (Binary: 97.6% Ternary: 1.2% Other: 1.2%)
Memory Peak : 1805MB
Max. Length : 30 steps
Sol. Length : 20 steps