147 lines
6.8 KiB
Plaintext
147 lines
6.8 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/instances/instance-14.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-2000/domains/freecell-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/instances/instance-14.pddl
|
|
Parsing...
|
|
Parsing: [0.050s CPU, 0.047s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.004s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.060s CPU, 0.056s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.029s wall-clock]
|
|
Generated 125 rules.
|
|
Computing model... [0.900s CPU, 0.902s wall-clock]
|
|
7720 relevant atoms
|
|
1817 auxiliary atoms
|
|
9537 final queue length
|
|
33517 total queue pushes
|
|
Completing instantiation... [3.290s CPU, 3.282s wall-clock]
|
|
Instantiating: [4.290s CPU, 4.291s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
15 initial candidates
|
|
Finding invariants: [0.150s CPU, 0.144s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.006s wall-clock]
|
|
Instantiating groups... [0.030s CPU, 0.032s wall-clock]
|
|
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
16 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.006s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.200s CPU, 0.201s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Building mutex information...
|
|
not in strips_to_sas, left out: Atom bottomcol(c0)
|
|
not in strips_to_sas, left out: Atom bottomcol(d0)
|
|
not in strips_to_sas, left out: Atom bottomcol(h0)
|
|
not in strips_to_sas, left out: Atom bottomcol(s0)
|
|
Building mutex information: [0.000s CPU, 0.005s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.150s CPU, 0.143s wall-clock]
|
|
Translating task: [2.960s CPU, 2.954s wall-clock]
|
|
3242 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
14 propositions removed
|
|
Detecting unreachable propositions: [1.470s CPU, 1.467s wall-clock]
|
|
Reordering and filtering variables...
|
|
38 of 38 variables necessary.
|
|
36 of 66 mutex groups necessary.
|
|
7375 of 7375 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.540s CPU, 0.547s wall-clock]
|
|
Translator variables: 38
|
|
Translator derived variables: 0
|
|
Translator facts: 161
|
|
Translator goal facts: 4
|
|
Translator mutex groups: 36
|
|
Translator total mutex groups size: 156
|
|
Translator operators: 7375
|
|
Translator axioms: 0
|
|
Translator task size: 60910
|
|
Translator peak memory: 70396 KB
|
|
Writing output... [0.900s CPU, 0.978s wall-clock]
|
|
Done! [10.550s CPU, 10.621s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 2.17s
|
|
Memory: 206MB
|
|
|
|
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.01s
|
|
Memory: 206MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.01s
|
|
|
|
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: 1.21s
|
|
Memory: 206MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.12s
|
|
Memory: 212MB (+6MB)
|
|
UNSAT
|
|
Iteration Time: 1.73s
|
|
|
|
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: 1.19s
|
|
Memory: 233MB (+21MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("sendtonewcol","h2","c4","n1","n0")),1) occurs(action(("sendtofree","s4","sa","n4","n3")),1) occurs(action(("sendtohome","da","d2","d","n1","d0","n0")),1) occurs(action(("move","c3","s3","h4")),1) occurs(action(("sendtofree","c4","s2","n3","n2")),2) occurs(action(("sendtohome-b","ca","c","n1","c0","n0","n0","n1")),2) occurs(action(("sendtohome","d2","h3","d","n2","da","n1")),2) occurs(action(("sendtohome","sa","d3","s","n1","s0","n0")),2) occurs(action(("sendtofree","c3","h4","n2","n1")),3) occurs(action(("sendtohome-b","s2","s","n2","sa","n1","n1","n2")),3) occurs(action(("sendtohome-b","s3","s","n3","s2","n2","n2","n3")),4) occurs(action(("sendtofree","h4","ha","n1","n0")),4) occurs(action(("homefromfreecell","s4","s","n4","s3","n3","n0","n1")),5) occurs(action(("sendtohome-b","ha","h","n1","h0","n0","n3","n4")),5) occurs(action(("sendtofree","h3","d4","n1","n0")),6) occurs(action(("sendtohome-b","h2","h","n2","ha","n1","n4","n5")),6) occurs(action(("homefromfreecell","h3","h","n3","h2","n2","n0","n1")),7) occurs(action(("sendtohome-b","c2","c","n2","ca","n1","n5","n6")),7) occurs(action(("homefromfreecell","h4","h","n4","h3","n3","n1","n2")),8) occurs(action(("sendtohome-b","d3","d","n3","d2","n2","n6","n7")),8) occurs(action(("sendtohome-b","d4","d","n4","d3","n3","n7","n8")),9) occurs(action(("homefromfreecell","c3","c","n3","c2","n2","n2","n3")),9) occurs(action(("homefromfreecell","c4","c","n4","c3","n3","n3","n4")),10)
|
|
Solving Time: 0.17s
|
|
Memory: 251MB (+18MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 5.785s (Solving: 0.10s 1st Model: 0.08s Unsat: 0.01s)
|
|
CPU Time : 5.640s
|
|
|
|
Choices : 1429 (Domain: 1408)
|
|
Conflicts : 289 (Analyzed: 288)
|
|
Restarts : 2 (Average: 144.00 Last: 47)
|
|
Model-Level : 66.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 288 (Deleted: 0)
|
|
Binary : 14 (Ratio: 4.86%)
|
|
Ternary : 7 (Ratio: 2.43%)
|
|
Conflict : 288 (Average Length: 789.7 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 288 (Average: 4.61 Max: 43 Sum: 1329)
|
|
Executed : 284 (Average: 4.60 Max: 43 Sum: 1325 Ratio: 99.70%)
|
|
Bounded : 4 (Average: 1.00 Max: 1 Sum: 4 Ratio: 0.30%)
|
|
|
|
Rules : 204161
|
|
Atoms : 204161
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 65878 (Eliminated: 0 Frozen: 60181)
|
|
Constraints : 439178 (Binary: 99.3% Ternary: 0.3% Other: 0.4%)
|
|
|
|
Memory Peak : 251MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|