Average Error: 0.3 → 0
Time: 327.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 r275822 = d;
        double r275823 = 10.0;
        double r275824 = r275822 * r275823;
        double r275825 = 20.0;
        double r275826 = r275822 * r275825;
        double r275827 = r275824 + r275826;
        return r275827;
}
↓
double f(double d) {
        double r275828 = d;
        double r275829 = 10.0;
        double r275830 = 20.0;
        double r275831 = r275829 + r275830;
        double r275832 = r275828 * r275831;
        return r275832;
}

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

  :herbie-target
  (* d 30)

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