details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	3.594 seconds
cpu usage	3.40831
user time	2.51316
system time	0.895147
max virtual memory	697528.0
max residence set size	12116.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR x y z) (THEORY (AC inter union) (C eq)) (RULES eq(0,0) -> true eq(0,s(x)) -> false eq(s(x),s(y)) -> eq(x,y) if(false,x,y) -> y if(true,x,y) -> x inter(union(y,z),x) -> union(inter(x,y),inter(x,z)) inter(empty,x) -> empty inter(singl(x),singl(y)) -> if(eq(x,y),singl(x),empty) union(empty,x) -> x ) Problem 1: Dependency Pairs Processor: -> FAxioms: EQ(x3,x4) = EQ(x4,x3) INTER(inter(x3,x4),x5) = INTER(x3,inter(x4,x5)) INTER(x3,x4) = INTER(x4,x3) UNION(union(x3,x4),x5) = UNION(x3,union(x4,x5)) UNION(x3,x4) = UNION(x4,x3) -> Pairs: EQ(s(x),s(y)) -> EQ(x,y) INTER(inter(union(y,z),x),x3) -> INTER(union(inter(x,y),inter(x,z)),x3) INTER(inter(union(y,z),x),x3) -> INTER(x,y) INTER(inter(union(y,z),x),x3) -> INTER(x,z) INTER(inter(union(y,z),x),x3) -> UNION(inter(x,y),inter(x,z)) INTER(inter(empty,x),x3) -> INTER(empty,x3) INTER(inter(singl(x),singl(y)),x3) -> EQ(x,y) INTER(inter(singl(x),singl(y)),x3) -> IF(eq(x,y),singl(x),empty) INTER(inter(singl(x),singl(y)),x3) -> INTER(if(eq(x,y),singl(x),empty),x3) INTER(union(y,z),x) -> INTER(x,y) INTER(union(y,z),x) -> INTER(x,z) INTER(union(y,z),x) -> UNION(inter(x,y),inter(x,z)) INTER(singl(x),singl(y)) -> EQ(x,y) INTER(singl(x),singl(y)) -> IF(eq(x,y),singl(x),empty) UNION(union(empty,x),x3) -> UNION(x,x3) -> EAxioms: eq(x3,x4) = eq(x4,x3) inter(inter(x3,x4),x5) = inter(x3,inter(x4,x5)) inter(x3,x4) = inter(x4,x3) union(union(x3,x4),x5) = union(x3,union(x4,x5)) union(x3,x4) = union(x4,x3) -> Rules: eq(0,0) -> true eq(0,s(x)) -> false eq(s(x),s(y)) -> eq(x,y) if(false,x,y) -> y if(true,x,y) -> x inter(union(y,z),x) -> union(inter(x,y),inter(x,z)) inter(empty,x) -> empty inter(singl(x),singl(y)) -> if(eq(x,y),singl(x),empty) union(empty,x) -> x -> SRules: INTER(inter(x3,x4),x5) -> INTER(x3,x4) INTER(x3,inter(x4,x5)) -> INTER(x4,x5) UNION(union(x3,x4),x5) -> UNION(x3,x4) UNION(x3,union(x4,x5)) -> UNION(x4,x5) Problem 1: SCC Processor: -> FAxioms: EQ(x3,x4) = EQ(x4,x3) INTER(inter(x3,x4),x5) = INTER(x3,inter(x4,x5)) INTER(x3,x4) = INTER(x4,x3) UNION(union(x3,x4),x5) = UNION(x3,union(x4,x5)) UNION(x3,x4) = UNION(x4,x3) -> Pairs: EQ(s(x),s(y)) -> EQ(x,y) INTER(inter(union(y,z),x),x3) -> INTER(union(inter(x,y),inter(x,z)),x3) INTER(inter(union(y,z),x),x3) -> INTER(x,y) INTER(inter(union(y,z),x),x3) -> INTER(x,z) INTER(inter(union(y,z),x),x3) -> UNION(inter(x,y),inter(x,z)) INTER(inter(empty,x),x3) -> INTER(empty,x3) INTER(inter(singl(x),singl(y)),x3) -> EQ(x,y) INTER(inter(singl(x),singl(y)),x3) -> IF(eq(x,y),singl(x),empty) INTER(inter(singl(x),singl(y)),x3) -> INTER(if(eq(x,y),singl(x),empty),x3) INTER(union(y,z),x) -> INTER(x,y) INTER(union(y,z),x) -> INTER(x,z) INTER(union(y,z),x) -> UNION(inter(x,y),inter(x,z)) INTER(singl(x),singl(y)) -> EQ(x,y) INTER(singl(x),singl(y)) -> IF(eq(x,y),singl(x),empty) UNION(union(empty,x),x3) -> UNION(x,x3) -> EAxioms: eq(x3,x4) = eq(x4,x3) inter(inter(x3,x4),x5) = inter(x3,inter(x4,x5)) inter(x3,x4) = inter(x4,x3) union(union(x3,x4),x5) = union(x3,union(x4,x5)) union(x3,x4) = union(x4,x3) -> Rules: eq(0,0) -> true popout

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

job log

popout

actions

all output return to TRS Equational