**************************************************
Claim
{ termination = Standard
, system = (VAR x1)
(RULES a -> b c ,
a b b -> c a a a ,
c c ->)
, deadline = Just
(Time
-2040279275)
}
is false because of
mirror image
R' = { reverse(l) -> reverse(r) | (l -> r) in R }
(VAR x1)
(RULES a -> c b ,
b b a -> a a a c ,
c c ->)
looping forward closure
of length 35
Derivation
{ lhs = [ b , b , a , c , b , a , c , b , a ]
, rhs = [ b , b , a , c , b , a , c , b , a , c , c ]
, hash_value = -1667448543 , strict = True
, steps = [ Step
{ rule = 1 , position = 0 }
, Step
{ rule = 0 , position = 2 }
, Step
{ rule = 2 , position = 4 }
, Step
{ rule = 1 , position = 3 }
, Step
{ rule = 0 , position = 3 }
, Step
{ rule = 2 , position = 2 }
, Step
{ rule = 0 , position = 1 }
, Step
{ rule = 1 , position = 2 }
, Step
{ rule = 0 , position = 2 }
, Step
{ rule = 0 , position = 5 }
, Step
{ rule = 0 , position = 0 }
, Step
{ rule = 2 , position = 2 }
, Step
{ rule = 1 , position = 1 }
, Step
{ rule = 2 , position = 4 }
, Step
{ rule = 2 , position = 7 }
, Step
{ rule = 0 , position = 3 }
, Step
{ rule = 0 , position = 7 }
, Step
{ rule = 2 , position = 6 }
, Step
{ rule = 1 , position = 6 }
, Step
{ rule = 1 , position = 4 }
, Step
{ rule = 0 , position = 8 }
, Step
{ rule = 2 , position = 7 }
, Step
{ rule = 0 , position = 4 }
, Step
{ rule = 0 , position = 2 }
, Step
{ rule = 0 , position = 8 }
, Step
{ rule = 2 , position = 4 }
, Step
{ rule = 1 , position = 3 }
, Step
{ rule = 2 , position = 6 }
, Step
{ rule = 0 , position = 1 }
, Step
{ rule = 2 , position = 0 }
, Step
{ rule = 1 , position = 5 }
, Step
{ rule = 0 , position = 4 }
, Step
{ rule = 0 , position = 7 }
, Step
{ rule = 0 , position = 2 }
, Step
{ rule = 2 , position = 1 }
]
}
this is closure number 6940
**************************************************
statistics:
total atomic proof attempts
number = 11, total = 6
maximal = [ Log
{ what = rfc match bounds (classical)
, start = Time
-2040285209
, end = Time
-2040284705
, duration = 5 , success = False
}
]
successful atomic proof attempts
number = 4, total = 0
maximal = [ Log
{ what = simplex
, start = Time
-2040285209
, end = Time
-2040285209
, duration = 0 , success = True
}
, Log
{ what = simplex
, start = Time
-2040285210
, end = Time
-2040285210
, duration = 0 , success = True
}
, Log
{ what = simplex
, start = Time
-2040285209
, end = Time
-2040285209
, duration = 0 , success = True
}
, Log
{ what = simplex
, start = Time
-2040285210
, end = Time
-2040285210
, duration = 0 , success = True
}
]
failed atomic proof attempts
number = 7, total = 6
maximal = [ Log
{ what = rfc match bounds (classical)
, start = Time
-2040285209
, end = Time
-2040284705
, 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/tmpiw4Lsz/matchbox-2007-06-01/minisat --timeout-command=/tmp/tmpiw4Lsz/matchbox-2007-06-01/timeout --tmpdir=tmp --timeout=60 /tmp/tmp.o7USUuBZyh/a.srs
started : Thu Jan 26 12:46:36 CET 2012
finished : Thu Jan 26 12:46:43 CET 2012
run system : Linux uc01-12 2.6.32-5-amd64 #1 SMP Wed Jan 12 03:40:32 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