Average Error: 0.2 → 0.0
Time: 6.1s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[\left(d2 + \left(20 + 10\right)\right) \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
\left(d2 + \left(20 + 10\right)\right) \cdot d1
double f(double d1, double d2) {
        double r192068 = d1;
        double r192069 = 10.0;
        double r192070 = r192068 * r192069;
        double r192071 = d2;
        double r192072 = r192068 * r192071;
        double r192073 = r192070 + r192072;
        double r192074 = 20.0;
        double r192075 = r192068 * r192074;
        double r192076 = r192073 + r192075;
        return r192076;
}
↓
double f(double d1, double d2) {
        double r192077 = d2;
        double r192078 = 20.0;
        double r192079 = 10.0;
        double r192080 = r192078 + r192079;
        double r192081 = r192077 + r192080;
        double r192082 = d1;
        double r192083 = r192081 * r192082;
        return r192083;
}

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(\left(10 + 20\right) + d2\right) \cdot d1}\]

  3. Final simplification0.0

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

Reproduce

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

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

  (+ (+ (* d1 10.0) (* d1 d2)) (* d1 20.0)))