Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713459
details
property
value
status
complete
benchmark
thiemann04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.885249853134 seconds
cpu usage
1.026755158
max memory
3.9366656E7
stage attributes
key
value
output-size
3900
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: eq(0(),0()) -> true() 2: eq(0(),s(x)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: or(true(),y) -> true() 6: or(false(),y) -> y 7: union(empty(),h) -> h 8: union(edge(x,y,i),h) -> edge(x,y,union(i,h)) 9: isEmpty(empty()) -> true() 10: isEmpty(edge(x,y,i)) -> false() 11: from(edge(x,y,i)) -> x 12: to(edge(x,y,i)) -> y 13: rest(edge(x,y,i)) -> i 14: rest(empty()) -> empty() 15: reach(x,y,i,h) -> if1(eq(x,y),isEmpty(i),eq(x,from(i)),eq(y,to(i)),x,y,i,h) 16: if1(true(),b1,b2,b3,x,y,i,h) -> true() 17: if1(false(),b1,b2,b3,x,y,i,h) -> if2(b1,b2,b3,x,y,i,h) 18: if2(true(),b2,b3,x,y,i,h) -> false() 19: if2(false(),b2,b3,x,y,i,h) -> if3(b2,b3,x,y,i,h) 20: if3(false(),b3,x,y,i,h) -> reach(x,y,rest(i),edge(from(i),to(i),h)) 21: if3(true(),b3,x,y,i,h) -> if4(b3,x,y,i,h) 22: if4(true(),x,y,i,h) -> true() 23: if4(false(),x,y,i,h) -> or(reach(x,y,rest(i),h),reach(to(i),y,union(rest(i),h),empty())) Number of strict rules: 23 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #if4(false(),x,y,i,h) -> #or(reach(x,y,rest(i),h),reach(to(i),y,union(rest(i),h),empty())) #2: #if4(false(),x,y,i,h) -> #reach(x,y,rest(i),h) #3: #if4(false(),x,y,i,h) -> #rest(i) #4: #if4(false(),x,y,i,h) -> #reach(to(i),y,union(rest(i),h),empty()) #5: #if4(false(),x,y,i,h) -> #to(i) #6: #if4(false(),x,y,i,h) -> #union(rest(i),h) #7: #if4(false(),x,y,i,h) -> #rest(i) #8: #if3(false(),b3,x,y,i,h) -> #reach(x,y,rest(i),edge(from(i),to(i),h)) #9: #if3(false(),b3,x,y,i,h) -> #rest(i) #10: #if3(false(),b3,x,y,i,h) -> #from(i) #11: #if3(false(),b3,x,y,i,h) -> #to(i) #12: #if1(false(),b1,b2,b3,x,y,i,h) -> #if2(b1,b2,b3,x,y,i,h) #13: #if2(false(),b2,b3,x,y,i,h) -> #if3(b2,b3,x,y,i,h) #14: #if3(true(),b3,x,y,i,h) -> #if4(b3,x,y,i,h) #15: #union(edge(x,y,i),h) -> #union(i,h) #16: #reach(x,y,i,h) -> #if1(eq(x,y),isEmpty(i),eq(x,from(i)),eq(y,to(i)),x,y,i,h) #17: #reach(x,y,i,h) -> #eq(x,y) #18: #reach(x,y,i,h) -> #isEmpty(i) #19: #reach(x,y,i,h) -> #eq(x,from(i)) #20: #reach(x,y,i,h) -> #from(i) #21: #reach(x,y,i,h) -> #eq(y,to(i)) #22: #reach(x,y,i,h) -> #to(i) #23: #eq(s(x),s(y)) -> #eq(x,y) Number of SCCs: 3, DPs: 9 SCC { #23 } POLO(Sum)... succeeded. #if4 w: 0 s w: x1 + 1 #rest w: 0 edge w: 0 #isEmpty w: 0 eq w: 0 if1 w: 0 false w: 0 isEmpty w: 0 #to w: 0 reach w: 0 true w: 0 #reach w: 0 #eq w: x1 + x2 #if1 w: 0 if2 w: 0 #if3 w: 0 0 w: 0 from w: 0 union w: 0 or w: 0 if4 w: 0 rest w: 0 #from w: 0 if3 w: 0 empty w: 0 #or w: 0 to w: 0 #if2 w: 0 #union w: 0 USABLE RULES: { } Removed DPs: #23 Number of SCCs: 2, DPs: 8 SCC { #15 } POLO(Sum)... succeeded. #if4 w: 0 s w: 1 #rest w: 0 edge w: x3 + 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472