Average Error: 0.3 → 0
Time: 301.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 r522855 = d;
        double r522856 = 10.0;
        double r522857 = r522855 * r522856;
        double r522858 = 20.0;
        double r522859 = r522855 * r522858;
        double r522860 = r522857 + r522859;
        return r522860;
}
↓
double f(double d) {
        double r522861 = d;
        double r522862 = 10.0;
        double r522863 = 20.0;
        double r522864 = r522862 + r522863;
        double r522865 = r522861 * r522864;
        return r522865;
}

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

  :herbie-target
  (* d 30)

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