Average Error: 0.0 → 0.0
Time: 837.0ms
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[x \cdot 1 + x \cdot \left(-x \cdot 0.5\right)\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
x \cdot 1 + x \cdot \left(-x \cdot 0.5\right)
double f(double x) {
        double r39036 = x;
        double r39037 = 1.0;
        double r39038 = 0.5;
        double r39039 = r39036 * r39038;
        double r39040 = r39037 - r39039;
        double r39041 = r39036 * r39040;
        return r39041;
}
↓
double f(double x) {
        double r39042 = x;
        double r39043 = 1.0;
        double r39044 = r39042 * r39043;
        double r39045 = 0.5;
        double r39046 = r39042 * r39045;
        double r39047 = -r39046;
        double r39048 = r39042 * r39047;
        double r39049 = r39044 + r39048;
        return r39049;
}

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. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

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