/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: f(true(),true(),x,s(y)) -> f(isNat(x),isNat(y),s(x),double(s(y))) 2: isNat(0()) -> true() 3: isNat(s(x)) -> isNat(x) 4: double(0()) -> 0() 5: double(s(x)) -> s(s(double(x))) Number of strict rules: 5 Direct POLO(bPol) ... failed. Uncurrying double 1: f(true(),true(),x,s(y)) -> f(isNat(x),isNat(y),s(x),double^1_s(y)) 2: isNat(0()) -> true() 3: isNat(s(x)) -> isNat(x) 4: double^1_0() -> 0() 5: double^1_s(x) -> s(s(double(x))) 6: double(0()) ->= double^1_0() 7: double(s(_1)) ->= double^1_s(_1) Number of strict rules: 5 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #double(0()) ->? #double^1_0() #2: #double(s(_1)) ->? #double^1_s(_1) #3: #double^1_s(x) -> #double(x) #4: #isNat(s(x)) -> #isNat(x) #5: #f(true(),true(),x,s(y)) -> #f(isNat(x),isNat(y),s(x),double^1_s(y)) #6: #f(true(),true(),x,s(y)) -> #isNat(x) #7: #f(true(),true(),x,s(y)) -> #isNat(y) #8: #f(true(),true(),x,s(y)) -> #double^1_s(y) Number of SCCs: 3, DPs: 4 SCC { #4 } POLO(Sum)... succeeded. double^1_s w: 0 s w: x1 + 1 #isNat w: x1 double^1_0 w: 0 true w: 0 f w: 0 #double^1_0 w: 0 0 w: 0 #double w: 0 double w: 0 #f w: 0 isNat w: 0 #double^1_s w: 0 USABLE RULES: { } Removed DPs: #4 Number of SCCs: 2, DPs: 3 SCC { #2 #3 } POLO(Sum)... succeeded. double^1_s w: 0 s w: x1 + 2 #isNat w: 0 double^1_0 w: 0 true w: 0 f w: 0 #double^1_0 w: 0 0 w: 0 #double w: x1 double w: 0 #f w: 0 isNat w: 0 #double^1_s w: x1 + 1 USABLE RULES: { } Removed DPs: #2 #3 Number of SCCs: 1, DPs: 1 SCC { #5 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.