Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[\frac{x + 1}{1 - x}\]
↓
\[\sqrt[3]{{\left(\frac{x + 1}{1 - x}\right)}^{3}}\]
\frac{x + 1}{1 - x}
↓
\sqrt[3]{{\left(\frac{x + 1}{1 - x}\right)}^{3}}
double f(double x) {
        double r39823 = x;
        double r39824 = 1.0;
        double r39825 = r39823 + r39824;
        double r39826 = r39824 - r39823;
        double r39827 = r39825 / r39826;
        return r39827;
}
↓
double f(double x) {
        double r39828 = x;
        double r39829 = 1.0;
        double r39830 = r39828 + r39829;
        double r39831 = r39829 - r39828;
        double r39832 = r39830 / r39831;
        double r39833 = 3.0;
        double r39834 = pow(r39832, r39833);
        double r39835 = cbrt(r39834);
        return r39835;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{x + 1}{1 - x}\]
  2. Using strategy rm

  3. Applied add-cbrt-cube21.3

    \[\leadsto \frac{x + 1}{\color{blue}{\sqrt[3]{\left(\left(1 - x\right) \cdot \left(1 - x\right)\right) \cdot \left(1 - x\right)}}}\]

  4. Applied add-cbrt-cube21.9

    \[\leadsto \frac{\color{blue}{\sqrt[3]{\left(\left(x + 1\right) \cdot \left(x + 1\right)\right) \cdot \left(x + 1\right)}}}{\sqrt[3]{\left(\left(1 - x\right) \cdot \left(1 - x\right)\right) \cdot \left(1 - x\right)}}\]

  5. Applied cbrt-undiv21.9

    \[\leadsto \color{blue}{\sqrt[3]{\frac{\left(\left(x + 1\right) \cdot \left(x + 1\right)\right) \cdot \left(x + 1\right)}{\left(\left(1 - x\right) \cdot \left(1 - x\right)\right) \cdot \left(1 - x\right)}}}\]

  6. Simplified0.0

    \[\leadsto \sqrt[3]{\color{blue}{{\left(\frac{x + 1}{1 - x}\right)}^{3}}}\]

  7. Final simplification0.0

    \[\leadsto \sqrt[3]{{\left(\frac{x + 1}{1 - x}\right)}^{3}}\]

Reproduce

herbie shell --seed 2020025 +o rules:numerics
(FPCore (x)
  :name "Prelude:atanh from fay-base-0.20.0.1"
  :precision binary64
  (/ (+ x 1) (- 1 x)))