Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711594
details
property
value
status
complete
benchmark
#4.33.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0678331851959 seconds
cpu usage
0.062050697
max memory
3719168.0
stage attributes
key
value
output-size
5719
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR m n x y) (RULES sum(cons(0,x),y) -> sum(x,y) sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(nil,y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0,x))) weight(cons(n,nil)) -> n ) Problem 1: Innermost Equivalent Processor: -> Rules: sum(cons(0,x),y) -> sum(x,y) sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(nil,y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0,x))) weight(cons(n,nil)) -> n -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: SUM(cons(0,x),y) -> SUM(x,y) SUM(cons(s(n),x),cons(m,y)) -> SUM(cons(n,x),cons(s(m),y)) WEIGHT(cons(n,cons(m,x))) -> SUM(cons(n,cons(m,x)),cons(0,x)) WEIGHT(cons(n,cons(m,x))) -> WEIGHT(sum(cons(n,cons(m,x)),cons(0,x))) -> Rules: sum(cons(0,x),y) -> sum(x,y) sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(nil,y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0,x))) weight(cons(n,nil)) -> n Problem 1: SCC Processor: -> Pairs: SUM(cons(0,x),y) -> SUM(x,y) SUM(cons(s(n),x),cons(m,y)) -> SUM(cons(n,x),cons(s(m),y)) WEIGHT(cons(n,cons(m,x))) -> SUM(cons(n,cons(m,x)),cons(0,x)) WEIGHT(cons(n,cons(m,x))) -> WEIGHT(sum(cons(n,cons(m,x)),cons(0,x))) -> Rules: sum(cons(0,x),y) -> sum(x,y) sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(nil,y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0,x))) weight(cons(n,nil)) -> n ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: SUM(cons(0,x),y) -> SUM(x,y) SUM(cons(s(n),x),cons(m,y)) -> SUM(cons(n,x),cons(s(m),y)) ->->-> Rules: sum(cons(0,x),y) -> sum(x,y) sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(nil,y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0,x))) weight(cons(n,nil)) -> n ->->Cycle: ->->-> Pairs: WEIGHT(cons(n,cons(m,x))) -> WEIGHT(sum(cons(n,cons(m,x)),cons(0,x))) ->->-> Rules: sum(cons(0,x),y) -> sum(x,y) sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(nil,y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0,x))) weight(cons(n,nil)) -> n The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: SUM(cons(0,x),y) -> SUM(x,y) SUM(cons(s(n),x),cons(m,y)) -> SUM(cons(n,x),cons(s(m),y)) -> Rules: sum(cons(0,x),y) -> sum(x,y) sum(cons(s(n),x),cons(m,y)) -> sum(cons(n,x),cons(s(m),y)) sum(nil,y) -> y weight(cons(n,cons(m,x))) -> weight(sum(cons(n,cons(m,x)),cons(0,x))) weight(cons(n,nil)) -> n -> Usable rules: Empty ->Interpretation type: Linear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472