Average Error: 0.3 → 0
Time: 333.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 r433375 = d;
        double r433376 = 10.0;
        double r433377 = r433375 * r433376;
        double r433378 = 20.0;
        double r433379 = r433375 * r433378;
        double r433380 = r433377 + r433379;
        return r433380;
}
↓
double f(double d) {
        double r433381 = d;
        double r433382 = 10.0;
        double r433383 = 20.0;
        double r433384 = r433382 + r433383;
        double r433385 = r433381 * r433384;
        return r433385;
}

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

  :herbie-target
  (* d 30)

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