Average Error: 0.0 → 0.0
Time: 6.8s
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[x \cdot \left(1 - x \cdot 0.5\right)\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
x \cdot \left(1 - x \cdot 0.5\right)
double f(double x) {
        double r34651 = x;
        double r34652 = 1.0;
        double r34653 = 0.5;
        double r34654 = r34651 * r34653;
        double r34655 = r34652 - r34654;
        double r34656 = r34651 * r34655;
        return r34656;
}
↓
double f(double x) {
        double r34657 = x;
        double r34658 = 1.0;
        double r34659 = 0.5;
        double r34660 = r34657 * r34659;
        double r34661 = r34658 - r34660;
        double r34662 = r34657 * r34661;
        return r34662;
}

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

    \[x \cdot \left(1 - x \cdot 0.5\right)\]

  2. Final simplification0.0

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

Reproduce

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