156 lines
6.4 KiB
Plaintext
156 lines
6.4 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.030s CPU, 0.028s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Generated 46 rules.
|
||
|
|
Computing model... [0.330s CPU, 0.323s wall-clock]
|
||
|
|
3114 relevant atoms
|
||
|
|
1522 auxiliary atoms
|
||
|
|
4636 final queue length
|
||
|
|
9238 total queue pushes
|
||
|
|
Completing instantiation... [0.790s CPU, 0.789s wall-clock]
|
||
|
|
Instantiating: [1.170s CPU, 1.170s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.010s CPU, 0.014s 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.000s CPU, 0.007s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Computing fact groups: [0.050s CPU, 0.047s 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.630s CPU, 0.634s 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.312s 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.098s 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.220s CPU, 0.242s wall-clock]
|
||
|
|
Done! [2.540s CPU, 2.568s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 16.87s
|
||
|
|
Memory: 825MB
|
||
|
|
|
||
|
|
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.10s
|
||
|
|
Memory: 825MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.10s
|
||
|
|
|
||
|
|
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.35s
|
||
|
|
Memory: 841MB (+16MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 848MB (+7MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.59s
|
||
|
|
|
||
|
|
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.34s
|
||
|
|
Memory: 854MB (+6MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 867MB (+13MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.60s
|
||
|
|
|
||
|
|
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.35s
|
||
|
|
Memory: 869MB (+2MB)
|
||
|
|
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","node1-2")),3) occurs(action(("move","node1-2","node0-2")),4) occurs(action(("putdown","node1-2","key1")),4) occurs(action(("pickup","node0-2","key3")),5) occurs(action(("move","node0-2","node1-2")),5) occurs(action(("move","node1-2","node1-3")),6) occurs(action(("unlock","node1-3","node2-3","key3","square")),7) occurs(action(("move","node1-3","node2-3")),8) occurs(action(("putdown","node1-3","key3")),8) occurs(action(("pickup","node2-3","key0")),9) occurs(action(("move","node2-3","node2-4")),10) occurs(action(("move","node2-4","node1-4")),11) occurs(action(("move","node1-4","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.08s
|
||
|
|
Memory: 893MB (+24MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 18.836s (Solving: 0.05s 1st Model: 0.05s Unsat: 0.00s)
|
||
|
|
CPU Time : 18.810s
|
||
|
|
|
||
|
|
Choices : 620
|
||
|
|
Conflicts : 264 (Analyzed: 263)
|
||
|
|
Restarts : 2 (Average: 131.50 Last: 78)
|
||
|
|
Model-Level : 42.0
|
||
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||
|
|
Lemmas : 263 (Deleted: 0)
|
||
|
|
Binary : 39 (Ratio: 14.83%)
|
||
|
|
Ternary : 20 (Ratio: 7.60%)
|
||
|
|
Conflict : 263 (Average Length: 365.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 263 (Average: 3.22 Max: 37 Sum: 846)
|
||
|
|
Executed : 246 (Average: 2.26 Max: 37 Sum: 594 Ratio: 70.21%)
|
||
|
|
Bounded : 17 (Average: 14.82 Max: 17 Sum: 252 Ratio: 29.79%)
|
||
|
|
|
||
|
|
Rules : 8432579
|
||
|
|
Atoms : 8432579
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 38571 (Eliminated: 0 Frozen: 30880)
|
||
|
|
Constraints : 125349 (Binary: 96.9% Ternary: 1.5% Other: 1.6%)
|
||
|
|
|
||
|
|
Memory Peak : 893MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
|
||
|
|
|