===========================================================
                                      .___ __  __   
          _________________  __ __  __| _/|__|/  |_ 
         / ___\_` __ \__  \ |  |  \/ __ | | \\_  __\
        / /_/  >  | \// __ \|  |  / /_/ | |  ||  |  
        \___  /|__|  (____  /____/\____ | |__||__|  
       /_____/            \/           \/           
              grep rough audit - static analysis tool
                  v2.8 written by @Wireghoul
=================================[justanotherhacker.com]===
minlog-4.0.99.20100221/modules/diatup.scm-267-(define (aconst-to-repro-formula1 x) (cadr (cddddr x)))
minlog-4.0.99.20100221/modules/diatup.scm:268:(define (aconst-to-repro-formula2 x) (caddr (cddddr x)))
minlog-4.0.99.20100221/modules/diatup.scm-269-(define FALSE_tm (make-term-in-const-form false-const))
##############################################
minlog-4.0.99.20100221/doc/mlcf.tex-3118-\indexentry{imitation} branch and $m$ \indexentry{projection}
minlog-4.0.99.20100221/doc/mlcf.tex:3119:branches, where $r = r_1, \dots, r_m$.  Imitation replaces the
minlog-4.0.99.20100221/doc/mlcf.tex-3120-flexible head $u$, using the substitution $\rho = \subst{}{u}{\lambda
##############################################
minlog-4.0.99.20100221/doc/mlcf.tex-3448-\]
minlog-4.0.99.20100221/doc/mlcf.tex:3449:where $\rho = \subst{}{u}{\lambda \vec{y} t}$, and $Q'$ is obtained
minlog-4.0.99.20100221/doc/mlcf.tex-3450-from $Q$ by removing $\exists u$.
##############################################
minlog-4.0.99.20100221/doc/mlcf.tex-4401-$\ex$-axioms; these will be defined below.  For derivations $M^A$
minlog-4.0.99.20100221/doc/mlcf.tex:4402:where $\tau(A) = \nulltype$ (i.e.\ $A$ is a Harrop formula) we define
minlog-4.0.99.20100221/doc/mlcf.tex-4403-$\extrTer{M} := \eps$ ($\eps$ some new symbol).  This applies in
##############################################
minlog-4.0.99.20100221/doc/mlcf.tex-4481-\]
minlog-4.0.99.20100221/doc/mlcf.tex:4482:where $\tau := \tau(A) \ne \nulltype$.  The variant
minlog-4.0.99.20100221/doc/mlcf.tex-4483-\[
##############################################
minlog-4.0.99.20100221/doc/reflection_manual.tex-168-valued function applied to two arguments. The general pattern is
minlog-4.0.99.20100221/doc/reflection_manual.tex:169:$f(t_1,t_2)$ where $f$ is of type $R=>R=>boole$ and $t_1$ and
minlog-4.0.99.20100221/doc/reflection_manual.tex-170-$t_2$ are terms of type of $R$. Moreover $R$ must be discrete,
##############################################
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-342-(define (get-fieldinfo x)
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm:343:  (caddr (cddadr (assoc x INITIALISED-TYPES))))
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-344-
##############################################
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-349-(define (get-one x)
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm:350:  (caddr (get-basics1 x)))
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-351-(define (get-plus x)
##############################################
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-362-(define (get-ExpLemma3 x)
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm:363:  (caddr (get-explemmas x)))
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-364-
##############################################
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-369-(define (get-PlusComm x)
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm:370:  (caddr (get-semiringaxioms1 x)))
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-371-(define (get-TimesAssoc x)
##############################################
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-377-(define (get-Distr x)
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm:378:  (caddr (get-semiringaxioms2 x)))
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-379-
##############################################
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-384-(define (get-NegativeLemma1 x)
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm:385:  (caddr (get-ringinfo1 x)))
minlog-4.0.99.20100221/examples/ordinals/reflection_alpha.scm-386-(define (get-NegativeLemma2 x)
##############################################
minlog-4.0.99.20100221/src/term.scm-1206-	   (not (member (car (cadr (car expr)))
minlog-4.0.99.20100221/src/term.scm:1207:			(expr-to-free (caddr (car expr))))))
minlog-4.0.99.20100221/src/term.scm:1208:      (caddr (car expr))
minlog-4.0.99.20100221/src/term.scm-1209-      expr))
##############################################
minlog-4.0.99.20100221/src/typ.scm-1061-(define (alg-name-to-simalg-names alg-name) (cadr (assoc alg-name ALGEBRAS)))
minlog-4.0.99.20100221/src/typ.scm:1062:(define (alg-name-to-token-type alg-name) (caddr (assoc alg-name ALGEBRAS)))
minlog-4.0.99.20100221/src/typ.scm-1063-(define (alg-name-to-typed-constr-names alg-name)
##############################################
minlog-4.0.99.20100221/src/pconst.scm-82-(define (const-to-tsubst x) (cadr (cddddr x)))
minlog-4.0.99.20100221/src/pconst.scm:83:(define (const-to-t-deg x) (caddr (cddddr x)))
minlog-4.0.99.20100221/src/pconst.scm-84-(define (const-to-token-type x) (cadddr (cddddr x)))
##############################################
minlog-4.0.99.20100221/src/pconst.scm-103-	     (tsubst (cadr (cddddr x)))
minlog-4.0.99.20100221/src/pconst.scm:104:	     (t-deg (caddr (cddddr x)))
minlog-4.0.99.20100221/src/pconst.scm-105-	     (token-type (cadddr (cddddr x))))
##############################################
minlog-4.0.99.20100221/src/pproof.scm-237-(define (pproof-state-to-maxgoal . x)
minlog-4.0.99.20100221/src/pproof.scm:238:  (if (null? x) (caddr PPROOF-STATE) (caddr (car x))))
minlog-4.0.99.20100221/src/pproof.scm-239-