{- |

Module : $Header$

Description : Gtk GUI for automatic proving procedure of multiple nodes

Copyright : (c) Simon Ulbricht, Uni Bremen 2010

License : similar to LGPL, see HetCATS/LICENSE.txt or LIZENZ.txt

Maintainer : tekknix@informatik.uni-bremen.de

Stability : provisional

Portability : portable

This module provides a GUI for the consistency checker.

-}

module GUI.GtkAutomaticProofs

(showAutomaticProofs, Finder(..))

where

import Graphics.UI.Gtk

import Graphics.UI.Gtk.Glade

import GUI.GtkUtils as GtkUtils

import qualified GUI.Glade.NodeChecker as ConsistencyChecker

import GUI.GraphTypes

import Static.DevGraph

import Static.PrintDevGraph ()

import Static.GTheory

import Static.History

import Interfaces.GenericATPState (guiDefaultTimeLimit)

import Logic.Grothendieck

import Logic.Comorphism (AnyComorphism (..))

import Logic.Prover

import Logic.Logic (Logic)

import Comorphisms.LogicGraph (logicGraph)

import Comorphisms.KnownProvers

import qualified Common.OrderedMap as OMap

import Common.AS_Annotation (isAxiom)

import Common.LibName (LibName)

import Common.Result

import Control.Concurrent (forkIO, killThread)

import Control.Concurrent.MVar

import Control.Monad (foldM_, join, when)

import Proofs.AbstractState

import Data.Graph.Inductive.Graph (LNode)

import qualified Data.Map as Map

import Data.List

import Data.Maybe

import Data.Ord (comparing)

-- | Data structure for saving the user-selected prover and comorphism

data Finder = Finder { fName :: String

, finder :: G_prover

, comorphism :: [AnyComorphism]

, selected :: Int }

instance Eq Finder where

f1 == f2 = fName f1 == fName f2 && comorphism f1 == comorphism f2

-- | stores each node to be considered along with some further infomation

data FNode = FNode { name :: String

, node :: LNode DGNodeLab

, sublogic :: G_sublogics

, goals :: [String]

, newTheory :: G_theory } -- Map.Map String (AnyComorphism, BasicProof) }

status :: FNode -> Map.Map String (AnyComorphism, BasicProof)

status fn = case newTheory fn of

G_theory _ _ _ sens _

-> foldr (\ (sn,sen) t -> case thmStatus sen of

[] -> t

-- TODO get best, not last goalstatus

thms -> Map.insert sn (last thms) t

) Map.empty $ OMap.toList $ OMap.filter (not . isAxiom) sens

showStatus :: FNode -> String

showStatus fn = let toPref = (GtkUtils.statusToPrefix . GtkUtils.basicProofToGStatus)

in intercalate "\n" . map (\ s -> case Map.lookup s (status fn) of

Just (_,bp) -> toPref bp ++ s

Nothing -> "[ ]" ++ s ) $ goals fn

pStatusToColor :: Map.Map String (a,BasicProof) -> String

pStatusToColor s = GtkUtils.statusToColor gst

where gst = if Map.null s then GOpen

else GtkUtils.basicProofToGStatus

$ minimum $ map snd $ Map.elems s

pStatusToPrefix :: Map.Map String (a,BasicProof) -> String

pStatusToPrefix s = GtkUtils.statusToPrefix gst

where gst = if Map.null s then GOpen

else GtkUtils.basicProofToGStatus

$ minimum $ map snd $ Map.elems s

-- | Get a markup string containing name and color

instance Show FNode where

show fn = let s = status fn in

"<span color=\"" ++ pStatusToColor s

++ "\">" ++ pStatusToPrefix s ++ name fn ++ "</span>"

instance Eq FNode where

(==) f1 f2 = compare f1 f2 == EQ

-- | Nodes are sorted in accordance with goalstatus. Nodes without goals are not

-- | very importent and thus set to status GHandwritten (best case) for comparison only.

instance Ord FNode where

compare f1 f2 = let

s1 = status f1

s2 = status f2

min' a = case Map.elems a of

[] -> Handwritten

