void symbol_Init(BOOL Signature)
/**************************************************************
INPUT: A flag indicating whether a signature is used or not.
RETURNS: None.
SUMMARY: Initializes the Symbol Module.
EFFECTS: Initializes global variables.
CAUTION: MUST BE CALLED BEFORE ANY OTHER Symbol-FUNCTION.
***************************************************************/
{
symbol_ResetSkolemIndex();
symbol_ContextClean();
if (Signature)
symbol_SIGNATURE = (SIGNATURE*)memory_Malloc(sizeof(SIGNATURE[symbol__MAXSIGNATURE]));
symbol_STANDARDVARCOUNTER = symbol_GetInitialStandardVarCounter();
symbol_INDEXVARCOUNTER = symbol_GetInitialIndexVarCounter();
symbol_ACTINDEX = 1;
symbol_ORDERING = 1;
symbol_VARSTRING = memory_Malloc(symbol__SYMBOLMAXLEN);
symbol_HASSIGNATURE = Signature;
symbol_FREEDSYMBOLS = list_Nil();
}
void ana_AnalyzeProblem(PROOFSEARCH Search, LIST Clauses)
/**************************************************************
INPUT: A proofsearch object and a list of clauses.
RETURNS: Void.
EFFECT: Analyzes the clauses and sets the analyze variables.
Recomputes the weight for the clauses.
<Search> is modified according to clauses: non trivial domain number
is set
***************************************************************/
{
CLAUSE Clause;
ana_EQUATIONS = FALSE;
ana_PEQUATIONS = FALSE; /* Defaults for properties */
ana_NEQUATIONS = FALSE;
ana_FUNCTIONS = FALSE;
ana_FINDOMAIN = FALSE;
ana_NONTRIVDOMAIN = FALSE;
ana_MONADIC = FALSE;
ana_NONMONADIC = FALSE;
ana_PROP = FALSE;
ana_GROUND = FALSE;
ana_SORTRES = FALSE;
ana_USORTRES = FALSE;
ana_NONUNIT = FALSE;
ana_CONGROUND = TRUE;
ana_AXIOMCLAUSES = 0;
ana_CONCLAUSES = 0;
ana_NONHORNCLAUSES = 0;
list_Delete(ana_FINITEMONADICPREDICATES);
ana_FINITEMONADICPREDICATES = list_Nil();
if (list_Empty(Clauses))
return;
ana_FINITEMONADICPREDICATES = clause_FiniteMonadicPredicates(Clauses);
while (!list_Empty(Clauses)) {
Clause = (CLAUSE)list_Car(Clauses);
clause_UpdateWeight(Clause, prfs_Store(Search));
if (clause_GetFlag(Clause,CONCLAUSE))
ana_CONCLAUSES++;
else
ana_AXIOMCLAUSES++;
if (clause_NumOfSuccLits(Clause) > 1)
ana_NONHORNCLAUSES++;
if (ana_CONGROUND && clause_GetFlag(Clause,CONCLAUSE) &&
clause_MaxVar(Clause) != symbol_GetInitialStandardVarCounter())
ana_CONGROUND = FALSE;
if (!ana_PEQUATIONS && clause_ContainsPositiveEquations(Clause)) {
ana_PEQUATIONS = TRUE;
}
if (!ana_NEQUATIONS && clause_ContainsNegativeEquations(Clause)) {
ana_NEQUATIONS = TRUE;
}
if (!ana_MONADIC || !ana_NONMONADIC || !ana_PROP || !ana_GROUND)
clause_ContainsFolAtom(Clause,&ana_PROP,&ana_GROUND,&ana_MONADIC,&ana_NONMONADIC);
if (!ana_FUNCTIONS && clause_ContainsFunctions(Clause)) {
ana_FUNCTIONS = TRUE;
}
if (!ana_FINDOMAIN && clause_ImpliesFiniteDomain(Clause)) {
ana_FINDOMAIN = TRUE;
}
if (!ana_NONTRIVDOMAIN && clause_ImpliesNonTrivialDomain(Clause)) {
prfs_SetNonTrivClauseNumber(Search, clause_Number(Clause));
ana_NONTRIVDOMAIN = TRUE;
}
if (!ana_NONUNIT && clause_Length(Clause) > 1) {
ana_NONUNIT = TRUE;
}
if (!ana_SORTRES || !ana_USORTRES)
clause_ContainsSortRestriction(Clause,&ana_SORTRES,&ana_USORTRES);
Clauses = list_Cdr(Clauses);
}
ana_PUREEQUATIONAL = ((ana_PEQUATIONS || ana_NEQUATIONS) && !ana_MONADIC &&
!ana_NONMONADIC && !ana_PROP && !ana_GROUND);
ana_EQUATIONS = (ana_PEQUATIONS || ana_NEQUATIONS);
ana_PUREPROPOSITIONAL = (!ana_PEQUATIONS && !ana_NEQUATIONS &&!ana_MONADIC &&
!ana_NONMONADIC && ana_PROP);
}
