SynthBasics:oscSampleBasedAux from YampaSynth-0.2

Percentage Accurate: 100.0% → 100.0%

Time: 4.9s

Alternatives: 6

Speedup: 1.2×

• 20.4% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x + y \cdot \left(z - x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (- z x))))

C

double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (z - x))
end function

Java

public static double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Python

def code(x, y, z):
	return x + (y * (z - x))

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z - x)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y * (z - x));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \left(z - x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (- z x))))

C

double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (z - x))
end function

Java

public static double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Python

def code(x, y, z):
	return x + (y * (z - x))

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z - x)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y * (z - x));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z - x, y, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (- z x) y x))

C

double code(double x, double y, double z) {
	return fma((z - x), y, x);
}

Julia

function code(x, y, z)
	return fma(Float64(z - x), y, x)
end

Wolfram

code[x_, y_, z_] := N[(N[(z - x), $MachinePrecision] * y + x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z - x\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 100.0

      \[\leadsto \color{blue}{\mathsf{fma}\left(z - x, y, x\right)} \]

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z - x, y, x\right)} \]
5. Add Preprocessing

Alternative 2: 84.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{-19} \lor \neg \left(y \leq 5 \cdot 10^{-21}\right):\\ \;\;\;\;\left(z - x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -5.8e-19) (not (<= y 5e-21))) (* (- z x) y) (* 1.0 x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5.8e-19) || !(y <= 5e-21)) {
		tmp = (z - x) * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-5.8d-19)) .or. (.not. (y <= 5d-21))) then
        tmp = (z - x) * y
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5.8e-19) || !(y <= 5e-21)) {
		tmp = (z - x) * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -5.8e-19) or not (y <= 5e-21):
		tmp = (z - x) * y
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -5.8e-19) || !(y <= 5e-21))
		tmp = Float64(Float64(z - x) * y);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -5.8e-19) || ~((y <= 5e-21)))
		tmp = (z - x) * y;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -5.8e-19], N[Not[LessEqual[y, 5e-21]], $MachinePrecision]], N[(N[(z - x), $MachinePrecision] * y), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.8e-19 or 4.99999999999999973e-21 < y

   1. Initial program 99.9%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 100.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(z - x, y, x\right)} \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z - x, y, x\right)} \]

   5. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(z - x\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 98.0

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

   7. Applied rewrites 98.0%

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

   if -5.8e-19 < y < 4.99999999999999973e-21

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(y\right)\right)}\right) \cdot x \]

      4. unsub-neg N/A

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

      5. lower--.f64 71.5

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

   5. Applied rewrites 71.5%

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

   6. Taylor expanded in y around 0

      \[\leadsto 1 \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 71.5%

      \[\leadsto 1 \cdot x \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{-19} \lor \neg \left(y \leq 5 \cdot 10^{-21}\right):\\ \;\;\;\;\left(z - x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 75.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-65} \lor \neg \left(x \leq 1.8 \cdot 10^{-46}\right):\\ \;\;\;\;\left(1 - y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.85e-65) (not (<= x 1.8e-46))) (* (- 1.0 y) x) (* z y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.85e-65) || !(x <= 1.8e-46)) {
		tmp = (1.0 - y) * x;
	} else {
		tmp = z * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.85d-65)) .or. (.not. (x <= 1.8d-46))) then
        tmp = (1.0d0 - y) * x
    else
        tmp = z * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.85e-65) || !(x <= 1.8e-46)) {
		tmp = (1.0 - y) * x;
	} else {
		tmp = z * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.85e-65) or not (x <= 1.8e-46):
		tmp = (1.0 - y) * x
	else:
		tmp = z * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.85e-65) || !(x <= 1.8e-46))
		tmp = Float64(Float64(1.0 - y) * x);
	else
		tmp = Float64(z * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.85e-65) || ~((x <= 1.8e-46)))
		tmp = (1.0 - y) * x;
	else
		tmp = z * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.85e-65], N[Not[LessEqual[x, 1.8e-46]], $MachinePrecision]], N[(N[(1.0 - y), $MachinePrecision] * x), $MachinePrecision], N[(z * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.85e-65 or 1.8e-46 < x

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(y\right)\right)}\right) \cdot x \]

      4. unsub-neg N/A

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

      5. lower--.f64 80.8

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

   5. Applied rewrites 80.8%

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

   if -1.85e-65 < x < 1.8e-46

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{y \cdot z} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot y} \]

      2. lower-*.f64 73.9

         \[\leadsto \color{blue}{z \cdot y} \]

   5. Applied rewrites 73.9%

      \[\leadsto \color{blue}{z \cdot y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-65} \lor \neg \left(x \leq 1.8 \cdot 10^{-46}\right):\\ \;\;\;\;\left(1 - y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-65}:\\ \;\;\;\;\left(1 - y\right) \cdot x\\ \mathbf{elif}\;x \leq 1.8 \cdot 10^{-46}:\\ \;\;\;\;z \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-y, x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.85e-65)
   (* (- 1.0 y) x)
   (if (<= x 1.8e-46) (* z y) (fma (- y) x x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.85e-65) {
		tmp = (1.0 - y) * x;
	} else if (x <= 1.8e-46) {
		tmp = z * y;
	} else {
		tmp = fma(-y, x, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.85e-65)
		tmp = Float64(Float64(1.0 - y) * x);
	elseif (x <= 1.8e-46)
		tmp = Float64(z * y);
	else
		tmp = fma(Float64(-y), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.85e-65], N[(N[(1.0 - y), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[x, 1.8e-46], N[(z * y), $MachinePrecision], N[((-y) * x + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.85e-65

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(y\right)\right)}\right) \cdot x \]

      4. unsub-neg N/A

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

      5. lower--.f64 83.7

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

   5. Applied rewrites 83.7%

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

   if -1.85e-65 < x < 1.8e-46

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{y \cdot z} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot y} \]

      2. lower-*.f64 73.9

         \[\leadsto \color{blue}{z \cdot y} \]

   5. Applied rewrites 73.9%

      \[\leadsto \color{blue}{z \cdot y} \]

   if 1.8e-46 < x

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(y\right)\right)}\right) \cdot x \]

      4. unsub-neg N/A

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

      5. lower--.f64 77.0

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

   5. Applied rewrites 77.0%

      \[\leadsto \color{blue}{\left(1 - y\right) \cdot x} \]
   6. Step-by-step derivation

   7. Applied rewrites 77.0%

      \[\leadsto \mathsf{fma}\left(-y, \color{blue}{x}, x\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 61.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{-19} \lor \neg \left(y \leq 5 \cdot 10^{-21}\right):\\ \;\;\;\;z \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -5.8e-19) (not (<= y 5e-21))) (* z y) (* 1.0 x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5.8e-19) || !(y <= 5e-21)) {
		tmp = z * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-5.8d-19)) .or. (.not. (y <= 5d-21))) then
        tmp = z * y
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5.8e-19) || !(y <= 5e-21)) {
		tmp = z * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -5.8e-19) or not (y <= 5e-21):
		tmp = z * y
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -5.8e-19) || !(y <= 5e-21))
		tmp = Float64(z * y);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -5.8e-19) || ~((y <= 5e-21)))
		tmp = z * y;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -5.8e-19], N[Not[LessEqual[y, 5e-21]], $MachinePrecision]], N[(z * y), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.8e-19 or 4.99999999999999973e-21 < y

   1. Initial program 99.9%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{y \cdot z} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot y} \]

      2. lower-*.f64 56.7

         \[\leadsto \color{blue}{z \cdot y} \]

   5. Applied rewrites 56.7%

      \[\leadsto \color{blue}{z \cdot y} \]

   if -5.8e-19 < y < 4.99999999999999973e-21

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(y\right)\right)}\right) \cdot x \]

      4. unsub-neg N/A

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

      5. lower--.f64 71.5

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

   5. Applied rewrites 71.5%

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

   6. Taylor expanded in y around 0

      \[\leadsto 1 \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 71.5%

      \[\leadsto 1 \cdot x \]
3. Recombined 2 regimes into one program.

4. Final simplification 63.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{-19} \lor \neg \left(y \leq 5 \cdot 10^{-21}\right):\\ \;\;\;\;z \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 42.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ z \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* z y))

C

double code(double x, double y, double z) {
	return z * y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = z * y
end function

Java

public static double code(double x, double y, double z) {
	return z * y;
}

Python

def code(x, y, z):
	return z * y

Julia

function code(x, y, z)
	return Float64(z * y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = z * y;
end

Wolfram

code[x_, y_, z_] := N[(z * y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z - x\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{y \cdot z} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{z \cdot y} \]

   2. lower-*.f64 43.9

      \[\leadsto \color{blue}{z \cdot y} \]

5. Applied rewrites 43.9%

   \[\leadsto \color{blue}{z \cdot y} \]
6. Add Preprocessing

Reproduce

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