es -> minimum $ map snd es

cp = comparing min'

in case cp s1 s2 of

EQ -> compare (name f1) (name f2)

c -> c

-- | gets all Nodes from the DGraph as input and creates a list of FNodes only

-- | containing Nodes to be considered.

initFNodes :: [LNode DGNodeLab] -> [FNode]

initFNodes ls = foldr (\ n@(_,l) t

-> case globalTheory l of

Just gt@(G_theory _lid _sigma _ sens _)

-> FNode (getDGNodeName l) n

(sublogicOfTh gt)

(OMap.keys $ OMap.filter (not . isAxiom) sens)

(dgn_theory l) : t

Nothing -> t

) [] $ filter (hasSenKind (not . isAxiom) . snd) ls

-- | Displays the consistency checker window

showAutomaticProofs :: GInfo -> LibEnv -> IO (Result LibEnv)

showAutomaticProofs (GInfo { libName = ln }) le = do

wait <- newEmptyMVar

showProverWindow wait ln le

le' <- takeMVar wait

return $ Result [] $ Just le'

-- | Displays the consistency checker window

showProverWindow :: MVar LibEnv -> LibName -> LibEnv -> IO ()

showProverWindow res ln le = postGUIAsync $ do

xml <- getGladeXML ConsistencyChecker.get

-- get objects

window <- xmlGetWidget xml castToWindow "NodeChecker"

btnClose <- xmlGetWidget xml castToButton "btnClose"

btnResults <- xmlGetWidget xml castToButton "btnResults"

-- get nodes view and buttons

trvNodes <- xmlGetWidget xml castToTreeView "trvNodes"

btnNodesAll <- xmlGetWidget xml castToButton "btnNodesAll"

btnNodesNone <- xmlGetWidget xml castToButton "btnNodesNone"

btnNodesInvert <- xmlGetWidget xml castToButton "btnNodesInvert"

btnNodesUnchecked <- xmlGetWidget xml castToButton "btnNodesUnchecked"

btnNodesTimeout <- xmlGetWidget xml castToButton "btnNodesTimeout"

cbInclThms <- xmlGetWidget xml castToCheckButton "cbInclThms"

-- get checker view and buttons

cbComorphism <- xmlGetWidget xml castToComboBox "cbComorphism"

lblSublogic <- xmlGetWidget xml castToLabel "lblSublogic"

sbTimeout <- xmlGetWidget xml castToSpinButton "sbTimeout"

btnCheck <- xmlGetWidget xml castToButton "btnCheck"

btnStop <- xmlGetWidget xml castToButton "btnStop"

-- btnFineGrained <- xmlGetWidget xml castToButton "btnFineGrained"

trvFinder <- xmlGetWidget xml castToTreeView "trvFinder"

windowSetTitle window "AutomaticProofs"

spinButtonSetValue sbTimeout $ fromIntegral guiDefaultTimeLimit

let widgets = [ toWidget sbTimeout

, toWidget cbComorphism

, toWidget lblSublogic ]

checkWidgets = widgets ++ [ toWidget btnClose

, toWidget btnNodesAll

, toWidget btnNodesNone

, toWidget btnNodesInvert

, toWidget btnNodesUnchecked

, toWidget btnNodesTimeout

, toWidget btnResults ]

switch b = do

widgetSetSensitive btnStop $ not b

widgetSetSensitive btnCheck b

widgetSetSensitive btnStop False

widgetSetSensitive btnCheck False

threadId <- newEmptyMVar

wait <- newEmptyMVar

mView <- newEmptyMVar

let dg = lookupDGraph ln le

nodes = initFNodes $ labNodesDG dg

-- setup data

listNodes <- setListData trvNodes show $ sort nodes

listFinder <- setListData trvFinder fName []

-- setup comorphism combobox

comboBoxSetModelText cbComorphism

shC <- after cbComorphism changed

$ setSelectedComorphism trvFinder listFinder cbComorphism

-- setup view selection actions

let update = do

mf <- getSelectedSingle trvFinder listFinder

updateComorphism trvFinder listFinder cbComorphism shC

