details

property	value
status	complete
benchmark	AC45.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n139.star.cs.uiowa.edu
space	Mixed_C

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.289517 seconds
cpu usage	0.252013
user time	0.135733
system time	0.11628
max virtual memory	113188.0
max residence set size	4984.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR m n x y) (THEORY (C eq)) (RULES eq(0,0) -> true eq(0,s(x)) -> false eq(s(x),0) -> false eq(s(x),s(y)) -> eq(x,y) if_rm(false,n,add(m,x)) -> add(m,rm(n,x)) if_rm(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)) -> if_rm(eq(n,m),n,add(m,x)) rm(n,nil) -> nil ) Problem 1: Dependency Pairs Processor: -> FAxioms: EQ(x4,x5) = EQ(x5,x4) -> Pairs: EQ(s(x),s(y)) -> EQ(x,y) IF_RM(false,n,add(m,x)) -> RM(n,x) IF_RM(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)) -> IF_RM(eq(n,m),n,add(m,x)) -> EAxioms: eq(x4,x5) = eq(x5,x4) -> Rules: eq(0,0) -> true eq(0,s(x)) -> false eq(s(x),0) -> false eq(s(x),s(y)) -> eq(x,y) if_rm(false,n,add(m,x)) -> add(m,rm(n,x)) if_rm(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)) -> if_rm(eq(n,m),n,add(m,x)) rm(n,nil) -> nil -> SRules: Empty Problem 1: SCC Processor: -> FAxioms: EQ(x4,x5) = EQ(x5,x4) -> Pairs: EQ(s(x),s(y)) -> EQ(x,y) IF_RM(false,n,add(m,x)) -> RM(n,x) IF_RM(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)) -> IF_RM(eq(n,m),n,add(m,x)) -> EAxioms: eq(x4,x5) = eq(x5,x4) -> Rules: eq(0,0) -> true eq(0,s(x)) -> false eq(s(x),0) -> false eq(s(x),s(y)) -> eq(x,y) if_rm(false,n,add(m,x)) -> add(m,rm(n,x)) if_rm(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)) -> if_rm(eq(n,m),n,add(m,x)) rm(n,nil) -> nil -> SRules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: EQ(s(x),s(y)) -> EQ(x,y) -> FAxioms: eq(x4,x5) -> eq(x5,x4) EQ(x4,x5) -> EQ(x5,x4) -> EAxioms: eq(x4,x5) = eq(x5,x4) ->->-> Rules: eq(0,0) -> true eq(0,s(x)) -> false eq(s(x),0) -> false eq(s(x),s(y)) -> eq(x,y) if_rm(false,n,add(m,x)) -> add(m,rm(n,x)) if_rm(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)) -> if_rm(eq(n,m),n,add(m,x)) rm(n,nil) -> nil -> SRules: Empty ->->Cycle: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Equational