Average Error: 0.3 → 0
Time: 878.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 r8258935 = d;
        double r8258936 = 10.0;
        double r8258937 = r8258935 * r8258936;
        double r8258938 = 20.0;
        double r8258939 = r8258935 * r8258938;
        double r8258940 = r8258937 + r8258939;
        return r8258940;
}
↓
double f(double d) {
        double r8258941 = 20.0;
        double r8258942 = 10.0;
        double r8258943 = r8258941 + r8258942;
        double r8258944 = d;
        double r8258945 = r8258943 * r8258944;
        return r8258945;
}

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

  :herbie-target
  (* d 30.0)

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