Average Error: 0.0 → 0.0
Time: 6.8s
Precision: 64
\[x + y \cdot \left(z - x\right)\]
↓
\[x + \left(y \cdot z + y \cdot \left(-x\right)\right)\]
x + y \cdot \left(z - x\right)
↓
x + \left(y \cdot z + y \cdot \left(-x\right)\right)
double f(double x, double y, double z) {
        double r9352 = x;
        double r9353 = y;
        double r9354 = z;
        double r9355 = r9354 - r9352;
        double r9356 = r9353 * r9355;
        double r9357 = r9352 + r9356;
        return r9357;
}
↓
double f(double x, double y, double z) {
        double r9358 = x;
        double r9359 = y;
        double r9360 = z;
        double r9361 = r9359 * r9360;
        double r9362 = -r9358;
        double r9363 = r9359 * r9362;
        double r9364 = r9361 + r9363;
        double r9365 = r9358 + r9364;
        return r9365;
}

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

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

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019323 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))