Average Error: 0.3 → 0
Time: 585.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 r153932 = d;
        double r153933 = 10.0;
        double r153934 = r153932 * r153933;
        double r153935 = 20.0;
        double r153936 = r153932 * r153935;
        double r153937 = r153934 + r153936;
        return r153937;
}
↓
double f(double d) {
        double r153938 = d;
        double r153939 = 10.0;
        double r153940 = 20.0;
        double r153941 = r153939 + r153940;
        double r153942 = r153938 * r153941;
        return r153942;
}

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

  :herbie-target
  (* d 30)

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