Average Error: 0.3 → 0
Time: 922.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot \left(10 + 20\right)\]
d \cdot 10 + d \cdot 20
↓
d \cdot \left(10 + 20\right)
double f(double d) {
        double r226088 = d;
        double r226089 = 10.0;
        double r226090 = r226088 * r226089;
        double r226091 = 20.0;
        double r226092 = r226088 * r226091;
        double r226093 = r226090 + r226092;
        return r226093;
}
↓
double f(double d) {
        double r226094 = d;
        double r226095 = 10.0;
        double r226096 = 20.0;
        double r226097 = r226095 + r226096;
        double r226098 = r226094 * r226097;
        return r226098;
}

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

  3. Final simplification0

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

Reproduce

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

  :herbie-target
  (* d 30)

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