Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714132
details
property
value
status
complete
benchmark
thiemann16.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
3.50841403008 seconds
cpu usage
3.30229317
max memory
2.0463616E7
stage attributes
key
value
output-size
16449
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 u x y z) (RULES check(0) -> zero check(s(0)) -> odd check(s(s(0))) -> even check(s(s(s(x)))) -> check(s(x)) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(even,x,y,z,u) -> plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z)))) if(odd,x,y,z,u) -> timesIter(p(x),y,u) if(zero,x,y,z,u) -> z p(0) -> 0 p(s(x)) -> x plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) times(x,y) -> timesIter(x,y,0) timesIter(x,y,z) -> if(check(x),x,y,z,plus(z,y)) ) Problem 1: Innermost Equivalent Processor: -> Rules: check(0) -> zero check(s(0)) -> odd check(s(s(0))) -> even check(s(s(s(x)))) -> check(s(x)) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(even,x,y,z,u) -> plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z)))) if(odd,x,y,z,u) -> timesIter(p(x),y,u) if(zero,x,y,z,u) -> z p(0) -> 0 p(s(x)) -> x plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) times(x,y) -> timesIter(x,y,0) timesIter(x,y,z) -> if(check(x),x,y,z,plus(z,y)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: CHECK(s(s(s(x)))) -> CHECK(s(x)) HALF(s(s(x))) -> HALF(x) IF(even,x,y,z,u) -> HALF(s(z)) IF(even,x,y,z,u) -> HALF(x) IF(even,x,y,z,u) -> HALF(z) IF(even,x,y,z,u) -> PLUS(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z)))) IF(even,x,y,z,u) -> TIMESITER(half(x),y,half(s(z))) IF(even,x,y,z,u) -> TIMESITER(half(x),y,half(z)) IF(odd,x,y,z,u) -> P(x) IF(odd,x,y,z,u) -> TIMESITER(p(x),y,u) PLUS(s(x),y) -> PLUS(x,y) TIMES(x,y) -> TIMESITER(x,y,0) TIMESITER(x,y,z) -> CHECK(x) TIMESITER(x,y,z) -> IF(check(x),x,y,z,plus(z,y)) TIMESITER(x,y,z) -> PLUS(z,y) -> Rules: check(0) -> zero check(s(0)) -> odd check(s(s(0))) -> even check(s(s(s(x)))) -> check(s(x)) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(even,x,y,z,u) -> plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z)))) if(odd,x,y,z,u) -> timesIter(p(x),y,u) if(zero,x,y,z,u) -> z p(0) -> 0 p(s(x)) -> x plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) times(x,y) -> timesIter(x,y,0) timesIter(x,y,z) -> if(check(x),x,y,z,plus(z,y)) Problem 1: SCC Processor: -> Pairs: CHECK(s(s(s(x)))) -> CHECK(s(x)) HALF(s(s(x))) -> HALF(x) IF(even,x,y,z,u) -> HALF(s(z)) IF(even,x,y,z,u) -> HALF(x) IF(even,x,y,z,u) -> HALF(z) IF(even,x,y,z,u) -> PLUS(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472