widgetSetSensitive btnCheck $ isJust mf

setListSelectorSingle trvFinder update

let upd = updateNodes trvNodes listNodes

(\ s -> do labelSetLabel lblSublogic $ show s

updateFinder trvFinder listFinder s)

(do labelSetLabel lblSublogic "No sublogic"

listStoreClear listFinder

activate widgets False

widgetSetSensitive btnCheck False)

(activate widgets True >> widgetSetSensitive btnCheck True)

shN <- setListSelectorMultiple trvNodes btnNodesAll btnNodesNone

btnNodesInvert upd

onClicked btnResults $ showModelView mView "Models" listNodes []

onClicked btnClose $ widgetDestroy window

onClicked btnStop $ takeMVar threadId >>= killThread >>= putMVar wait

onClicked btnCheck $ do

activate checkWidgets False

timeout <- spinButtonGetValueAsInt sbTimeout

inclThms <- toggleButtonGetActive cbInclThms

(prgBar, exit) <- progressBar "Proving" "please wait..."

nodes' <- getSelectedMultiple trvNodes listNodes

mf <- getSelectedSingle trvFinder listFinder

f <- case mf of

Nothing -> error "Automatic Proofs: internal error"

Just (_, f) -> return f

switch False

tid <- forkIO $ do

performAutoProof inclThms timeout prgBar f listNodes nodes'

-- check inclThms ln le dg f timeout listNodes updat nodes'

putMVar wait ()

putMVar threadId tid

forkIO_ $ do

takeMVar wait

postGUIAsync $ do

switch True

tryTakeMVar threadId

showModelView mView "Results of automatic proofs" listNodes []

signalBlock shN

sortNodes trvNodes listNodes

signalUnblock shN

upd

activate checkWidgets True

exit

onDestroy window $ do

nodes' <- listStoreToList listNodes

let changes = foldl (\ cs fn ->

-- where the proving did not return anything, node is not updated

if null $ Map.toList $ status fn then cs

else

let (_, l) = node fn

n' = updateProofHistory fn

in SetNodeLab l n' : cs

) [] nodes'

dg' = changesDGH dg changes

