Average Error: 0.3 → 0
Time: 323.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 r405922 = d;
        double r405923 = 10.0;
        double r405924 = r405922 * r405923;
        double r405925 = 20.0;
        double r405926 = r405922 * r405925;
        double r405927 = r405924 + r405926;
        return r405927;
}
↓
double f(double d) {
        double r405928 = d;
        double r405929 = 10.0;
        double r405930 = 20.0;
        double r405931 = r405929 + r405930;
        double r405932 = r405928 * r405931;
        return r405932;
}

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

  :herbie-target
  (* d 30)

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