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