Graphics.Rendering.Chart.Drawing:drawTextsR from Chart-1.5.3

Percentage Accurate: 97.7% → 100.0%

Time: 5.0s

Alternatives: 6

Speedup: 1.4×

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

Specification

Math

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

FPCore

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

C

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

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) + ((x - 1.0d0) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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) + ((x - 1.0d0) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. +-commutative N/A

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

   5. lower-+.f64 N/A

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

   6. mul-1-neg N/A

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

   7. lower-neg.f64 100.0

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

5. Applied rewrites 100.0%

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

Alternative 2: 59.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.5 \cdot 10^{+217}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq -14000000:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{-79}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -5.5e+217)
   (* y x)
   (if (<= x -14000000.0) (* z x) (if (<= x 7.8e-79) (- z) (* y x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.5e+217) {
		tmp = y * x;
	} else if (x <= -14000000.0) {
		tmp = z * x;
	} else if (x <= 7.8e-79) {
		tmp = -z;
	} else {
		tmp = y * 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 (x <= (-5.5d+217)) then
        tmp = y * x
    else if (x <= (-14000000.0d0)) then
        tmp = z * x
    else if (x <= 7.8d-79) then
        tmp = -z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.5e+217) {
		tmp = y * x;
	} else if (x <= -14000000.0) {
		tmp = z * x;
	} else if (x <= 7.8e-79) {
		tmp = -z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -5.5e+217:
		tmp = y * x
	elif x <= -14000000.0:
		tmp = z * x
	elif x <= 7.8e-79:
		tmp = -z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -5.5e+217)
		tmp = Float64(y * x);
	elseif (x <= -14000000.0)
		tmp = Float64(z * x);
	elseif (x <= 7.8e-79)
		tmp = Float64(-z);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -5.5e+217)
		tmp = y * x;
	elseif (x <= -14000000.0)
		tmp = z * x;
	elseif (x <= 7.8e-79)
		tmp = -z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -5.5e+217], N[(y * x), $MachinePrecision], If[LessEqual[x, -14000000.0], N[(z * x), $MachinePrecision], If[LessEqual[x, 7.8e-79], (-z), N[(y * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -5.5e217 or 7.80000000000000011e-79 < x

   1. Initial program 96.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z\right)} \]

      2. lower-neg.f64 6.9

         \[\leadsto \color{blue}{-z} \]

   5. Applied rewrites 6.9%

      \[\leadsto \color{blue}{-z} \]

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 59.3

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

   8. Applied rewrites 59.3%

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

   if -5.5e217 < x < -1.4e7

   1. Initial program 93.9%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-out-- N/A

         \[\leadsto \color{blue}{x \cdot z - 1 \cdot z} \]

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{x \cdot z + -1 \cdot z} \]

      4. +-commutative N/A

         \[\leadsto \color{blue}{-1 \cdot z + x \cdot z} \]

      5. distribute-rgt-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 67.4

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

   5. Applied rewrites 67.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 67.4%

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

   if -1.4e7 < x < 7.80000000000000011e-79

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z\right)} \]

      2. lower-neg.f64 79.8

         \[\leadsto \color{blue}{-z} \]

   5. Applied rewrites 79.8%

      \[\leadsto \color{blue}{-z} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 83.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.8 \cdot 10^{-29} \lor \neg \left(x \leq 7.8 \cdot 10^{-79}\right):\\ \;\;\;\;\left(z + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(-1 + x\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -9.8e-29) (not (<= x 7.8e-79))) (* (+ z y) x) (* (+ -1.0 x) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -9.8e-29) || !(x <= 7.8e-79)) {
		tmp = (z + y) * x;
	} else {
		tmp = (-1.0 + x) * z;
	}
	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 <= (-9.8d-29)) .or. (.not. (x <= 7.8d-79))) then
        tmp = (z + y) * x
    else
        tmp = ((-1.0d0) + x) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -9.8e-29) || !(x <= 7.8e-79)) {
		tmp = (z + y) * x;
	} else {
		tmp = (-1.0 + x) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -9.8e-29) or not (x <= 7.8e-79):
		tmp = (z + y) * x
	else:
		tmp = (-1.0 + x) * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -9.8e-29) || !(x <= 7.8e-79))
		tmp = Float64(Float64(z + y) * x);
	else
		tmp = Float64(Float64(-1.0 + x) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -9.8e-29) || ~((x <= 7.8e-79)))
		tmp = (z + y) * x;
	else
		tmp = (-1.0 + x) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -9.8e-29], N[Not[LessEqual[x, 7.8e-79]], $MachinePrecision]], N[(N[(z + y), $MachinePrecision] * x), $MachinePrecision], N[(N[(-1.0 + x), $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -9.7999999999999997e-29 or 7.80000000000000011e-79 < x

   1. Initial program 95.8%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 94.0

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

   5. Applied rewrites 94.0%

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

   if -9.7999999999999997e-29 < x < 7.80000000000000011e-79

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-out-- N/A

         \[\leadsto \color{blue}{x \cdot z - 1 \cdot z} \]

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{x \cdot z + -1 \cdot z} \]

      4. +-commutative N/A

         \[\leadsto \color{blue}{-1 \cdot z + x \cdot z} \]

      5. distribute-rgt-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 84.0

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

   5. Applied rewrites 84.0%

      \[\leadsto \color{blue}{\left(-1 + x\right) \cdot z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.6%

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

Alternative 4: 75.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.5 \cdot 10^{-142} \lor \neg \left(z \leq 1.75 \cdot 10^{-113}\right):\\ \;\;\;\;\left(-1 + x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3.5e-142) (not (<= z 1.75e-113))) (* (+ -1.0 x) z) (* y x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.5e-142) || !(z <= 1.75e-113)) {
		tmp = (-1.0 + x) * z;
	} else {
		tmp = y * 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 ((z <= (-3.5d-142)) .or. (.not. (z <= 1.75d-113))) then
        tmp = ((-1.0d0) + x) * z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.5e-142) || !(z <= 1.75e-113)) {
		tmp = (-1.0 + x) * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3.5e-142) or not (z <= 1.75e-113):
		tmp = (-1.0 + x) * z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.5e-142) || !(z <= 1.75e-113))
		tmp = Float64(Float64(-1.0 + x) * z);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -3.5e-142) || ~((z <= 1.75e-113)))
		tmp = (-1.0 + x) * z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3.5e-142], N[Not[LessEqual[z, 1.75e-113]], $MachinePrecision]], N[(N[(-1.0 + x), $MachinePrecision] * z), $MachinePrecision], N[(y * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.50000000000000015e-142 or 1.75000000000000014e-113 < z

   1. Initial program 96.6%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-out-- N/A

         \[\leadsto \color{blue}{x \cdot z - 1 \cdot z} \]

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{x \cdot z + -1 \cdot z} \]

      4. +-commutative N/A

         \[\leadsto \color{blue}{-1 \cdot z + x \cdot z} \]

      5. distribute-rgt-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 84.0

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

   5. Applied rewrites 84.0%

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

   if -3.50000000000000015e-142 < z < 1.75000000000000014e-113

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z\right)} \]

      2. lower-neg.f64 20.6

         \[\leadsto \color{blue}{-z} \]

   5. Applied rewrites 20.6%

      \[\leadsto \color{blue}{-z} \]

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 74.8

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

   8. Applied rewrites 74.8%

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

