1
0
tplp-planning-benchmark/fd-ps-e1-sh/ipc-1998_grid-round-2-strips_1.out

156 lines
5.9 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.pddl
Parsing...
Parsing: [0.010s CPU, 0.021s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.020s CPU, 0.017s wall-clock]
Generated 46 rules.
Computing model... [0.300s CPU, 0.309s wall-clock]
3114 relevant atoms
1522 auxiliary atoms
4636 final queue length
9238 total queue pushes
Completing instantiation... [0.800s CPU, 0.790s wall-clock]
Instantiating: [1.140s CPU, 1.146s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.015s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.000s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.040s CPU, 0.046s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.001s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.038s wall-clock]
Translating task: [0.640s CPU, 0.638s wall-clock]
225 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
69 propositions removed
Detecting unreachable propositions: [0.310s CPU, 0.311s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
1 of 19 mutex groups necessary.
2384 of 2384 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.101s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 277
Translator goal facts: 1
Translator mutex groups: 1
Translator total mutex groups size: 10
Translator operators: 2384
Translator axioms: 0
Translator task size: 14119
Translator peak memory: 42584 KB
Writing output... [0.230s CPU, 0.247s wall-clock]
Done! [2.520s CPU, 2.545s wall-clock]
planner.py version 0.0.1
Time: 0.48s
Memory: 78MB
Iteration 1
Queue: [0]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 78MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.23s
Memory: 80MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 86MB (+6MB)
UNSAT
Iteration Time: 0.34s
Iteration 3
Queue: [10]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.23s
Memory: 90MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 97MB (+7MB)
UNSAT
Iteration Time: 0.36s
Iteration 4
Queue: [15]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.28s
Memory: 106MB (+9MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("move","node2-4","node1-4")),1) occurs(action(("move","node1-4","node1-3")),2) occurs(action(("pickup","node1-3","key1")),3) occurs(action(("move","node1-3","node0-3")),4) occurs(action(("move","node0-3","node0-2")),5) occurs(action(("pickup-and-loose","node0-2","key3","key1")),6) occurs(action(("move","node0-2","node1-2")),7) occurs(action(("move","node1-2","node1-3")),8) occurs(action(("unlock","node1-3","node2-3","key3","square")),9) occurs(action(("move","node1-3","node2-3")),10) occurs(action(("pickup-and-loose","node2-3","key0","key3")),11) occurs(action(("move","node2-3","node1-3")),12) occurs(action(("move","node1-3","node1-2")),13) occurs(action(("move","node1-2","node1-1")),14) occurs(action(("putdown","node1-1","key0")),15)
Solving Time: 0.03s
Memory: 114MB (+8MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 1.638s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 1.620s
Choices : 164
Conflicts : 80 (Analyzed: 79)
Restarts : 0
Model-Level : 26.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 79 (Deleted: 0)
Binary : 10 (Ratio: 12.66%)
Ternary : 7 (Ratio: 8.86%)
Conflict : 79 (Average Length: 486.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 79 (Average: 2.95 Max: 24 Sum: 233)
Executed : 73 (Average: 1.96 Max: 24 Sum: 155 Ratio: 66.52%)
Bounded : 6 (Average: 13.00 Max: 17 Sum: 78 Ratio: 33.48%)
Rules : 47429
Atoms : 47429
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 39742 (Eliminated: 0 Frozen: 31872)
Constraints : 166030 (Binary: 97.3% Ternary: 1.3% Other: 1.4%)
Memory Peak : 114MB
Max. Length : 15 steps
Sol. Length : 15 steps