Average Error: 0.3 → 0
Time: 346.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 r366921 = d;
        double r366922 = 10.0;
        double r366923 = r366921 * r366922;
        double r366924 = 20.0;
        double r366925 = r366921 * r366924;
        double r366926 = r366923 + r366925;
        return r366926;
}
↓
double f(double d) {
        double r366927 = d;
        double r366928 = 10.0;
        double r366929 = 20.0;
        double r366930 = r366928 + r366929;
        double r366931 = r366927 * r366930;
        return r366931;
}

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 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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