1
0
Fork 0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2000_freecell-strips-ty...

162 lines
7.5 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-17.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-17.pddl
Parsing...
Parsing: [0.030s CPU, 0.035s wall-clock]
Normalizing task... [0.000s CPU, 0.003s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.050s CPU, 0.046s wall-clock]
Preparing model... [0.020s CPU, 0.027s wall-clock]
Generated 125 rules.
Computing model... [1.220s CPU, 1.218s wall-clock]
9788 relevant atoms
2225 auxiliary atoms
12013 final queue length
42437 total queue pushes
Completing instantiation... [4.650s CPU, 4.659s wall-clock]
Instantiating: [5.970s CPU, 5.971s wall-clock]
Computing fact groups...
Finding invariants...
15 initial candidates
Finding invariants: [0.180s CPU, 0.178s wall-clock]
Checking invariant weight... [0.000s CPU, 0.008s wall-clock]
Instantiating groups... [0.060s CPU, 0.050s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
20 uncovered facts
Choosing groups: [0.020s CPU, 0.009s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.260s CPU, 0.261s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s 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.010s CPU, 0.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.010s CPU, 0.000s wall-clock]
Processing axioms: [0.200s CPU, 0.196s wall-clock]
Translating task: [4.190s CPU, 4.186s wall-clock]
4088 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [2.050s CPU, 2.053s wall-clock]
Reordering and filtering variables...
46 of 46 variables necessary.
44 of 82 mutex groups necessary.
9379 of 9379 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.780s CPU, 0.781s wall-clock]
Translator variables: 46
Translator derived variables: 0
Translator facts: 197
Translator goal facts: 4
Translator mutex groups: 44
Translator total mutex groups size: 200
Translator operators: 9379
Translator axioms: 0
Translator task size: 77260
Translator peak memory: 83964 KB
Writing output... [1.230s CPU, 1.307s wall-clock]
Done! [14.690s CPU, 14.776s wall-clock]
planner.py version 0.0.1
Time: 3.18s
Memory: 262MB
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: 262MB (+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.10s
Memory: 262MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 270MB (+8MB)
UNSAT
Iteration Time: 1.69s
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.23s
Memory: 283MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.15s
Memory: 306MB (+23MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 3.43s
Memory: 308MB (+2MB)
Solving...
Solving Time: 1.60s
Memory: 308MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 308MB (+0MB)
Answer: 2
occurs(action(("sendtohome","ca","d5","c","n1","c0","n0")),1) occurs(action(("sendtonewcol","s5","da","n1","n0")),1) occurs(action(("sendtofree","h4","s4","n4","n3")),1) occurs(action(("sendtohome","sa","h3","s","n1","s0","n0")),1) occurs(action(("sendtofree","d3","s2","n3","n2")),2) occurs(action(("sendtohome-b","da","d","n1","d0","n0","n0","n1")),2) occurs(action(("move","s4","c2","d5")),2) occurs(action(("sendtofree","h5","s3","n2","n1")),3) occurs(action(("sendtohome-b","c2","c","n2","ca","n1","n1","n2")),3) occurs(action(("sendtohome","s2","c3","s","n2","sa","n1")),3) occurs(action(("move","h3","ha","s4")),3) occurs(action(("sendtofree","h3","s4","n1","n0")),4) occurs(action(("sendtohome-b","c3","c","n3","c2","n2","n2","n3")),4) occurs(action(("sendtohome","s3","c4","s","n3","s2","n2")),4) occurs(action(("sendtohome","ha","d4","h","n1","h0","n0")),4) occurs(action(("sendtohome","h2","c5","h","n2","ha","n1")),5) occurs(action(("sendtohome-b","c4","c","n4","c3","n3","n3","n4")),5) occurs(action(("sendtohome","s4","d5","s","n4","s3","n3")),5) occurs(action(("colfromfreecell","h4","s5","n0","n1")),5) occurs(action(("sendtohome-b","c5","c","n5","c4","n4","n4","n5")),6) occurs(action(("sendtofree","d5","d2","n1","n0")),6) occurs(action(("homefromfreecell","h3","h","n3","h2","n2","n0","n1")),7) occurs(action(("sendtohome-b","d2","d","n2","da","n1","n5","n6")),7) occurs(action(("homefromfreecell","d3","d","n3","d2","n2","n1","n2")),8) occurs(action(("sendtohome","h4","s5","h","n4","h3","n3")),8) occurs(action(("homefromfreecell","h5","h","n5","h4","n4","n2","n3")),9) occurs(action(("sendtohome-b","d4","d","n4","d3","n3","n6","n7")),9) occurs(action(("homefromfreecell","d5","d","n5","d4","n4","n3","n4")),10) occurs(action(("sendtohome-b","s5","s","n5","s4","n4","n7","n8")),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 9.393s (Solving: 1.57s 1st Model: 1.56s Unsat: 0.00s)
CPU Time : 9.248s
Choices : 12100 (Domain: 11949)
Conflicts : 3039 (Analyzed: 3039)
Restarts : 26 (Average: 116.88 Last: 102)
Model-Level : 70.0
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 3039 (Deleted: 1000)
Binary : 34 (Ratio: 1.12%)
Ternary : 66 (Ratio: 2.17%)
Conflict : 3039 (Average Length: 1267.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3039 (Average: 3.64 Max: 64 Sum: 11057)
Executed : 3035 (Average: 3.62 Max: 64 Sum: 11009 Ratio: 99.57%)
Bounded : 4 (Average: 12.00 Max: 12 Sum: 48 Ratio: 0.43%)
Rules : 363597 (Original: 363511)
Atoms : 259903
Bodies : 35453 (Original: 35372)
Count : 391 (Original: 405)
Equivalences : 30913 (Atom=Atom: 16 Body=Body: 0 Other: 30897)
Tight : Yes
Variables : 83162 (Eliminated: 0 Frozen: 31665)
Constraints : 496410 (Binary: 99.2% Ternary: 0.3% Other: 0.5%)
Memory Peak : 439MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2