Average Error: 0.3 → 0
Time: 710.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 r123188 = d;
        double r123189 = 10.0;
        double r123190 = r123188 * r123189;
        double r123191 = 20.0;
        double r123192 = r123188 * r123191;
        double r123193 = r123190 + r123192;
        return r123193;
}
↓
double f(double d) {
        double r123194 = d;
        double r123195 = 10.0;
        double r123196 = 20.0;
        double r123197 = r123195 + r123196;
        double r123198 = r123194 * r123197;
        return r123198;
}

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

  :herbie-target
  (* d 30)

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