putMVar res $ Map.insert ln (groupHistory dg (DGRule "autoproof") dg') le

widgetShow window

updateProofHistory :: FNode -> LNode DGNodeLab

updateProofHistory fn = let (i,l) = node fn

gt = dgn_theory l

gt' = propagateProofs gt $ newTheory fn

in (i, l {dgn_theory = gt'})

sortNodes :: TreeView -> ListStore FNode -> IO ()

sortNodes trvNodes listNodes = do

sel <- getSelectedMultiple trvNodes listNodes

nodes <- listStoreToList listNodes

let sn = sort nodes

updateListData listNodes sn

selector <- treeViewGetSelection trvNodes

mapM_ (\ (_, FNode { name = n }) -> treeSelectionSelectPath selector

[fromMaybe (error "Node not found!") $ findIndex ((n ==) . name) sn]

) sel

-- | Called when node selection is changed. Updates finder list

updateNodes :: TreeView -> ListStore FNode -> (G_sublogics -> IO ())

-> IO () -> IO () -> IO ()

updateNodes view listNodes update lock unlock = do

nodes <- getSelectedMultiple view listNodes

if null nodes then lock

else let sls = map (sublogic . snd) nodes in

maybe lock (\ sl -> unlock >> update sl)

$ foldl (\ ma b -> case ma of

Just a -> joinSublogics b a

Nothing -> Nothing) (Just $ head sls) $ tail sls

-- | Update the list of finder

updateFinder :: TreeView -> ListStore Finder -> G_sublogics -> IO ()

updateFinder view list sl = do

old <- listStoreToList list

let new = Map.elems $ foldr (\ (pr, c) m ->

let n = getPName pr

f = Map.findWithDefault (Finder n pr [] 0) n m

in Map.insert n (f { comorphism = c : comorphism f}) m) Map.empty

$ getProvers ProveCMDLautomatic (Just sl) $ findComorphismPaths logicGraph sl

when (old /= new) $ do

-- update list and try to select previous finder

selected' <- getSelectedSingle view list

sel <- treeViewGetSelection view

listStoreClear list

mapM_ (listStoreAppend list) $ mergeFinder old new

maybe (selectFirst view)

(\ (_, f) -> let i = findIndex ((fName f ==) . fName) new in

maybe (selectFirst view) (treeSelectionSelectPath sel . (: [])) i

) selected'

-- | Try to select previous selected comorphism if possible

mergeFinder :: [Finder] -> [Finder] -> [Finder]

mergeFinder old new = let m' = Map.fromList $ map (\ f -> (fName f, f)) new in

Map.elems $ foldl (\ m (Finder { fName = n, comorphism = cc, selected = i}) ->

case Map.lookup n m of

Nothing -> m

Just f@(Finder { comorphism = cc' }) -> let c = cc !! i in

Map.insert n (f { selected = fromMaybe 0 $ findIndex (== c) cc' }) m

) m' old

performAutoProof :: -- include proven Theorems in subsequent proofs

Bool

-- Timeout (sec)

-> Int

-- Progress bar

-> (Double -> String -> IO ())

-- selcted Prover and Comorphism

-> Finder

-- Display function for node selection box

-> ListStore FNode

-- selected nodes

-> [(Int, FNode)]

-- return TODO comment!

-> IO()

performAutoProof inclThms timeout update (Finder _ pr cs i) listNodes nodes =

let count' = fromIntegral $ length nodes

c = cs !! i

in foldM_ (\ count (row, fn) -> do

postGUISync $ update (count / count') $ name fn

res <- autoProofAtNode inclThms timeout (node fn) (pr, c)

postGUISync $ listStoreSetValue listNodes row fn { newTheory = res }

-- using this line to check whether or not new goalstatus is stored withing FNode -> dgn_theory

-- postGUISync $ listStoreSetValue listNodes row fn { status = initProofStatus $ snd $ node fn }

return $ count + 1) 0 nodes

autoProofAtNode :: -- use theorems is subsequent proofs

Bool

-- Timeout Limit

-> Int

-- Node selected for proving

-> LNode DGNodeLab

-- selected Prover and Comorphism

-> ( G_prover, AnyComorphism )

-- returns new GoalStatus for the Node

-> IO G_theory

autoProofAtNode useTh timeout (_, lab) p_cm =

case fromMaybe (error "GtkAutomaticProofs: noG_theory") $ globalTheory lab of

g_th@( G_theory lid _ _ _ _ ) -> do

-- recompute the theory (to make effective the selected axioms,

-- goals)

let knpr = propagateErrors $ knownProversWithKind ProveCMDLautomatic

pf_st <- initialState lid "" g_th knpr [p_cm]

let st = recalculateSublogicAndSelectedTheory pf_st

-- try to prepare the theory

case maybeResult $ prepareForProving st p_cm of

-- theory could not be computed

Nothing -> do putStrLn "No suitable prover and comorphism found"

return g_th

Just (G_theory_with_prover lid1 th p) ->

case proveCMDLautomaticBatch p of

Nothing -> do putStrLn "Error obtaining the prover"

-- TODO create usefull return value

return g_th

Just fn -> do

-- mVar to poll the prover for results

answ <- newMVar (return [])

case selectedGoals st of

[] -> do putStrLn "No goals selected. Nothing to prove"

-- TODO create usefull return value

return g_th

_ -> do (_, mV) <- fn useTh False answ (theoryName st)

(TacticScript $ show timeout) th []

-- mThr <- newMVar $ Just thrId

takeMVar mV

res <- getResults lid1 answ (snd p_cm) st

return $ case res of

Nothing -> g_th

Just gt -> gt

getResults :: (Logic lid1 sublogics1

basic_spec1 sentence1 symb_items1 symb_map_items1

sign1 morphism1 symbol1 raw_symbol1 proof_tree1,

Logic lid sublogics basic_spec sentence

symb_items symb_map_items

sign morphism symbol raw_symbol proof_tree) =>

lid

-> MVar (Result [ProofStatus proof_tree])

-> AnyComorphism

-> ProofState lid1 sentence1

-> IO (Maybe G_theory)

getResults lid mData ac st =

do

d <- takeMVar mData

case maybeResult d of

Nothing -> return Nothing

Just d' -> do

let ps' = markProved ac lid d' st

-- TODO Open Reason is not written back into GTheory, but only Proved Goals

-- this need to be fixed.

case theory ps' of

G_theory lidT sigT indT sensT _ ->

case coerceThSens (logicId ps') lidT "" (goalMap ps') of

Nothing -> return Nothing

Just gMap -> let

nwTh = G_theory lidT sigT indT (Map.union sensT gMap) startThId

in do return $ Just nwTh

updateComorphism :: TreeView -> ListStore Finder -> ComboBox

-> ConnectId ComboBox -> IO ()

updateComorphism view list cbComorphism sh = do

signalBlock sh

model <- comboBoxGetModelText cbComorphism

listStoreClear model

mfinder <- getSelectedSingle view list

case mfinder of

Just (_, f) -> do

mapM_ (comboBoxAppendText cbComorphism) $ expand f

comboBoxSetActive cbComorphism $ selected f

Nothing -> return ()

signalUnblock sh

expand :: Finder -> [String]

expand = map show . comorphism

setSelectedComorphism :: TreeView -> ListStore Finder -> ComboBox -> IO ()

setSelectedComorphism view list cbComorphism = do

mfinder <- getSelectedSingle view list

case mfinder of

Just (i, f) -> do

sel <- comboBoxGetActive cbComorphism

listStoreSetValue list i f { selected = sel }

Nothing -> return ()

-- | Displays the model view window

showModelViewAux :: MVar (IO ()) -> String -> ListStore FNode -> [FNode]

-> IO ()

showModelViewAux lock title list other = do

xml <- getGladeXML ConsistencyChecker.get

-- get objects

window <- xmlGetWidget xml castToWindow "ModelView"

btnClose <- xmlGetWidget xml castToButton "btnResClose"

frNodes <- xmlGetWidget xml castToFrame "frResNodes"

trvNodes <- xmlGetWidget xml castToTreeView "trvResNodes"

tvModel <- xmlGetWidget xml castToTextView "tvResModel"

windowSetTitle window title

-- setup text view

buffer <- textViewGetBuffer tvModel

textBufferInsertAtCursor buffer ""

tagTable <- textBufferGetTagTable buffer

font <- textTagNew Nothing

set font [ textTagFont := "FreeMono" ]

textTagTableAdd tagTable font

start <- textBufferGetStartIter buffer

end <- textBufferGetEndIter buffer

textBufferApplyTag buffer font start end

-- setup list view

let filterNodes = id

nodes <- listStoreToList list

listNodes <- setListData trvNodes show $ sort $ filterNodes $ other ++ nodes

setListSelectorSingle trvNodes $ do

mn <- getSelectedSingle trvNodes listNodes

case mn of

Nothing -> textBufferSetText buffer ""

Just (_, n) -> textBufferSetText buffer $ showStatus n

-- setup actions

onClicked btnClose $ widgetDestroy window

onDestroy window $ takeMVar lock >>= const (return ())

putMVar lock $ do

sel' <- getSelectedSingle trvNodes listNodes

sel <- treeViewGetSelection trvNodes

nodes'' <- listStoreToList list

let nodes' = sort $ filterNodes nodes''

updateListData listNodes $ sort (other ++ nodes')

maybe (selectFirst trvNodes) (treeSelectionSelectPath sel . (: []))

$ maybe Nothing (\ (_, n) -> findIndex ((name n ==) . name) nodes') sel'

selectFirst trvNodes

widgetSetSizeRequest window 800 600

widgetSetSizeRequest frNodes 250 (-1)

widgetShow window

-- | Displays the model view window

showModelView :: MVar (IO ()) -> String -> ListStore FNode -> [FNode] -> IO ()

showModelView lock title list other = do

isNotOpen <- isEmptyMVar lock

if isNotOpen then showModelViewAux lock title list other

else join (readMVar lock)