/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: app(app(app(if(),true()),x),y) -> x 2: app(app(app(if(),false()),x),y) -> y 3: app(app(app(until(),p),f),x) -> app(app(app(if(),app(p,x)),x),app(app(app(until(),p),f),app(f,x))) Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying app 1: app^3_if(true(),x,y) -> x 2: app^3_if(false(),x,y) -> y 3: app^3_until(p,f,x) -> app^3_if(app(p,x),x,app^3_until(p,f,app(f,x))) 4: app(if(),_1) ->= app^1_if(_1) 5: app(app^1_if(_1),_2) ->= app^2_if(_1,_2) 6: app(app^2_if(_1,_2),_3) ->= app^3_if(_1,_2,_3) 7: app(until(),_1) ->= app^1_until(_1) 8: app(app^1_until(_1),_2) ->= app^2_until(_1,_2) 9: app(app^2_until(_1,_2),_3) ->= app^3_until(_1,_2,_3) Number of strict rules: 3 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app(app^2_if(_1,_2),_3) ->? #app^3_if(_1,_2,_3) #2: #app(app^2_until(_1,_2),_3) ->? #app^3_until(_1,_2,_3) #3: #app^3_until(p,f,x) -> #app^3_if(app(p,x),x,app^3_until(p,f,app(f,x))) #4: #app^3_until(p,f,x) -> #app(p,x) #5: #app^3_until(p,f,x) -> #app^3_until(p,f,app(f,x)) #6: #app^3_until(p,f,x) -> #app(f,x) Number of SCCs: 1, DPs: 4 SCC { #2 #4..6 } POLO(Sum)... succeeded. #app^3_if w: 0 false w: 1 true w: 1 app^2_until w: x1 + x2 + 2 if w: 0 app^1_until w: 0 #app w: x1 app^3_until w: x2 + 1 app^2_if w: 0 app^3_if w: x1 + x2 + x3 + 2 until w: 0 app^1_if w: 0 #app^3_until w: x1 + x2 + 1 app w: 1 USABLE RULES: { } Removed DPs: #2 #4 #6 Number of SCCs: 1, DPs: 1 SCC { #5 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #app^3_until(p_{1},f_{1},x) -#5-> #app^3_until(p_{1},f_{1},app(f_{1},x)) --->* #app^3_until(p_{1},f_{1},app(f_{1},x)) Looping with: [ p_{1} := p_{1}; f_{1} := f_{1}; x := app(f_{1},x); ]