182 lines
7.5 KiB
Plaintext
182 lines
7.5 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-2.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-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.035s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Generated 46 rules.
|
||
|
|
Computing model... [0.510s CPU, 0.516s wall-clock]
|
||
|
|
5240 relevant atoms
|
||
|
|
2298 auxiliary atoms
|
||
|
|
7538 final queue length
|
||
|
|
15595 total queue pushes
|
||
|
|
Completing instantiation... [1.350s CPU, 1.352s wall-clock]
|
||
|
|
Instantiating: [1.930s CPU, 1.937s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.009s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
1 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Computing fact groups: [0.070s CPU, 0.067s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.060s CPU, 0.063s wall-clock]
|
||
|
|
Translating task: [1.160s CPU, 1.161s wall-clock]
|
||
|
|
360 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
103 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.540s CPU, 0.540s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
20 of 20 variables necessary.
|
||
|
|
1 of 20 mutex groups necessary.
|
||
|
|
4140 of 4140 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.170s CPU, 0.172s wall-clock]
|
||
|
|
Translator variables: 20
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 424
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 1
|
||
|
|
Translator total mutex groups size: 11
|
||
|
|
Translator operators: 4140
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 24548
|
||
|
|
Translator peak memory: 49240 KB
|
||
|
|
Writing output... [0.390s CPU, 0.421s wall-clock]
|
||
|
|
Done! [4.360s CPU, 4.395s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.80s
|
||
|
|
Memory: 103MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 103MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.42s
|
||
|
|
Memory: 104MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 113MB (+9MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.64s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.45s
|
||
|
|
Memory: 125MB (+12MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 137MB (+12MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.71s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
|
||
|
|
Grounded Until: 10
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.67s
|
||
|
|
Memory: 144MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.08s
|
||
|
|
Memory: 155MB (+11MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.03s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
|
||
|
|
Grounded Until: 15
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.76s
|
||
|
|
Memory: 176MB (+21MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.63s
|
||
|
|
Memory: 190MB (+14MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.67s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100]
|
||
|
|
Grounded Until: 20
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.67s
|
||
|
|
Memory: 203MB (+13MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("pickup","node5-5","key4")),1) occurs(action(("move","node5-5","node4-5")),2) occurs(action(("move","node4-5","node3-5")),3) occurs(action(("unlock","node3-5","node3-4","key4","triangle")),4) occurs(action(("move","node3-5","node3-4")),5) occurs(action(("unlock","node3-4","node3-3","key4","triangle")),6) occurs(action(("move","node3-4","node3-3")),7) occurs(action(("unlock","node3-3","node3-2","key4","triangle")),8) occurs(action(("unlock","node3-3","node4-3","key4","triangle")),8) occurs(action(("move","node3-3","node4-3")),9) occurs(action(("pickup-and-loose","node4-3","key8","key4")),10) occurs(action(("move","node4-3","node3-3")),11) occurs(action(("move","node3-3","node3-2")),12) occurs(action(("putdown","node3-2","key8")),13) occurs(action(("move","node3-2","node2-2")),14) occurs(action(("move","node2-2","node1-2")),15) occurs(action(("move","node1-2","node0-2")),16) occurs(action(("move","node0-2","node0-1")),17) occurs(action(("move","node0-1","node0-0")),18) occurs(action(("pickup","node0-0","key0")),19) occurs(action(("move","node0-0","node1-0")),20) occurs(action(("move","node1-0","node2-0")),21) occurs(action(("move","node2-0","node3-0")),22) occurs(action(("move","node3-0","node4-0")),23) occurs(action(("move","node4-0","node4-1")),24) occurs(action(("putdown","node4-1","key0")),25)
|
||
|
|
Solving Time: 13.86s
|
||
|
|
Memory: 224MB (+21MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 6
|
||
|
|
Time : 19.678s (Solving: 14.49s 1st Model: 13.82s Unsat: 0.66s)
|
||
|
|
CPU Time : 19.630s
|
||
|
|
|
||
|
|
Choices : 14378
|
||
|
|
Conflicts : 8249 (Analyzed: 8247)
|
||
|
|
Restarts : 96 (Average: 85.91 Last: 60)
|
||
|
|
Model-Level : 37.0
|
||
|
|
Problems : 6 (Average Length: 14.50 Splits: 0)
|
||
|
|
Lemmas : 8247 (Deleted: 4285)
|
||
|
|
Binary : 413 (Ratio: 5.01%)
|
||
|
|
Ternary : 291 (Ratio: 3.53%)
|
||
|
|
Conflict : 8247 (Average Length: 1250.7 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 8247 (Average: 2.31 Max: 57 Sum: 19012)
|
||
|
|
Executed : 7971 (Average: 1.73 Max: 57 Sum: 14235 Ratio: 74.87%)
|
||
|
|
Bounded : 276 (Average: 17.31 Max: 27 Sum: 4777 Ratio: 25.13%)
|
||
|
|
|
||
|
|
Rules : 82403
|
||
|
|
Atoms : 82403
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 116751 (Eliminated: 0 Frozen: 103849)
|
||
|
|
Constraints : 789258 (Binary: 98.0% Ternary: 1.0% Other: 1.0%)
|
||
|
|
|
||
|
|
Memory Peak : 224MB
|
||
|
|
Max. Length : 25 steps
|
||
|
|
Sol. Length : 25 steps
|
||
|
|
|
||
|
|
|