Average Error: 0.3 → 0
Time: 1.7s
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(20 + 10\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(20 + 10\right) \cdot d
double f(double d) {
        double r9353806 = d;
        double r9353807 = 10.0;
        double r9353808 = r9353806 * r9353807;
        double r9353809 = 20.0;
        double r9353810 = r9353806 * r9353809;
        double r9353811 = r9353808 + r9353810;
        return r9353811;
}
↓
double f(double d) {
        double r9353812 = 20.0;
        double r9353813 = 10.0;
        double r9353814 = r9353812 + r9353813;
        double r9353815 = d;
        double r9353816 = r9353814 * r9353815;
        return r9353816;
}

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

  3. Final simplification0

    \[\leadsto \left(20 + 10\right) \cdot d\]

Reproduce

herbie shell --seed 2019168 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

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