7 satget(SATSolve *s, int i, int *t, int n)
13 for(c = s->cl; c != s->learncl; c = c->next)
15 for(j = 0; j < n && j < c->n; j++)
16 t[j] = signf(c->l[j]);
19 for(l = s->lit; l < s->lit + 2 * s->nvar; l++)
20 for(k = 0; k < l->nbimp; k++)
21 if(l - s->lit < l->bimp[k] && i-- == 0){
22 if(n > 0) t[0] = -signf(l - s->lit);
23 if(n > 1) t[1] = signf(l->bimp[k]);
26 m = s->lvl == 0 ? s->ntrail : s->decbd[1];
27 for(k = 0; k < m; k++)
29 if(n > 0) t[0] = signf(s->trail[k]);
32 for(; c != 0; c = c->next)
34 for(j = 0; j < n && j < c->n; j++)
35 t[j] = signf(c->l[j]);