Average Error: 0.3 → 0
Time: 735.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 r113736 = d;
        double r113737 = 10.0;
        double r113738 = r113736 * r113737;
        double r113739 = 20.0;
        double r113740 = r113736 * r113739;
        double r113741 = r113738 + r113740;
        return r113741;
}
↓
double f(double d) {
        double r113742 = d;
        double r113743 = 10.0;
        double r113744 = 20.0;
        double r113745 = r113743 + r113744;
        double r113746 = r113742 * r113745;
        return r113746;
}

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

  :herbie-target
  (* d 30)

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