úÎ%û      Safe-Inferred$Make a new sort with the input name  Safe-Inferred BReturns false if the literal is an atomic formula and true if the . literal is the negation of an atomic formula 0Returns the atomic formula of the given literal Returns a new atom GReturn the terms that are arguments to the predicate of the input atom 3Return the name of the predicate of the input atom AReturns True if the input term is a function with the give name,  and false otherwise 'Return the name of the input variable, . throws error if input term is not a variable Returns the input function's argument list, . throws error if input term is not a function =Returns the integer value of an Integer constant or an error  if the input is not an integer  !"#$ %&'    ! "$# %&' Safe-Inferred.Description of a decidable first order theory $Specify a new predicate declaration #Specify a new function declaration ()  ()*      !"#$% &'()* +FirstOrderTheory-0.1.0.4FirstOrderTheory.UtilsFirstOrderTheory.SyntaxFirstOrderTheory.TheorySortArityNamesortTermAtomLiterallitnLitisNeggetAtomatomatomArgs predicateNamefuncvarintConstisFunctionWithNamevarNamefuncArgsintValFirstOrderTheory theoryNamesorts predicates functions decideSat FunctionDecl PredicateDecl predicateDecl functionDeclIntegerVariableFunctionNegLit $fShowTerm $fShowAtom $fShowLiteral