Average Error: 0.3 → 0
Time: 337.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 r299160 = d;
        double r299161 = 10.0;
        double r299162 = r299160 * r299161;
        double r299163 = 20.0;
        double r299164 = r299160 * r299163;
        double r299165 = r299162 + r299164;
        return r299165;
}
↓
double f(double d) {
        double r299166 = d;
        double r299167 = 10.0;
        double r299168 = 20.0;
        double r299169 = r299167 + r299168;
        double r299170 = r299166 * r299169;
        return r299170;
}

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

  :herbie-target
  (* d 30)

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