Average Error: 0.0 → 0.0
Time: 8.2s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[1 \cdot \left(x + y\right) + \left(x + y\right) \cdot \left(-z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
1 \cdot \left(x + y\right) + \left(x + y\right) \cdot \left(-z\right)
double f(double x, double y, double z) {
        double r35188 = x;
        double r35189 = y;
        double r35190 = r35188 + r35189;
        double r35191 = 1.0;
        double r35192 = z;
        double r35193 = r35191 - r35192;
        double r35194 = r35190 * r35193;
        return r35194;
}
↓
double f(double x, double y, double z) {
        double r35195 = 1.0;
        double r35196 = x;
        double r35197 = y;
        double r35198 = r35196 + r35197;
        double r35199 = r35195 * r35198;
        double r35200 = z;
        double r35201 = -r35200;
        double r35202 = r35198 * r35201;
        double r35203 = r35199 + r35202;
        return r35203;
}

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. Final simplification0.0

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

Reproduce

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