Average Error: 0.3 → 0
Time: 1.8s
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(20 + 10\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(20 + 10\right) \cdot d
double f(double d) {
        double r7785970 = d;
        double r7785971 = 10.0;
        double r7785972 = r7785970 * r7785971;
        double r7785973 = 20.0;
        double r7785974 = r7785970 * r7785973;
        double r7785975 = r7785972 + r7785974;
        return r7785975;
}
↓
double f(double d) {
        double r7785976 = 20.0;
        double r7785977 = 10.0;
        double r7785978 = r7785976 + r7785977;
        double r7785979 = d;
        double r7785980 = r7785978 * r7785979;
        return r7785980;
}

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}{\left(20 + 10\right) \cdot d}\]

  3. Final simplification0

    \[\leadsto \left(20 + 10\right) \cdot d\]

Reproduce

herbie shell --seed 2019200 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))