details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.594009 seconds
cpu usage	0.516711
user time	0.319007
system time	0.197704
max virtual memory	113176.0
max residence set size	8000.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.59 YES 0.00/0.59 0.00/0.59 Problem 1: 0.00/0.59 0.00/0.59 (VAR h i u v x y) 0.00/0.59 (THEORY 0.00/0.59 (AC or) 0.00/0.59 (C eq)) 0.00/0.59 (RULES 0.00/0.59 eq(0,0) -> true 0.00/0.59 eq(0,s(x)) -> false 0.00/0.59 eq(s(x),0) -> false 0.00/0.59 eq(s(x),s(y)) -> eq(x,y) 0.00/0.59 if_reach_1(false,x,y,edge(u,v,i),h) -> reach(x,y,i,edge(u,v,h)) 0.00/0.59 if_reach_1(true,x,y,edge(u,v,i),h) -> if_reach_2(eq(y,v),x,y,edge(u,v,i),h) 0.00/0.59 if_reach_2(false,x,y,edge(u,v,i),h) -> or(reach(x,y,i,h),reach(v,y,union(i,h),empty)) 0.00/0.59 if_reach_2(true,x,y,edge(u,v,i),h) -> true 0.00/0.59 or(false,y) -> y 0.00/0.59 or(true,y) -> true 0.00/0.59 reach(x,y,edge(u,v,i),h) -> if_reach_1(eq(x,u),x,y,edge(u,v,i),h) 0.00/0.59 reach(x,y,empty,h) -> false 0.00/0.59 union(edge(x,y,i),h) -> edge(x,y,union(i,h)) 0.00/0.59 union(empty,h) -> h 0.00/0.59 ) 0.00/0.59 0.00/0.59 Problem 1: 0.00/0.59 0.00/0.59 Dependency Pairs Processor: 0.00/0.59 -> FAxioms: 0.00/0.59 EQ(x6,x7) = EQ(x7,x6) 0.00/0.59 OR(or(x6,x7),x8) = OR(x6,or(x7,x8)) 0.00/0.59 OR(x6,x7) = OR(x7,x6) 0.00/0.59 -> Pairs: 0.00/0.59 EQ(s(x),s(y)) -> EQ(x,y) 0.00/0.59 IF_REACH_1(false,x,y,edge(u,v,i),h) -> REACH(x,y,i,edge(u,v,h)) 0.00/0.59 IF_REACH_1(true,x,y,edge(u,v,i),h) -> EQ(y,v) 0.00/0.59 IF_REACH_1(true,x,y,edge(u,v,i),h) -> IF_REACH_2(eq(y,v),x,y,edge(u,v,i),h) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> OR(reach(x,y,i,h),reach(v,y,union(i,h),empty)) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> REACH(v,y,union(i,h),empty) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> REACH(x,y,i,h) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> UNION(i,h) 0.00/0.59 OR(or(false,y),x6) -> OR(y,x6) 0.00/0.59 OR(or(true,y),x6) -> OR(true,x6) 0.00/0.59 REACH(x,y,edge(u,v,i),h) -> EQ(x,u) 0.00/0.59 REACH(x,y,edge(u,v,i),h) -> IF_REACH_1(eq(x,u),x,y,edge(u,v,i),h) 0.00/0.59 UNION(edge(x,y,i),h) -> UNION(i,h) 0.00/0.59 -> EAxioms: 0.00/0.59 eq(x6,x7) = eq(x7,x6) 0.00/0.59 or(or(x6,x7),x8) = or(x6,or(x7,x8)) 0.00/0.59 or(x6,x7) = or(x7,x6) 0.00/0.59 -> Rules: 0.00/0.59 eq(0,0) -> true 0.00/0.59 eq(0,s(x)) -> false 0.00/0.59 eq(s(x),0) -> false 0.00/0.59 eq(s(x),s(y)) -> eq(x,y) 0.00/0.59 if_reach_1(false,x,y,edge(u,v,i),h) -> reach(x,y,i,edge(u,v,h)) 0.00/0.59 if_reach_1(true,x,y,edge(u,v,i),h) -> if_reach_2(eq(y,v),x,y,edge(u,v,i),h) 0.00/0.59 if_reach_2(false,x,y,edge(u,v,i),h) -> or(reach(x,y,i,h),reach(v,y,union(i,h),empty)) 0.00/0.59 if_reach_2(true,x,y,edge(u,v,i),h) -> true 0.00/0.59 or(false,y) -> y 0.00/0.59 or(true,y) -> true 0.00/0.59 reach(x,y,edge(u,v,i),h) -> if_reach_1(eq(x,u),x,y,edge(u,v,i),h) 0.00/0.59 reach(x,y,empty,h) -> false 0.00/0.59 union(edge(x,y,i),h) -> edge(x,y,union(i,h)) 0.00/0.59 union(empty,h) -> h 0.00/0.59 -> SRules: 0.00/0.59 OR(or(x6,x7),x8) -> OR(x6,x7) 0.00/0.59 OR(x6,or(x7,x8)) -> OR(x7,x8) 0.00/0.59 0.00/0.59 Problem 1: 0.00/0.59 0.00/0.59 SCC Processor: 0.00/0.59 -> FAxioms: 0.00/0.59 EQ(x6,x7) = EQ(x7,x6) 0.00/0.59 OR(or(x6,x7),x8) = OR(x6,or(x7,x8)) 0.00/0.59 OR(x6,x7) = OR(x7,x6) 0.00/0.59 -> Pairs: 0.00/0.59 EQ(s(x),s(y)) -> EQ(x,y) 0.00/0.59 IF_REACH_1(false,x,y,edge(u,v,i),h) -> REACH(x,y,i,edge(u,v,h)) 0.00/0.59 IF_REACH_1(true,x,y,edge(u,v,i),h) -> EQ(y,v) 0.00/0.59 IF_REACH_1(true,x,y,edge(u,v,i),h) -> IF_REACH_2(eq(y,v),x,y,edge(u,v,i),h) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> OR(reach(x,y,i,h),reach(v,y,union(i,h),empty)) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> REACH(v,y,union(i,h),empty) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> REACH(x,y,i,h) 0.00/0.59 IF_REACH_2(false,x,y,edge(u,v,i),h) -> UNION(i,h) 0.00/0.59 OR(or(false,y),x6) -> OR(y,x6) 0.00/0.59 OR(or(true,y),x6) -> OR(true,x6) 0.00/0.59 REACH(x,y,edge(u,v,i),h) -> EQ(x,u) 0.00/0.59 REACH(x,y,edge(u,v,i),h) -> IF_REACH_1(eq(x,u),x,y,edge(u,v,i),h) 0.00/0.59 UNION(edge(x,y,i),h) -> UNION(i,h) 0.00/0.59 -> EAxioms: 0.00/0.59 eq(x6,x7) = eq(x7,x6) 0.00/0.59 or(or(x6,x7),x8) = or(x6,or(x7,x8)) 0.00/0.59 or(x6,x7) = or(x7,x6) 0.00/0.59 -> Rules: 0.00/0.59 eq(0,0) -> true 0.00/0.59 eq(0,s(x)) -> false 0.00/0.59 eq(s(x),0) -> false 0.00/0.59 eq(s(x),s(y)) -> eq(x,y) 0.00/0.59 if_reach_1(false,x,y,edge(u,v,i),h) -> reach(x,y,i,edge(u,v,h)) popout

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

job log

popout

actions

all output return to TRS_Equational 2019-03-21 05.09