sp-acj4-46-cond true

Summary

Given

\(x \in \mathbb{C},\quad \operatorname{Im}\left(x\right) > -\pi \land \operatorname{Im}\left(x\right) \le \pi,\quad 2^{x} \neq 0\)

Claim

\(\displaystyle \log 2 \, x = \log\left(2^{x}\right)\)

Expected

true equal at every admissible point

the two sides are equal at every admissible point

SimpliPy acj-4 (MIT) rules_real.json[46]: * log 2 _0 -> log pow 2 _0 [weakest assumption found: im-principal]

Lean proof: included

Answers (latest run per system; open code for the reproducer that ran)

system outcome answer steps (from the trace) s run query (as sent) detail

none

always-none no verdict null 0.0 2026-10-13 17:21:18 ba9dc4def822 (and (> (im x) (- pi)) (<= (im x) pi)) ∧ (nonzero (pow 2 x)) ⊢ (= (* (log 2) x) (log (pow 2 x))) null

sympy

sympy-ask no verdict null difference → x*log(2) - log(2**x) · ask → None 0.401 2026-10-13 17:21:19 ba9dc4def822 Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = ask(Q.positive(W**2 + 1), Q.real(W))
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
Assum = And(Q.complex(x), And(im(x) > -pi, im(x) <= pi), ~Q.zero(Pow(2, x)))
Residual = log(2) * x - log(Pow(2, x))
# not Q.eq: in SymPy 1.14 ask(Q.eq(x**2, x), Q.real(x)) is wrongly False
Answer = ask(Q.zero(Residual), Assum)
print(Residual, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

sympy-ask no verdict null difference → x*log(2) - log(2**x) · ask → None 0.046 2026-10-12 21:54:02 ee702ae2fe06 Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = ask(Q.positive(W**2 + 1), Q.real(W))
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
Assum = And(Q.complex(x), And(im(x) > -pi, im(x) <= pi), ~Q.zero(Pow(2, x)))
Residual = log(2) * x - log(Pow(2, x))
# not Q.eq: in SymPy 1.14 ask(Q.eq(x**2, x), Q.real(x)) is wrongly False
Answer = ask(Q.zero(Residual), Assum)
print(Residual, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

sympy-refine no verdict null difference → x*log(2) - log(2**x) · refine → x*log(2) - log(2**x) 0.095 2026-10-13 17:22:30 ba9dc4def822 Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = refine(Abs(W), Q.positive(W))
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
Assum = And(Q.complex(x), And(im(x) > -pi, im(x) <= pi), ~Q.zero(Pow(2, x)))
Residual = log(2) * x - log(Pow(2, x))
Result = refine(Residual, Assum)
# true iff the result is 0; false only if it is a definite nonzero number
Answer = True if Result == 0 else False if (Result.is_number and Result.is_finite and Result.is_zero is False) else None
print(Result, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
refine	`refine(Residual, Assum)`	→	`xlog(2) - log(2*x)`
answer			`null`

sympy-refine no verdict null difference → x*log(2) - log(2**x) · refine → x*log(2) - log(2**x) 0.077 2026-10-12 21:54:16 ee702ae2fe06 Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = refine(Abs(W), Q.positive(W))
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
Assum = And(Q.complex(x), And(im(x) > -pi, im(x) <= pi), ~Q.zero(Pow(2, x)))
Residual = log(2) * x - log(Pow(2, x))
Result = refine(Residual, Assum)
# true iff the result is 0; false only if it is a definite nonzero number
Answer = True if Result == 0 else False if (Result.is_number and Result.is_finite and Result.is_zero is False) else None
print(Result, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
refine	`refine(Residual, Assum)`	→	`xlog(2) - log(2*x)`
answer			`null`

sympy-simplify no verdict null difference → x*log(2) - log(2**x) · simplify → x*log(2) - log(2**x) 0.026 2026-10-13 17:24:01 ba9dc4def822 Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = simplify(sin(W)**2 + cos(W)**2)
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
# dropped (not a unary fact about one symbol): And(im(x) > -pi, im(x) <= pi)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(2, x))
Residual = log(2) * x - log(Pow(2, x))
Result = simplify(Residual)
# true iff the result is 0; false only if it is a definite nonzero number
Answer = True if Result == 0 else False if (Result.is_number and Result.is_finite and Result.is_zero is False) else None
print(Result, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
simplify	`simplify(Residual)`	→	`xlog(2) - log(2*x)`
answer			`null`

sympy-simplify no verdict null difference → x*log(2) - log(2**x) · simplify → x*log(2) - log(2**x) 0.028 2026-10-12 21:54:43 ee702ae2fe06 Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = simplify(sin(W)**2 + cos(W)**2)
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
# dropped (not a unary fact about one symbol): And(im(x) > -pi, im(x) <= pi)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(2, x))
Residual = log(2) * x - log(Pow(2, x))
Result = simplify(Residual)
# true iff the result is 0; false only if it is a definite nonzero number
Answer = True if Result == 0 else False if (Result.is_number and Result.is_finite and Result.is_zero is False) else None
print(Result, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
simplify	`simplify(Residual)`	→	`xlog(2) - log(2*x)`
answer			`null`

wolfram

wolfram-fullsimplify solved true difference → x*Log[2] - Log[2^x] · result → 0 0.03 2026-10-13 17:24:42 ba9dc4def822 Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) true

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = FullSimplify[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`FullSimplify[Residual, Assum]`	→	`0`
answer			`true`

wolfram-refine no verdict null difference → x*Log[2] - Log[2^x] · result → x*Log[2] - Log[2^x] 0.022 2026-10-13 17:24:31 ba9dc4def822 Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) null

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = Refine[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`Refine[Residual, Assum]`	→	`x*Log[2] - Log[2^x]`
answer			`null`

wolfram-simplify no verdict null difference → x*Log[2] - Log[2^x] · result → x*Log[2] - Log[2^x] 0.024 2026-10-13 17:24:17 ba9dc4def822 Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) null

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = Simplify[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`Simplify[Residual, Assum]`	→	`x*Log[2] - Log[2^x]`
answer			`null`

Older runs (11)

system outcome answer steps (from the trace) s run query (as sent) detail

wolfram-fullsimplify solved true difference → x*Log[2] - Log[2^x] · result → 0 0.031 2026-10-13 16:43:00 3ba0dfac4bca Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) true

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = FullSimplify[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`FullSimplify[Residual, Assum]`	→	`0`
answer			`true`

wolfram-refine no verdict null difference → x*Log[2] - Log[2^x] · result → x*Log[2] - Log[2^x] 0.023 2026-10-13 16:42:50 3ba0dfac4bca Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) null

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = Refine[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`Refine[Residual, Assum]`	→	`x*Log[2] - Log[2^x]`
answer			`null`

wolfram-simplify no verdict null difference → x*Log[2] - Log[2^x] · result → x*Log[2] - Log[2^x] 0.024 2026-10-13 16:42:35 3ba0dfac4bca Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) null

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = Simplify[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`Simplify[Residual, Assum]`	→	`x*Log[2] - Log[2^x]`
answer			`null`

sympy-simplify no verdict null difference → x*log(2) - log(2**x) · simplify → x*log(2) - log(2**x) 0.027 2026-10-13 16:42:18 3ba0dfac4bca Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = simplify(sin(W)**2 + cos(W)**2)
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
# dropped (not a unary fact about one symbol): And(im(x) > -pi, im(x) <= pi)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(2, x))
Residual = log(2) * x - log(Pow(2, x))
Result = simplify(Residual)
# true iff the result is 0; false only if it is a definite nonzero number
Answer = True if Result == 0 else False if (Result.is_number and Result.is_finite and Result.is_zero is False) else None
print(Result, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
simplify	`simplify(Residual)`	→	`xlog(2) - log(2*x)`
answer			`null`

sympy-refine no verdict null difference → x*log(2) - log(2**x) · refine → x*log(2) - log(2**x) 0.096 2026-10-13 16:40:40 3ba0dfac4bca Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = refine(Abs(W), Q.positive(W))
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
Assum = And(Q.complex(x), And(im(x) > -pi, im(x) <= pi), ~Q.zero(Pow(2, x)))
Residual = log(2) * x - log(Pow(2, x))
Result = refine(Residual, Assum)
# true iff the result is 0; false only if it is a definite nonzero number
Answer = True if Result == 0 else False if (Result.is_number and Result.is_finite and Result.is_zero is False) else None
print(Result, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
refine	`refine(Residual, Assum)`	→	`xlog(2) - log(2*x)`
answer			`null`

always-none no verdict null 0.0 2026-10-13 16:39:28 3ba0dfac4bca (and (> (im x) (- pi)) (<= (im x) pi)) ∧ (nonzero (pow 2 x)) ⊢ (= (* (log 2) x) (log (pow 2 x))) null

sympy-ask no verdict null difference → x*log(2) - log(2**x) · ask → None 0.408 2026-10-13 16:39:28 3ba0dfac4bca Q.complex(x) ∧ And((im(x) > (-pi)), (im(x) <= pi)) ∧ (~Q.zero(Pow(2, x))) ⊢ Eq((log(2)*x), log(Pow(2, x))) null

code

setup — not timed

from sympy import *
import sympy

SympyVersion = sympy.__version__
# warm-up: a fixed generic expression, never case content
W = Symbol('W')
Warmup = ask(Q.positive(W**2 + 1), Q.real(W))
# every query then runs in its own forked process, starting from this state:
# the expression caches are dropped (imported and lazily loaded modules stay)
sympy.core.cache.clear_cache()

x = Symbol('x', complex=True)
Assum = And(Q.complex(x), And(im(x) > -pi, im(x) <= pi), ~Q.zero(Pow(2, x)))
Residual = log(2) * x - log(Pow(2, x))
# not Q.eq: in SymPy 1.14 ask(Q.eq(x**2, x), Q.real(x)) is wrongly False
Answer = ask(Q.zero(Residual), Assum)
print(Residual, Answer, sep='\n')

difference	`log(2) * x - log(Pow(2, x))`	→	`xlog(2) - log(2*x)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

wolfram-fullsimplify solved true difference → x*Log[2] - Log[2^x] · result → 0 0.03 2026-10-12 21:55:24 ee702ae2fe06 Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) true

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = FullSimplify[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`FullSimplify[Residual, Assum]`	→	`0`
answer			`true`

wolfram-refine no verdict null difference → x*Log[2] - Log[2^x] · result → x*Log[2] - Log[2^x] 0.023 2026-10-12 21:55:14 ee702ae2fe06 Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) null

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = Refine[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`Refine[Residual, Assum]`	→	`x*Log[2] - Log[2^x]`
answer			`null`

always-none no verdict null 0.0 2026-10-12 21:55:00 ee702ae2fe06 (and (> (im x) (- pi)) (<= (im x) pi)) ∧ (nonzero (pow 2 x)) ⊢ (= (* (log 2) x) (log (pow 2 x))) null

wolfram-simplify no verdict null difference → x*Log[2] - Log[2^x] · result → x*Log[2] - Log[2^x] 0.024 2026-10-12 21:55:00 ee702ae2fe06 Element[x, Complexes] ∧ ((Im[x] > (-Pi)) && (Im[x] <= Pi)) ∧ (Power[2, x] != 0) ⊢ ((Log[2]*x) == Log[Power[2, x]]) null

code

setup — not timed

(
  $HistoryLength = 0;
  $Messages = {};
  Warmup = Simplify[Sin[W]^2 + Cos[W]^2, Element[W, Reals]];
  GenericWarmup = Quiet[{Simplify[Abs[W] + W, W < 0], Simplify[Sqrt[W^2] - W, W > 0], Refine[Sqrt[W^2], W > 0], Simplify[Log[W V] - Log[W] - Log[V], W > 0 && V > 0], Simplify[Log[-W] - Log[W] - I Pi, W < 0], Simplify[(-1)^(2 W) - 1, Element[W, Integers]], Simplify[Mod[W + 1, 2], Element[W, Integers] && Element[(W - 1)/2, Integers]], Simplify[ArcTan[W] + ArcTan[1/W] - Pi/2, W > 0], FullSimplify[ArcCot[W] - ArcTan[1/W], W > 0], Simplify[Abs[Exp[I W]] - 1, Element[W, Reals]], Simplify[Re[W] - (W + Conjugate[W])/2], Simplify[Gamma[W + 1] - W!, Element[W, Integers] && W > 0], Simplify[Floor[W] - W, Element[W, Integers]], Simplify[Sqrt[W] Sqrt[V] - Sqrt[W V], W > 0 && V > 0], Simplify[HeavisideTheta[W] - 1, W > 0], Simplify[2^W 2^V - 2^(W + V), Element[W, Reals] && Element[V, Reals]], Simplify[Sum[V, {V, 1, W}] - W (W + 1)/2, Element[W, Integers] && W > 0]}];
  Quiet[Check[Message[General::argx, "W", 0], Null]];
  {$Version, Warmup, Length[GenericWarmup]}
)

(* evaluated in a forked copy of the setup kernel: TimeConstrained would not fire here (no timer thread), so the parent enforces a hard timeout of 9 s by killing this process *)
(
  Assum = (Element[x, Complexes]) && (((Im[x] > (-Pi)) && (Im[x] <= Pi))) && ((Power[2, x] != 0));
  Residual = (Log[2]*x) - (Log[2^x]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(Log[2]*x) - (Log[2^x])`	→	`x*Log[2] - Log[2^x]`
result	`Simplify[Residual, Assum]`	→	`x*Log[2] - Log[2^x]`
answer			`null`

Source (conditional.sexp)

(case sp-acj4-46-cond (category simplipy-conditional)
  (note "SimpliPy acj-4 (MIT) rules_real.json[46]: * log 2 _0  ->  log pow 2 _0  [weakest assumption found: im-principal]")
  (var x complex)
  (assume (and (> (im x) (- pi)) (<= (im x) pi)))
  (assume (nonzero (pow 2 x)))
  (ask (= (* (log 2) x) (log (pow 2 x))))
  (expect true)
  (lean-proof "simp at h0; have hl := Real.log_pos one_lt_two; have hl2 := Real.log_two_lt_d9; have e : (x * Complex.log 2).im = x.im * Real.log 2 := (by rw [AE.cond_log_two_eq, Complex.mul_im, Complex.ofReal_im, Complex.ofReal_re]; ring); refine ⟨⟨two_ne_zero, h1.1.1, h1.2⟩, ?_⟩; rw [AE.cond_log_pow_of_im two_ne_zero (by rw [e]; nlinarith [Real.pi_pos]) (by rw [e]; nlinarith [Real.pi_pos]), mul_comm]"))