Average Error: 0.3 → 0
Time: 297.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 r131918 = d;
        double r131919 = 10.0;
        double r131920 = r131918 * r131919;
        double r131921 = 20.0;
        double r131922 = r131918 * r131921;
        double r131923 = r131920 + r131922;
        return r131923;
}
↓
double f(double d) {
        double r131924 = d;
        double r131925 = 10.0;
        double r131926 = 20.0;
        double r131927 = r131925 + r131926;
        double r131928 = r131924 * r131927;
        return r131928;
}

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

  :herbie-target
  (* d 30)

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