Average Error: 0.0 → 0.0
Time: 4.5s
Precision: 64
\[x + y \cdot \left(z - x\right)\]
\[\left(z - x\right) \cdot y + x\]
x + y \cdot \left(z - x\right)
\left(z - x\right) \cdot y + x
double f(double x, double y, double z) {
        double r12602 = x;
        double r12603 = y;
        double r12604 = z;
        double r12605 = r12604 - r12602;
        double r12606 = r12603 * r12605;
        double r12607 = r12602 + r12606;
        return r12607;
}

double f(double x, double y, double z) {
        double r12608 = z;
        double r12609 = x;
        double r12610 = r12608 - r12609;
        double r12611 = y;
        double r12612 = r12610 * r12611;
        double r12613 = r12612 + r12609;
        return r12613;
}

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 \left(z - x\right) \cdot y + x\]

Reproduce

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