Average Error: 0.3 → 0
Time: 294.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot \left(10 + 20\right)\]
d \cdot 10 + d \cdot 20
↓
d \cdot \left(10 + 20\right)
double f(double d) {
        double r309059 = d;
        double r309060 = 10.0;
        double r309061 = r309059 * r309060;
        double r309062 = 20.0;
        double r309063 = r309059 * r309062;
        double r309064 = r309061 + r309063;
        return r309064;
}
↓
double f(double d) {
        double r309065 = d;
        double r309066 = 10.0;
        double r309067 = 20.0;
        double r309068 = r309066 + r309067;
        double r309069 = r309065 * r309068;
        return r309069;
}

Error

Bits error versus d

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0
Herbie0
\[d \cdot 30\]

Derivation

  1. Initial program 0.3

    \[d \cdot 10 + d \cdot 20\]

  2. Simplified0

    \[\leadsto \color{blue}{d \cdot \left(10 + 20\right)}\]

  3. Final simplification0

    \[\leadsto d \cdot \left(10 + 20\right)\]

Reproduce

herbie shell --seed 2020047 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

  (+ (* d 10) (* d 20)))