Average Error: 0.3 → 0
Time: 1.1s
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 r221229 = d;
        double r221230 = 10.0;
        double r221231 = r221229 * r221230;
        double r221232 = 20.0;
        double r221233 = r221229 * r221232;
        double r221234 = r221231 + r221233;
        return r221234;
}
↓
double f(double d) {
        double r221235 = d;
        double r221236 = 10.0;
        double r221237 = 20.0;
        double r221238 = r221236 + r221237;
        double r221239 = r221235 * r221238;
        return r221239;
}

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

  :herbie-target
  (* d 30)

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