Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714016
details
property
value
status
complete
benchmark
PEANO_nosorts-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0619239807129 seconds
cpu usage
0.031604144
max memory
3534848.0
stage attributes
key
value
output-size
3080
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) (RULES U11(tt,M,N) -> U12(tt,activate(M),activate(N)) U12(tt,M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) ) Problem 1: Innermost Equivalent Processor: -> Rules: U11(tt,M,N) -> U12(tt,activate(M),activate(N)) U12(tt,M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,M,N) -> U12#(tt,activate(M),activate(N)) U11#(tt,M,N) -> ACTIVATE(M) U11#(tt,M,N) -> ACTIVATE(N) U12#(tt,M,N) -> ACTIVATE(M) U12#(tt,M,N) -> ACTIVATE(N) U12#(tt,M,N) -> PLUS(activate(N),activate(M)) PLUS(N,s(M)) -> U11#(tt,M,N) -> Rules: U11(tt,M,N) -> U12(tt,activate(M),activate(N)) U12(tt,M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) Problem 1: SCC Processor: -> Pairs: U11#(tt,M,N) -> U12#(tt,activate(M),activate(N)) U11#(tt,M,N) -> ACTIVATE(M) U11#(tt,M,N) -> ACTIVATE(N) U12#(tt,M,N) -> ACTIVATE(M) U12#(tt,M,N) -> ACTIVATE(N) U12#(tt,M,N) -> PLUS(activate(N),activate(M)) PLUS(N,s(M)) -> U11#(tt,M,N) -> Rules: U11(tt,M,N) -> U12(tt,activate(M),activate(N)) U12(tt,M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: U11#(tt,M,N) -> U12#(tt,activate(M),activate(N)) U12#(tt,M,N) -> PLUS(activate(N),activate(M)) PLUS(N,s(M)) -> U11#(tt,M,N) ->->-> Rules: U11(tt,M,N) -> U12(tt,activate(M),activate(N)) U12(tt,M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) Problem 1: Reduction Pairs Processor: -> Pairs: U11#(tt,M,N) -> U12#(tt,activate(M),activate(N)) U12#(tt,M,N) -> PLUS(activate(N),activate(M)) PLUS(N,s(M)) -> U11#(tt,M,N) -> Rules: U11(tt,M,N) -> U12(tt,activate(M),activate(N)) U12(tt,M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) -> Usable rules: activate(X) -> X ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472