module TPTP.Prover.Isabelle (isabelle) where
import TPTP.Prover.Common
import TPTP.Prover.ProofParser
import TPTP.Prover.ProverState
import TPTP.Morphism
import TPTP.Sign
import TPTP.Sublogic
import Common.AS_Annotation
import Common.ProofTree
import Interfaces.GenericATPState hiding (proverState)
import Logic.Prover hiding (proofLines)
isabelle :: Prover Sign Sentence Morphism Sublogic ProofTree
isabelle :: Prover Sign Sentence Morphism Sublogic ProofTree
isabelle = String
-> String
-> Sublogic
-> RunTheProverType
-> Prover Sign Sentence Morphism Sublogic ProofTree
mkProver String
binary_name String
prover_name Sublogic
sublogics RunTheProverType
runTheProver
binary_name :: String
binary_name :: String
binary_name = "isabelle"
prover_name :: String
prover_name :: String
prover_name = "Isabelle"
sublogics :: Sublogic
sublogics :: Sublogic
sublogics = Sublogic
THF
runTheProver :: ProverState
-> GenericConfig ProofTree
-> Bool
-> String
-> Named Sentence
-> IO (ATPRetval, GenericConfig ProofTree)
runTheProver :: RunTheProverType
runTheProver proverState :: ProverState
proverState cfg :: GenericConfig ProofTree
cfg saveTPTPFile :: Bool
saveTPTPFile theoryName :: String
theoryName namedGoal :: Named Sentence
namedGoal = do
let proverTimeLimitS :: String
proverTimeLimitS = Int -> String
forall a. Show a => a -> String
show (Int -> String) -> Int -> String
forall a b. (a -> b) -> a -> b
$ 1000 Int -> Int -> Int
forall a. Num a => a -> a -> a
* GenericConfig ProofTree -> Int
getTimeLimit GenericConfig ProofTree
cfg
allOptions :: [String]
allOptions = [ "tptp_isabelle"
, String
proverTimeLimitS
]
String
problemFileName <-
ProverState
-> GenericConfig ProofTree
-> Bool
-> String
-> Named Sentence
-> String
-> IO String
prepareProverInput ProverState
proverState GenericConfig ProofTree
cfg Bool
saveTPTPFile String
theoryName Named Sentence
namedGoal String
prover_name
(_, out :: [String]
out, wallTimeUsed :: TimeOfDay
wallTimeUsed) <-
String -> [String] -> IO (ExitCode, [String], TimeOfDay)
executeTheProver String
binary_name ([String]
allOptions [String] -> [String] -> [String]
forall a. [a] -> [a] -> [a]
++ [String
problemFileName])
let szsStatusLine :: String
szsStatusLine = [String] -> String
findSZS [String]
out
let resultedTimeUsed :: TimeOfDay
resultedTimeUsed = TimeOfDay
wallTimeUsed
let axiomsUsed :: [String]
axiomsUsed = ProverState -> [String]
getAxioms ProverState
proverState
let (atpRetval :: ATPRetval
atpRetval, resultedProofStatus :: ProofStatus ProofTree
resultedProofStatus) =
GenericConfig ProofTree
-> Named Sentence
-> TimeOfDay
-> [String]
-> String
-> String
-> (ATPRetval, ProofStatus ProofTree)
atpRetValAndProofStatus GenericConfig ProofTree
cfg Named Sentence
namedGoal TimeOfDay
resultedTimeUsed [String]
axiomsUsed
String
szsStatusLine String
prover_name
(ATPRetval, GenericConfig ProofTree)
-> IO (ATPRetval, GenericConfig ProofTree)
forall (m :: * -> *) a. Monad m => a -> m a
return (ATPRetval
atpRetval, GenericConfig ProofTree
cfg { proofStatus :: ProofStatus ProofTree
proofStatus = ProofStatus ProofTree
resultedProofStatus
, resultOutput :: [String]
resultOutput = [String]
out
, timeUsed :: TimeOfDay
timeUsed = TimeOfDay
resultedTimeUsed })