Average Error: 0.1 → 0.1
Time: 2.7s
Precision: 64
\[x \cdot \left(1 - x \cdot y\right)\]
↓
\[x \cdot 1 + x \cdot \left(-x \cdot y\right)\]
x \cdot \left(1 - x \cdot y\right)
↓
x \cdot 1 + x \cdot \left(-x \cdot y\right)
double f(double x, double y) {
        double r95021 = x;
        double r95022 = 1.0;
        double r95023 = y;
        double r95024 = r95021 * r95023;
        double r95025 = r95022 - r95024;
        double r95026 = r95021 * r95025;
        return r95026;
}
↓
double f(double x, double y) {
        double r95027 = x;
        double r95028 = 1.0;
        double r95029 = r95027 * r95028;
        double r95030 = y;
        double r95031 = r95027 * r95030;
        double r95032 = -r95031;
        double r95033 = r95027 * r95032;
        double r95034 = r95029 + r95033;
        return r95034;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[x \cdot \left(1 - x \cdot y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.1

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

  4. Applied distribute-lft-in0.1

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

  5. Final simplification0.1

    \[\leadsto x \cdot 1 + x \cdot \left(-x \cdot y\right)\]

Reproduce

herbie shell --seed 2020062 
(FPCore (x y)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, A"
  :precision binary64
  (* x (- 1 (* x y))))