Average Error: 0.3 → 0
Time: 992.0ms
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 r8146855 = d;
        double r8146856 = 10.0;
        double r8146857 = r8146855 * r8146856;
        double r8146858 = 20.0;
        double r8146859 = r8146855 * r8146858;
        double r8146860 = r8146857 + r8146859;
        return r8146860;
}
↓
double f(double d) {
        double r8146861 = 20.0;
        double r8146862 = 10.0;
        double r8146863 = r8146861 + r8146862;
        double r8146864 = d;
        double r8146865 = r8146863 * r8146864;
        return r8146865;
}

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 2019134 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30)

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