Average Error: 0.3 → 0
Time: 393.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 r395631 = d;
        double r395632 = 10.0;
        double r395633 = r395631 * r395632;
        double r395634 = 20.0;
        double r395635 = r395631 * r395634;
        double r395636 = r395633 + r395635;
        return r395636;
}
↓
double f(double d) {
        double r395637 = d;
        double r395638 = 10.0;
        double r395639 = 20.0;
        double r395640 = r395638 + r395639;
        double r395641 = r395637 * r395640;
        return r395641;
}

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

  :herbie-target
  (* d 30)

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