Average Error: 0.3 → 0
Time: 816.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(10 + 20\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(10 + 20\right) \cdot d
double f(double d) {
        double r12797586 = d;
        double r12797587 = 10.0;
        double r12797588 = r12797586 * r12797587;
        double r12797589 = 20.0;
        double r12797590 = r12797586 * r12797589;
        double r12797591 = r12797588 + r12797590;
        return r12797591;
}
↓
double f(double d) {
        double r12797592 = 10.0;
        double r12797593 = 20.0;
        double r12797594 = r12797592 + r12797593;
        double r12797595 = d;
        double r12797596 = r12797594 * r12797595;
        return r12797596;
}

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

Reproduce

herbie shell --seed 2019170 
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

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