Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713442
details
property
value
status
complete
benchmark
#4.30c.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
7.82483506203 seconds
cpu usage
7.655232131
max memory
4.39554048E8
stage attributes
key
value
output-size
14729
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- rm: cannot remove ‘/tmp/muTerm1497983152038664370.in.dec’: No such file or directory rm: cannot remove ‘/tmp/muTerm1497983152038664370.in.form’: No such file or directory YES Problem 1: (VAR x y) (RULES gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,x,y) -> gcd(minus(y,x),x) if_gcd(true,x,y) -> gcd(minus(x,y),y) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,x) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,x,y) -> gcd(minus(y,x),x) if_gcd(true,x,y) -> gcd(minus(x,y),y) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,x) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> 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_GCD(le(y,x),s(x),s(y)) GCD(s(x),s(y)) -> LE(y,x) IF_GCD(false,x,y) -> GCD(minus(y,x),x) IF_GCD(false,x,y) -> MINUS(y,x) IF_GCD(true,x,y) -> GCD(minus(x,y),y) IF_GCD(true,x,y) -> MINUS(x,y) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) -> Rules: gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,x,y) -> gcd(minus(y,x),x) if_gcd(true,x,y) -> gcd(minus(x,y),y) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,x) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x Problem 1: SCC Processor: -> Pairs: GCD(s(x),s(y)) -> IF_GCD(le(y,x),s(x),s(y)) GCD(s(x),s(y)) -> LE(y,x) IF_GCD(false,x,y) -> GCD(minus(y,x),x) IF_GCD(false,x,y) -> MINUS(y,x) IF_GCD(true,x,y) -> GCD(minus(x,y),y) IF_GCD(true,x,y) -> MINUS(x,y) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) -> Rules: gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,x,y) -> gcd(minus(y,x),x) if_gcd(true,x,y) -> gcd(minus(x,y),y) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,x) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(s(x),s(y)) -> MINUS(x,y) ->->-> Rules: gcd(0,y) -> y
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472