1
0
Fork 0
tplp-planning-benchmark/fd-pb-es/ipc-1998_grid-round-2-strip...

156 lines
6.2 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.020s CPU, 0.025s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.020s CPU, 0.020s wall-clock]
Generated 46 rules.
Computing model... [0.320s CPU, 0.322s wall-clock]
3114 relevant atoms
1522 auxiliary atoms
4636 final queue length
9238 total queue pushes
Completing instantiation... [0.800s CPU, 0.798s wall-clock]
Instantiating: [1.170s CPU, 1.174s 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.010s 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.050s CPU, 0.046s wall-clock]
Building STRIPS to SAS dictionary... [0.000s 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.037s 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.110s 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.256s wall-clock]
Done! [2.550s CPU, 2.586s wall-clock]
planner.py version 0.0.1
Time: 0.46s
Memory: 78MB
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: 78MB (+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.18s
Memory: 78MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 82MB (+4MB)
UNSAT
Iteration Time: 0.27s
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.17s
Memory: 87MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 94MB (+7MB)
UNSAT
Iteration Time: 0.28s
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: 0.18s
Memory: 98MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("move","node2-4","node1-4")),1) occurs(action(("move","node1-4","node0-4")),2) occurs(action(("move","node0-4","node0-3")),3) occurs(action(("move","node0-3","node0-2")),4) occurs(action(("pickup","node0-2","key3")),5) occurs(action(("move","node0-2","node0-3")),6) occurs(action(("move","node0-3","node1-3")),7) occurs(action(("unlock","node1-3","node2-3","key3","square")),8) occurs(action(("move","node1-3","node2-3")),9) occurs(action(("pickup-and-loose","node2-3","key0","key3")),10) occurs(action(("move","node2-3","node1-3")),11) occurs(action(("move","node1-3","node1-2")),12) occurs(action(("move","node1-2","node1-1")),13) occurs(action(("putdown","node1-1","key0")),14) occurs(action(("move","node1-1","node2-1")),15)
Solving Time: 0.10s
Memory: 105MB (+7MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 1.423s (Solving: 0.10s 1st Model: 0.09s Unsat: 0.00s)
CPU Time : 1.380s
Choices : 956
Conflicts : 491 (Analyzed: 490)
Restarts : 6 (Average: 81.67 Last: 32)
Model-Level : 28.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 490 (Deleted: 0)
Binary : 76 (Ratio: 15.51%)
Ternary : 41 (Ratio: 8.37%)
Conflict : 490 (Average Length: 476.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 490 (Average: 2.29 Max: 25 Sum: 1124)
Executed : 471 (Average: 1.91 Max: 25 Sum: 938 Ratio: 83.45%)
Bounded : 19 (Average: 9.79 Max: 17 Sum: 186 Ratio: 16.55%)
Rules : 43020
Atoms : 43020
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 38571 (Eliminated: 0 Frozen: 34027)
Constraints : 125365 (Binary: 96.9% Ternary: 1.5% Other: 1.6%)
Memory Peak : 105MB
Max. Length : 15 steps
Sol. Length : 15 steps