Average Error: 60.9 → 0.0
Time: 36.9s
Precision: 64
\[-1 \lt x \land x \lt 1\]
\[\frac{\log \left(1 - x\right)}{\log \left(1 + x\right)}\]
↓
\[\frac{\log_* (1 + \left(-x\right))}{\log_* (1 + x)}\]
\frac{\log \left(1 - x\right)}{\log \left(1 + x\right)}
↓
\frac{\log_* (1 + \left(-x\right))}{\log_* (1 + x)}
double f(double x) {
        double r6341336 = 1.0;
        double r6341337 = x;
        double r6341338 = r6341336 - r6341337;
        double r6341339 = log(r6341338);
        double r6341340 = r6341336 + r6341337;
        double r6341341 = log(r6341340);
        double r6341342 = r6341339 / r6341341;
        return r6341342;
}
↓
double f(double x) {
        double r6341343 = x;
        double r6341344 = -r6341343;
        double r6341345 = log1p(r6341344);
        double r6341346 = log1p(r6341343);
        double r6341347 = r6341345 / r6341346;
        return r6341347;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original60.9
Target0.3
Herbie0.0
\[-\left(\left(\left(1 + x\right) + \frac{x \cdot x}{2}\right) + \frac{5}{12} \cdot {x}^{3}\right)\]

Derivation

  1. Initial program 60.9

    \[\frac{\log \left(1 - x\right)}{\log \left(1 + x\right)}\]

  2. Simplified60.0

    \[\leadsto \color{blue}{\frac{\log \left(1 - x\right)}{\log_* (1 + x)}}\]
  3. Using strategy rm

  4. Applied sub-neg60.0

    \[\leadsto \frac{\log \color{blue}{\left(1 + \left(-x\right)\right)}}{\log_* (1 + x)}\]

  5. Applied log1p-def0.0

    \[\leadsto \frac{\color{blue}{\log_* (1 + \left(-x\right))}}{\log_* (1 + x)}\]

  6. Final simplification0.0

    \[\leadsto \frac{\log_* (1 + \left(-x\right))}{\log_* (1 + x)}\]

Reproduce

herbie shell --seed 2019107 +o rules:numerics
(FPCore (x)
  :name "qlog (example 3.10)"
  :pre (and (< -1 x) (< x 1))

  :herbie-target
  (- (+ (+ (+ 1 x) (/ (* x x) 2)) (* 5/12 (pow x 3))))

  (/ (log (- 1 x)) (log (+ 1 x))))