Average Error: 0.3 → 0
Time: 858.0ms
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 r381112 = d;
        double r381113 = 10.0;
        double r381114 = r381112 * r381113;
        double r381115 = 20.0;
        double r381116 = r381112 * r381115;
        double r381117 = r381114 + r381116;
        return r381117;
}

double f(double d) {
        double r381118 = 20.0;
        double r381119 = 10.0;
        double r381120 = r381118 + r381119;
        double r381121 = d;
        double r381122 = r381120 * r381121;
        return r381122;
}

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(10 + 20\right) \cdot d}\]
  3. Final simplification0

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

Reproduce

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

  :herbie-target
  (* d 30.0)

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