Average Error: 0.3 → 0
Time: 1.1s
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 r224513 = d;
        double r224514 = 10.0;
        double r224515 = r224513 * r224514;
        double r224516 = 20.0;
        double r224517 = r224513 * r224516;
        double r224518 = r224515 + r224517;
        return r224518;
}
↓
double f(double d) {
        double r224519 = d;
        double r224520 = 10.0;
        double r224521 = 20.0;
        double r224522 = r224520 + r224521;
        double r224523 = r224519 * r224522;
        return r224523;
}

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 2019323 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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