Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Contextsensitive 2019-03-21 05.07 pair #429997118
details
property
value
status
complete
benchmark
MYNAT_nosorts-noand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n181.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.017878 seconds
cpu usage
0.018433
user time
0.009438
system time
0.008995
max virtual memory
113176.0
max residence set size
5080.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR M N) 0.00/0.01 (STRATEGY CONTEXTSENSITIVE 0.00/0.01 (U11 1) 0.00/0.01 (U12 1) 0.00/0.01 (U21 1) 0.00/0.01 (U22 1) 0.00/0.01 (plus 1 2) 0.00/0.01 (x 1 2) 0.00/0.01 (0) 0.00/0.01 (s 1) 0.00/0.01 (tt) 0.00/0.01 ) 0.00/0.01 (RULES 0.00/0.01 U11(tt,M,N) -> U12(tt,M,N) 0.00/0.01 U12(tt,M,N) -> s(plus(N,M)) 0.00/0.01 U21(tt,M,N) -> U22(tt,M,N) 0.00/0.01 U22(tt,M,N) -> plus(x(N,M),N) 0.00/0.01 plus(N,0) -> N 0.00/0.01 plus(N,s(M)) -> U11(tt,M,N) 0.00/0.01 x(N,0) -> 0 0.00/0.01 x(N,s(M)) -> U21(tt,M,N) 0.00/0.01 ) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Innermost Equivalent Processor: 0.00/0.01 -> Rules: 0.00/0.01 U11(tt,M,N) -> U12(tt,M,N) 0.00/0.01 U12(tt,M,N) -> s(plus(N,M)) 0.00/0.01 U21(tt,M,N) -> U22(tt,M,N) 0.00/0.01 U22(tt,M,N) -> plus(x(N,M),N) 0.00/0.01 plus(N,0) -> N 0.00/0.01 plus(N,s(M)) -> U11(tt,M,N) 0.00/0.01 x(N,0) -> 0 0.00/0.01 x(N,s(M)) -> U21(tt,M,N) 0.00/0.01 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. 0.00/0.01 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Dependency Pairs Processor: 0.00/0.01 -> Pairs: 0.00/0.01 U11#(tt,M,N) -> U12#(tt,M,N) 0.00/0.01 U12#(tt,M,N) -> PLUS(N,M) 0.00/0.01 U12#(tt,M,N) -> M 0.00/0.01 U12#(tt,M,N) -> N 0.00/0.01 U21#(tt,M,N) -> U22#(tt,M,N) 0.00/0.01 U22#(tt,M,N) -> PLUS(x(N,M),N) 0.00/0.01 U22#(tt,M,N) -> X(N,M) 0.00/0.01 U22#(tt,M,N) -> M 0.00/0.01 U22#(tt,M,N) -> N 0.00/0.01 PLUS(N,s(M)) -> U11#(tt,M,N) 0.00/0.01 X(N,s(M)) -> U21#(tt,M,N) 0.00/0.01 -> Rules: 0.00/0.01 U11(tt,M,N) -> U12(tt,M,N) 0.00/0.01 U12(tt,M,N) -> s(plus(N,M)) 0.00/0.01 U21(tt,M,N) -> U22(tt,M,N) 0.00/0.01 U22(tt,M,N) -> plus(x(N,M),N) 0.00/0.01 plus(N,0) -> N 0.00/0.01 plus(N,s(M)) -> U11(tt,M,N) 0.00/0.01 x(N,0) -> 0 0.00/0.01 x(N,s(M)) -> U21(tt,M,N) 0.00/0.01 -> Unhiding Rules: 0.00/0.01 Empty 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 U11#(tt,M,N) -> U12#(tt,M,N) 0.00/0.01 U12#(tt,M,N) -> PLUS(N,M) 0.00/0.01 U12#(tt,M,N) -> M 0.00/0.01 U12#(tt,M,N) -> N 0.00/0.01 U21#(tt,M,N) -> U22#(tt,M,N) 0.00/0.01 U22#(tt,M,N) -> PLUS(x(N,M),N) 0.00/0.01 U22#(tt,M,N) -> X(N,M) 0.00/0.01 U22#(tt,M,N) -> M 0.00/0.01 U22#(tt,M,N) -> N 0.00/0.01 PLUS(N,s(M)) -> U11#(tt,M,N) 0.00/0.01 X(N,s(M)) -> U21#(tt,M,N) 0.00/0.01 -> Rules: 0.00/0.01 U11(tt,M,N) -> U12(tt,M,N) 0.00/0.01 U12(tt,M,N) -> s(plus(N,M)) 0.00/0.01 U21(tt,M,N) -> U22(tt,M,N) 0.00/0.01 U22(tt,M,N) -> plus(x(N,M),N) 0.00/0.01 plus(N,0) -> N 0.00/0.01 plus(N,s(M)) -> U11(tt,M,N) 0.00/0.01 x(N,0) -> 0 0.00/0.01 x(N,s(M)) -> U21(tt,M,N) 0.00/0.01 -> Unhiding rules: 0.00/0.01 Empty 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 ->->Cycle: 0.00/0.01 ->->-> Pairs: 0.00/0.01 U11#(tt,M,N) -> U12#(tt,M,N) 0.00/0.01 U12#(tt,M,N) -> PLUS(N,M)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Contextsensitive 2019-03-21 05.07