Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713799
details
property
value
status
complete
benchmark
addList.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.264601945877 seconds
cpu usage
0.308927717
max memory
1.8198528E7
stage attributes
key
value
output-size
7448
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 Input TRS: 1: isEmpty(cons(x,xs)) -> false() 2: isEmpty(nil()) -> true() 3: isZero(0()) -> true() 4: isZero(s(x)) -> false() 5: head(cons(x,xs)) -> x 6: tail(cons(x,xs)) -> xs 7: tail(nil()) -> nil() 8: append(nil(),x) -> cons(x,nil()) 9: append(cons(y,ys),x) -> cons(y,append(ys,x)) 10: p(s(s(x))) -> s(p(s(x))) 11: p(s(0())) -> 0() 12: p(0()) -> 0() 13: inc(s(x)) -> s(inc(x)) 14: inc(0()) -> s(0()) 15: addLists(xs,ys,zs) -> if(isEmpty(xs),isEmpty(ys),isZero(head(xs)),tail(xs),tail(ys),cons(p(head(xs)),tail(xs)),cons(inc(head(ys)),tail(ys)),zs,append(zs,head(ys))) 16: if(true(),true(),b,xs,ys,xs2,ys2,zs,zs2) -> zs 17: if(true(),false(),b,xs,ys,xs2,ys2,zs,zs2) -> differentLengthError() 18: if(false(),true(),b,xs,ys,xs2,ys2,zs,zs2) -> differentLengthError() 19: if(false(),false(),false(),xs,ys,xs2,ys2,zs,zs2) -> addLists(xs2,ys2,zs) 20: if(false(),false(),true(),xs,ys,xs2,ys2,zs,zs2) -> addLists(xs,ys,zs2) 21: addList(xs,ys) -> addLists(xs,ys,nil()) Number of strict rules: 21 Direct POLO(bPol) ... failed. Uncurrying p 1: isEmpty(cons(x,xs)) -> false() 2: isEmpty(nil()) -> true() 3: isZero(0()) -> true() 4: isZero(s(x)) -> false() 5: head(cons(x,xs)) -> x 6: tail(cons(x,xs)) -> xs 7: tail(nil()) -> nil() 8: append(nil(),x) -> cons(x,nil()) 9: append(cons(y,ys),x) -> cons(y,append(ys,x)) 10: p^1_s(s(x)) -> s(p^1_s(x)) 11: p^1_s(0()) -> 0() 12: p^1_0() -> 0() 13: inc(s(x)) -> s(inc(x)) 14: inc(0()) -> s(0()) 15: addLists(xs,ys,zs) -> if(isEmpty(xs),isEmpty(ys),isZero(head(xs)),tail(xs),tail(ys),cons(p(head(xs)),tail(xs)),cons(inc(head(ys)),tail(ys)),zs,append(zs,head(ys))) 16: if(true(),true(),b,xs,ys,xs2,ys2,zs,zs2) -> zs 17: if(true(),false(),b,xs,ys,xs2,ys2,zs,zs2) -> differentLengthError() 18: if(false(),true(),b,xs,ys,xs2,ys2,zs,zs2) -> differentLengthError() 19: if(false(),false(),false(),xs,ys,xs2,ys2,zs,zs2) -> addLists(xs2,ys2,zs) 20: if(false(),false(),true(),xs,ys,xs2,ys2,zs,zs2) -> addLists(xs,ys,zs2) 21: addList(xs,ys) -> addLists(xs,ys,nil()) 22: p(0()) ->= p^1_0() 23: p(s(_1)) ->= p^1_s(_1) Number of strict rules: 21 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #inc(s(x)) -> #inc(x) #2: #append(cons(y,ys),x) -> #append(ys,x) #3: #p(s(_1)) ->? #p^1_s(_1) #4: #if(false(),false(),true(),xs,ys,xs2,ys2,zs,zs2) -> #addLists(xs,ys,zs2) #5: #p^1_s(s(x)) -> #p^1_s(x) #6: #p(0()) ->? #p^1_0() #7: #if(false(),false(),false(),xs,ys,xs2,ys2,zs,zs2) -> #addLists(xs2,ys2,zs) #8: #addList(xs,ys) -> #addLists(xs,ys,nil()) #9: #addLists(xs,ys,zs) -> #if(isEmpty(xs),isEmpty(ys),isZero(head(xs)),tail(xs),tail(ys),cons(p(head(xs)),tail(xs)),cons(inc(head(ys)),tail(ys)),zs,append(zs,head(ys))) #10: #addLists(xs,ys,zs) -> #isEmpty(xs) #11: #addLists(xs,ys,zs) -> #isEmpty(ys) #12: #addLists(xs,ys,zs) -> #isZero(head(xs)) #13: #addLists(xs,ys,zs) -> #head(xs) #14: #addLists(xs,ys,zs) -> #tail(xs) #15: #addLists(xs,ys,zs) -> #tail(ys) #16: #addLists(xs,ys,zs) -> #p(head(xs)) #17: #addLists(xs,ys,zs) -> #head(xs) #18: #addLists(xs,ys,zs) -> #tail(xs) #19: #addLists(xs,ys,zs) -> #inc(head(ys)) #20: #addLists(xs,ys,zs) -> #head(ys) #21: #addLists(xs,ys,zs) -> #tail(ys) #22: #addLists(xs,ys,zs) -> #append(zs,head(ys)) #23: #addLists(xs,ys,zs) -> #head(ys) Number of SCCs: 4, DPs: 6 SCC { #5 } POLO(Sum)... succeeded. s w: x1 + 1 #p^1_0 w: 0 #append w: 0 #isZero w: 0 #p^1_s w: x1 #isEmpty w: 0 p^1_0 w: 0 false w: 0 #head w: 0 isEmpty w: 0 p^1_s w: 0 addList w: 0 #inc w: 0 #p w: 0 inc w: 0 true w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472