Average Error: 0.3 → 0
Time: 698.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 r251296 = d;
        double r251297 = 10.0;
        double r251298 = r251296 * r251297;
        double r251299 = 20.0;
        double r251300 = r251296 * r251299;
        double r251301 = r251298 + r251300;
        return r251301;
}
↓
double f(double d) {
        double r251302 = d;
        double r251303 = 10.0;
        double r251304 = 20.0;
        double r251305 = r251303 + r251304;
        double r251306 = r251302 * r251305;
        return r251306;
}

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