Average Error: 0.3 → 0
Time: 349.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 r372859 = d;
        double r372860 = 10.0;
        double r372861 = r372859 * r372860;
        double r372862 = 20.0;
        double r372863 = r372859 * r372862;
        double r372864 = r372861 + r372863;
        return r372864;
}
↓
double f(double d) {
        double r372865 = d;
        double r372866 = 10.0;
        double r372867 = 20.0;
        double r372868 = r372866 + r372867;
        double r372869 = r372865 * r372868;
        return r372869;
}

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

  :herbie-target
  (* d 30)

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