/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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 poly ... failed. Freezing 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 poly ... 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 } Sum... succeeded. #double❆1_0() w: (0) s(x1) w: (1 + x1) #isNat(x1) w: (x1) #double❆1_s(x1) w: (0) true() w: (0) f(x1,x2,x3,x4) w: (0) 0() w: (0) #double(x1) w: (0) double(x1) w: (0) #f(x1,x2,x3,x4) w: (0) double❆1_0() w: (0) isNat(x1) w: (0) double❆1_s(x1) w: (0) USABLE RULES: { } Removed DPs: #4 Number of SCCs: 2, DPs: 3 SCC { #2 #3 } Sum... succeeded. #double❆1_0() w: (0) s(x1) w: (2 + x1) #isNat(x1) w: (0) #double❆1_s(x1) w: (1 + x1) true() w: (0) f(x1,x2,x3,x4) w: (0) 0() w: (0) #double(x1) w: (x1) double(x1) w: (0) #f(x1,x2,x3,x4) w: (0) double❆1_0() w: (0) isNat(x1) w: (0) double❆1_s(x1) w: (0) USABLE RULES: { } Removed DPs: #2 #3 Number of SCCs: 1, DPs: 1 SCC { #5 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.