Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711749
details
property
value
status
complete
benchmark
#4.26.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0808110237122 seconds
cpu usage
0.059250858
max memory
3801088.0
stage attributes
key
value
output-size
3783
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 if(false,x,y) -> s(minus(p(x),y)) if(true,x,y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) p(0) -> 0 p(s(x)) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: if(false,x,y) -> s(minus(p(x),y)) if(true,x,y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) p(0) -> 0 p(s(x)) -> x -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: IF(false,x,y) -> MINUS(p(x),y) IF(false,x,y) -> P(x) LE(s(x),s(y)) -> LE(x,y) MINUS(x,y) -> IF(le(x,y),x,y) MINUS(x,y) -> LE(x,y) -> Rules: if(false,x,y) -> s(minus(p(x),y)) if(true,x,y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) p(0) -> 0 p(s(x)) -> x Problem 1: SCC Processor: -> Pairs: IF(false,x,y) -> MINUS(p(x),y) IF(false,x,y) -> P(x) LE(s(x),s(y)) -> LE(x,y) MINUS(x,y) -> IF(le(x,y),x,y) MINUS(x,y) -> LE(x,y) -> Rules: if(false,x,y) -> s(minus(p(x),y)) if(true,x,y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) p(0) -> 0 p(s(x)) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LE(s(x),s(y)) -> LE(x,y) ->->-> Rules: if(false,x,y) -> s(minus(p(x),y)) if(true,x,y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) p(0) -> 0 p(s(x)) -> x ->->Cycle: ->->-> Pairs: IF(false,x,y) -> MINUS(p(x),y) MINUS(x,y) -> IF(le(x,y),x,y) ->->-> Rules: if(false,x,y) -> s(minus(p(x),y)) if(true,x,y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) 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