0.00/0.00 MAYBE 0.00/0.00 0.00/0.00 Succeeded in reading "/export/starexec/sandbox2/benchmark/theBenchmark.trs". 0.00/0.00 (CONDITIONTYPE ORIENTED) 0.00/0.00 (VAR x y x2 x1) 0.00/0.00 (RULES 0.00/0.00 pin(x) -> pout(g(x)) 0.00/0.00 pin(x) -> pout(f(y)) | pin(x) == pout(g(y)) 0.00/0.00 ) 0.00/0.00 (COMMENT COPS 330) 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 (CONDITION 0.00/0.00 pin(x1) == pout(g(x2)) 0.00/0.00 ) 0.00/0.00 0.00/0.00 This is ultra-RL and deterministic. 0.00/0.00 0.00/0.00 This is not operationally terminating and confluent. 0.00/0.00 0.00/0.00 (RTG_of_NARROWINGTREE 0.00/0.00 (START 0.00/0.00 Gamma[pin(x1) == pout(g(x2)) : { e, 1 }] 0.00/0.00 ) 0.00/0.00 (NONTERMINALS 0.00/0.00 Gamma[pin(x1) == pout(g(x2)) : { e, 1 }] 0.00/0.00 Gamma[pin(x15) == pout2 : { e, 1 }] 0.00/0.00 ) 0.00/0.00 (RULES 0.00/0.00 Gamma[pin(x1) == pout(g(x2)) : { e, 1 }] -> (Rec(Gamma[pin(x15) == pout2 : { e, 1 }], { pout1 -> pout2, x1 -> x15 }) & { pout1 -> pout(g(x2)) }) 0.00/0.00 Gamma[pin(x15) == pout2 : { e, 1 }] -> { pout2 -> pin(x15) } 0.00/0.00 Gamma[pin(x15) == pout2 : { e, 1 }] -> { pout2 -> pout(g(x17)), x15 -> x17 } 0.00/0.00 Gamma[pin(x15) == pout2 : { e, 1 }] -> (((Rec(Gamma[pin(x15) == pout2 : { e, 1 }], { pout3 -> pout2, x18 -> x15 }) & { pout3 -> pout(g(y3)) }) & { pout2 -> pout(f(y3)) }) . { x15 -> x18 }) 0.00/0.00 ) 0.00/0.00 ) 0.00/0.00 0.00/0.00 Failed to prove infeasibility of the linearized conditions by means of narrowing trees. 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 (RTG_of_NARROWINGTREE 0.00/0.00 (START 0.00/0.00 Gamma[pout(g(x2)) == pin(x1) : { e, 1, 1.1 }] 0.00/0.00 ) 0.00/0.00 (NONTERMINALS 0.00/0.00 Gamma[pout(g(x2)) == pin(x1) : { e, 1, 1.1 }] 0.00/0.00 ) 0.00/0.00 (RULES 0.00/0.00 Gamma[pout(g(x2)) == pin(x1) : { e, 1, 1.1 }] -> { x1 -> x27 } 0.00/0.00 ) 0.00/0.00 ) 0.00/0.00 0.00/0.00 0.00/0.00 MAYBE 0.00/0.00 EOF