Average Error: 0.3 → 0
Time: 289.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 r185371 = d;
        double r185372 = 10.0;
        double r185373 = r185371 * r185372;
        double r185374 = 20.0;
        double r185375 = r185371 * r185374;
        double r185376 = r185373 + r185375;
        return r185376;
}
↓
double f(double d) {
        double r185377 = d;
        double r185378 = 10.0;
        double r185379 = 20.0;
        double r185380 = r185378 + r185379;
        double r185381 = r185377 * r185380;
        return r185381;
}

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

  :herbie-target
  (* d 30)

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