Average Error: 0.3 → 0
Time: 1.9s
Precision: 64
\[d \cdot 10.0 + d \cdot 20.0\]
↓
\[\left(20.0 + 10.0\right) \cdot d\]
d \cdot 10.0 + d \cdot 20.0
↓
\left(20.0 + 10.0\right) \cdot d
double f(double d) {
        double r5815118 = d;
        double r5815119 = 10.0;
        double r5815120 = r5815118 * r5815119;
        double r5815121 = 20.0;
        double r5815122 = r5815118 * r5815121;
        double r5815123 = r5815120 + r5815122;
        return r5815123;
}
↓
double f(double d) {
        double r5815124 = 20.0;
        double r5815125 = 10.0;
        double r5815126 = r5815124 + r5815125;
        double r5815127 = d;
        double r5815128 = r5815126 * r5815127;
        return r5815128;
}

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.0\]

Derivation

  1. Initial program 0.3

    \[d \cdot 10.0 + d \cdot 20.0\]

  2. Simplified0

    \[\leadsto \color{blue}{\left(10.0 + 20.0\right) \cdot d}\]

  3. Final simplification0

    \[\leadsto \left(20.0 + 10.0\right) \cdot d\]

Reproduce

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

  :herbie-target
  (* d 30.0)

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