Average Error: 0.3 → 0
Time: 432.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 r319262 = d;
        double r319263 = 10.0;
        double r319264 = r319262 * r319263;
        double r319265 = 20.0;
        double r319266 = r319262 * r319265;
        double r319267 = r319264 + r319266;
        return r319267;
}
↓
double f(double d) {
        double r319268 = d;
        double r319269 = 10.0;
        double r319270 = 20.0;
        double r319271 = r319269 + r319270;
        double r319272 = r319268 * r319271;
        return r319272;
}

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

  :herbie-target
  (* d 30)

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