Average Error: 0.3 → 0
Time: 1.0s
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 r12396671 = d;
        double r12396672 = 10.0;
        double r12396673 = r12396671 * r12396672;
        double r12396674 = 20.0;
        double r12396675 = r12396671 * r12396674;
        double r12396676 = r12396673 + r12396675;
        return r12396676;
}
↓
double f(double d) {
        double r12396677 = 10.0;
        double r12396678 = 20.0;
        double r12396679 = r12396677 + r12396678;
        double r12396680 = d;
        double r12396681 = r12396679 * r12396680;
        return r12396681;
}

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

  :herbie-target
  (* d 30.0)

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