Average Error: 0.3 → 0
Time: 1.3s
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 r7827133 = d;
        double r7827134 = 10.0;
        double r7827135 = r7827133 * r7827134;
        double r7827136 = 20.0;
        double r7827137 = r7827133 * r7827136;
        double r7827138 = r7827135 + r7827137;
        return r7827138;
}
↓
double f(double d) {
        double r7827139 = 20.0;
        double r7827140 = 10.0;
        double r7827141 = r7827139 + r7827140;
        double r7827142 = d;
        double r7827143 = r7827141 * r7827142;
        return r7827143;
}

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

  :herbie-target
  (* d 30.0)

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