Average Error: 0.0 → 0.0
Time: 5.7s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[1 \cdot \left(x + y\right) + \left(-z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
1 \cdot \left(x + y\right) + \left(-z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r35200 = x;
        double r35201 = y;
        double r35202 = r35200 + r35201;
        double r35203 = 1.0;
        double r35204 = z;
        double r35205 = r35203 - r35204;
        double r35206 = r35202 * r35205;
        return r35206;
}
↓
double f(double x, double y, double z) {
        double r35207 = 1.0;
        double r35208 = x;
        double r35209 = y;
        double r35210 = r35208 + r35209;
        double r35211 = r35207 * r35210;
        double r35212 = z;
        double r35213 = -r35212;
        double r35214 = r35213 * r35210;
        double r35215 = r35211 + r35214;
        return r35215;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(1 - z\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto \left(x + y\right) \cdot \color{blue}{\left(1 + \left(-z\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot \left(-z\right)}\]

  5. Simplified0.0

    \[\leadsto \color{blue}{1 \cdot \left(x + y\right)} + \left(x + y\right) \cdot \left(-z\right)\]

  6. Simplified0.0

    \[\leadsto 1 \cdot \left(x + y\right) + \color{blue}{\left(-z\right) \cdot \left(x + y\right)}\]

  7. Final simplification0.0

    \[\leadsto 1 \cdot \left(x + y\right) + \left(-z\right) \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019208 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1 z)))