Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713855
details
property
value
status
complete
benchmark
#3.5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.041445016861 seconds
cpu usage
0.037878998
max memory
3821568.0
stage attributes
key
value
output-size
6182
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 y) (RULES if_mod(false,s(x),s(y)) -> s(x) if_mod(true,s(x),s(y)) -> mod(minus(x,y),s(y)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x mod(0,y) -> 0 mod(s(x),0) -> 0 mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) ) Problem 1: Innermost Equivalent Processor: -> Rules: if_mod(false,s(x),s(y)) -> s(x) if_mod(true,s(x),s(y)) -> mod(minus(x,y),s(y)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x mod(0,y) -> 0 mod(s(x),0) -> 0 mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: IF_MOD(true,s(x),s(y)) -> MINUS(x,y) IF_MOD(true,s(x),s(y)) -> MOD(minus(x,y),s(y)) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) MOD(s(x),s(y)) -> IF_MOD(le(y,x),s(x),s(y)) MOD(s(x),s(y)) -> LE(y,x) -> Rules: if_mod(false,s(x),s(y)) -> s(x) if_mod(true,s(x),s(y)) -> mod(minus(x,y),s(y)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x mod(0,y) -> 0 mod(s(x),0) -> 0 mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) Problem 1: SCC Processor: -> Pairs: IF_MOD(true,s(x),s(y)) -> MINUS(x,y) IF_MOD(true,s(x),s(y)) -> MOD(minus(x,y),s(y)) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) MOD(s(x),s(y)) -> IF_MOD(le(y,x),s(x),s(y)) MOD(s(x),s(y)) -> LE(y,x) -> Rules: if_mod(false,s(x),s(y)) -> s(x) if_mod(true,s(x),s(y)) -> mod(minus(x,y),s(y)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x mod(0,y) -> 0 mod(s(x),0) -> 0 mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(s(x),s(y)) -> MINUS(x,y) ->->-> Rules: if_mod(false,s(x),s(y)) -> s(x) if_mod(true,s(x),s(y)) -> mod(minus(x,y),s(y)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x mod(0,y) -> 0 mod(s(x),0) -> 0 mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) ->->Cycle:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472