Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712174
details
property
value
status
complete
benchmark
elimdupl.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
Rubio_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0585210323334 seconds
cpu usage
0.040541034
max memory
4071424.0
stage attributes
key
value
output-size
6538
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 Y) (RULES eq(0,0) -> true eq(0,s(X)) -> false eq(s(X),0) -> false eq(s(X),s(Y)) -> eq(X,Y) ifrm(false,N,add(M,X)) -> add(M,rm(N,X)) ifrm(true,N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil) -> nil rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X)) rm(N,nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: eq(0,0) -> true eq(0,s(X)) -> false eq(s(X),0) -> false eq(s(X),s(Y)) -> eq(X,Y) ifrm(false,N,add(M,X)) -> add(M,rm(N,X)) ifrm(true,N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil) -> nil rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X)) rm(N,nil) -> nil -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: EQ(s(X),s(Y)) -> EQ(X,Y) IFRM(false,N,add(M,X)) -> RM(N,X) IFRM(true,N,add(M,X)) -> RM(N,X) PURGE(add(N,X)) -> PURGE(rm(N,X)) PURGE(add(N,X)) -> RM(N,X) RM(N,add(M,X)) -> EQ(N,M) RM(N,add(M,X)) -> IFRM(eq(N,M),N,add(M,X)) -> Rules: eq(0,0) -> true eq(0,s(X)) -> false eq(s(X),0) -> false eq(s(X),s(Y)) -> eq(X,Y) ifrm(false,N,add(M,X)) -> add(M,rm(N,X)) ifrm(true,N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil) -> nil rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X)) rm(N,nil) -> nil Problem 1: SCC Processor: -> Pairs: EQ(s(X),s(Y)) -> EQ(X,Y) IFRM(false,N,add(M,X)) -> RM(N,X) IFRM(true,N,add(M,X)) -> RM(N,X) PURGE(add(N,X)) -> PURGE(rm(N,X)) PURGE(add(N,X)) -> RM(N,X) RM(N,add(M,X)) -> EQ(N,M) RM(N,add(M,X)) -> IFRM(eq(N,M),N,add(M,X)) -> Rules: eq(0,0) -> true eq(0,s(X)) -> false eq(s(X),0) -> false eq(s(X),s(Y)) -> eq(X,Y) ifrm(false,N,add(M,X)) -> add(M,rm(N,X)) ifrm(true,N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil) -> nil rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X)) rm(N,nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: EQ(s(X),s(Y)) -> EQ(X,Y) ->->-> Rules: eq(0,0) -> true eq(0,s(X)) -> false eq(s(X),0) -> false eq(s(X),s(Y)) -> eq(X,Y) ifrm(false,N,add(M,X)) -> add(M,rm(N,X)) ifrm(true,N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil) -> nil rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472