4. Final simplification 81.1%

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

Alternative 5: 61.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -14000000 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;z \cdot x\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -14000000.0) (not (<= x 1.0))) (* z x) (- z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -14000000.0) || !(x <= 1.0)) {
		tmp = z * x;
	} else {
		tmp = -z;
	}
	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 <= (-14000000.0d0)) .or. (.not. (x <= 1.0d0))) then
        tmp = z * x
    else
        tmp = -z
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (x <= -14000000.0) or not (x <= 1.0):
		tmp = z * x
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -14000000.0) || !(x <= 1.0))
		tmp = Float64(z * x);
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -14000000.0) || ~((x <= 1.0)))
		tmp = z * x;
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -14000000.0], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(z * x), $MachinePrecision], (-z)]

Derivation

1. Split input into 2 regimes

2. if x < -1.4e7 or 1 < x

   1. Initial program 95.1%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-out-- N/A

         \[\leadsto \color{blue}{x \cdot z - 1 \cdot z} \]

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{x \cdot z + -1 \cdot z} \]

      4. +-commutative N/A

         \[\leadsto \color{blue}{-1 \cdot z + x \cdot z} \]

      5. distribute-rgt-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 53.5

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

   5. Applied rewrites 53.5%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 52.9%

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

   if -1.4e7 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z\right)} \]

      2. lower-neg.f64 77.1

         \[\leadsto \color{blue}{-z} \]

   5. Applied rewrites 77.1%

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

4. Final simplification 65.6%

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

Alternative 6: 36.6% accurate, 5.7× speedup

Math

\[\begin{array}{l} \\ -z \end{array} \]

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := (-z)

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in x around 0

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(z\right)} \]

   2. lower-neg.f64 41.7

      \[\leadsto \color{blue}{-z} \]

5. Applied rewrites 41.7%

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

Reproduce

herbie shell --seed 2024339 
(FPCore (x y z)
  :name "Graphics.Rendering.Chart.Drawing:drawTextsR from Chart-1.5.3"
  :precision binary64
  (+ (* x y) (* (- x 1.0) z)))