Average Error: 0.3 → 0
Time: 299.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 r699299 = d;
        double r699300 = 10.0;
        double r699301 = r699299 * r699300;
        double r699302 = 20.0;
        double r699303 = r699299 * r699302;
        double r699304 = r699301 + r699303;
        return r699304;
}
↓
double f(double d) {
        double r699305 = d;
        double r699306 = 10.0;
        double r699307 = 20.0;
        double r699308 = r699306 + r699307;
        double r699309 = r699305 * r699308;
        return r699309;
}

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

  :herbie-target
  (* d 30)

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