Average Error: 0.2 → 0.0
Time: 9.9s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[d1 \cdot \left(\left(10 + d2\right) + 20\right)\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
d1 \cdot \left(\left(10 + d2\right) + 20\right)
double f(double d1, double d2) {
        double r124015 = d1;
        double r124016 = 10.0;
        double r124017 = r124015 * r124016;
        double r124018 = d2;
        double r124019 = r124015 * r124018;
        double r124020 = r124017 + r124019;
        double r124021 = 20.0;
        double r124022 = r124015 * r124021;
        double r124023 = r124020 + r124022;
        return r124023;
}
↓
double f(double d1, double d2) {
        double r124024 = d1;
        double r124025 = 10.0;
        double r124026 = d2;
        double r124027 = r124025 + r124026;
        double r124028 = 20.0;
        double r124029 = r124027 + r124028;
        double r124030 = r124024 * r124029;
        return r124030;
}

Error

Bits error versus d1

Bits error versus d2

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.2
Target0.0
Herbie0.0
\[d1 \cdot \left(30 + d2\right)\]

Derivation

  1. Initial program 0.2

    \[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]

  2. Simplified0.0

    \[\leadsto \color{blue}{d1 \cdot \left(\left(10 + d2\right) + 20\right)}\]

  3. Final simplification0.0

    \[\leadsto d1 \cdot \left(\left(10 + d2\right) + 20\right)\]

Reproduce

herbie shell --seed 2019304 
(FPCore (d1 d2)
  :name "FastMath test2"
  :precision binary64

  :herbie-target
  (* d1 (+ 30 d2))

  (+ (+ (* d1 10) (* d1 d2)) (* d1 20)))