Graphics.Rendering.Chart.Plot.Vectors:renderPlotVectors from Chart-1.5.3

Percentage Accurate: 78.0% → 100.0%

Time: 5.7s

Alternatives: 8

Speedup: 1.3×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 78.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 78.0%

   \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
2. Step-by-step derivation

   1. +-commutative 78.0%

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

   2. remove-double-neg 78.0%

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

   3. unsub-neg 78.0%

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

   4. sub-neg 78.0%

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

   5. +-commutative 78.0%

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

   6. distribute-rgt-in 78.0%

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

   7. *-lft-identity 78.0%

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

   8. associate-+r- 78.0%

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

   9. associate--l- 100.0%

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

   10. sub-neg 100.0%

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

   11. +-inverses 100.0%

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

   12. --rgt-identity 100.0%

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

   13. +-commutative 100.0%

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

   14. distribute-lft-neg-out 100.0%

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

   15. distribute-rgt-neg-in 100.0%

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

   16. neg-sub0 100.0%

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

   17. associate--r- 100.0%

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

   18. metadata-eval 100.0%

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

   19. +-commutative 100.0%

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

3. Simplified 100.0%

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

   1. distribute-lft-in 100.0%

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

   2. fma-define 100.0%

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

   3. *-commutative 100.0%

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

   4. mul-1-neg 100.0%

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

   5. fmm-undef 100.0%

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

6. Applied egg-rr 100.0%

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

