Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997278
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
n147.star.cs.uiowa.edu
space
Mixed_AC_and_C
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.0570191 seconds
cpu usage
0.032398
user time
0.017649
system time
0.014749
max virtual memory
113176.0
max residence set size
5488.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.05 YES 0.00/0.05 Input TRS: 0.00/0.05 AC symbols: or 0.00/0.05 C symbols: eq 0.00/0.05 1: eq(0(),0()) -> true() 0.00/0.05 2: eq(0(),s(x)) -> false() 0.00/0.05 3: eq(s(x),0()) -> false() 0.00/0.05 4: eq(s(x),s(y)) -> eq(x,y) 0.00/0.05 5: or(true(),y) -> true() 0.00/0.05 6: or(false(),y) -> y 0.00/0.05 7: union(empty(),h) -> h 0.00/0.05 8: union(edge(x,y,i),h) -> edge(x,y,union(i,h)) 0.00/0.05 9: reach(x,y,empty(),h) -> false() 0.00/0.05 10: reach(x,y,edge(u,v,i),h) -> if_reach_1(eq(x,u),x,y,edge(u,v,i),h) 0.00/0.05 11: 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.05 12: if_reach_1(false(),x,y,edge(u,v,i),h) -> reach(x,y,i,edge(u,v,h)) 0.00/0.05 13: if_reach_2(true(),x,y,edge(u,v,i),h) -> true() 0.00/0.05 14: 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.05 Number of strict rules: 14 0.00/0.05 Direct POLO(bPol) ... failed. 0.00/0.05 Uncurrying ... failed. 0.00/0.05 Dependency Pairs: 0.00/0.05 #1: #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.05 #2: #if_reach_1(true(),x,y,edge(u,v,i),h) -> #eq(y,v) 0.00/0.05 #3: #if_reach_1(false(),x,y,edge(u,v,i),h) -> #reach(x,y,i,edge(u,v,h)) 0.00/0.05 #4: #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.05 #5: #if_reach_2(false(),x,y,edge(u,v,i),h) -> #reach(x,y,i,h) 0.00/0.05 #6: #if_reach_2(false(),x,y,edge(u,v,i),h) -> #reach(v,y,union(i,h),empty()) 0.00/0.05 #7: #if_reach_2(false(),x,y,edge(u,v,i),h) -> #union(i,h) 0.00/0.05 #8: #reach(x,y,edge(u,v,i),h) -> #if_reach_1(eq(x,u),x,y,edge(u,v,i),h) 0.00/0.05 #9: #reach(x,y,edge(u,v,i),h) -> #eq(x,u) 0.00/0.05 #10: #union(edge(x,y,i),h) -> #union(i,h) 0.00/0.05 #11: #or(x,or(y,z)) ->= #or(or(x,y),z) 0.00/0.05 #12: #or(x,or(y,z)) ->= #or(x,y) 0.00/0.05 #13: #eq(s(x),s(y)) -> #eq(x,y) 0.00/0.05 Number of SCCs: 4, DPs: 9 0.00/0.05 SCC { #13 } 0.00/0.05 POLO(Sum)... succeeded. 0.00/0.05 s w: x1 + 1 0.00/0.05 #if_reach_1 w: 0 0.00/0.05 edge w: 0 0.00/0.05 #if_reach_2 w: 0 0.00/0.05 eq w: 0 0.00/0.05 false w: 0 0.00/0.05 reach w: 0 0.00/0.05 if_reach_2 w: 0 0.00/0.05 true w: 0 0.00/0.05 #reach w: 0 0.00/0.05 #eq w: x1 + x2 0.00/0.05 0 w: 0 0.00/0.05 union w: 0 0.00/0.05 or w: 0 0.00/0.05 empty w: 0 0.00/0.05 if_reach_1 w: 0 0.00/0.05 #or w: 0 0.00/0.05 #union w: 0 0.00/0.05 USABLE RULES: { } 0.00/0.05 Removed DPs: #13 0.00/0.05 Number of SCCs: 3, DPs: 8 0.00/0.05 SCC { #10 } 0.00/0.05 POLO(Sum)... succeeded. 0.00/0.05 s w: 0 0.00/0.05 #if_reach_1 w: 0 0.00/0.05 edge w: x3 + 1 0.00/0.05 #if_reach_2 w: 0 0.00/0.05 eq w: 0 0.00/0.05 false w: 0 0.00/0.05 reach w: 0 0.00/0.05 if_reach_2 w: 0 0.00/0.05 true w: 0 0.00/0.05 #reach w: 0 0.00/0.05 #eq w: 0 0.00/0.05 0 w: 0 0.00/0.05 union w: 0 0.00/0.05 or w: 0 0.00/0.05 empty w: 0 0.00/0.05 if_reach_1 w: 0 0.00/0.05 #or w: 0 0.00/0.05 #union w: x1 0.00/0.05 USABLE RULES: { } 0.00/0.05 Removed DPs: #10 0.00/0.05 Number of SCCs: 2, DPs: 7 0.00/0.05 SCC { #11 #12 } 0.00/0.05 only weak rules. 0.00/0.05 Number of SCCs: 1, DPs: 5 0.00/0.05 SCC { #1 #3 #5 #6 #8 } 0.00/0.05 POLO(Sum)... succeeded. 0.00/0.05 s w: 1 0.00/0.05 #if_reach_1 w: x3 + x4 + x5 + 1 0.00/0.05 edge w: x3 + 4 0.00/0.05 #if_reach_2 w: x3 + x4 + x5 0.00/0.05 eq w: x1 + x2 + 1 0.00/0.05 false w: 4 0.00/0.05 reach w: 0 0.00/0.05 if_reach_2 w: 0 0.00/0.05 true w: 4 0.00/0.05 #reach w: x2 + x3 + x4 + 1 0.00/0.05 #eq w: 0 0.00/0.05 0 w: 1 0.00/0.05 union w: x1 + x2 + 1
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