Average Error: 0.2 → 0.0
Time: 2.8s
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 r298993 = d1;
        double r298994 = 10.0;
        double r298995 = r298993 * r298994;
        double r298996 = d2;
        double r298997 = r298993 * r298996;
        double r298998 = r298995 + r298997;
        double r298999 = 20.0;
        double r299000 = r298993 * r298999;
        double r299001 = r298998 + r299000;
        return r299001;
}
↓
double f(double d1, double d2) {
        double r299002 = d1;
        double r299003 = 10.0;
        double r299004 = d2;
        double r299005 = r299003 + r299004;
        double r299006 = 20.0;
        double r299007 = r299005 + r299006;
        double r299008 = r299002 * r299007;
        return r299008;
}

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

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

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