**************************************************
Claim
    { termination = Standard
    , system = (VAR x1)
               (RULES a -> b ,
                      b a a c -> c c a a a a)
    , deadline = Just
                     (Time
                          -2040296272)
    }
is false because of
mirror image
  R' = { reverse(l) -> reverse(r) | (l -> r) in R }
    (VAR x1)
    (RULES a -> b ,
           c a a b -> a a a a c c)
      admits a looping transport system
          notation: http://dfa.imn.htwk-leipzig.de/matchbox/methods/loop.pdf
      pivot p = [ a , a , a ]
      block alphabet Gamma = [ [ a ] , [ c ] ]
      forall g in Gamma: g p ->^* p phi(g)  where
          phi = listToFM
                    [ ( [ a ] , [ [ a ] ] ) , ( [ c ] , [ [ a ] , [ c ] , [ c ] ] ) ]
              phi ([ a ]) = [ [ a ] ]
                  because of Derivation
                                 { lhs = [ a ] , rhs = [ a ] , hash_value = -165557840
                                 , strict = False , steps = [ ]
                                 }
              phi ([ c ]) = [ [ a ] , [ c ] , [ c ] ]
                  because of Derivation
                                 { lhs = [ c , a , a , a ] , rhs = [ a , a , a , a , c , c ]
                                 , hash_value = 1033226803 , strict = True
                                 , steps = [ Step
                                                 { rule = 0 , position = 3 }
                                           , Step
                                                 { rule = 1 , position = 0 }
                                           ]
                                 }
      start s = [ c ]
      exponent k = 6
      phi^k(s)  contains  s (.. p ..)^k
      this implies  there is a loop starting at  s p^k
**************************************************
statistics:
total atomic proof attempts
    number = 8, total = 5
    maximal = [ Log
                    { what = rfc match bounds (classical)
                    , start = Time
                                  -2040302203
                    , end = Time
                                -2040301700
                    , duration = 5 , success = False
                    }
              ]
successful atomic proof attempts
    number = 1, total = 0
    maximal = [ Log
                    { what = simplex
                    , start = Time
                                  -2040302204
                    , end = Time
                                -2040302204
                    , duration = 0 , success = True
                    }
              ]
failed atomic proof attempts
    number = 7, total = 5
    maximal = [ Log
                    { what = rfc match bounds (classical)
                    , start = Time
                                  -2040302203
                    , end = Time
                                -2040301700
                    , duration = 5 , success = False
                    }
              ]
**************************************************
matchbox general information (including details on proof methods):
http://dfa.imn.htwk-leipzig.de/matchbox/

this matchbox implementation uses the SAT solver
MiniSat by Niklas Een and Niklas Sörensson
http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/

matchbox process information
arguments      : --solver=/tmp/tmpBZ7WI9/matchbox-2007-06-01/minisat --timeout-command=/tmp/tmpBZ7WI9/matchbox-2007-06-01/timeout --tmpdir=tmp --timeout=60 /tmp/tmp.XqCgnkSYTd/a.srs
started        : Thu Jan 26 12:43:49 CET 2012
finished       : Thu Jan 26 12:43:55 CET 2012
run system     : Linux uc01-10 2.6.32-5-amd64 #1 SMP Mon Mar 7 21:35:22 UTC 2011 x86_64
release date   : Fri Jun 1 17:36:44 CEST 2007
build date     : Fri Jun 1 17:36:44 CEST 2007
build system   : Linux dfa 2.6.8-2-k7 #1 Tue Aug 16 14:00:15 UTC 2005 i686 GNU/Linux

used clock time: 6 secs