0.00/0.00 MAYBE 0.00/0.00 0.00/0.00 Succeeded in reading "/export/starexec/sandbox/benchmark/theBenchmark.trs". 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR n m l x1 x3) 0.00/0.00 (RULES 0.00/0.00 lte(0,n) -> true 0.00/0.00 lte(s(m),0) -> false 0.00/0.00 lte(s(m),s(n)) -> lte(m,n) 0.00/0.00 insert(nil,m) -> cons(m,nil) 0.00/0.00 insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) == true 0.00/0.00 insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) == false 0.00/0.00 ordered(nil) -> true 0.00/0.00 ordered(cons(m,nil)) -> true 0.00/0.00 ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) == true 0.00/0.00 ordered(cons(m,cons(n,l))) -> false | lte(m,n) == false 0.00/0.00 ) 0.00/0.00 (COMMENT COPS 272) 0.00/0.00 (COMMENT submitted by: Naoki Nishida) 0.00/0.00 0.00/0.00 No "->="-rules. 0.00/0.00 0.00/0.00 Decomposed conditions and removed infeasible rules if possible. 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR n m l x1 x3) 0.00/0.00 (RULES 0.00/0.00 lte(0,n) -> true 0.00/0.00 lte(s(m),0) -> false 0.00/0.00 lte(s(m),s(n)) -> lte(m,n) 0.00/0.00 insert(nil,m) -> cons(m,nil) 0.00/0.00 insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) == true 0.00/0.00 insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) == false 0.00/0.00 ordered(nil) -> true 0.00/0.00 ordered(cons(m,nil)) -> true 0.00/0.00 ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) == true 0.00/0.00 ordered(cons(m,cons(n,l))) -> false | lte(m,n) == false 0.00/0.00 ) 0.00/0.00 (COMMENT COPS 272) 0.00/0.00 (COMMENT submitted by: Naoki Nishida) 0.00/0.00 0.00/0.00 (VAR x1 x3) 0.00/0.00 (CONDITION 0.00/0.00 lte(x3,x1) == true, lte(x3,x1) == false 0.00/0.00 ) 0.00/0.00 0.00/0.00 Optimized the infeasibility problem if possible. 0.00/0.00 0.00/0.00 (VAR x1 x3) 0.00/0.00 (CONDITION 0.00/0.00 lte(x3,x1) == true, lte(x3,x1) == false 0.00/0.00 ) 0.00/0.00 0.00/0.00 This is not ultra-RL and deterministic. 0.00/0.00 0.00/0.00 The inverted system is ultra-RL and deterministic. 0.00/0.00 0.00/0.00 0.00/0.00 MAYBE 0.00/0.00 EOF