Average Error: 0.3 → 0
Time: 927.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(10 + 20\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(10 + 20\right) \cdot d
double f(double d) {
        double r299067 = d;
        double r299068 = 10.0;
        double r299069 = r299067 * r299068;
        double r299070 = 20.0;
        double r299071 = r299067 * r299070;
        double r299072 = r299069 + r299071;
        return r299072;
}
↓
double f(double d) {
        double r299073 = 10.0;
        double r299074 = 20.0;
        double r299075 = r299073 + r299074;
        double r299076 = d;
        double r299077 = r299075 * r299076;
        return r299077;
}

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 \left(10 + 20\right) \cdot d\]

Reproduce

herbie shell --seed 2019179 
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))