Average Error: 0.3 → 0
Time: 983.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 r187056 = d;
        double r187057 = 10.0;
        double r187058 = r187056 * r187057;
        double r187059 = 20.0;
        double r187060 = r187056 * r187059;
        double r187061 = r187058 + r187060;
        return r187061;
}
↓
double f(double d) {
        double r187062 = d;
        double r187063 = 10.0;
        double r187064 = 20.0;
        double r187065 = r187063 + r187064;
        double r187066 = r187062 * r187065;
        return r187066;
}

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

  :herbie-target
  (* d 30)

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