1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2002_depots-strips-automatic_3.out

148 lines
7.5 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-3.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-3.pddl
Parsing...
Parsing: [0.030s CPU, 0.026s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 43 rules.
Computing model... [0.110s CPU, 0.112s wall-clock]
582 relevant atoms
540 auxiliary atoms
1122 final queue length
1976 total queue pushes
Completing instantiation... [0.150s CPU, 0.148s wall-clock]
Instantiating: [0.310s CPU, 0.316s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.048s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.021s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
18 uncovered facts
Choosing groups: [0.000s CPU, 0.005s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.090s CPU, 0.087s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.008s wall-clock]
Translating task: [0.160s CPU, 0.160s wall-clock]
432 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
26 propositions removed
Detecting unreachable propositions: [0.080s CPU, 0.080s wall-clock]
Reordering and filtering variables...
26 of 26 variables necessary.
18 of 26 mutex groups necessary.
336 of 336 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.043s wall-clock]
Translator variables: 26
Translator derived variables: 0
Translator facts: 132
Translator goal facts: 6
Translator mutex groups: 18
Translator total mutex groups size: 156
Translator operators: 336
Translator axioms: 0
Translator task size: 3146
Translator peak memory: 38092 KB
Writing output... [0.050s CPU, 0.057s wall-clock]
Done! [0.780s CPU, 0.785s wall-clock]
planner.py version 0.0.1
Time: 0.13s
Memory: 56MB
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: 57MB (+1MB)
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.04s
Memory: 57MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 58MB (+1MB)
UNSAT
Iteration Time: 0.05s
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.05s
Memory: 60MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 61MB (+1MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.10s
Memory: 61MB (+0MB)
Answer: 1
occurs(action(("lift","hoist2","crate5","crate2","distributor1")),1) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),1) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("drive","truck0","depot0","distributor0")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("load","hoist2","crate5","truck1","distributor1")),2) occurs(action(("load","hoist1","crate4","truck0","distributor0")),2) occurs(action(("drive","truck0","distributor0","depot0")),2) occurs(action(("drive","truck1","distributor1","distributor0")),2) occurs(action(("lift","hoist1","crate3","crate0","distributor0")),3) occurs(action(("lift","hoist2","crate2","pallet2","distributor1")),3) occurs(action(("load","hoist0","crate1","truck0","depot0")),3) occurs(action(("drive","truck0","depot0","distributor1")),3) occurs(action(("load","hoist1","crate3","truck1","distributor0")),4) occurs(action(("load","hoist2","crate2","truck0","distributor1")),4) occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),5) occurs(action(("unload","hoist2","crate1","truck0","distributor1")),5) occurs(action(("drive","truck0","distributor1","depot0")),5) occurs(action(("drop","hoist2","crate1","pallet2","distributor1")),6) occurs(action(("unload","hoist0","crate2","truck0","depot0")),6) occurs(action(("drive","truck0","depot0","distributor0")),6) occurs(action(("load","hoist1","crate0","truck1","distributor0")),6) occurs(action(("drive","truck1","distributor0","distributor1")),6) occurs(action(("drop","hoist0","crate2","pallet0","depot0")),7) occurs(action(("unload","hoist1","crate4","truck0","distributor0")),7) occurs(action(("unload","hoist2","crate0","truck1","distributor1")),7) occurs(action(("drive","truck1","distributor1","depot0")),7) occurs(action(("drive","truck0","distributor0","distributor1")),7) occurs(action(("drop","hoist1","crate4","pallet1","distributor0")),8) occurs(action(("drop","hoist2","crate0","crate1","distributor1")),8) occurs(action(("unload","hoist0","crate3","truck1","depot0")),8) occurs(action(("drive","truck1","depot0","distributor1")),8) occurs(action(("drop","hoist0","crate3","crate2","depot0")),9) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),9) occurs(action(("drop","hoist2","crate5","crate0","distributor1")),10)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.251s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.244s
Choices : 98 (Domain: 94)
Conflicts : 22 (Analyzed: 21)
Restarts : 0
Model-Level : 42.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 21 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 3 (Ratio: 14.29%)
Conflict : 21 (Average Length: 16.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 21 (Average: 5.52 Max: 29 Sum: 116)
Executed : 17 (Average: 3.24 Max: 29 Sum: 68 Ratio: 58.62%)
Bounded : 4 (Average: 12.00 Max: 12 Sum: 48 Ratio: 41.38%)
Rules : 9341
Atoms : 9341
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 5616 (Eliminated: 0 Frozen: 1046)
Constraints : 30027 (Binary: 93.2% Ternary: 3.5% Other: 3.3%)
Memory Peak : 65MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1