Average Error: 0.3 → 0
Time: 839.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 r200020 = d;
        double r200021 = 10.0;
        double r200022 = r200020 * r200021;
        double r200023 = 20.0;
        double r200024 = r200020 * r200023;
        double r200025 = r200022 + r200024;
        return r200025;
}
↓
double f(double d) {
        double r200026 = 10.0;
        double r200027 = 20.0;
        double r200028 = r200026 + r200027;
        double r200029 = d;
        double r200030 = r200028 * r200029;
        return r200030;
}

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)))