Average Error: 0.0 → 0.0
Time: 8.6s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
\[\left(1 - z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
\left(1 - z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r45324 = x;
        double r45325 = y;
        double r45326 = r45324 + r45325;
        double r45327 = 1.0;
        double r45328 = z;
        double r45329 = r45327 - r45328;
        double r45330 = r45326 * r45329;
        return r45330;
}

double f(double x, double y, double z) {
        double r45331 = 1.0;
        double r45332 = z;
        double r45333 = r45331 - r45332;
        double r45334 = x;
        double r45335 = y;
        double r45336 = r45334 + r45335;
        double r45337 = r45333 * r45336;
        return r45337;
}

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. Using strategy rm
  8. Applied distribute-lft-in0.0

    \[\leadsto 1 \cdot \left(x + y\right) + \color{blue}{\left(\left(-z\right) \cdot x + \left(-z\right) \cdot y\right)}\]
  9. Final simplification0.0

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

Reproduce

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