Average Error: 0.3 → 0
Time: 292.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot \left(10 + 20\right)\]
d \cdot 10 + d \cdot 20
↓
d \cdot \left(10 + 20\right)
double f(double d) {
        double r231211 = d;
        double r231212 = 10.0;
        double r231213 = r231211 * r231212;
        double r231214 = 20.0;
        double r231215 = r231211 * r231214;
        double r231216 = r231213 + r231215;
        return r231216;
}
↓
double f(double d) {
        double r231217 = d;
        double r231218 = 10.0;
        double r231219 = 20.0;
        double r231220 = r231218 + r231219;
        double r231221 = r231217 * r231220;
        return r231221;
}

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

Reproduce

herbie shell --seed 2020060 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

  (+ (* d 10) (* d 20)))