Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714268
details
property
value
status
complete
benchmark
thiemann15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.374602794647 seconds
cpu usage
0.076938638
max memory
3981312.0
stage attributes
key
value
output-size
6325
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x y) (RULES bitIter(x,y) -> if(zero(x),x,inc(y)) bits(x) -> bitIter(x,0) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,y) -> bitIter(half(x),y) if(true,x,y) -> p(y) inc(0) -> 0 inc(s(x)) -> s(inc(x)) p(0) -> 0 p(s(x)) -> x zero(0) -> true zero(s(x)) -> false ) Problem 1: Innermost Equivalent Processor: -> Rules: bitIter(x,y) -> if(zero(x),x,inc(y)) bits(x) -> bitIter(x,0) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,y) -> bitIter(half(x),y) if(true,x,y) -> p(y) inc(0) -> 0 inc(s(x)) -> s(inc(x)) p(0) -> 0 p(s(x)) -> x zero(0) -> true zero(s(x)) -> false -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: BITITER(x,y) -> IF(zero(x),x,inc(y)) BITITER(x,y) -> INC(y) BITITER(x,y) -> ZERO(x) BITS(x) -> BITITER(x,0) HALF(s(s(x))) -> HALF(x) IF(false,x,y) -> BITITER(half(x),y) IF(false,x,y) -> HALF(x) IF(true,x,y) -> P(y) INC(s(x)) -> INC(x) -> Rules: bitIter(x,y) -> if(zero(x),x,inc(y)) bits(x) -> bitIter(x,0) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,y) -> bitIter(half(x),y) if(true,x,y) -> p(y) inc(0) -> 0 inc(s(x)) -> s(inc(x)) p(0) -> 0 p(s(x)) -> x zero(0) -> true zero(s(x)) -> false Problem 1: SCC Processor: -> Pairs: BITITER(x,y) -> IF(zero(x),x,inc(y)) BITITER(x,y) -> INC(y) BITITER(x,y) -> ZERO(x) BITS(x) -> BITITER(x,0) HALF(s(s(x))) -> HALF(x) IF(false,x,y) -> BITITER(half(x),y) IF(false,x,y) -> HALF(x) IF(true,x,y) -> P(y) INC(s(x)) -> INC(x) -> Rules: bitIter(x,y) -> if(zero(x),x,inc(y)) bits(x) -> bitIter(x,0) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,y) -> bitIter(half(x),y) if(true,x,y) -> p(y) inc(0) -> 0 inc(s(x)) -> s(inc(x)) p(0) -> 0 p(s(x)) -> x
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472