Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713819
details
property
value
status
complete
benchmark
#3.5b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0613329410553 seconds
cpu usage
0.047496326
max memory
4190208.0
stage attributes
key
value
output-size
7700
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_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 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(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) 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_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 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(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) 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_MINUS(false,s(x),y) -> MINUS(x,y) 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),y) -> IF_MINUS(le(s(x),y),s(x),y) MINUS(s(x),y) -> LE(s(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_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 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(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) 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_MINUS(false,s(x),y) -> MINUS(x,y) 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),y) -> IF_MINUS(le(s(x),y),s(x),y) MINUS(s(x),y) -> LE(s(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_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 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(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) 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: LE(s(x),s(y)) -> LE(x,y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472