Average Error: 0.3 → 0
Time: 751.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 r110703 = d;
        double r110704 = 10.0;
        double r110705 = r110703 * r110704;
        double r110706 = 20.0;
        double r110707 = r110703 * r110706;
        double r110708 = r110705 + r110707;
        return r110708;
}
↓
double f(double d) {
        double r110709 = 20.0;
        double r110710 = 10.0;
        double r110711 = r110709 + r110710;
        double r110712 = d;
        double r110713 = r110711 * r110712;
        return r110713;
}

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

  :herbie-target
  (* d 30.0)

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