**************************************************
Claim
    { termination = Standard
    , system = (VAR x1)
               (RULES a -> ,
                      a a b -> c c c ,
                      c -> b a ,
                      c b ->)
    , deadline = Just
                     (Time
                          -2040334463)
    }
is false because of
looping forward closure
of length 16
Derivation
    { lhs = [ a , a , b , a , b , a , b ]
    , rhs = [ b , b , a , a , b , a , b , a , b , a ]
    , hash_value = -737944221 , strict = True
    , steps = [ Step
                    { rule = 1 , position = 0 }
              , Step
                    { rule = 2 , position = 2 }
              , Step
                    { rule = 1 , position = 3 }
              , Step
                    { rule = 2 , position = 4 }
              , Step
                    { rule = 3 , position = 1 }
              , Step
                    { rule = 3 , position = 1 }
              , Step
                    { rule = 2 , position = 2 }
              , Step
                    { rule = 2 , position = 0 }
              , Step
                    { rule = 1 , position = 1 }
              , Step
                    { rule = 2 , position = 1 }
              , Step
                    { rule = 2 , position = 4 }
              , Step
                    { rule = 1 , position = 6 }
              , Step
                    { rule = 3 , position = 3 }
              , Step
                    { rule = 2 , position = 4 }
              , Step
                    { rule = 2 , position = 6 }
              , Step
                    { rule = 2 , position = 8 }
              ]
    }
this is closure number 5452
**************************************************
statistics:
total atomic proof attempts
    number = 8, total = 6
    maximal = [ Log
                    { what = rfc match bounds (classical)
                    , start = Time
                                  -2040340408
                    , end = Time
                                -2040339905
                    , duration = 5 , success = False
                    }
              ]
successful atomic proof attempts
    number = 1, total = 0
    maximal = [ Log
                    { what = simplex
                    , start = Time
                                  -2040340409
                    , end = Time
                                -2040340409
                    , duration = 0 , success = True
                    }
              ]
failed atomic proof attempts
    number = 7, total = 6
    maximal = [ Log
                    { what = rfc match bounds (classical)
                    , start = Time
                                  -2040340408
                    , end = Time
                                -2040339905
                    , 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/tmpLPb48N/matchbox-2007-06-01/minisat --timeout-command=/tmp/tmpLPb48N/matchbox-2007-06-01/timeout --tmpdir=tmp --timeout=60 /tmp/tmp.n7CK4m4eSf/a.srs
started        : Thu Jan 26 12:37:18 CET 2012
finished       : Thu Jan 26 12:37:25 CET 2012
run system     : Linux uc01-03 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: 7 secs