Average Error: 0.2 → 0.0
Time: 14.4s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[\left(\left(10 + 20\right) + d2\right) \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
\left(\left(10 + 20\right) + d2\right) \cdot d1
double f(double d1, double d2) {
        double r8718001 = d1;
        double r8718002 = 10.0;
        double r8718003 = r8718001 * r8718002;
        double r8718004 = d2;
        double r8718005 = r8718001 * r8718004;
        double r8718006 = r8718003 + r8718005;
        double r8718007 = 20.0;
        double r8718008 = r8718001 * r8718007;
        double r8718009 = r8718006 + r8718008;
        return r8718009;
}
↓
double f(double d1, double d2) {
        double r8718010 = 10.0;
        double r8718011 = 20.0;
        double r8718012 = r8718010 + r8718011;
        double r8718013 = d2;
        double r8718014 = r8718012 + r8718013;
        double r8718015 = d1;
        double r8718016 = r8718014 * r8718015;
        return r8718016;
}

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

  3. Final simplification0.0

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

Reproduce

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

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

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