Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712652
details
property
value
status
complete
benchmark
#4.28.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0663352012634 seconds
cpu usage
0.045143513
max memory
3465216.0
stage attributes
key
value
output-size
2814
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x) (RULES bits(0) -> 0 bits(s(x)) -> s(bits(half(s(x)))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) ) Problem 1: Innermost Equivalent Processor: -> Rules: bits(0) -> 0 bits(s(x)) -> s(bits(half(s(x)))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: BITS(s(x)) -> BITS(half(s(x))) BITS(s(x)) -> HALF(s(x)) HALF(s(s(x))) -> HALF(x) -> Rules: bits(0) -> 0 bits(s(x)) -> s(bits(half(s(x)))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) Problem 1: SCC Processor: -> Pairs: BITS(s(x)) -> BITS(half(s(x))) BITS(s(x)) -> HALF(s(x)) HALF(s(s(x))) -> HALF(x) -> Rules: bits(0) -> 0 bits(s(x)) -> s(bits(half(s(x)))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: HALF(s(s(x))) -> HALF(x) ->->-> Rules: bits(0) -> 0 bits(s(x)) -> s(bits(half(s(x)))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) ->->Cycle: ->->-> Pairs: BITS(s(x)) -> BITS(half(s(x))) ->->-> Rules: bits(0) -> 0 bits(s(x)) -> s(bits(half(s(x)))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: HALF(s(s(x))) -> HALF(x) -> Rules: bits(0) -> 0 bits(s(x)) -> s(bits(half(s(x)))) half(0) -> 0 half(s(0)) -> 0 half(s(s(x))) -> s(half(x)) ->Projection: pi(HALF) = 1 Problem 1.1: SCC Processor: -> Pairs: Empty
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472