Average Error: 0.3 → 0
Time: 389.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 r404849 = d;
        double r404850 = 10.0;
        double r404851 = r404849 * r404850;
        double r404852 = 20.0;
        double r404853 = r404849 * r404852;
        double r404854 = r404851 + r404853;
        return r404854;
}
↓
double f(double d) {
        double r404855 = d;
        double r404856 = 10.0;
        double r404857 = 20.0;
        double r404858 = r404856 + r404857;
        double r404859 = r404855 * r404858;
        return r404859;
}

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

  :herbie-target
  (* d 30)

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