/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: g(A()) -> A() 2: g(B()) -> A() 3: g(B()) -> B() 4: g(C()) -> A() 5: g(C()) -> B() 6: g(C()) -> C() 7: foldB(t,0()) -> t 8: foldB(t,s(n)) -> f(foldB(t,n),B()) 9: foldC(t,0()) -> t 10: foldC(t,s(n)) -> f(foldC(t,n),C()) 11: f(t,x) -> f'(t,g(x)) 12: f'(triple(a,b,c),C()) -> triple(a,b,s(c)) 13: f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) 14: f'(triple(a,b,c),A()) -> f''(foldB(triple(s(a),0(),c),b)) 15: f''(triple(a,b,c)) -> foldC(triple(a,b,0()),c) 16: fold(t,x,0()) -> t 17: fold(t,x,s(n)) -> f(fold(t,x,n),x) Number of strict rules: 17 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #f'(triple(a,b,c),B()) -> #f(triple(a,b,c),A()) #2: #f(t,x) -> #f'(t,g(x)) #3: #f(t,x) -> #g(x) #4: #f'(triple(a,b,c),A()) -> #f''(foldB(triple(s(a),0(),c),b)) #5: #f'(triple(a,b,c),A()) -> #foldB(triple(s(a),0(),c),b) #6: #foldC(t,s(n)) -> #f(foldC(t,n),C()) #7: #foldC(t,s(n)) -> #foldC(t,n) #8: #fold(t,x,s(n)) -> #f(fold(t,x,n),x) #9: #fold(t,x,s(n)) -> #fold(t,x,n) #10: #foldB(t,s(n)) -> #f(foldB(t,n),B()) #11: #foldB(t,s(n)) -> #foldB(t,n) #12: #f''(triple(a,b,c)) -> #foldC(triple(a,b,0()),c) Number of SCCs: 2, DPs: 10 SCC { #9 } POLO(Sum)... succeeded. s w: x1 + 1 #foldC w: 0 #f' w: 0 triple w: 0 C w: 0 f w: 0 B w: 0 foldB w: 0 #fold w: x3 0 w: 0 #foldB w: 0 A w: 0 #f w: 0 #g w: 0 fold w: 0 f' w: 0 foldC w: 0 g w: 0 f'' w: 0 #f'' w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 1, DPs: 9 SCC { #1 #2 #4..7 #10..12 } POLO(Sum)... succeeded. s w: x1 + 5 #foldC w: x1 + x2 #f' w: x1 + 3 triple w: x2 + x3 + 2 C w: 2 f w: x1 + 5 B w: 2 foldB w: x1 + x2 + 1 #fold w: 0 0 w: 0 #foldB w: x1 + x2 + 2 A w: 2 #f w: x1 + 3 #g w: 0 fold w: 0 f' w: x1 + 5 foldC w: x1 + x2 + 1 g w: 1 f'' w: x1 + 4 #f'' w: x1 + 1 USABLE RULES: { 7..15 } Removed DPs: #4..7 #10..12 Number of SCCs: 1, DPs: 2 SCC { #1 #2 } POLO(Sum)... succeeded. s w: 1 #foldC w: 0 #f' w: x2 + 3 triple w: 4 C w: 3 f w: x1 + 2 B w: 4 foldB w: x1 + x2 + 1 #fold w: 0 0 w: 0 #foldB w: 2 A w: 1 #f w: x2 + 5 #g w: 0 fold w: 0 f' w: 3 foldC w: x2 + 1 g w: x1 + 1 f'' w: 0 #f'' w: 1 USABLE RULES: { 1..6 } Removed DPs: #1 #2 Number of SCCs: 0, DPs: 0