Average Error: 0.2 → 0.0
Time: 2.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 r177069 = d1;
        double r177070 = 10.0;
        double r177071 = r177069 * r177070;
        double r177072 = d2;
        double r177073 = r177069 * r177072;
        double r177074 = r177071 + r177073;
        double r177075 = 20.0;
        double r177076 = r177069 * r177075;
        double r177077 = r177074 + r177076;
        return r177077;
}
↓
double f(double d1, double d2) {
        double r177078 = d1;
        double r177079 = 10.0;
        double r177080 = d2;
        double r177081 = r177079 + r177080;
        double r177082 = 20.0;
        double r177083 = r177081 + r177082;
        double r177084 = r177078 * r177083;
        return r177084;
}

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 2020001 
(FPCore (d1 d2)
  :name "FastMath test2"
  :precision binary64

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

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