Average Error: 0.0 → 0.0
Time: 872.0ms
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 r68003 = x;
        double r68004 = 1.0;
        double r68005 = 0.5;
        double r68006 = r68003 * r68005;
        double r68007 = r68004 - r68006;
        double r68008 = r68003 * r68007;
        return r68008;
}
↓
double f(double x) {
        double r68009 = x;
        double r68010 = 1.0;
        double r68011 = 0.5;
        double r68012 = r68009 * r68011;
        double r68013 = r68010 - r68012;
        double r68014 = r68009 * r68013;
        return r68014;
}

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