Madagascar 0.99999 25/02/2015 09:03:18 amd64 1-core
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/instances/instance-12.pddlignoring --stats
ignoring --verbose

Domain: freecell
Problem: freecell-4-2
Parser: 19000 ground actions and 585 state variables
Invariants: 0 1 2  0.04 secs
Goal: conjunctive
Simplified: 7347 ground actions and 128 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.29 secs (max SCC size 7297)
Plan type: E-step
Heuristic: VSIDS
				Allocated 32 MB permanent (total 215 MB)
Horizon 0: 128 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 152648 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 305168 variables
				Allocated 32 MB (total 520 MB)
Horizon 15: 457688 variables
Horizon 20: 610208 variables
Horizon 25: 762728 variables
Horizon 30: 915248 variables
Horizon 35: 1067768 variables
				Allocated 32 MB (total 1206 MB)
				Allocated 32 MB permanent (total 1402 MB)
Horizon 40: 1220288 variables
Horizon 45: 1372808 variables
				Allocated 32 MB (total 1608 MB)
Horizon 50: 1525328 variables
				Allocated 32 MB (total 1826 MB)
				Allocated 32 MB permanent (total 2054 MB)
Horizon 55: 1677848 variables
				Allocated 32 MB (total 2086 MB)
Horizon 60: 1830368 variables
SAT (142501 decisions 652 conflicts)
PLAN FOUND: 20 steps
STEP 0.0: move(s3,c4,h4) sendtofree(d3,s2,n4,n3) sendtohome(sa,h3,s,n1,s0,n0)
STEP 0.1: move-b(h2,s3,n1,n2)
STEP 0.2: move(ca,d2,h2)
STEP 1: sendtofree-b(d2,n3,n2,n2,n3) sendtohome(ca,h2,c,n1,c0,n0) sendtohome(s2,c3,s,n2,sa,n1)
STEP 2: move(h2,s3,c3) sendtofree-b(da,n2,n1,n3,n4)
STEP 3: sendtofree-b(c4,n1,n0,n4,n5) sendtohome(s3,h4,s,n3,s2,n2)
STEP 4: homefromfreecell(da,d,n1,d0,n0,n0,n1) sendtonewcol(h4,s4,n5,n4)
STEP 5: sendtofree(h2,c3,n1,n0) sendtohome(s4,c2,s,n4,s3,n3)
STEP 7: newcolfromfreecell(c4,n4,n3,n0,n1)
STEP 8: sendtofree-b(c4,n1,n0,n3,n4)
STEP 10: newcolfromfreecell(c4,n4,n3,n0,n1)
STEP 11: move(h3,ha,c4) sendtofree-b(h4,n1,n0,n3,n4)
STEP 12: homefromfreecell(d2,d,n2,da,n1,n0,n1) sendtohome-b(c2,c,n2,ca,n1,n4,n5)
STEP 13: sendtofree(h3,c4,n1,n0) sendtohome-b(c3,c,n3,c2,n2,n5,n6)
STEP 14: homefromfreecell(d3,d,n3,d2,n2,n0,n1) sendtohome(ha,d4,h,n1,h0,n0) sendtohome-b(c4,c,n4,c3,n3,n6,n7)
STEP 15: homefromfreecell(h2,h,n2,ha,n1,n1,n2)
STEP 16: sendtofree-b(d4,n2,n1,n7,n8)
STEP 17: homefromfreecell(h3,h,n3,h2,n2,n1,n2)
STEP 18: homefromfreecell(d4,d,n4,d3,n3,n2,n3)
STEP 19: homefromfreecell(h4,h,n4,h3,n3,n3,n4)
33 actions in the plan.
total time 5.48 preprocess 0.47 
total size 2.364 GB
max. learned clause length 143027
t val conflicts decisions
0 0 0 0
5 0 0 0
10 -1 709 21707
15 -1 656 118720
20 1 652 142501