Average Error: 0.0 → 0.0
Time: 5.5s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) \cdot 1 + \left(-z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) \cdot 1 + \left(-z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r37778 = x;
        double r37779 = y;
        double r37780 = r37778 + r37779;
        double r37781 = 1.0;
        double r37782 = z;
        double r37783 = r37781 - r37782;
        double r37784 = r37780 * r37783;
        return r37784;
}
↓
double f(double x, double y, double z) {
        double r37785 = x;
        double r37786 = y;
        double r37787 = r37785 + r37786;
        double r37788 = 1.0;
        double r37789 = r37787 * r37788;
        double r37790 = z;
        double r37791 = -r37790;
        double r37792 = r37791 * r37787;
        double r37793 = r37789 + r37792;
        return r37793;
}

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 \left(x + y\right) \cdot 1 + \color{blue}{\left(-z\right) \cdot \left(x + y\right)}\]

  6. Final simplification0.0

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

Reproduce

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