/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: pred(s(x)) -> x 2: minus(x,0()) -> x 3: minus(x,s(y)) -> pred(minus(x,y)) 4: quot(0(),s(y)) -> 0() 5: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 6: log(s(0())) -> 0() 7: log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying log 1: pred(s(x)) -> x 2: minus(x,0()) -> x 3: minus(x,s(y)) -> pred(minus(x,y)) 4: quot(0(),s(y)) -> 0() 5: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 6: log^1_s(0()) -> 0() 7: log^1_s(s(x)) -> s(log^1_s(quot(x,s(s(0()))))) 8: log(s(_1)) ->= log^1_s(_1) Number of strict rules: 7 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #log^1_s(s(x)) -> #log^1_s(quot(x,s(s(0())))) #2: #log^1_s(s(x)) -> #quot(x,s(s(0()))) #3: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y)) #4: #quot(s(x),s(y)) -> #minus(x,y) #5: #minus(x,s(y)) -> #pred(minus(x,y)) #6: #minus(x,s(y)) -> #minus(x,y) #7: #log(s(_1)) ->? #log^1_s(_1) Number of SCCs: 3, DPs: 3 SCC { #6 } POLO(Sum)... succeeded. s w: x1 + 1 minus w: 0 #log^1_s w: 0 #log w: 0 pred w: 0 log w: 0 0 w: 0 quot w: 0 #minus w: x2 #pred w: 0 #quot w: 0 log^1_s w: 0 USABLE RULES: { } Removed DPs: #6 Number of SCCs: 2, DPs: 2 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 2 minus w: x1 #log^1_s w: x1 #log w: 0 pred w: x1 log w: 0 0 w: 1 quot w: x1 + 1 #minus w: 0 #pred w: 0 #quot w: 0 log^1_s w: 0 USABLE RULES: { 1..5 } Removed DPs: #1 Number of SCCs: 1, DPs: 1 SCC { #3 } POLO(Sum)... succeeded. s w: x1 + 2 minus w: x1 + 1 #log^1_s w: 0 #log w: 0 pred w: x1 log w: 0 0 w: 0 quot w: 1 #minus w: 0 #pred w: 0 #quot w: x1 log^1_s w: 0 USABLE RULES: { 1..4 } Removed DPs: #3 Number of SCCs: 0, DPs: 0