Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733224
details
property
value
status
complete
benchmark
MYNAT_nosorts-noand-peanoSimple.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n089.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0174701213837 seconds
cpu usage
0.015033165
max memory
1527808.0
stage attributes
key
value
output-size
2306
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 M N) (STRATEGY CONTEXTSENSITIVE (U11 1) (U12 1) (plus 1 2) (0) (s 1) (tt) ) (RULES U11(tt,M,N) -> U12(tt,M,N) U12(tt,M,N) -> s(plus(N,M)) plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) ) Problem 1: Innermost Equivalent Processor: -> Rules: U11(tt,M,N) -> U12(tt,M,N) U12(tt,M,N) -> s(plus(N,M)) plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,M,N) -> U12#(tt,M,N) U12#(tt,M,N) -> PLUS(N,M) U12#(tt,M,N) -> M U12#(tt,M,N) -> N PLUS(N,s(M)) -> U11#(tt,M,N) -> Rules: U11(tt,M,N) -> U12(tt,M,N) U12(tt,M,N) -> s(plus(N,M)) plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: U11#(tt,M,N) -> U12#(tt,M,N) U12#(tt,M,N) -> PLUS(N,M) U12#(tt,M,N) -> M U12#(tt,M,N) -> N PLUS(N,s(M)) -> U11#(tt,M,N) -> Rules: U11(tt,M,N) -> U12(tt,M,N) U12(tt,M,N) -> s(plus(N,M)) plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: U11#(tt,M,N) -> U12#(tt,M,N) U12#(tt,M,N) -> PLUS(N,M) PLUS(N,s(M)) -> U11#(tt,M,N) ->->-> Rules: U11(tt,M,N) -> U12(tt,M,N) U12(tt,M,N) -> s(plus(N,M)) plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) ->->-> Unhiding rules: Empty Problem 1: SubNColl Processor: -> Pairs: U11#(tt,M,N) -> U12#(tt,M,N) U12#(tt,M,N) -> PLUS(N,M) PLUS(N,s(M)) -> U11#(tt,M,N) -> Rules: U11(tt,M,N) -> U12(tt,M,N) U12(tt,M,N) -> s(plus(N,M)) plus(N,0) -> N plus(N,s(M)) -> U11(tt,M,N) -> Unhiding rules: Empty ->Projection: pi(U11#) = 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651