Alternative 2: 61.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1400:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq -2.2 \cdot 10^{-191}:\\ \;\;\;\;-y\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-167}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1400.0)
   (* y x)
   (if (<= x -2.2e-191)
     (- y)
     (if (<= x 1.65e-167) 1.0 (if (<= x 1.0) (- y) (* y x))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1400.0) {
		tmp = y * x;
	} else if (x <= -2.2e-191) {
		tmp = -y;
	} else if (x <= 1.65e-167) {
		tmp = 1.0;
	} else if (x <= 1.0) {
		tmp = -y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1400.0d0)) then
        tmp = y * x
    else if (x <= (-2.2d-191)) then
        tmp = -y
    else if (x <= 1.65d-167) then
        tmp = 1.0d0
    else if (x <= 1.0d0) then
        tmp = -y
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1400.0) {
		tmp = y * x;
	} else if (x <= -2.2e-191) {
		tmp = -y;
	} else if (x <= 1.65e-167) {
		tmp = 1.0;
	} else if (x <= 1.0) {
		tmp = -y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1400.0:
		tmp = y * x
	elif x <= -2.2e-191:
		tmp = -y
	elif x <= 1.65e-167:
		tmp = 1.0
	elif x <= 1.0:
		tmp = -y
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1400.0)
		tmp = Float64(y * x);
	elseif (x <= -2.2e-191)
		tmp = Float64(-y);
	elseif (x <= 1.65e-167)
		tmp = 1.0;
	elseif (x <= 1.0)
		tmp = Float64(-y);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1400.0)
		tmp = y * x;
	elseif (x <= -2.2e-191)
		tmp = -y;
	elseif (x <= 1.65e-167)
		tmp = 1.0;
	elseif (x <= 1.0)
		tmp = -y;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1400.0], N[(y * x), $MachinePrecision], If[LessEqual[x, -2.2e-191], (-y), If[LessEqual[x, 1.65e-167], 1.0, If[LessEqual[x, 1.0], (-y), N[(y * x), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1400 or 1 < x

   1. Initial program 53.5%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 53.5%

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

      2. remove-double-neg 53.5%

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

      3. unsub-neg 53.5%

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

      4. sub-neg 53.5%

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

      5. +-commutative 53.5%

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

      6. distribute-rgt-in 53.5%

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

      7. *-lft-identity 53.5%

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

      8. associate-+r- 53.5%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 99.9%

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

   6. Taylor expanded in x around inf 80.1%

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

   if -1400 < x < -2.19999999999999998e-191 or 1.64999999999999998e-167 < x < 1

   1. Initial program 100.0%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. remove-double-neg 100.0%

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

      3. unsub-neg 100.0%

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

      4. sub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. distribute-rgt-in 100.0%

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

      7. *-lft-identity 100.0%

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

      8. associate-+r- 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 99.9%

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

   6. Taylor expanded in y around inf 64.5%

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

   7. Taylor expanded in x around 0 62.6%

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

      1. neg-mul-1 62.6%

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

   9. Simplified 62.6%

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

   if -2.19999999999999998e-191 < x < 1.64999999999999998e-167

   1. Initial program 100.0%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. remove-double-neg 100.0%

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

      3. unsub-neg 100.0%

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

      4. sub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. distribute-rgt-in 100.0%

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

      7. *-lft-identity 100.0%

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

      8. associate-+r- 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 61.7%

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

Alternative 3: 99.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1400 \lor \neg \left(x \leq 1.3 \cdot 10^{-8}\right):\\ \;\;\;\;1 + y \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1400.0) (not (<= x 1.3e-8))) (+ 1.0 (* y x)) (- 1.0 y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1400.0) || !(x <= 1.3e-8)) {
		tmp = 1.0 + (y * x);
	} else {
		tmp = 1.0 - y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1400.0d0)) .or. (.not. (x <= 1.3d-8))) then
        tmp = 1.0d0 + (y * x)
    else
        tmp = 1.0d0 - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1400.0) || !(x <= 1.3e-8)) {
		tmp = 1.0 + (y * x);
	} else {
		tmp = 1.0 - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1400.0) or not (x <= 1.3e-8):
		tmp = 1.0 + (y * x)
	else:
		tmp = 1.0 - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1400.0) || !(x <= 1.3e-8))
		tmp = Float64(1.0 + Float64(y * x));
	else
		tmp = Float64(1.0 - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1400.0) || ~((x <= 1.3e-8)))
		tmp = 1.0 + (y * x);
	else
		tmp = 1.0 - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1400.0], N[Not[LessEqual[x, 1.3e-8]], $MachinePrecision]], N[(1.0 + N[(y * x), $MachinePrecision]), $MachinePrecision], N[(1.0 - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1400 or 1.3000000000000001e-8 < x

   1. Initial program 54.2%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 54.2%

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

      2. remove-double-neg 54.2%

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

      3. unsub-neg 54.2%

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

      4. sub-neg 54.2%

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

      5. +-commutative 54.2%

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

      6. distribute-rgt-in 54.2%

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

      7. *-lft-identity 54.2%

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

      8. associate-+r- 54.2%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 99.4%

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

      1. *-commutative 99.4%

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

   7. Simplified 99.4%

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

   if -1400 < x < 1.3000000000000001e-8

   1. Initial program 100.0%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. remove-double-neg 100.0%

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

      3. unsub-neg 100.0%

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

      4. sub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. distribute-rgt-in 100.0%

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

      7. *-lft-identity 100.0%

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

      8. associate-+r- 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 98.7%

      \[\leadsto \color{blue}{1 + -1 \cdot y} \]
   6. Step-by-step derivation

      1. neg-mul-1 98.7%

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

      2. unsub-neg 98.7%

         \[\leadsto \color{blue}{1 - y} \]

   7. Simplified 98.7%

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

4. Final simplification 99.0%

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

Alternative 4: 86.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.4 \cdot 10^{+93}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 9.6:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x + -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.4e+93) (* y x) (if (<= x 9.6) (- 1.0 y) (* y (+ x -1.0)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.4e+93) {
		tmp = y * x;
	} else if (x <= 9.6) {
		tmp = 1.0 - y;
	} else {
		tmp = y * (x + -1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-3.4d+93)) then
        tmp = y * x
    else if (x <= 9.6d0) then
        tmp = 1.0d0 - y
    else
        tmp = y * (x + (-1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -3.4e+93) {
		tmp = y * x;
	} else if (x <= 9.6) {
		tmp = 1.0 - y;
	} else {
		tmp = y * (x + -1.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3.4e+93:
		tmp = y * x
	elif x <= 9.6:
		tmp = 1.0 - y
	else:
		tmp = y * (x + -1.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.4e+93)
		tmp = Float64(y * x);
	elseif (x <= 9.6)
		tmp = Float64(1.0 - y);
	else
		tmp = Float64(y * Float64(x + -1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3.4e+93)
		tmp = y * x;
	elseif (x <= 9.6)
		tmp = 1.0 - y;
	else
		tmp = y * (x + -1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.4e+93], N[(y * x), $MachinePrecision], If[LessEqual[x, 9.6], N[(1.0 - y), $MachinePrecision], N[(y * N[(x + -1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.4e93

   1. Initial program 49.9%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 49.9%

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

      2. remove-double-neg 49.9%

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

      3. unsub-neg 49.9%

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

      4. sub-neg 49.9%

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

      5. +-commutative 49.9%

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

      6. distribute-rgt-in 49.9%

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

      7. *-lft-identity 49.9%

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

      8. associate-+r- 49.9%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 99.9%

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

   6. Taylor expanded in x around inf 90.2%

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

   if -3.4e93 < x < 9.59999999999999964

   1. Initial program 94.2%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 94.2%

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

      2. remove-double-neg 94.2%

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

      3. unsub-neg 94.2%

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

      4. sub-neg 94.2%

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

      5. +-commutative 94.2%

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

      6. distribute-rgt-in 94.2%

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

      7. *-lft-identity 94.2%

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

      8. associate-+r- 94.2%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 94.1%

      \[\leadsto \color{blue}{1 + -1 \cdot y} \]
   6. Step-by-step derivation

      1. neg-mul-1 94.1%

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

      2. unsub-neg 94.1%

         \[\leadsto \color{blue}{1 - y} \]

   7. Simplified 94.1%

      \[\leadsto \color{blue}{1 - y} \]

   if 9.59999999999999964 < x

   1. Initial program 57.5%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 57.5%

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

      2. remove-double-neg 57.5%

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

      3. unsub-neg 57.5%

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

      4. sub-neg 57.5%

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

      5. +-commutative 57.5%

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

      6. distribute-rgt-in 57.5%

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

      7. *-lft-identity 57.5%

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

      8. associate-+r- 57.5%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 100.0%

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

   6. Taylor expanded in y around inf 82.8%

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

4. Final simplification 90.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.4 \cdot 10^{+93}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 9.6:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x + -1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 86.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.55 \cdot 10^{+93} \lor \neg \left(x \leq 2.2 \cdot 10^{+16}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.55e+93) (not (<= x 2.2e+16))) (* y x) (- 1.0 y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.55e+93) || !(x <= 2.2e+16)) {
		tmp = y * x;
	} else {
		tmp = 1.0 - y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1.55d+93)) .or. (.not. (x <= 2.2d+16))) then
        tmp = y * x
    else
        tmp = 1.0d0 - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1.55e+93) || !(x <= 2.2e+16)) {
		tmp = y * x;
	} else {
		tmp = 1.0 - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.55e+93) or not (x <= 2.2e+16):
		tmp = y * x
	else:
		tmp = 1.0 - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.55e+93) || !(x <= 2.2e+16))
		tmp = Float64(y * x);
	else
		tmp = Float64(1.0 - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.55e+93) || ~((x <= 2.2e+16)))
		tmp = y * x;
	else
		tmp = 1.0 - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.55e+93], N[Not[LessEqual[x, 2.2e+16]], $MachinePrecision]], N[(y * x), $MachinePrecision], N[(1.0 - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.5500000000000001e93 or 2.2e16 < x

   1. Initial program 52.9%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 52.9%

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

      2. remove-double-neg 52.9%

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

      3. unsub-neg 52.9%

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

      4. sub-neg 52.9%

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

      5. +-commutative 52.9%

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

      6. distribute-rgt-in 52.9%

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

      7. *-lft-identity 52.9%

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

      8. associate-+r- 52.9%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 100.0%

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

   6. Taylor expanded in x around inf 86.9%

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

   if -1.5500000000000001e93 < x < 2.2e16

   1. Initial program 94.3%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 94.3%

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

      2. remove-double-neg 94.3%

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

      3. unsub-neg 94.3%

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

      4. sub-neg 94.3%

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

      5. +-commutative 94.3%

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

      6. distribute-rgt-in 94.3%

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

      7. *-lft-identity 94.3%

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

      8. associate-+r- 94.3%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 93.0%

      \[\leadsto \color{blue}{1 + -1 \cdot y} \]
   6. Step-by-step derivation

      1. neg-mul-1 93.0%

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

      2. unsub-neg 93.0%

         \[\leadsto \color{blue}{1 - y} \]

   7. Simplified 93.0%

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

4. Final simplification 90.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.55 \cdot 10^{+93} \lor \neg \left(x \leq 2.2 \cdot 10^{+16}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 - y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 62.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 620000000\right):\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 620000000.0))) (- y) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 620000000.0)) {
		tmp = -y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.0d0)) .or. (.not. (y <= 620000000.0d0))) then
        tmp = -y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 620000000.0]], $MachinePrecision]], (-y), 1.0]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 6.2e8 < y

   1. Initial program 100.0%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. remove-double-neg 100.0%

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

      3. unsub-neg 100.0%

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

      4. sub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. distribute-rgt-in 100.0%

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

      7. *-lft-identity 100.0%

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

      8. associate-+r- 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 100.0%

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

   6. Taylor expanded in y around inf 99.4%

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

   7. Taylor expanded in x around 0 54.1%

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

      1. neg-mul-1 54.1%

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

   9. Simplified 54.1%

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

   if -1 < y < 6.2e8

   1. Initial program 57.0%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. +-commutative 57.0%

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

      2. remove-double-neg 57.0%

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

      3. unsub-neg 57.0%

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

      4. sub-neg 57.0%

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

      5. +-commutative 57.0%

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

      6. distribute-rgt-in 57.0%

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

      7. *-lft-identity 57.0%

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

      8. associate-+r- 57.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. --rgt-identity 100.0%

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

      13. +-commutative 100.0%

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

      14. distribute-lft-neg-out 100.0%

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

      15. distribute-rgt-neg-in 100.0%

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

      16. neg-sub0 100.0%

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

      17. associate--r- 100.0%

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

      18. metadata-eval 100.0%

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

      19. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 67.3%

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

