Average Error: 0.3 → 0
Time: 958.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 r196954 = d;
        double r196955 = 10.0;
        double r196956 = r196954 * r196955;
        double r196957 = 20.0;
        double r196958 = r196954 * r196957;
        double r196959 = r196956 + r196958;
        return r196959;
}
↓
double f(double d) {
        double r196960 = 10.0;
        double r196961 = 20.0;
        double r196962 = r196960 + r196961;
        double r196963 = d;
        double r196964 = r196962 * r196963;
        return r196964;
}

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

  :herbie-target
  (* d 30.0)

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