Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712767
details
property
value
status
complete
benchmark
gcd.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.400974035263 seconds
cpu usage
0.042109327
max memory
3936256.0
stage attributes
key
value
output-size
6867
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 gcd(0,Y) -> 0 gcd(s(X),0) -> s(X) gcd(s(X),s(Y)) -> if(le(Y,X),s(X),s(Y)) if(false,s(X),s(Y)) -> gcd(minus(Y,X),s(X)) if(true,s(X),s(Y)) -> gcd(minus(X,Y),s(Y)) le(0,Y) -> true le(s(X),0) -> false le(s(X),s(Y)) -> le(X,Y) minus(X,0) -> X minus(X,s(Y)) -> pred(minus(X,Y)) pred(s(X)) -> X ) Problem 1: Innermost Equivalent Processor: -> Rules: gcd(0,Y) -> 0 gcd(s(X),0) -> s(X) gcd(s(X),s(Y)) -> if(le(Y,X),s(X),s(Y)) if(false,s(X),s(Y)) -> gcd(minus(Y,X),s(X)) if(true,s(X),s(Y)) -> gcd(minus(X,Y),s(Y)) le(0,Y) -> true le(s(X),0) -> false le(s(X),s(Y)) -> le(X,Y) minus(X,0) -> X minus(X,s(Y)) -> pred(minus(X,Y)) pred(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: GCD(s(X),s(Y)) -> IF(le(Y,X),s(X),s(Y)) GCD(s(X),s(Y)) -> LE(Y,X) IF(false,s(X),s(Y)) -> GCD(minus(Y,X),s(X)) IF(false,s(X),s(Y)) -> MINUS(Y,X) IF(true,s(X),s(Y)) -> GCD(minus(X,Y),s(Y)) IF(true,s(X),s(Y)) -> MINUS(X,Y) LE(s(X),s(Y)) -> LE(X,Y) MINUS(X,s(Y)) -> MINUS(X,Y) MINUS(X,s(Y)) -> PRED(minus(X,Y)) -> Rules: gcd(0,Y) -> 0 gcd(s(X),0) -> s(X) gcd(s(X),s(Y)) -> if(le(Y,X),s(X),s(Y)) if(false,s(X),s(Y)) -> gcd(minus(Y,X),s(X)) if(true,s(X),s(Y)) -> gcd(minus(X,Y),s(Y)) le(0,Y) -> true le(s(X),0) -> false le(s(X),s(Y)) -> le(X,Y) minus(X,0) -> X minus(X,s(Y)) -> pred(minus(X,Y)) pred(s(X)) -> X Problem 1: SCC Processor: -> Pairs: GCD(s(X),s(Y)) -> IF(le(Y,X),s(X),s(Y)) GCD(s(X),s(Y)) -> LE(Y,X) IF(false,s(X),s(Y)) -> GCD(minus(Y,X),s(X)) IF(false,s(X),s(Y)) -> MINUS(Y,X) IF(true,s(X),s(Y)) -> GCD(minus(X,Y),s(Y)) IF(true,s(X),s(Y)) -> MINUS(X,Y) LE(s(X),s(Y)) -> LE(X,Y) MINUS(X,s(Y)) -> MINUS(X,Y) MINUS(X,s(Y)) -> PRED(minus(X,Y)) -> Rules: gcd(0,Y) -> 0 gcd(s(X),0) -> s(X) gcd(s(X),s(Y)) -> if(le(Y,X),s(X),s(Y)) if(false,s(X),s(Y)) -> gcd(minus(Y,X),s(X)) if(true,s(X),s(Y)) -> gcd(minus(X,Y),s(Y)) le(0,Y) -> true le(s(X),0) -> false le(s(X),s(Y)) -> le(X,Y) minus(X,0) -> X minus(X,s(Y)) -> pred(minus(X,Y)) pred(s(X)) -> X ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(X,s(Y)) -> MINUS(X,Y) ->->-> Rules: gcd(0,Y) -> 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472