Average Error: 0.3 → 0
Time: 286.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 r233719 = d;
        double r233720 = 10.0;
        double r233721 = r233719 * r233720;
        double r233722 = 20.0;
        double r233723 = r233719 * r233722;
        double r233724 = r233721 + r233723;
        return r233724;
}
↓
double f(double d) {
        double r233725 = d;
        double r233726 = 10.0;
        double r233727 = 20.0;
        double r233728 = r233726 + r233727;
        double r233729 = r233725 * r233728;
        return r233729;
}

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

  :herbie-target
  (* d 30)

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