Average Error: 0.3 → 0
Time: 1.1s
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 r196517 = d;
        double r196518 = 10.0;
        double r196519 = r196517 * r196518;
        double r196520 = 20.0;
        double r196521 = r196517 * r196520;
        double r196522 = r196519 + r196521;
        return r196522;
}
↓
double f(double d) {
        double r196523 = d;
        double r196524 = 10.0;
        double r196525 = 20.0;
        double r196526 = r196524 + r196525;
        double r196527 = r196523 * r196526;
        return r196527;
}

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 2019199 
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

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