Average Error: 0.2 → 0.0
Time: 28.1s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
\[\left(d2 + 30\right) \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
\left(d2 + 30\right) \cdot d1
double f(double d1, double d2) {
        double r36225043 = d1;
        double r36225044 = 10.0;
        double r36225045 = r36225043 * r36225044;
        double r36225046 = d2;
        double r36225047 = r36225043 * r36225046;
        double r36225048 = r36225045 + r36225047;
        double r36225049 = 20.0;
        double r36225050 = r36225043 * r36225049;
        double r36225051 = r36225048 + r36225050;
        return r36225051;
}

double f(double d1, double d2) {
        double r36225052 = d2;
        double r36225053 = 30.0;
        double r36225054 = r36225052 + r36225053;
        double r36225055 = d1;
        double r36225056 = r36225054 * r36225055;
        return r36225056;
}

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}{\left(30 + d2\right) \cdot d1}\]
  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019112 +o rules:numerics
(FPCore (d1 d2)
  :name "FastMath test2"

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

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