/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: app(app(mapbt(),f),app(leaf(),x)) -> app(leaf(),app(f,x)) 2: app(app(mapbt(),f),app(app(app(branch(),x),l),r)) -> app(app(app(branch(),app(f,x)),app(app(mapbt(),f),l)),app(app(mapbt(),f),r)) Number of strict rules: 2 Direct POLO(bPol) ... failed. Uncurrying app 1: app^2_mapbt(f,app^1_leaf(x)) -> app^1_leaf(app(f,x)) 2: app^2_mapbt(f,app^3_branch(x,l,r)) -> app^3_branch(app(f,x),app^2_mapbt(f,l),app^2_mapbt(f,r)) 3: app(branch(),_1) ->= app^1_branch(_1) 4: app(app^1_branch(_1),_2) ->= app^2_branch(_1,_2) 5: app(app^2_branch(_1,_2),_3) ->= app^3_branch(_1,_2,_3) 6: app(mapbt(),_1) ->= app^1_mapbt(_1) 7: app(app^1_mapbt(_1),_2) ->= app^2_mapbt(_1,_2) 8: app(leaf(),_1) ->= app^1_leaf(_1) Number of strict rules: 2 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^2_mapbt(f,app^3_branch(x,l,r)) -> #app(f,x) #2: #app^2_mapbt(f,app^3_branch(x,l,r)) -> #app^2_mapbt(f,l) #3: #app^2_mapbt(f,app^3_branch(x,l,r)) -> #app^2_mapbt(f,r) #4: #app(app^1_mapbt(_1),_2) ->? #app^2_mapbt(_1,_2) #5: #app^2_mapbt(f,app^1_leaf(x)) -> #app(f,x) Number of SCCs: 1, DPs: 5 SCC { #1..5 } POLO(Sum)... succeeded. app^3_branch w: 1 #app^2_mapbt w: x1 + 1 mapbt w: 0 app^1_mapbt w: x1 + 2 app^1_branch w: 0 #app w: x1 app^2_branch w: 0 app^2_mapbt w: 0 branch w: 0 leaf w: 0 app^1_leaf w: 1 app w: 0 USABLE RULES: { } Removed DPs: #1 #4 #5 Number of SCCs: 1, DPs: 2 SCC { #2 #3 } POLO(Sum)... succeeded. app^3_branch w: x2 + x3 + 1 #app^2_mapbt w: x2 + 1 mapbt w: 0 app^1_mapbt w: 2 app^1_branch w: 0 #app w: 0 app^2_branch w: 0 app^2_mapbt w: 0 branch w: 0 leaf w: 0 app^1_leaf w: 1 app w: 0 USABLE RULES: { } Removed DPs: #2 #3 Number of SCCs: 0, DPs: 0