tplp-planning-benchmark/gc-ta1-tt1/ipc-2002_depots-strips-automatic_13.out

148 lines
7.2 KiB
Plaintext

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-13.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-13.pddl
Parsing...
Parsing: [0.010s CPU, 0.020s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.023s wall-clock]
Preparing model... [0.010s CPU, 0.018s wall-clock]
Generated 43 rules.
Computing model... [0.230s CPU, 0.222s wall-clock]
1435 relevant atoms
1320 auxiliary atoms
2755 final queue length
5115 total queue pushes
Completing instantiation... [0.410s CPU, 0.414s wall-clock]
Instantiating: [0.680s CPU, 0.688s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.048s wall-clock]
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
Instantiating groups... [0.050s CPU, 0.056s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
38 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.140s CPU, 0.137s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.023s wall-clock]
Translating task: [0.480s CPU, 0.482s wall-clock]
1392 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
46 propositions removed
Detecting unreachable propositions: [0.270s CPU, 0.263s wall-clock]
Reordering and filtering variables...
36 of 36 variables necessary.
28 of 36 mutex groups necessary.
984 of 984 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.110s CPU, 0.115s wall-clock]
Translator variables: 36
Translator derived variables: 0
Translator facts: 236
Translator goal facts: 6
Translator mutex groups: 28
Translator total mutex groups size: 280
Translator operators: 984
Translator axioms: 0
Translator task size: 9030
Translator peak memory: 41932 KB
Writing output... [0.160s CPU, 0.161s wall-clock]
Done! [1.890s CPU, 1.898s wall-clock]
planner.py version 0.0.1
Time: 0.35s
Memory: 72MB
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: 72MB (+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.11s
Memory: 72MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 73MB (+1MB)
UNSAT
Iteration Time: 0.15s
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.13s
Memory: 79MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 82MB (+3MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.28s
Memory: 82MB (+0MB)
Answer: 1
occurs(action(("lift","hoist3","crate4","pallet3","distributor0")),1) occurs(action(("lift","hoist0","crate2","pallet0","depot0")),1) occurs(action(("lift","hoist2","crate5","crate1","depot2")),1) occurs(action(("drive","truck0","distributor1","depot2")),1) occurs(action(("drop","hoist3","crate4","pallet9","distributor0")),2) occurs(action(("load","hoist2","crate5","truck0","depot2")),2) occurs(action(("load","hoist0","crate2","truck1","depot0")),2) occurs(action(("drive","truck1","depot0","depot2")),2) occurs(action(("lift","hoist2","crate1","crate0","depot2")),3) occurs(action(("load","hoist2","crate1","truck1","depot2")),4) occurs(action(("drive","truck1","depot2","distributor2")),4) occurs(action(("unload","hoist5","crate1","truck1","distributor2")),5) occurs(action(("drive","truck1","distributor2","distributor1")),5) occurs(action(("lift","hoist2","crate0","pallet2","depot2")),5) occurs(action(("drop","hoist5","crate1","pallet5","distributor2")),6) occurs(action(("unload","hoist4","crate2","truck1","distributor1")),6) occurs(action(("drive","truck1","distributor1","depot1")),6) occurs(action(("load","hoist2","crate0","truck0","depot2")),6) occurs(action(("drive","truck0","depot2","depot0")),6) occurs(action(("drop","hoist4","crate2","pallet4","distributor1")),7) occurs(action(("unload","hoist0","crate0","truck0","depot0")),7) occurs(action(("drive","truck0","depot0","depot1")),7) occurs(action(("drop","hoist0","crate0","pallet0","depot0")),8) occurs(action(("unload","hoist1","crate5","truck0","depot1")),8) occurs(action(("drive","truck0","depot1","depot0")),8) occurs(action(("drive","truck1","depot1","depot2")),8) occurs(action(("drop","hoist1","crate5","pallet1","depot1")),9) occurs(action(("lift","hoist0","crate3","pallet8","depot0")),9) occurs(action(("drive","truck1","depot2","depot0")),9) occurs(action(("drive","truck0","depot0","distributor1")),9) occurs(action(("drop","hoist0","crate3","pallet7","depot0")),10) occurs(action(("drive","truck1","depot0","distributor0")),10) occurs(action(("drive","truck0","distributor1","depot0")),10)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.704s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.680s
Choices : 99 (Domain: 89)
Conflicts : 6 (Analyzed: 6)
Restarts : 0
Model-Level : 94.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 6 (Deleted: 0)
Binary : 1 (Ratio: 16.67%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 6 (Average Length: 30.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 6 (Average: 8.83 Max: 17 Sum: 53)
Executed : 3 (Average: 2.83 Max: 17 Sum: 17 Ratio: 32.08%)
Bounded : 3 (Average: 12.00 Max: 12 Sum: 36 Ratio: 67.92%)
Rules : 26727
Atoms : 26727
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 13068 (Eliminated: 0 Frozen: 1936)
Constraints : 84706 (Binary: 96.1% Ternary: 2.0% Other: 1.9%)
Memory Peak : 95MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1