Average Error: 0.0 → 0.0
Time: 7.4s
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 r35160 = x;
        double r35161 = 1.0;
        double r35162 = 0.5;
        double r35163 = r35160 * r35162;
        double r35164 = r35161 - r35163;
        double r35165 = r35160 * r35164;
        return r35165;
}
↓
double f(double x) {
        double r35166 = x;
        double r35167 = 1.0;
        double r35168 = 0.5;
        double r35169 = r35166 * r35168;
        double r35170 = r35167 - r35169;
        double r35171 = r35166 * r35170;
        return r35171;
}

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 2019303 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1 (* x 0.5))))