Average Error: 0.3 → 0
Time: 983.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 r356717 = d;
        double r356718 = 10.0;
        double r356719 = r356717 * r356718;
        double r356720 = 20.0;
        double r356721 = r356717 * r356720;
        double r356722 = r356719 + r356721;
        return r356722;
}
↓
double f(double d) {
        double r356723 = d;
        double r356724 = 10.0;
        double r356725 = 20.0;
        double r356726 = r356724 + r356725;
        double r356727 = r356723 * r356726;
        return r356727;
}

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

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))