Average Error: 0.3 → 0
Time: 818.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot 30\]
d \cdot 10 + d \cdot 20
↓
d \cdot 30
double f(double d) {
        double r23465812 = d;
        double r23465813 = 10.0;
        double r23465814 = r23465812 * r23465813;
        double r23465815 = 20.0;
        double r23465816 = r23465812 * r23465815;
        double r23465817 = r23465814 + r23465816;
        return r23465817;
}
↓
double f(double d) {
        double r23465818 = d;
        double r23465819 = 30.0;
        double r23465820 = r23465818 * r23465819;
        return r23465820;
}

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 30}\]

  3. Final simplification0

    \[\leadsto d \cdot 30\]

Reproduce

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

  :herbie-target
  (* d 30)

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