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

Percentage Accurate: 77.7% → 100.0%

Time: 5.1s

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: 77.7% 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} \\ \left(1 + x \cdot y\right) - y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.7%

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

   1. +-commutative 80.7%

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

   2. remove-double-neg 80.7%

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

   3. unsub-neg 80.7%

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

   4. sub-neg 80.7%

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

   5. +-commutative 80.7%

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

   6. distribute-rgt-in 80.7%

      \[\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 80.7%

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

   8. associate--l+ 88.9%

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

   9. associate--l- 100.0%

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

   10. sub-neg 100.0%

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

   11. +-inverses 100.0%

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

   12. metadata-eval 100.0%

       \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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. *-commutative 100.0%

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

   3. mul-1-neg 100.0%

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

6. Applied egg-rr 100.0%

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

7. Taylor expanded in x around 0 100.0%

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

Alternative 2: 62.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.2 \cdot 10^{+188}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq -7.2 \cdot 10^{+77}:\\ \;\;\;\;-y\\ \mathbf{elif}\;y \leq -1.2 \cdot 10^{-71}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 1.06 \cdot 10^{-14}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{+87} \lor \neg \left(y \leq 3.2 \cdot 10^{+249}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -5.2e+188)
   (* x y)
   (if (<= y -7.2e+77)
     (- y)
     (if (<= y -1.2e-71)
       (* x y)
       (if (<= y 1.06e-14)
         1.0
         (if (or (<= y 3.5e+87) (not (<= y 3.2e+249))) (* x y) (- y)))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -5.2e+188) {
		tmp = x * y;
	} else if (y <= -7.2e+77) {
		tmp = -y;
	} else if (y <= -1.2e-71) {
		tmp = x * y;
	} else if (y <= 1.06e-14) {
		tmp = 1.0;
	} else if ((y <= 3.5e+87) || !(y <= 3.2e+249)) {
		tmp = x * y;
	} else {
		tmp = -y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-5.2d+188)) then
        tmp = x * y
    else if (y <= (-7.2d+77)) then
        tmp = -y
    else if (y <= (-1.2d-71)) then
        tmp = x * y
    else if (y <= 1.06d-14) then
        tmp = 1.0d0
    else if ((y <= 3.5d+87) .or. (.not. (y <= 3.2d+249))) then
        tmp = x * y
    else
        tmp = -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -5.2e+188) {
		tmp = x * y;
	} else if (y <= -7.2e+77) {
		tmp = -y;
	} else if (y <= -1.2e-71) {
		tmp = x * y;
	} else if (y <= 1.06e-14) {
		tmp = 1.0;
	} else if ((y <= 3.5e+87) || !(y <= 3.2e+249)) {
		tmp = x * y;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -5.2e+188:
		tmp = x * y
	elif y <= -7.2e+77:
		tmp = -y
	elif y <= -1.2e-71:
		tmp = x * y
	elif y <= 1.06e-14:
		tmp = 1.0
	elif (y <= 3.5e+87) or not (y <= 3.2e+249):
		tmp = x * y
	else:
		tmp = -y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -5.2e+188)
		tmp = Float64(x * y);
	elseif (y <= -7.2e+77)
		tmp = Float64(-y);
	elseif (y <= -1.2e-71)
		tmp = Float64(x * y);
	elseif (y <= 1.06e-14)
		tmp = 1.0;
	elseif ((y <= 3.5e+87) || !(y <= 3.2e+249))
		tmp = Float64(x * y);
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -5.2e+188)
		tmp = x * y;
	elseif (y <= -7.2e+77)
		tmp = -y;
	elseif (y <= -1.2e-71)
		tmp = x * y;
	elseif (y <= 1.06e-14)
		tmp = 1.0;
	elseif ((y <= 3.5e+87) || ~((y <= 3.2e+249)))
		tmp = x * y;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -5.2e+188], N[(x * y), $MachinePrecision], If[LessEqual[y, -7.2e+77], (-y), If[LessEqual[y, -1.2e-71], N[(x * y), $MachinePrecision], If[LessEqual[y, 1.06e-14], 1.0, If[Or[LessEqual[y, 3.5e+87], N[Not[LessEqual[y, 3.2e+249]], $MachinePrecision]], N[(x * y), $MachinePrecision], (-y)]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -5.19999999999999975e188 or -7.1999999999999996e77 < y < -1.2e-71 or 1.06e-14 < y < 3.49999999999999986e87 or 3.20000000000000014e249 < y

   1. Initial program 92.2%

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

      1. +-commutative 92.2%

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

      2. remove-double-neg 92.2%

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

      3. unsub-neg 92.2%

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

      4. sub-neg 92.2%

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

      5. +-commutative 92.2%

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

      6. distribute-rgt-in 92.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 92.2%

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

      8. associate--l+ 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 60.4%

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

   if -5.19999999999999975e188 < y < -7.1999999999999996e77 or 3.49999999999999986e87 < y < 3.20000000000000014e249

   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--l+ 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 100.0%

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

   7. Taylor expanded in x around 0 67.8%

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

      1. neg-mul-1 67.8%

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

   9. Simplified 67.8%

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

   if -1.2e-71 < y < 1.06e-14

   1. Initial program 59.1%

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

      1. +-commutative 59.1%

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

      2. remove-double-neg 59.1%

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

      3. unsub-neg 59.1%

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

      4. sub-neg 59.1%

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

      5. +-commutative 59.1%

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

      6. distribute-rgt-in 59.1%

         \[\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 59.1%

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

      8. associate--l+ 72.1%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 83.4%

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

4. Final simplification 71.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.2 \cdot 10^{+188}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq -7.2 \cdot 10^{+77}:\\ \;\;\;\;-y\\ \mathbf{elif}\;y \leq -1.2 \cdot 10^{-71}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 1.06 \cdot 10^{-14}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{+87} \lor \neg \left(y \leq 3.2 \cdot 10^{+249}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.8e9 or 1 < x

   1. Initial program 59.6%

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

      1. +-commutative 59.6%

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

      2. remove-double-neg 59.6%

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

      3. unsub-neg 59.6%

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

      4. sub-neg 59.6%

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

      5. +-commutative 59.6%

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

      6. distribute-rgt-in 59.6%

         \[\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 59.6%

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

      8. associate--l+ 76.7%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 -2.8e9 < 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--l+ 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 99.3%

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

      1. neg-mul-1 99.3%

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

      2. unsub-neg 99.3%

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

   7. Simplified 99.3%

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

4. Final simplification 99.3%

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

Alternative 4: 85.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.05e-71) (not (<= y 0.0145))) (* y (+ x -1.0)) (- 1.0 y)))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if (y <= -1.05e-71) or not (y <= 0.0145):
		tmp = y * (x + -1.0)
	else:
		tmp = 1.0 - y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.05e-71) || ~((y <= 0.0145)))
		tmp = y * (x + -1.0);
	else
		tmp = 1.0 - y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.0500000000000001e-71 or 0.0145000000000000007 < y

   1. Initial program 95.4%

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

      1. +-commutative 95.4%

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

      2. remove-double-neg 95.4%

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

      3. unsub-neg 95.4%

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

      4. sub-neg 95.4%

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

      5. +-commutative 95.4%

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

      6. distribute-rgt-in 95.4%

         \[\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 95.4%

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

      8. associate--l+ 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 96.2%

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

   if -1.0500000000000001e-71 < y < 0.0145000000000000007

   1. Initial program 59.6%

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

      1. +-commutative 59.6%

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

      2. remove-double-neg 59.6%

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

      3. unsub-neg 59.6%

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

      4. sub-neg 59.6%

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

      5. +-commutative 59.6%

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

      6. distribute-rgt-in 59.6%

         \[\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 59.6%

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

      8. associate--l+ 72.9%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 83.0%

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

      1. neg-mul-1 83.0%

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

      2. unsub-neg 83.0%

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

   7. Simplified 83.0%

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

4. Final simplification 90.8%

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

Alternative 5: 87.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -5.2e+18) (not (<= x 16500000000.0))) (* x y) (- 1.0 y)))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if (x <= -5.2e+18) or not (x <= 16500000000.0):
		tmp = x * y
	else:
		tmp = 1.0 - y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -5.2e+18) || ~((x <= 16500000000.0)))
		tmp = x * y;
	else
		tmp = 1.0 - y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -5.2e18 or 1.65e10 < x

   1. Initial program 58.6%

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

      1. +-commutative 58.6%

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

      2. remove-double-neg 58.6%

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

      3. unsub-neg 58.6%

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

      4. sub-neg 58.6%

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

      5. +-commutative 58.6%

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

      6. distribute-rgt-in 58.6%

         \[\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 58.6%

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

      8. associate--l+ 76.1%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 76.1%

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

   if -5.2e18 < x < 1.65e10

   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--l+ 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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.6%

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

      1. neg-mul-1 98.6%

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

      2. unsub-neg 98.6%

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

   7. Simplified 98.6%

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

4. Final simplification 88.1%

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

Alternative 6: 61.3% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 0.0185)) {
		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 <= 0.0185d0))) 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 <= 0.0185)) {
		tmp = -y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 0.0185))
		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 <= 0.0185)))
		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, 0.0185]], $MachinePrecision]], (-y), 1.0]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.0184999999999999991 < y

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. remove-double-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. sub-neg 99.9%

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

      5. +-commutative 99.9%

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

      6. distribute-rgt-in 99.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 99.9%

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

      8. associate--l+ 100.0%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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.2%

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

   7. Taylor expanded in x around 0 50.4%

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

      1. neg-mul-1 50.4%

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

   9. Simplified 50.4%

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

   if -1 < y < 0.0184999999999999991

   1. Initial program 57.9%

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

      1. +-commutative 57.9%

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

      2. remove-double-neg 57.9%

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

      3. unsub-neg 57.9%

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

      4. sub-neg 57.9%

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

      5. +-commutative 57.9%

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

      6. distribute-rgt-in 57.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 57.9%

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

      8. associate--l+ 75.7%

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

      9. associate--l- 100.0%

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

      10. sub-neg 100.0%

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

      11. +-inverses 100.0%

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

      12. metadata-eval 100.0%

          \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 78.1%

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

4. Final simplification 63.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 0.0185\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 80.7%

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

   1. +-commutative 80.7%

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

   2. remove-double-neg 80.7%

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

   3. unsub-neg 80.7%

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

   4. sub-neg 80.7%

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

   5. +-commutative 80.7%

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

   6. distribute-rgt-in 80.7%

      \[\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 80.7%

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

   8. associate--l+ 88.9%

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

   9. associate--l- 100.0%

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

   10. sub-neg 100.0%

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

   11. +-inverses 100.0%

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

   12. metadata-eval 100.0%

       \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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.1% 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 80.7%

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

   1. +-commutative 80.7%

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

   2. remove-double-neg 80.7%

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

   3. unsub-neg 80.7%

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

   4. sub-neg 80.7%

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

   5. +-commutative 80.7%

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

   6. distribute-rgt-in 80.7%

      \[\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 80.7%

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

   8. associate--l+ 88.9%

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

   9. associate--l- 100.0%

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

   10. sub-neg 100.0%

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

   11. +-inverses 100.0%

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

   12. metadata-eval 100.0%

       \[\leadsto \left(-y\right) \cdot \left(1 - x\right) + \color{blue}{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 37.2%

   \[\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 2024144 
(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))))