Average Error: 0.3 → 0
Time: 964.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 r9800749 = d;
        double r9800750 = 10.0;
        double r9800751 = r9800749 * r9800750;
        double r9800752 = 20.0;
        double r9800753 = r9800749 * r9800752;
        double r9800754 = r9800751 + r9800753;
        return r9800754;
}
↓
double f(double d) {
        double r9800755 = 10.0;
        double r9800756 = 20.0;
        double r9800757 = r9800755 + r9800756;
        double r9800758 = d;
        double r9800759 = r9800757 * r9800758;
        return r9800759;
}

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

  :herbie-target
  (* d 30.0)

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