Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487067454
details
property
value
status
complete
benchmark
#3.6b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n175.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0617459 seconds
cpu usage
0.052227
user time
0.023895
system time
0.028332
max virtual memory
113188.0
max residence set size
5960.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES gcd(0,y:S) -> y:S gcd(s(x:S),0) -> s(x:S) gcd(s(x:S),s(y:S)) -> if_gcd(le(y:S,x:S),s(x:S),s(y:S)) if_gcd(ffalse,s(x:S),s(y:S)) -> gcd(minus(y:S,x:S),s(x:S)) if_gcd(ttrue,s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) if_minus(ffalse,s(x:S),y:S) -> s(minus(x:S,y:S)) if_minus(ttrue,s(x:S),y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(0,y:S) -> 0 minus(s(x:S),y:S) -> if_minus(le(s(x:S),y:S),s(x:S),y:S) ) Problem 1: Innermost Equivalent Processor: -> Rules: gcd(0,y:S) -> y:S gcd(s(x:S),0) -> s(x:S) gcd(s(x:S),s(y:S)) -> if_gcd(le(y:S,x:S),s(x:S),s(y:S)) if_gcd(ffalse,s(x:S),s(y:S)) -> gcd(minus(y:S,x:S),s(x:S)) if_gcd(ttrue,s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) if_minus(ffalse,s(x:S),y:S) -> s(minus(x:S,y:S)) if_minus(ttrue,s(x:S),y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(0,y:S) -> 0 minus(s(x:S),y:S) -> if_minus(le(s(x:S),y:S),s(x:S),y:S) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: GCD(s(x:S),s(y:S)) -> IF_GCD(le(y:S,x:S),s(x:S),s(y:S)) GCD(s(x:S),s(y:S)) -> LE(y:S,x:S) IF_GCD(ffalse,s(x:S),s(y:S)) -> GCD(minus(y:S,x:S),s(x:S)) IF_GCD(ffalse,s(x:S),s(y:S)) -> MINUS(y:S,x:S) IF_GCD(ttrue,s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) IF_GCD(ttrue,s(x:S),s(y:S)) -> MINUS(x:S,y:S) IF_MINUS(ffalse,s(x:S),y:S) -> MINUS(x:S,y:S) LE(s(x:S),s(y:S)) -> LE(x:S,y:S) MINUS(s(x:S),y:S) -> IF_MINUS(le(s(x:S),y:S),s(x:S),y:S) MINUS(s(x:S),y:S) -> LE(s(x:S),y:S) -> Rules: gcd(0,y:S) -> y:S gcd(s(x:S),0) -> s(x:S) gcd(s(x:S),s(y:S)) -> if_gcd(le(y:S,x:S),s(x:S),s(y:S)) if_gcd(ffalse,s(x:S),s(y:S)) -> gcd(minus(y:S,x:S),s(x:S)) if_gcd(ttrue,s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) if_minus(ffalse,s(x:S),y:S) -> s(minus(x:S,y:S)) if_minus(ttrue,s(x:S),y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(0,y:S) -> 0 minus(s(x:S),y:S) -> if_minus(le(s(x:S),y:S),s(x:S),y:S) Problem 1: SCC Processor: -> Pairs: GCD(s(x:S),s(y:S)) -> IF_GCD(le(y:S,x:S),s(x:S),s(y:S)) GCD(s(x:S),s(y:S)) -> LE(y:S,x:S) IF_GCD(ffalse,s(x:S),s(y:S)) -> GCD(minus(y:S,x:S),s(x:S)) IF_GCD(ffalse,s(x:S),s(y:S)) -> MINUS(y:S,x:S) IF_GCD(ttrue,s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) IF_GCD(ttrue,s(x:S),s(y:S)) -> MINUS(x:S,y:S) IF_MINUS(ffalse,s(x:S),y:S) -> MINUS(x:S,y:S) LE(s(x:S),s(y:S)) -> LE(x:S,y:S) MINUS(s(x:S),y:S) -> IF_MINUS(le(s(x:S),y:S),s(x:S),y:S) MINUS(s(x:S),y:S) -> LE(s(x:S),y:S) -> Rules: gcd(0,y:S) -> y:S gcd(s(x:S),0) -> s(x:S) gcd(s(x:S),s(y:S)) -> if_gcd(le(y:S,x:S),s(x:S),s(y:S)) if_gcd(ffalse,s(x:S),s(y:S)) -> gcd(minus(y:S,x:S),s(x:S)) if_gcd(ttrue,s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) if_minus(ffalse,s(x:S),y:S) -> s(minus(x:S,y:S)) if_minus(ttrue,s(x:S),y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(0,y:S) -> 0 minus(s(x:S),y:S) -> if_minus(le(s(x:S),y:S),s(x:S),y:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LE(s(x:S),s(y:S)) -> LE(x:S,y:S) ->->-> Rules: gcd(0,y:S) -> y:S
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard