sp-acj4-234-cond true

Summary

Given

\(x \in \mathbb{C},\quad \operatorname{Re}\left(x\right) \ge 0,\quad x \neq 0 \lor \operatorname{Re}\left(x\right) > 0,\quad x^{x} \neq 0,\quad x \neq 0,\quad \frac{1}{x} \neq 0 \lor \operatorname{Re}\left(x\right) > 0\)

Claim

\(\displaystyle \frac{1}{x^{x}} = \frac{1}{x}^{x}\)

Expected

true equal at every admissible point

the two sides are equal at every admissible point

SimpliPy acj-4 (MIT) rules_real.json[234]: inv pow _0 _0 -> pow inv _0 _0 [weakest assumption found: re-nonneg]

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 (>= (re x) 0) ∧ (or (nonzero x) (> (re x) 0)) ∧ (nonzero (pow x x)) ∧ (nonzero x) ∧ (or (nonzero (/ x)) (> (re x) 0)) ⊢ (= (/ (pow x x)) (pow (/ x) x)) null

sympy

sympy-ask no verdict null difference → -(1/x)**x + x**(-x) · ask → None 0.214 2026-10-13 17:21:19 ba9dc4def822 Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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), re(x) >= 0, Or(~Q.zero(x), re(x) > 0), ~Q.zero(Pow(x, x)), ~Q.zero(x), Or(~Q.zero(1 / x), re(x) > 0))
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

sympy-ask no verdict null difference → -(1/x)**x + x**(-x) · ask → None 0.043 2026-10-12 21:54:02 ee702ae2fe06 Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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), re(x) >= 0, Or(~Q.zero(x), re(x) > 0), ~Q.zero(Pow(x, x)), ~Q.zero(x), Or(~Q.zero(1 / x), re(x) > 0))
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

sympy-refine no verdict null difference → -(1/x)**x + x**(-x) · refine → -(1/x)**x + x**(-x) 0.131 2026-10-13 17:22:30 ba9dc4def822 Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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), re(x) >= 0, Or(~Q.zero(x), re(x) > 0), ~Q.zero(Pow(x, x)), ~Q.zero(x), Or(~Q.zero(1 / x), re(x) > 0))
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
refine	`refine(Residual, Assum)`	→	`-(1/x)x + x(-x)`
answer			`null`

sympy-refine no verdict null difference → -(1/x)**x + x**(-x) · refine → -(1/x)**x + x**(-x) 0.085 2026-10-12 21:54:16 ee702ae2fe06 Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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), re(x) >= 0, Or(~Q.zero(x), re(x) > 0), ~Q.zero(Pow(x, x)), ~Q.zero(x), Or(~Q.zero(1 / x), re(x) > 0))
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
refine	`refine(Residual, Assum)`	→	`-(1/x)x + x(-x)`
answer			`null`

sympy-simplify no verdict null difference → -(1/x)**x + x**(-x) · simplify → -(1/x)**x + x**(-x) 0.028 2026-10-13 17:24:01 ba9dc4def822 Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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, zero=False)
# dropped (not a unary fact about one symbol): re(x) >= 0
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(x) > 0)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(x, x))
# dropped (not a unary fact about one symbol): Or(~Q.zero(1 / x), re(x) > 0)
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
simplify	`simplify(Residual)`	→	`-(1/x)x + x(-x)`
answer			`null`

sympy-simplify no verdict null difference → -(1/x)**x + x**(-x) · simplify → -(1/x)**x + x**(-x) 0.029 2026-10-12 21:54:43 ee702ae2fe06 Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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, zero=False)
# dropped (not a unary fact about one symbol): re(x) >= 0
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(x) > 0)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(x, x))
# dropped (not a unary fact about one symbol): Or(~Q.zero(1 / x), re(x) > 0)
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
simplify	`simplify(Residual)`	→	`-(1/x)x + x(-x)`
answer			`null`

wolfram

wolfram-fullsimplify solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.031 2026-10-13 17:24:42 ba9dc4def822 Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), 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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`FullSimplify[Residual, Assum]`	→	`0`
answer			`true`

wolfram-refine solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.028 2026-10-13 17:24:31 ba9dc4def822 Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), x]) true

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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`Refine[Residual, Assum]`	→	`0`
answer			`true`

wolfram-simplify solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.03 2026-10-13 17:24:17 ba9dc4def822 Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), x]) true

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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`Simplify[Residual, Assum]`	→	`0`
answer			`true`

Older runs (11)

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

wolfram-fullsimplify solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.031 2026-10-13 16:43:00 3ba0dfac4bca Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), 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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`FullSimplify[Residual, Assum]`	→	`0`
answer			`true`

wolfram-refine solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.028 2026-10-13 16:42:50 3ba0dfac4bca Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), x]) true

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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`Refine[Residual, Assum]`	→	`0`
answer			`true`

wolfram-simplify solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.031 2026-10-13 16:42:35 3ba0dfac4bca Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), x]) true

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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`Simplify[Residual, Assum]`	→	`0`
answer			`true`

sympy-simplify no verdict null difference → -(1/x)**x + x**(-x) · simplify → -(1/x)**x + x**(-x) 0.028 2026-10-13 16:42:18 3ba0dfac4bca Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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, zero=False)
# dropped (not a unary fact about one symbol): re(x) >= 0
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(x) > 0)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(x, x))
# dropped (not a unary fact about one symbol): Or(~Q.zero(1 / x), re(x) > 0)
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
simplify	`simplify(Residual)`	→	`-(1/x)x + x(-x)`
answer			`null`

sympy-refine no verdict null difference → -(1/x)**x + x**(-x) · refine → -(1/x)**x + x**(-x) 0.134 2026-10-13 16:40:40 3ba0dfac4bca Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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), re(x) >= 0, Or(~Q.zero(x), re(x) > 0), ~Q.zero(Pow(x, x)), ~Q.zero(x), Or(~Q.zero(1 / x), re(x) > 0))
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
refine	`refine(Residual, Assum)`	→	`-(1/x)x + x(-x)`
answer			`null`

always-none no verdict null 0.0 2026-10-13 16:39:28 3ba0dfac4bca (>= (re x) 0) ∧ (or (nonzero x) (> (re x) 0)) ∧ (nonzero (pow x x)) ∧ (nonzero x) ∧ (or (nonzero (/ x)) (> (re x) 0)) ⊢ (= (/ (pow x x)) (pow (/ x) x)) null

sympy-ask no verdict null difference → -(1/x)**x + x**(-x) · ask → None 0.215 2026-10-13 16:39:28 3ba0dfac4bca Q.complex(x) ∧ (re(x) >= 0) ∧ Or((~Q.zero(x)), (re(x) > 0)) ∧ (~Q.zero(Pow(x, x))) ∧ (~Q.zero(x)) ∧ Or((~Q.zero((1/x))), (re(x) > 0)) ⊢ Eq((1/Pow(x, x)), Pow((1/x), 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), re(x) >= 0, Or(~Q.zero(x), re(x) > 0), ~Q.zero(Pow(x, x)), ~Q.zero(x), Or(~Q.zero(1 / x), re(x) > 0))
Residual = 1 / Pow(x, x) - Pow(1 / x, 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	`1 / Pow(x, x) - Pow(1 / x, x)`	→	`-(1/x)x + x(-x)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

wolfram-fullsimplify solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.031 2026-10-12 21:55:24 ee702ae2fe06 Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), 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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`FullSimplify[Residual, Assum]`	→	`0`
answer			`true`

wolfram-refine solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.028 2026-10-12 21:55:14 ee702ae2fe06 Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), x]) true

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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`Refine[Residual, Assum]`	→	`0`
answer			`true`

always-none no verdict null 0.0 2026-10-12 21:55:00 ee702ae2fe06 (>= (re x) 0) ∧ (or (nonzero x) (> (re x) 0)) ∧ (nonzero (pow x x)) ∧ (nonzero x) ∧ (or (nonzero (/ x)) (> (re x) 0)) ⊢ (= (/ (pow x x)) (pow (/ x) x)) null

wolfram-simplify solved true difference → -(x^(-1))^x + x^(-x) · result → 0 0.031 2026-10-12 21:55:00 ee702ae2fe06 Element[x, Complexes] ∧ (Re[x] >= 0) ∧ ((x != 0) || (Re[x] > 0)) ∧ (Power[x, x] != 0) ∧ (x != 0) ∧ (((1/x) != 0) || (Re[x] > 0)) ⊢ ((1/Power[x, x]) == Power[(1/x), x]) true

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]) && ((Re[x] >= 0)) && (((x != 0) || (Re[x] > 0))) && ((Power[x, x] != 0)) && ((x != 0)) && ((((1/x) != 0) || (Re[x] > 0)));
  Residual = (1/x^x) - ((1/x)^x);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

difference	`(1/x^x) - ((1/x)^x)`	→	`-(x^(-1))^x + x^(-x)`
result	`Simplify[Residual, Assum]`	→	`0`
answer			`true`

Source (conditional.sexp)

(case sp-acj4-234-cond (category simplipy-conditional)
  (note "SimpliPy acj-4 (MIT) rules_real.json[234]: inv pow _0 _0  ->  pow inv _0 _0  [weakest assumption found: re-nonneg]")
  (var x complex)
  (assume (>= (re x) 0))
  (assume (or (nonzero x) (> (re x) 0)))
  (assume (nonzero (pow x x)))
  (assume (nonzero x))
  (assume (or (nonzero (/ x)) (> (re x) 0)))
  (ask (= (/ (pow x x)) (pow (/ x) x)))
  (expect true)
  (lean-proof "have hre : 0 ≤ x.re := (by simpa using h0.2); refine ⟨⟨⟨h2.1.1, h2.2⟩, h3.2, (AE.pow.D_iff _ _).mpr (Or.inl (by simpa using h3.2))⟩, ?_⟩; rw [AE.cond_inv_pow_of h3.2, AE.cond_pow_inv_left_of h3.2 (Or.inl hre)]"))