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

135 lines
5.8 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-1.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-1.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.028s wall-clock]
Preparing model... [0.020s CPU, 0.012s wall-clock]
Generated 43 rules.
Computing model... [0.040s CPU, 0.042s wall-clock]
194 relevant atoms
216 auxiliary atoms
410 final queue length
568 total queue pushes
Completing instantiation... [0.040s CPU, 0.037s wall-clock]
Instantiating: [0.130s CPU, 0.126s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.046s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
14 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.060s CPU, 0.063s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.002s wall-clock]
Translating task: [0.030s CPU, 0.031s wall-clock]
72 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
18 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.017s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
10 of 14 mutex groups necessary.
72 of 72 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 48
Translator goal facts: 2
Translator mutex groups: 10
Translator total mutex groups size: 48
Translator operators: 72
Translator axioms: 0
Translator task size: 622
Translator peak memory: 36556 KB
Writing output... [0.010s CPU, 0.014s wall-clock]
Done! [0.280s CPU, 0.287s wall-clock]
planner.py version 0.0.1
Time: 0.03s
Memory: 50MB
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: 50MB (+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.01s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.02s
Memory: 51MB (+0MB)
Answer: 1
occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),1) occurs(action(("drive","truck1","depot0","distributor0")),1) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("drive","truck0","distributor1","depot0")),1) occurs(action(("load","hoist0","crate1","truck0","depot0")),2) occurs(action(("drive","truck0","depot0","distributor0")),2) occurs(action(("load","hoist1","crate0","truck1","distributor0")),2) occurs(action(("drive","truck1","distributor0","distributor1")),2) occurs(action(("unload","hoist1","crate1","truck0","distributor0")),3) occurs(action(("unload","hoist2","crate0","truck1","distributor1")),3) occurs(action(("drive","truck0","distributor0","depot0")),3) occurs(action(("drive","truck1","distributor1","depot0")),3) occurs(action(("drop","hoist1","crate1","pallet1","distributor0")),4) occurs(action(("drop","hoist2","crate0","pallet2","distributor1")),4) occurs(action(("drive","truck1","depot0","distributor1")),5)
SATISFIABLE
Models : 1+
Calls : 2
Time : 0.051s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.044s
Choices : 17 (Domain: 13)
Conflicts : 0 (Analyzed: 0)
Restarts : 0
Model-Level : 24.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 0 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
Rules : 1897
Atoms : 1897
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 781 (Eliminated: 0 Frozen: 124)
Constraints : 2223 (Binary: 86.8% Ternary: 8.9% Other: 4.3%)
Memory Peak : 52MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 1