Average Error: 0.3 → 0
Time: 615.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 r131949 = d;
        double r131950 = 10.0;
        double r131951 = r131949 * r131950;
        double r131952 = 20.0;
        double r131953 = r131949 * r131952;
        double r131954 = r131951 + r131953;
        return r131954;
}
↓
double f(double d) {
        double r131955 = d;
        double r131956 = 10.0;
        double r131957 = 20.0;
        double r131958 = r131956 + r131957;
        double r131959 = r131955 * r131958;
        return r131959;
}

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

  :herbie-target
  (* d 30)

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