Average Error: 0.3 → 0
Time: 785.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 r126522 = d;
        double r126523 = 10.0;
        double r126524 = r126522 * r126523;
        double r126525 = 20.0;
        double r126526 = r126522 * r126525;
        double r126527 = r126524 + r126526;
        return r126527;
}
↓
double f(double d) {
        double r126528 = d;
        double r126529 = 10.0;
        double r126530 = 20.0;
        double r126531 = r126529 + r126530;
        double r126532 = r126528 * r126531;
        return r126532;
}

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

  :herbie-target
  (* d 30)

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