|
definition:
|
solveWithDimacs :: SolverConfig -> Boolean -> IO [(Int,Bool)]
solveWithDimacs scfg boolean = do
let satcmd = unwords $ executable scfg : flags scfg
(inH, outH, _) <- execCmd satcmd
hPutStr inH $ showDimacs boolean
hFlush inH
hClose inH
response <- hGetContents outH
case parse response of
Left e -> error e
Right b -> return (boolVars2AssocList b)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
------------------------------------------------------------------------------
--- Checks the satisfiability of a Boolean formula with a SAT solver
--- supporting DIMACS format.
--- A list associating the variable indices to Boolean values so that
--- the formula is satisfied is returned.
--- If the formula is unsatisfiable, the returned list is empty.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
solveWithDimacs
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
SolverConfig -> Dimacs.Types.Boolean -> Prelude.IO [(Prelude.Int, Prelude.Bool)]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|