Average Error: 0.3 → 0
Time: 1.3s
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 r10196207 = d;
        double r10196208 = 10.0;
        double r10196209 = r10196207 * r10196208;
        double r10196210 = 20.0;
        double r10196211 = r10196207 * r10196210;
        double r10196212 = r10196209 + r10196211;
        return r10196212;
}
↓
double f(double d) {
        double r10196213 = 20.0;
        double r10196214 = 10.0;
        double r10196215 = r10196213 + r10196214;
        double r10196216 = d;
        double r10196217 = r10196215 * r10196216;
        return r10196217;
}

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(20 + 10\right) \cdot d}\]

  3. Final simplification0

    \[\leadsto \left(20 + 10\right) \cdot d\]

Reproduce

herbie shell --seed 2019200 
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

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