Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714746
details
property
value
status
complete
benchmark
MYNAT_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0167508125305 seconds
cpu usage
0.013490273
max memory
1495040.0
stage attributes
key
value
output-size
2835
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 activate(X) -> X and(tt,X) -> activate(X) plus(N,0) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0) -> 0 x(N,s(M)) -> plus(x(N,M),N) ) Problem 1: Innermost Equivalent Processor: -> Rules: activate(X) -> X and(tt,X) -> activate(X) plus(N,0) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0) -> 0 x(N,s(M)) -> plus(x(N,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: AND(tt,X) -> ACTIVATE(X) PLUS(N,s(M)) -> PLUS(N,M) X(N,s(M)) -> PLUS(x(N,M),N) X(N,s(M)) -> X(N,M) -> Rules: activate(X) -> X and(tt,X) -> activate(X) plus(N,0) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0) -> 0 x(N,s(M)) -> plus(x(N,M),N) Problem 1: SCC Processor: -> Pairs: AND(tt,X) -> ACTIVATE(X) PLUS(N,s(M)) -> PLUS(N,M) X(N,s(M)) -> PLUS(x(N,M),N) X(N,s(M)) -> X(N,M) -> Rules: activate(X) -> X and(tt,X) -> activate(X) plus(N,0) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0) -> 0 x(N,s(M)) -> plus(x(N,M),N) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(N,s(M)) -> PLUS(N,M) ->->-> Rules: activate(X) -> X and(tt,X) -> activate(X) plus(N,0) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0) -> 0 x(N,s(M)) -> plus(x(N,M),N) ->->Cycle: ->->-> Pairs: X(N,s(M)) -> X(N,M) ->->-> Rules: activate(X) -> X and(tt,X) -> activate(X) plus(N,0) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0) -> 0 x(N,s(M)) -> plus(x(N,M),N) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: PLUS(N,s(M)) -> PLUS(N,M) -> Rules: activate(X) -> X and(tt,X) -> activate(X) plus(N,0) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0) -> 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472