**************************************************
Claim
{ termination = Standard
, system = (VAR x1)
(RULES a -> ,
a b -> b c ,
c c -> b a c a a)
, deadline = Just
(Time
-2040323608)
}
is false because of
looping forward closure
of length 28
Derivation
{ lhs = [ c , c , c , b , c ]
, rhs = [ b , b , b , c , b , b , b , b , a , c , b , c , c , c , b
, c , a , a , a
]
, hash_value = -1450108015 , strict = True
, steps = [ Step
{ rule = 2 , position = 0 }
, Step
{ rule = 0 , position = 3 }
, Step
{ rule = 0 , position = 3 }
, Step
{ rule = 2 , position = 2 }
, Step
{ rule = 0 , position = 3 }
, Step
{ rule = 1 , position = 1 }
, Step
{ rule = 1 , position = 5 }
, Step
{ rule = 1 , position = 4 }
, Step
{ rule = 2 , position = 2 }
, Step
{ rule = 1 , position = 6 }
, Step
{ rule = 1 , position = 5 }
, Step
{ rule = 2 , position = 6 }
, Step
{ rule = 0 , position = 9 }
, Step
{ rule = 0 , position = 9 }
, Step
{ rule = 2 , position = 8 }
, Step
{ rule = 1 , position = 7 }
, Step
{ rule = 2 , position = 13 }
, Step
{ rule = 1 , position = 12 }
, Step
{ rule = 0 , position = 14 }
, Step
{ rule = 2 , position = 13 }
, Step
{ rule = 0 , position = 9 }
, Step
{ rule = 1 , position = 10 }
, Step
{ rule = 0 , position = 15 }
, Step
{ rule = 2 , position = 8 }
, Step
{ rule = 0 , position = 16 }
, Step
{ rule = 1 , position = 12 }
, Step
{ rule = 0 , position = 3 }
, Step
{ rule = 1 , position = 10 }
]
}
this is closure number 1998
**************************************************
statistics:
total atomic proof attempts
number = 8, total = 5
maximal = [ Log
{ what = rfc match bounds (classical)
, start = Time
-2040329564
, end = Time
-2040329060
, duration = 5 , success = False
}
]
successful atomic proof attempts
number = 1, total = 0
maximal = [ Log
{ what = simplex
, start = Time
-2040329564
, end = Time
-2040329564
, duration = 0 , success = True
}
]
failed atomic proof attempts
number = 7, total = 5
maximal = [ Log
{ what = rfc match bounds (classical)
, start = Time
-2040329564
, end = Time
-2040329060
, 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/tmpE945V7/matchbox-2007-06-01/minisat --timeout-command=/tmp/tmpE945V7/matchbox-2007-06-01/timeout --tmpdir=tmp --timeout=60 /tmp/tmp.xHUhXP6cEY/a.srs
started : Thu Jan 26 12:39:40 CET 2012
finished : Thu Jan 26 12:39:47 CET 2012
run system : Linux uc01-01 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