************************************************** Claim { termination = Standard , system = (VAR x1) (RULES 0 0 0 0 -> 0 1 0 1 , 1 0 0 1 -> 0 0 1 0) , deadline = Just (Time -2040404301) } is false because of looping forward closure of length 30 Derivation { lhs = [ 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 , 1 , 0 , 1 , 0 , 1 ] , rhs = [ 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 , 1 , 0 , 1 , 0 , 1 ] , hash_value = -167353335 , strict = True , steps = [ Step { rule = 0 , position = 0 } , Step { rule = 1 , position = 3 } , Step { rule = 1 , position = 5 } , Step { rule = 0 , position = 3 } , Step { rule = 1 , position = 1 } , Step { rule = 1 , position = 3 } , Step { rule = 1 , position = 7 } , Step { rule = 1 , position = 9 } , Step { rule = 0 , position = 7 } , Step { rule = 1 , position = 5 } , Step { rule = 1 , position = 7 } , Step { rule = 0 , position = 3 } , Step { rule = 1 , position = 6 } , Step { rule = 1 , position = 8 } , Step { rule = 0 , position = 6 } , Step { rule = 1 , position = 4 } , Step { rule = 0 , position = 2 } , Step { rule = 1 , position = 6 } , Step { rule = 1 , position = 5 } , Step { rule = 1 , position = 7 } , Step { rule = 0 , position = 5 } , Step { rule = 1 , position = 3 } , Step { rule = 1 , position = 5 } , Step { rule = 0 , position = 1 } , Step { rule = 1 , position = 4 } , Step { rule = 1 , position = 6 } , Step { rule = 0 , position = 4 } , Step { rule = 1 , position = 2 } , Step { rule = 0 , position = 9 } , Step { rule = 1 , position = 4 } ] } this is closure number 974 ************************************************** statistics: total atomic proof attempts number = 10, total = 6 maximal = [ Log { what = rfc match bounds (classical) , start = Time -2040410172 , end = Time -2040409668 , duration = 5 , success = False } ] successful atomic proof attempts number = 3, total = 0 maximal = [ Log { what = simplex , start = Time -2040410172 , end = Time -2040410172 , duration = 0 , success = True } , Log { what = simplex , start = Time -2040410173 , end = Time -2040410173 , duration = 0 , success = True } , Log { what = simplex , start = Time -2040410172 , end = Time -2040410172 , duration = 0 , success = True } ] failed atomic proof attempts number = 7, total = 6 maximal = [ Log { what = rfc match bounds (classical) , start = Time -2040410172 , end = Time -2040409668 , 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/tmpzMGfFQ/matchbox-2007-06-01/minisat --timeout-command=/tmp/tmpzMGfFQ/matchbox-2007-06-01/timeout --tmpdir=tmp --timeout=60 /tmp/tmp.DFp1Nz0xBP/a.srs started : Thu Jan 26 12:25:36 CET 2012 finished : Thu Jan 26 12:25:43 CET 2012 run system : Linux uc01-04 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: 7 secs