Average Error: 0.0 → 0.0
Time: 5.8s
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[1 \cdot x + \left(0.5 \cdot x\right) \cdot \left(-x\right)\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
1 \cdot x + \left(0.5 \cdot x\right) \cdot \left(-x\right)
double f(double x) {
        double r3367936 = x;
        double r3367937 = 1.0;
        double r3367938 = 0.5;
        double r3367939 = r3367936 * r3367938;
        double r3367940 = r3367937 - r3367939;
        double r3367941 = r3367936 * r3367940;
        return r3367941;
}
↓
double f(double x) {
        double r3367942 = 1.0;
        double r3367943 = x;
        double r3367944 = r3367942 * r3367943;
        double r3367945 = 0.5;
        double r3367946 = r3367945 * r3367943;
        double r3367947 = -r3367943;
        double r3367948 = r3367946 * r3367947;
        double r3367949 = r3367944 + r3367948;
        return r3367949;
}

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-rgt-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019172 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  (* x (- 1.0 (* x 0.5))))