4. Final simplification 60.9%

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

Alternative 7: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 78.0%

   \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
2. Step-by-step derivation

   1. +-commutative 78.0%

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

   2. remove-double-neg 78.0%

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

   3. unsub-neg 78.0%

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

   4. sub-neg 78.0%

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

   5. +-commutative 78.0%

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

   6. distribute-rgt-in 78.0%

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

   7. *-lft-identity 78.0%

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

   8. associate-+r- 78.0%

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

   9. associate--l- 100.0%

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

   10. sub-neg 100.0%

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

   11. +-inverses 100.0%

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

   12. --rgt-identity 100.0%

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

   13. +-commutative 100.0%

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

   14. distribute-lft-neg-out 100.0%

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

   15. distribute-rgt-neg-in 100.0%

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

   16. neg-sub0 100.0%

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

   17. associate--r- 100.0%

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

   18. metadata-eval 100.0%

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

   19. +-commutative 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{1 + y \cdot \left(x + -1\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 8: 38.4% accurate, 9.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 1.0)

C

double code(double x, double y) {
	return 1.0;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0
end function

Java

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

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0;
end

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 78.0%

   \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
2. Step-by-step derivation

   1. +-commutative 78.0%

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

   2. remove-double-neg 78.0%

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

   3. unsub-neg 78.0%

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

   4. sub-neg 78.0%

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

   5. +-commutative 78.0%

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

   6. distribute-rgt-in 78.0%

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

   7. *-lft-identity 78.0%

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

   8. associate-+r- 78.0%

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

   9. associate--l- 100.0%

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

   10. sub-neg 100.0%

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

   11. +-inverses 100.0%

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

   12. --rgt-identity 100.0%

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

   13. +-commutative 100.0%

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

   14. distribute-lft-neg-out 100.0%

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

   15. distribute-rgt-neg-in 100.0%

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

   16. neg-sub0 100.0%

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

   17. associate--r- 100.0%

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

   18. metadata-eval 100.0%

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

   19. +-commutative 100.0%

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

3. Simplified 100.0%

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

5. Taylor expanded in y around 0 35.9%

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

Developer Target 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024158 
(FPCore (x y)
  :name "Graphics.Rendering.Chart.Plot.Vectors:renderPlotVectors from Chart-1.5.3"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* y x) (- y 1)))

  (+ x (* (- 1.0 x) (- 1.0 y))))