239 lines
9.0 KiB
Plaintext
239 lines
9.0 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.034s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.028s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.028s wall-clock]
|
|
Generated 46 rules.
|
|
Computing model... [0.570s CPU, 0.570s wall-clock]
|
|
5240 relevant atoms
|
|
2298 auxiliary atoms
|
|
7538 final queue length
|
|
15595 total queue pushes
|
|
Completing instantiation... [1.500s CPU, 1.507s wall-clock]
|
|
Instantiating: [2.160s CPU, 2.150s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.010s CPU, 0.018s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.010s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
|
Choosing groups...
|
|
1 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.009s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.006s wall-clock]
|
|
Computing fact groups: [0.070s CPU, 0.070s 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.070s CPU, 0.072s wall-clock]
|
|
Translating task: [1.300s CPU, 1.306s 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.600s CPU, 0.598s 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.190s CPU, 0.194s 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: 52428 KB
|
|
Writing output... [0.420s CPU, 0.458s wall-clock]
|
|
Done! [4.840s CPU, 4.876s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 23.49s
|
|
Memory: 1248MB
|
|
|
|
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: 1248MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.11s
|
|
|
|
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
|
|
Expected Memory: 1248MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 29.40s
|
|
Memory: 3776MB (+2528MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 3.57s
|
|
Memory: 3981MB (+205MB)
|
|
UNSAT
|
|
Iteration Time: 75.90s
|
|
|
|
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
|
|
Expected Memory: 6714.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 34.01s
|
|
Memory: 5215MB (+1234MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 13.11s
|
|
Memory: 5410MB (+195MB)
|
|
UNSAT
|
|
Iteration Time: 131.45s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 8143.0MB
|
|
Skipping: not enough memory for grounding...
|
|
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 10876.0MB
|
|
Skipping: not enough memory for grounding...
|
|
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 6
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 13609.0MB
|
|
Skipping: not enough memory for grounding...
|
|
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 7
|
|
Queue: [(6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 16342.0MB
|
|
Skipping: not enough memory for grounding...
|
|
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 8
|
|
Queue: [(3,15,0,True)]
|
|
Grounded Until: 10
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 46.28s
|
|
Memory: 7038MB (+1628MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 40.01s
|
|
Memory: 7242MB (+204MB)
|
|
UNSAT
|
|
Iteration Time: 142.29s
|
|
|
|
Iteration 9
|
|
Queue: [(4,20,0,True)]
|
|
Grounded Until: 15
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 26.65s
|
|
Memory: 8071MB (+829MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 41.91s
|
|
Memory: 8285MB (+214MB)
|
|
UNKNOWN
|
|
Iteration Time: 112.65s
|
|
|
|
Iteration 10
|
|
Queue: [(4,20,1,True)]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Solving Time: 49.18s
|
|
Memory: 8288MB (+3MB)
|
|
UNKNOWN
|
|
Iteration Time: 49.18s
|
|
|
|
Iteration 11
|
|
Queue: [(4,20,2,True)]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Solving Time: 52.54s
|
|
Memory: 8288MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 52.54s
|
|
|
|
Iteration 12
|
|
Queue: [(4,20,3,True)]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Solving Time: 56.22s
|
|
Memory: 8288MB (+0MB)
|
|
UNKNOWN
|
|
Iteration Time: 56.22s
|
|
|
|
Iteration 13
|
|
Queue: [(4,20,4,True)]
|
|
Grounded Until: 20
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("move","node5-5","node5-4")),1) occurs(action(("pickup","node5-5","key4")),1) occurs(action(("move","node5-4","node5-3")),2) occurs(action(("unlock","node5-4","node5-3","key4","triangle")),2) occurs(action(("pickup-and-loose","node4-3","key8","key4")),3) occurs(action(("move","node5-3","node4-3")),3) occurs(action(("unlock","node5-3","node4-3","key4","triangle")),3) occurs(action(("unlock","node5-3","node5-2","key4","triangle")),3) occurs(action(("unlock","node4-3","node4-2","key4","triangle")),3) occurs(action(("putdown","node4-2","key8")),4) occurs(action(("move","node4-3","node4-2")),4) occurs(action(("move","node4-2","node4-3")),5) occurs(action(("pickup","node4-3","key4")),5) occurs(action(("unlock","node4-2","node3-2","key4","triangle")),6) occurs(action(("move","node4-3","node4-2")),6) occurs(action(("unlock","node4-3","node3-3","key4","triangle")),6) occurs(action(("pickup-and-loose","node4-2","key8","key4")),7) occurs(action(("move","node4-2","node3-2")),7) occurs(action(("putdown","node3-2","key8")),8) occurs(action(("move","node3-2","node3-1")),8) occurs(action(("move","node3-1","node3-0")),9) occurs(action(("move","node3-0","node2-0")),10) occurs(action(("move","node2-0","node1-0")),11) occurs(action(("pickup","node0-0","key0")),12) occurs(action(("move","node1-0","node0-0")),12) occurs(action(("move","node0-0","node0-1")),13) occurs(action(("move","node0-1","node0-2")),14) occurs(action(("putdown","node1-2","key0")),15) occurs(action(("move","node0-2","node1-2")),15) occurs(action(("pickup","node1-2","key0")),16) occurs(action(("move","node1-2","node2-2")),16) occurs(action(("move","node2-2","node3-2")),17) occurs(action(("pickup-and-loose","node4-2","key5","key0")),18) occurs(action(("move","node3-2","node4-2")),18) occurs(action(("pickup-and-loose","node4-2","key0","key5")),19) occurs(action(("putdown","node4-1","key0")),20) occurs(action(("move","node4-2","node4-1")),20)
|
|
Solving Time: 6.08s
|
|
Memory: 8288MB (+0MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 9
|
|
Time : 649.664s (Solving: 252.94s 1st Model: 5.89s Unsat: 50.23s)
|
|
CPU Time : 649.912s
|
|
|
|
Choices : 115282
|
|
Conflicts : 52619 (Analyzed: 52616)
|
|
Restarts : 548 (Average: 96.01 Last: 138)
|
|
Model-Level : 59.0
|
|
Problems : 9 (Average Length: 16.44 Splits: 0)
|
|
Lemmas : 71866 (Deleted: 43155)
|
|
Binary : 5140 (Ratio: 7.15%)
|
|
Ternary : 2042 (Ratio: 2.84%)
|
|
Conflict : 52616 (Average Length: 335.3 Ratio: 73.21%)
|
|
Loop : 19250 (Average Length: 94.7 Ratio: 26.79%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 52616 (Average: 2.50 Max: 81 Sum: 131743)
|
|
Executed : 51618 (Average: 2.14 Max: 81 Sum: 112525 Ratio: 85.41%)
|
|
Bounded : 998 (Average: 19.26 Max: 22 Sum: 19218 Ratio: 14.59%)
|
|
|
|
Rules : 10002204
|
|
Atoms : 10002204
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 535806 (Eliminated: 0 Frozen: 510979)
|
|
Constraints : 1046723 (Binary: 87.1% Ternary: 7.0% Other: 5.9%)
|
|
|
|
Memory Peak : 8377MB
|
|
Max. Length : 20 steps
|
|
Sol. Length : 20 steps
|
|
|
|
|