Average Error: 0.3 → 0
Time: 677.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 r164663 = d;
        double r164664 = 10.0;
        double r164665 = r164663 * r164664;
        double r164666 = 20.0;
        double r164667 = r164663 * r164666;
        double r164668 = r164665 + r164667;
        return r164668;
}
↓
double f(double d) {
        double r164669 = d;
        double r164670 = 10.0;
        double r164671 = 20.0;
        double r164672 = r164670 + r164671;
        double r164673 = r164669 * r164672;
        return r164673;
}

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

  :herbie-target
  (* d 30)

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