**************************************************
Claim
    { termination = Standard
    , system = (VAR x1)
               (RULES c a b a -> a b a b c c a)
    , deadline = Just
                     (Time
                          -2040240058)
    }
is false because of
looping forward closure
of length 8
Derivation
    { lhs = [ c , a , b , a , b , a , b , a ]
    , rhs = [ a , b , a , b , a , b , a , b , c , a , b , a , b , a , b
            , a , b , c , c , a , b , c , c , a , b , c , c , a , b , c , c , a
            ]
    , hash_value = 211298313 , strict = True
    , steps = [ Step
                    { rule = 0 , position = 0 }
              , Step
                    { rule = 0 , position = 5 }
              , Step
                    { rule = 0 , position = 4 }
              , Step
                    { rule = 0 , position = 13 }
              , Step
                    { rule = 0 , position = 12 }
              , Step
                    { rule = 0 , position = 9 }
              , Step
                    { rule = 0 , position = 14 }
              , Step
                    { rule = 0 , position = 13 }
              ]
    }
this is closure number 8
**************************************************
statistics:
total atomic proof attempts
    number = 7, total = 5
    maximal = [ Log
                    { what = rfc match bounds (classical)
                    , start = Time
                                  -2040245957
                    , end = Time
                                -2040245453
                    , duration = 5 , success = False
                    }
              ]
successful atomic proof attempts
    number = 0, total = 0
    maximal = [ ]
failed atomic proof attempts
    number = 7, total = 5
    maximal = [ Log
                    { what = rfc match bounds (classical)
                    , start = Time
                                  -2040245957
                    , end = Time
                                -2040245453
                    , 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/tmppDZ_v0/matchbox-2007-06-01/minisat --timeout-command=/tmp/tmppDZ_v0/matchbox-2007-06-01/timeout --tmpdir=tmp --timeout=60 /tmp/tmp.9QFMVLgLoA/a.srs
started        : Thu Jan 26 12:53:11 CET 2012
finished       : Thu Jan 26 12:53:17 CET 2012
run system     : Linux uc01-02 2.6.32-5-amd64 #1 SMP Tue Jun 14 09:42:28 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