Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964716
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
n145.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.742393016815 seconds
cpu usage
0.05111585
max memory
4108288.0
stage attributes
key
value
output-size
7855
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 v_NonEmpty:S M:S N:S X:S Y:S) (RULES eq(0,0) -> ttrue eq(0,s(X:S)) -> ffalse eq(s(X:S),0) -> ffalse eq(s(X:S),s(Y:S)) -> eq(X:S,Y:S) ifrm(ffalse,N:S,add(M:S,X:S)) -> add(M:S,rm(N:S,X:S)) ifrm(ttrue,N:S,add(M:S,X:S)) -> rm(N:S,X:S) purge(add(N:S,X:S)) -> add(N:S,purge(rm(N:S,X:S))) purge(nil) -> nil rm(N:S,add(M:S,X:S)) -> ifrm(eq(N:S,M:S),N:S,add(M:S,X:S)) rm(N:S,nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: eq(0,0) -> ttrue eq(0,s(X:S)) -> ffalse eq(s(X:S),0) -> ffalse eq(s(X:S),s(Y:S)) -> eq(X:S,Y:S) ifrm(ffalse,N:S,add(M:S,X:S)) -> add(M:S,rm(N:S,X:S)) ifrm(ttrue,N:S,add(M:S,X:S)) -> rm(N:S,X:S) purge(add(N:S,X:S)) -> add(N:S,purge(rm(N:S,X:S))) purge(nil) -> nil rm(N:S,add(M:S,X:S)) -> ifrm(eq(N:S,M:S),N:S,add(M:S,X:S)) rm(N:S,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),s(Y:S)) -> EQ(X:S,Y:S) IFRM(ffalse,N:S,add(M:S,X:S)) -> RM(N:S,X:S) IFRM(ttrue,N:S,add(M:S,X:S)) -> RM(N:S,X:S) PURGE(add(N:S,X:S)) -> PURGE(rm(N:S,X:S)) PURGE(add(N:S,X:S)) -> RM(N:S,X:S) RM(N:S,add(M:S,X:S)) -> EQ(N:S,M:S) RM(N:S,add(M:S,X:S)) -> IFRM(eq(N:S,M:S),N:S,add(M:S,X:S)) -> Rules: eq(0,0) -> ttrue eq(0,s(X:S)) -> ffalse eq(s(X:S),0) -> ffalse eq(s(X:S),s(Y:S)) -> eq(X:S,Y:S) ifrm(ffalse,N:S,add(M:S,X:S)) -> add(M:S,rm(N:S,X:S)) ifrm(ttrue,N:S,add(M:S,X:S)) -> rm(N:S,X:S) purge(add(N:S,X:S)) -> add(N:S,purge(rm(N:S,X:S))) purge(nil) -> nil rm(N:S,add(M:S,X:S)) -> ifrm(eq(N:S,M:S),N:S,add(M:S,X:S)) rm(N:S,nil) -> nil Problem 1: SCC Processor: -> Pairs: EQ(s(X:S),s(Y:S)) -> EQ(X:S,Y:S) IFRM(ffalse,N:S,add(M:S,X:S)) -> RM(N:S,X:S) IFRM(ttrue,N:S,add(M:S,X:S)) -> RM(N:S,X:S) PURGE(add(N:S,X:S)) -> PURGE(rm(N:S,X:S)) PURGE(add(N:S,X:S)) -> RM(N:S,X:S) RM(N:S,add(M:S,X:S)) -> EQ(N:S,M:S) RM(N:S,add(M:S,X:S)) -> IFRM(eq(N:S,M:S),N:S,add(M:S,X:S)) -> Rules: eq(0,0) -> ttrue eq(0,s(X:S)) -> ffalse eq(s(X:S),0) -> ffalse eq(s(X:S),s(Y:S)) -> eq(X:S,Y:S) ifrm(ffalse,N:S,add(M:S,X:S)) -> add(M:S,rm(N:S,X:S)) ifrm(ttrue,N:S,add(M:S,X:S)) -> rm(N:S,X:S) purge(add(N:S,X:S)) -> add(N:S,purge(rm(N:S,X:S))) purge(nil) -> nil rm(N:S,add(M:S,X:S)) -> ifrm(eq(N:S,M:S),N:S,add(M:S,X:S)) rm(N:S,nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: EQ(s(X:S),s(Y:S)) -> EQ(X:S,Y:S) ->->-> Rules: eq(0,0) -> ttrue eq(0,s(X:S)) -> ffalse eq(s(X:S),0) -> ffalse eq(s(X:S),s(Y:S)) -> eq(X:S,Y:S) ifrm(ffalse,N:S,add(M:S,X:S)) -> add(M:S,rm(N:S,X:S)) ifrm(ttrue,N:S,add(M:S,X:S)) -> rm(N:S,X:S) purge(add(N:S,X:S)) -> add(N:S,purge(rm(N:S,X:S))) purge(nil) -> nil rm(N:S,add(M:S,X:S)) -> ifrm(eq(N:S,M:S),N:S,add(M:S,X:S))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard