Average Error: 0.3 → 0
Time: 374.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 r298371 = d;
        double r298372 = 10.0;
        double r298373 = r298371 * r298372;
        double r298374 = 20.0;
        double r298375 = r298371 * r298374;
        double r298376 = r298373 + r298375;
        return r298376;
}
↓
double f(double d) {
        double r298377 = d;
        double r298378 = 10.0;
        double r298379 = 20.0;
        double r298380 = r298378 + r298379;
        double r298381 = r298377 * r298380;
        return r298381;
}

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

  :herbie-target
  (* d 30)

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