Sergey B Kirpichev

https://github.com/sympy/sympy/issues/21394

[Rubi integrator](http://www.apmaths.uwo.ca/%7Earich/) could handle this: ``` In[10]:= Int[Exp[x] Sqrt[1 + Exp[2 x]], x] Out[10]= 1/2 E^x Sqrt[1 + E^(2 x)] + ArcSinh[E^x]/2 ```

Yes, I know. I'm thinking about replacing current pattern matching with MatchPy.

Thank you for your attention to the project. Unfortunately, I have doubts on this feature. 1) I'm not sure why the SymPy is a special case. There are no plans...

> Thanks for your thoughts. I don't know, but I'm guessing that, when a > Python user wants to use symbolic computation, they usually turn to Sympy. > I guess...

Ok, I've removed also the 1.0 milestone, because I don't have good idea on how to solve this issue and, probably, I've no decent knowledge on the recent SymPy functionality...

No suggestions or help. So, I'll do something like a blog post for some next release, as best as I can to cover the issue, to close this one.

It doesn't enter into infinite recursion, just too slow (and excluded from travis-ci testings). ```python In [1]: %time limit((x**10/((x + 1)**10 + exp(-x))), x, oo) CPU times: user 2.88 s,...

This doesn't mean an infinite recursion. Try to increase maximal recursion depth with sys.setrecursionlimit.

> Can you guide me on how to start with this. I doubt this is an easy issue. Probably, you could start with using a debugger to figure out what's...