Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709649
details
property
value
status
complete
benchmark
thiemann14.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.176119804382 seconds
cpu usage
0.200292477
max memory
1.5675392E7
stage attributes
key
value
output-size
5824
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: empty(nil()) -> true() 2: empty(cons(x,y)) -> false() 3: tail(nil()) -> nil() 4: tail(cons(x,y)) -> y 5: head(cons(x,y)) -> x 6: zero(0()) -> true() 7: zero(s(x)) -> false() 8: p(0()) -> 0() 9: p(s(0())) -> 0() 10: p(s(s(x))) -> s(p(s(x))) 11: intlist(x) -> if_intlist(empty(x),x) 12: if_intlist(true(),x) -> nil() 13: if_intlist(false(),x) -> cons(s(head(x)),intlist(tail(x))) 14: int(x,y) -> if_int(zero(x),zero(y),x,y) 15: if_int(true(),b,x,y) -> if1(b,x,y) 16: if_int(false(),b,x,y) -> if2(b,x,y) 17: if1(true(),x,y) -> cons(0(),nil()) 18: if1(false(),x,y) -> cons(0(),int(s(0()),y)) 19: if2(true(),x,y) -> nil() 20: if2(false(),x,y) -> intlist(int(p(x),p(y))) Number of strict rules: 20 Direct POLO(bPol) ... failed. Uncurrying p 1: empty(nil()) -> true() 2: empty(cons(x,y)) -> false() 3: tail(nil()) -> nil() 4: tail(cons(x,y)) -> y 5: head(cons(x,y)) -> x 6: zero(0()) -> true() 7: zero(s(x)) -> false() 8: p^1_0() -> 0() 9: p^1_s(0()) -> 0() 10: p^1_s(s(x)) -> s(p^1_s(x)) 11: intlist(x) -> if_intlist(empty(x),x) 12: if_intlist(true(),x) -> nil() 13: if_intlist(false(),x) -> cons(s(head(x)),intlist(tail(x))) 14: int(x,y) -> if_int(zero(x),zero(y),x,y) 15: if_int(true(),b,x,y) -> if1(b,x,y) 16: if_int(false(),b,x,y) -> if2(b,x,y) 17: if1(true(),x,y) -> cons(0(),nil()) 18: if1(false(),x,y) -> cons(0(),int(s(0()),y)) 19: if2(true(),x,y) -> nil() 20: if2(false(),x,y) -> intlist(int(p(x),p(y))) 21: p(0()) ->= p^1_0() 22: p(s(_1)) ->= p^1_s(_1) Number of strict rules: 20 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #if_intlist(false(),x) -> #head(x) #2: #if_intlist(false(),x) -> #intlist(tail(x)) #3: #if_intlist(false(),x) -> #tail(x) #4: #intlist(x) -> #if_intlist(empty(x),x) #5: #intlist(x) -> #empty(x) #6: #int(x,y) -> #if_int(zero(x),zero(y),x,y) #7: #int(x,y) -> #zero(x) #8: #int(x,y) -> #zero(y) #9: #if2(false(),x,y) -> #intlist(int(p(x),p(y))) #10: #if2(false(),x,y) -> #int(p(x),p(y)) #11: #if2(false(),x,y) -> #p(x) #12: #if2(false(),x,y) -> #p(y) #13: #p^1_s(s(x)) -> #p^1_s(x) #14: #p(s(_1)) ->? #p^1_s(_1) #15: #p(0()) ->? #p^1_0() #16: #if_int(false(),b,x,y) -> #if2(b,x,y) #17: #if_int(true(),b,x,y) -> #if1(b,x,y) #18: #if1(false(),x,y) -> #int(s(0()),y) Number of SCCs: 3, DPs: 8 SCC { #13 } POLO(Sum)... succeeded. zero w: 0 #empty w: 0 #intlist w: 0 s w: x1 + 1 #p^1_0 w: 0 if_int w: 0 #p^1_s w: x1 #if_int w: 0 p^1_0 w: 0 if1 w: 0 false w: 0 #head w: 0 p^1_s w: 0 #p w: 0 true w: 0 #if1 w: 0 if2 w: 0 p w: 0 tail w: 0 0 w: 0 nil w: 0 intlist w: 0 #tail w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472