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	n048.star.cs.uiowa.edu
space	Mixed_C

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.359243154526 seconds
cpu usage	0.251912658
max memory	4304896.0

stage attributes

key	value
output-size	7183
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) (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))) popout

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

job log

popout

actions

all output return to TRS Equational