Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712022
details
property
value
status
complete
benchmark
thiemann10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.108237981796 seconds
cpu usage
0.085379068
max memory
4182016.0
stage attributes
key
value
output-size
6915
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 l x) (RULES conv(x) -> conviter(x,cons(0,nil)) conviter(x,l) -> if(zero(x),x,l) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,l) -> conviter(half(x),cons(lastbit(x),l)) if(true,x,l) -> l lastbit(0) -> 0 lastbit(s(0)) -> s(0) lastbit(s(s(x))) -> lastbit(x) zero(0) -> true zero(s(x)) -> false ) Problem 1: Innermost Equivalent Processor: -> Rules: conv(x) -> conviter(x,cons(0,nil)) conviter(x,l) -> if(zero(x),x,l) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,l) -> conviter(half(x),cons(lastbit(x),l)) if(true,x,l) -> l lastbit(0) -> 0 lastbit(s(0)) -> s(0) lastbit(s(s(x))) -> lastbit(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: CONV(x) -> CONVITER(x,cons(0,nil)) CONVITER(x,l) -> IF(zero(x),x,l) CONVITER(x,l) -> ZERO(x) HALF(s(s(x))) -> HALF(x) IF(false,x,l) -> CONVITER(half(x),cons(lastbit(x),l)) IF(false,x,l) -> HALF(x) IF(false,x,l) -> LASTBIT(x) LASTBIT(s(s(x))) -> LASTBIT(x) -> Rules: conv(x) -> conviter(x,cons(0,nil)) conviter(x,l) -> if(zero(x),x,l) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,l) -> conviter(half(x),cons(lastbit(x),l)) if(true,x,l) -> l lastbit(0) -> 0 lastbit(s(0)) -> s(0) lastbit(s(s(x))) -> lastbit(x) zero(0) -> true zero(s(x)) -> false Problem 1: SCC Processor: -> Pairs: CONV(x) -> CONVITER(x,cons(0,nil)) CONVITER(x,l) -> IF(zero(x),x,l) CONVITER(x,l) -> ZERO(x) HALF(s(s(x))) -> HALF(x) IF(false,x,l) -> CONVITER(half(x),cons(lastbit(x),l)) IF(false,x,l) -> HALF(x) IF(false,x,l) -> LASTBIT(x) LASTBIT(s(s(x))) -> LASTBIT(x) -> Rules: conv(x) -> conviter(x,cons(0,nil)) conviter(x,l) -> if(zero(x),x,l) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) if(false,x,l) -> conviter(half(x),cons(lastbit(x),l)) if(true,x,l) -> l lastbit(0) -> 0 lastbit(s(0)) -> s(0) lastbit(s(s(x))) -> lastbit(x) zero(0) -> true zero(s(x)) -> false ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LASTBIT(s(s(x))) -> LASTBIT(x)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472