Average Error: 0.3 → 0
Time: 328.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 r372816 = d;
        double r372817 = 10.0;
        double r372818 = r372816 * r372817;
        double r372819 = 20.0;
        double r372820 = r372816 * r372819;
        double r372821 = r372818 + r372820;
        return r372821;
}
↓
double f(double d) {
        double r372822 = d;
        double r372823 = 10.0;
        double r372824 = 20.0;
        double r372825 = r372823 + r372824;
        double r372826 = r372822 * r372825;
        return r372826;
}

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

  :herbie-target
  (* d 30)

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