module SAT.Solver.Mios.M114
(
simplifyDB
, solve
)
where
import Control.Monad (forM_, unless, void, when)
import Data.Bits
import Data.Foldable (foldrM)
import SAT.Solver.Mios.Types
import SAT.Solver.Mios.Internal
import SAT.Solver.Mios.Clause
import SAT.Solver.Mios.ClauseManager
import SAT.Solver.Mios.Solver
import SAT.Solver.Mios.Glucose
removeWatch :: Solver -> Clause -> IO ()
removeWatch Solver{..} c = do
let lvec = asVec c
l1 <- negateLit <$> getNth lvec 0
markClause (getNthWatcher watches l1) c
l2 <- negateLit <$> getNth lvec 1
markClause (getNthWatcher watches l2) c
newLearntClause :: Solver -> Vec -> IO ()
newLearntClause s@Solver{..} ps = do
good <- getBool ok
when good $ do
k <- getNth ps 0
case k of
1 -> do
l <- getNth ps 1
unsafeEnqueue s l NullClause
_ -> do
c <- newClauseFromVec True ps
let vec = asVec c
let
findMax :: Int -> Int -> Int -> IO Int
findMax ((< k) -> False) j _ = return j
findMax i j val = do
v' <- lit2var <$> getNth vec i
a <- getNth assigns v'
b <- getNth level v'
if (a /= lBottom) && (val < b)
then findMax (i + 1) i b
else findMax (i + 1) j val
swapBetween vec 1 =<< findMax 0 0 0
claBumpActivity s c
pushClause learnts c
l <- getNth vec 0
pushClauseWithKey (getNthWatcher watches (negateLit l)) c 0
l1 <- negateLit <$> getNth vec 1
pushClauseWithKey (getNthWatcher watches l1) c 0
unsafeEnqueue s l c
setLBD s c
simplify :: Solver -> Clause -> IO Bool
simplify s c = do
n <- sizeOfClause c
let
lvec = asVec c
loop ::Int -> IO Bool
loop ((< n) -> False) = return False
loop i = do
v <- valueLit s =<< getNth lvec i
if v == 1 then return True else loop (i + 1)
loop 0
analyze :: Solver -> Clause -> IO Int
analyze s@Solver{..} confl = do
clearStack litsLearnt
pushToStack litsLearnt 0
dl <- decisionLevel s
let
litsVec = asVec litsLearnt
trailVec = asVec trail
loopOnClauseChain :: Clause -> Lit -> Int -> Int -> Int -> IO Int
loopOnClauseChain c p ti bl pathC = do
when (learnt c) $ do
claBumpActivity s c
d <- getInt (lbd c)
when (2 < d) $ do
nblevels <- lbdOf s c
when (nblevels + 1 < d) $ do
when (d <= 30) $ setBool (protected c) True
setInt (lbd c) nblevels
sc <- sizeOfClause c
let
lvec = asVec c
loopOnLiterals :: Int -> Int -> Int -> IO (Int, Int)
loopOnLiterals ((< sc) -> False) b pc = return (b, pc)
loopOnLiterals j b pc = do
(q :: Lit) <- getNth lvec j
let v = lit2var q
sn <- getNth an'seen v
l <- getNth level v
if sn == 0 && 0 < l
then do
varBumpActivity s v
setNth an'seen v 1
if dl <= l
then do
r <- getNthClause reason v
when (r /= NullClause && learnt r) $ pushToStack lastDL q
loopOnLiterals (j + 1) b (pc + 1)
else pushToStack litsLearnt q >> loopOnLiterals (j + 1) (max b l) pc
else loopOnLiterals (j + 1) b pc
(b', pathC') <- loopOnLiterals (if p == bottomLit then 0 else 1) bl pathC
let
nextPickedUpLit :: Int -> IO Int
nextPickedUpLit i = do
x <- getNth an'seen . lit2var =<< getNth trailVec i
if x == 0 then nextPickedUpLit $ i 1 else return i
ti' <- nextPickedUpLit ti
nextP <- getNth trailVec ti'
let nextV = lit2var nextP
confl' <- getNthClause reason nextV
setNth an'seen nextV 0
if 1 < pathC'
then loopOnClauseChain confl' nextP (ti' 1) b' (pathC' 1)
else setNth litsVec 0 (negateLit nextP) >> return b'
ti <- subtract 1 <$> sizeOfStack trail
levelToReturn <- loopOnClauseChain confl bottomLit ti 0 0
n <- sizeOfStack litsLearnt
clearStack an'stack
clearStack an'toClear
pushToStack an'toClear =<< getNth litsVec 0
let
merger :: Int -> Int -> IO Int
merger ((< n) -> False) b = return b
merger i b = do
l <- getNth litsVec i
pushToStack an'toClear l
merger (i + 1) . setBit b . (31 .&.) =<< getNth level (lit2var l)
levels <- merger 1 0
let
loopOnLits :: Int -> Int -> IO ()
loopOnLits ((< n) -> False) n' = shrinkStack litsLearnt $ n n'
loopOnLits i j = do
l <- getNth litsVec i
c1 <- (NullClause ==) <$> getNthClause reason (lit2var l)
if c1
then setNth litsVec j l >> loopOnLits (i + 1) (j + 1)
else do
c2 <- not <$> analyzeRemovable s l levels
if c2
then setNth litsVec j l >> loopOnLits (i + 1) (j + 1)
else loopOnLits (i + 1) j
loopOnLits 1 1
nld <- sizeOfStack lastDL
lbd' <- computeLBD s $ asSizedVec litsLearnt
let
vec = asVec lastDL
loopOnLastDL :: Int -> IO ()
loopOnLastDL ((< nld) -> False) = return ()
loopOnLastDL i = do
v <- lit2var <$> getNth vec i
d' <- getInt . lbd =<< getNthClause reason v
when (lbd' < d') $ varBumpActivity s v
loopOnLastDL $ i + 1
loopOnLastDL 0
clearStack lastDL
k <- sizeOfStack an'toClear
let
vec' = asVec an'toClear
cleaner :: Int -> IO ()
cleaner ((< k) -> False) = return ()
cleaner i = do
v <- lit2var <$> getNth vec' i
setNth an'seen v 0
cleaner $ i + 1
cleaner 0
return levelToReturn
analyzeRemovable :: Solver -> Lit -> Int -> IO Bool
analyzeRemovable Solver{..} p minLevel = do
clearStack an'stack
pushToStack an'stack p
top <- sizeOfStack an'toClear
let
loopOnStack :: IO Bool
loopOnStack = do
k <- sizeOfStack an'stack
if 0 == k
then return True
else do
sl <- lastOfStack an'stack
popFromStack an'stack
c <- getNthClause reason (lit2var sl)
nl <- sizeOfClause c
let
cvec = asVec c
loopOnLit :: Int -> IO Bool
loopOnLit ((< nl) -> False) = loopOnStack
loopOnLit i = do
p' <- getNth cvec i
let v' = lit2var p'
l' <- getNth level v'
c1 <- (1 /=) <$> getNth an'seen v'
if c1 && (0 /= l')
then do
c3 <- (NullClause /=) <$> getNthClause reason v'
if c3 && testBit minLevel (l' .&. 31)
then do
setNth an'seen v' 1
pushToStack an'stack p'
pushToStack an'toClear p'
loopOnLit $ i + 1
else do
top' <- sizeOfStack an'toClear
let vec = asVec an'toClear
forM_ [top .. top' 1] $ \j -> do x <- getNth vec j; setNth an'seen (lit2var x) 0
shrinkStack an'toClear $ top' top
return False
else loopOnLit $ i + 1
loopOnLit 1
loopOnStack
analyzeFinal :: Solver -> Clause -> Bool -> IO ()
analyzeFinal Solver{..} confl skipFirst = do
clearStack conflict
rl <- getInt rootLevel
unless (rl == 0) $ do
n <- sizeOfClause confl
let
lvec = asVec confl
loopOnConfl :: Int -> IO ()
loopOnConfl ((< n) -> False) = return ()
loopOnConfl i = do
(x :: Var) <- lit2var <$> getNth lvec i
lvl <- getNth level x
when (0 < lvl) $ setNth an'seen x 1
loopOnConfl $ i + 1
loopOnConfl $ if skipFirst then 1 else 0
tls <- sizeOfStack trailLim
trs <- sizeOfStack trail
tlz <- getNth (asVec trailLim) 0
let
trailVec = asVec trail
loopOnTrail :: Int -> IO ()
loopOnTrail ((tlz <=) -> False) = return ()
loopOnTrail i = do
(l :: Lit) <- getNth trailVec i
let (x :: Var) = lit2var l
saw <- getNth an'seen x
when (saw == 1) $ do
(r :: Clause) <- getNthClause reason x
if r == NullClause
then pushToStack conflict (negateLit l)
else do
k <- sizeOfClause r
let
cvec = asVec r
loopOnLits :: Int -> IO ()
loopOnLits ((< k) -> False) = return ()
loopOnLits j = do
(v :: Var) <- lit2var <$> getNth cvec j
lv <- getNth level v
when (0 < lv) $ setNth an'seen v 1
loopOnLits $ i + 1
loopOnLits 1
setNth an'seen x 0
loopOnTrail $ i 1
loopOnTrail =<< if tls <= rl then return (trs 1) else getNth (asVec trailLim) rl
propagate :: Solver -> IO Clause
propagate s@Solver{..} = do
let
trailVec = asVec trail
while :: Clause -> Bool -> IO Clause
while confl False = return confl
while confl True = do
(p :: Lit) <- getNth trailVec =<< getInt qHead
modifyInt qHead (+ 1)
let (ws :: ClauseExtManager) = getNthWatcher watches p
end <- numberOfClauses ws
cvec <- getClauseVector ws
bvec <- getKeyVector ws
let
forClause :: Clause -> Int -> Int -> IO Clause
forClause confl i@((< end) -> False) j = do
shrinkManager ws (i j)
while confl =<< ((<) <$> getInt qHead <*> sizeOfStack trail)
forClause confl i j = do
(l :: Lit) <- getNth bvec i
bv <- if l == 0 then return lFalse else valueLit s l
if bv == lTrue
then do
unless (i == j) $ do
(c :: Clause) <- getNthClause cvec i
setNthClause cvec j c
setNth bvec j l
forClause confl (i + 1) (j + 1)
else do
(c :: Clause) <- getNthClause cvec i
let
lits = asVec c
falseLit = negateLit p
((falseLit ==) <$> getNth lits 0) >>= (`when` swapBetween lits 0 1)
(first :: Lit) <- getNth lits 0
val <- valueLit s first
if val == lTrue
then setNthClause cvec j c >> setNth bvec j first >> forClause confl (i + 1) (j + 1)
else do
cs <- sizeOfClause c
let
forLit :: Int -> IO Clause
forLit ((< cs) -> False) = do
setNthClause cvec j c
setNth bvec j 0
result <- enqueue s first c
if not result
then do
((== 0) <$> decisionLevel s) >>= (`when` setBool ok False)
setInt qHead =<< sizeOfStack trail
let
copy i'@((< end) -> False) j' = forClause c i' j'
copy i' j' = do
setNthClause cvec j' =<< getNthClause cvec i'
setNth bvec j' =<< getNth bvec i'
copy (i' + 1) (j' + 1)
copy (i + 1) (j + 1)
else forClause confl (i + 1) (j + 1)
forLit k = do
(l :: Lit) <- getNth lits k
lv <- valueLit s l
if lv /= lFalse
then do
swapBetween lits 1 k
pushClauseWithKey (getNthWatcher watches (negateLit l)) c l
forClause confl (i + 1) j
else forLit $ k + 1
forLit 2
forClause confl 0 0
while NullClause =<< ((<) <$> getInt qHead <*> sizeOfStack trail)
reduceDB :: Solver -> IO ()
reduceDB s@Solver{..} = do
n <- nLearnts s
vec <- getClauseVector learnts
let
loop :: Int -> IO ()
loop ((< n) -> False) = return ()
loop i = (removeWatch s =<< getNthClause vec i) >> loop (i + 1)
k <- sortClauses s learnts (div n 2)
loop k
garbageCollect watches
shrinkManager learnts (n k)
(lbdWidth :: Int, activityWidth :: Int, indexWidth :: Int) = (l, a, w (l + a + 1))
where
w = finiteBitSize (0:: Int)
(l, a) = case () of
_ | 64 <= w -> (16, 19)
_ | 60 <= w -> (14, 19)
_ | 32 <= w -> ( 7, 6)
_ | 29 <= w -> ( 6, 5)
_ -> error "Int on your CPU doesn't have sufficient bit width."
sortClauses :: Solver -> ClauseExtManager -> Int -> IO Int
sortClauses s cm nneeds = do
let
lbdMax :: Int
lbdMax = 2 ^ lbdWidth 1
activityMax :: Int
activityMax = 2 ^ activityWidth 1
activityScale :: Double
activityScale = fromIntegral activityMax
indexMax :: Int
indexMax = (2 ^ indexWidth 1)
n <- numberOfClauses cm
when (indexMax < n) $ error $ "## The number of learnt clauses " ++ show n ++ " exceeds mios's " ++ show indexWidth ++" bit manage capacity"
vec <- getClauseVector cm
keys <- getKeyVector cm
let
assignKey :: Int -> Int -> IO Int
assignKey ((< n) -> False) m = return m
assignKey i m = do
c <- getNthClause vec i
k <- (\k -> if k == 2 then return k else fromEnum <$> getBool (protected c)) =<< sizeOfClause c
case k of
1 -> setBool (protected c) False >> setNth keys i (shiftL 2 indexWidth + i) >> assignKey (i + 1) (m + 1)
2 -> setNth keys i (shiftL 1 indexWidth + i) >> assignKey (i + 1) (m + 1)
_ -> do
l <- locked s c
if l
then setNth keys i (shiftL 1 indexWidth + i) >> assignKey (i + 1) (m + 1)
else do
d <- getInt $ lbd c
b <- floor . (activityScale *) . (1 ) . logBase 1e100 . max 1 <$> getDouble (activity c)
setNth keys i $ shiftL (min lbdMax d) (activityWidth + indexWidth) + shiftL b indexWidth + i
assignKey (i + 1) m
limit <- min n . (+ nneeds) <$> assignKey 0 0
let
sortOnRange :: Int -> Int -> IO ()
sortOnRange left right
| limit < left = return ()
| left >= right = return ()
| left + 1 == right = do
a <- getNth keys left
b <- getNth keys right
unless (a < b) $ swapBetween keys left right
| otherwise = do
let p = div (left + right) 2
pivot <- getNth keys p
swapBetween keys p left
let
nextL :: Int -> IO Int
nextL i@((<= right) -> False) = return i
nextL i = do v <- getNth keys i; if v < pivot then nextL (i + 1) else return i
nextR :: Int -> IO Int
nextR i = do v <- getNth keys i; if pivot < v then nextR (i 1) else return i
divide :: Int -> Int -> IO Int
divide l r = do
l' <- nextL l
r' <- nextR r
if l' < r' then swapBetween keys l' r' >> divide (l' + 1) (r' 1) else return r'
m <- divide (left + 1) right
swapBetween keys left m
sortOnRange left (m 1)
sortOnRange (m + 1) right
sortOnRange 0 (n 1)
let
seek :: Int -> IO ()
seek ((< limit) -> False) = return ()
seek i = do
bits <- getNth keys i
when (indexMax < bits) $ do
c <- getNthClause vec i
let
sweep k = do
k' <- (indexMax .&.) <$> getNth keys k
setNth keys k k
if k' == i
then setNthClause vec k c
else getNthClause vec k' >>= setNthClause vec k >> sweep k'
sweep i
seek $ i + 1
seek 0
return limit
simplifyDB :: Solver -> IO Bool
simplifyDB s@Solver{..} = do
good <- getBool ok
if good
then do
p <- propagate s
if p /= NullClause
then setBool ok False >> return False
else do
n <- sizeOfStack trail
let
vec = asVec trail
loopOnLit ((< n) -> False) = return ()
loopOnLit i = do
l <- getNth vec i
clearManager . getNthWatcher watches $ l
clearManager . getNthWatcher watches $ negateLit l
loopOnLit $ i + 1
loopOnLit 0
let
for :: Int -> IO Bool
for ((< 2) -> False) = return True
for t = do
let ptr = if t == 0 then learnts else clauses
vec' <- getClauseVector ptr
n' <- numberOfClauses ptr
let
loopOnVector :: Int -> Int -> IO Bool
loopOnVector ((< n') -> False) j = shrinkManager ptr (n' j) >> return True
loopOnVector i j = do
c <- getNthClause vec' i
l <- locked s c
r <- simplify s c
if not l && r
then removeWatch s c >> loopOnVector (i + 1) j
else setNthClause vec' j c >> loopOnVector (i + 1) (j + 1)
loopOnVector 0 0
ret <- for 0
garbageCollect watches
return ret
else return False
search :: Solver -> Int -> Int -> IO LiftedBool
search s@Solver{..} nOfConflicts nOfLearnts = do
let
loop :: Int -> IO LiftedBool
loop conflictC = do
!confl <- propagate s
d <- decisionLevel s
if confl /= NullClause
then do
incrementStat s NumOfBackjump 1
r <- getInt rootLevel
if d == r
then do
analyzeFinal s confl False
return LFalse
else do
backtrackLevel <- analyze s confl
(s `cancelUntil`) . max backtrackLevel =<< getInt rootLevel
newLearntClause s $ asSizedVec litsLearnt
k <- sizeOfStack litsLearnt
when (k == 1) $ do
(v :: Var) <- lit2var <$> getNth (asVec litsLearnt) 0
setNth level v 0
varDecayActivity s
claDecayActivity s
loop $ conflictC + 1
else do
when (d == 0) . void $ simplifyDB s
k1 <- numberOfClauses learnts
k2 <- nAssigns s
when (k1 k2 >= nOfLearnts) $ reduceDB s
case () of
_ | k2 == nVars -> do
forM_ [0 .. nVars 1] $ \i -> setNthBool model i . (lTrue ==) =<< getNth assigns (i + 1)
return LTrue
_ | conflictC >= nOfConflicts -> do
(s `cancelUntil`) =<< getInt rootLevel
incrementStat s NumOfRestart 1
return Bottom
_ -> do
v <- select s
oldVal <- getNth phases v
unsafeAssume s $ var2lit v (0 < oldVal)
loop conflictC
good <- getBool ok
if good then loop 0 else return LFalse
solve :: (Foldable t) => Solver -> t Lit -> IO Bool
solve s@Solver{..} assumps = do
let
injector :: Lit -> Bool -> IO Bool
injector _ False = return False
injector a True = do
b <- assume s a
if not b
then do
(confl :: Clause) <- getNthClause reason (lit2var a)
analyzeFinal s confl True
pushToStack conflict (negateLit a)
cancelUntil s 0
return False
else do
confl <- propagate s
if confl /= NullClause
then do
analyzeFinal s confl True
cancelUntil s 0
return False
else return True
good <- simplifyDB s
x <- if good then foldrM injector True assumps else return False
if not x
then return False
else do
setInt rootLevel =<< decisionLevel s
nc <- fromIntegral <$> nClauses s
let
while :: Double -> Double -> IO Bool
while nOfConflicts nOfLearnts = do
status <- search s (floor nOfConflicts) (floor nOfLearnts)
if status == Bottom
then while (1.5 * nOfConflicts) (1.1 * nOfLearnts)
else cancelUntil s 0 >> return (status == LTrue)
while 100 (nc / 3.0)
unsafeEnqueue :: Solver -> Lit -> Clause -> IO ()
unsafeEnqueue s@Solver{..} p from = do
let v = lit2var p
setNth assigns v $! if positiveLit p then lTrue else lFalse
setNth level v =<< decisionLevel s
setNthClause reason v from
pushToStack trail p
unsafeAssume :: Solver -> Lit -> IO ()
unsafeAssume s@Solver{..} p = do
pushToStack trailLim =<< sizeOfStack trail
unsafeEnqueue s p NullClause