Average Error: 0.3 → 0
Time: 432.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 r161097 = d;
        double r161098 = 10.0;
        double r161099 = r161097 * r161098;
        double r161100 = 20.0;
        double r161101 = r161097 * r161100;
        double r161102 = r161099 + r161101;
        return r161102;
}
↓
double f(double d) {
        double r161103 = d;
        double r161104 = 10.0;
        double r161105 = 20.0;
        double r161106 = r161104 + r161105;
        double r161107 = r161103 * r161106;
        return r161107;
}

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 2019347 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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