Average Error: 0.1 → 0.1
Time: 15.5s
Precision: 64
\[x \cdot \left(1 - x \cdot y\right)\]
↓
\[x \cdot \left(1 - x \cdot y\right)\]
x \cdot \left(1 - x \cdot y\right)
↓
x \cdot \left(1 - x \cdot y\right)
double f(double x, double y) {
        double r65992 = x;
        double r65993 = 1.0;
        double r65994 = y;
        double r65995 = r65992 * r65994;
        double r65996 = r65993 - r65995;
        double r65997 = r65992 * r65996;
        return r65997;
}
↓
double f(double x, double y) {
        double r65998 = x;
        double r65999 = 1.0;
        double r66000 = y;
        double r66001 = r65998 * r66000;
        double r66002 = r65999 - r66001;
        double r66003 = r65998 * r66002;
        return r66003;
}

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. Final simplification0.1

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

Reproduce

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