Average Error: 0.3 → 0
Time: 483.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 r283666 = d;
        double r283667 = 10.0;
        double r283668 = r283666 * r283667;
        double r283669 = 20.0;
        double r283670 = r283666 * r283669;
        double r283671 = r283668 + r283670;
        return r283671;
}
↓
double f(double d) {
        double r283672 = d;
        double r283673 = 10.0;
        double r283674 = 20.0;
        double r283675 = r283673 + r283674;
        double r283676 = r283672 * r283675;
        return r283676;
}

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

  :herbie-target
  (* d 30)

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