Average Error: 0.3 → 0
Time: 307.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 r213185 = d;
        double r213186 = 10.0;
        double r213187 = r213185 * r213186;
        double r213188 = 20.0;
        double r213189 = r213185 * r213188;
        double r213190 = r213187 + r213189;
        return r213190;
}
↓
double f(double d) {
        double r213191 = d;
        double r213192 = 10.0;
        double r213193 = 20.0;
        double r213194 = r213192 + r213193;
        double r213195 = r213191 * r213194;
        return r213195;
}

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

  :herbie-target
  (* d 30)

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