Average Error: 0.3 → 0
Time: 627.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 r182400 = d;
        double r182401 = 10.0;
        double r182402 = r182400 * r182401;
        double r182403 = 20.0;
        double r182404 = r182400 * r182403;
        double r182405 = r182402 + r182404;
        return r182405;
}
↓
double f(double d) {
        double r182406 = d;
        double r182407 = 10.0;
        double r182408 = 20.0;
        double r182409 = r182407 + r182408;
        double r182410 = r182406 * r182409;
        return r182410;
}

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

  :herbie-target
  (* d 30)

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