Average Error: 0.3 → 0
Time: 313.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 r377234 = d;
        double r377235 = 10.0;
        double r377236 = r377234 * r377235;
        double r377237 = 20.0;
        double r377238 = r377234 * r377237;
        double r377239 = r377236 + r377238;
        return r377239;
}
↓
double f(double d) {
        double r377240 = d;
        double r377241 = 10.0;
        double r377242 = 20.0;
        double r377243 = r377241 + r377242;
        double r377244 = r377240 * r377243;
        return r377244;
}

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 2020065 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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