Average Error: 0.3 → 0
Time: 1.1s
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 r9519352 = d;
        double r9519353 = 10.0;
        double r9519354 = r9519352 * r9519353;
        double r9519355 = 20.0;
        double r9519356 = r9519352 * r9519355;
        double r9519357 = r9519354 + r9519356;
        return r9519357;
}
↓
double f(double d) {
        double r9519358 = 10.0;
        double r9519359 = 20.0;
        double r9519360 = r9519358 + r9519359;
        double r9519361 = d;
        double r9519362 = r9519360 * r9519361;
        return r9519362;
}

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

  :herbie-target
  (* d 30.0)

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