sp-acj4-136-cond true

category simplipy-conditional

Summary

Given

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

Claim

\(\displaystyle \left|x^{e^{1}}\right| = x^{e^{1}}\)

Expected

true equal at every admissible point

the two sides are equal at every admissible point

SimpliPy acj-4 (MIT) rules_real.json[136] + rules.json[104]: abs pow _0 np.e -> pow _0 np.e [weakest assumption found: nonnegative]

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 (real x) ∧ (nonnegative x) ∧ (or (nonzero x) (> (re (exp 1)) 0)) ⊢ (= (abs (pow x (exp 1))) (pow x (exp 1))) null

sympy

sympy-ask no verdict null difference → -x**E + Abs(x**E) · ask → None 0.233 2026-10-13 17:21:19 ba9dc4def822 Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) 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', real=True)
Assum = And(Q.real(x), Q.nonnegative(x), Or(~Q.zero(x), re(exp(1)) > 0))
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
# 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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`-xE + Abs(xE)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

sympy-ask no verdict null difference → -x**E + Abs(x**E) · ask → None 0.158 2026-10-12 21:54:02 ee702ae2fe06 Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) 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', real=True)
Assum = And(Q.real(x), Q.nonnegative(x), Or(~Q.zero(x), re(exp(1)) > 0))
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
# 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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`-xE + Abs(xE)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

sympy-refine no verdict null difference → -x**E + Abs(x**E) · refine → -x**E + Abs(x**E) 0.185 2026-10-13 17:22:30 ba9dc4def822 Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) 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', real=True)
Assum = And(Q.real(x), Q.nonnegative(x), Or(~Q.zero(x), re(exp(1)) > 0))
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`-xE + Abs(xE)`
refine	`refine(Residual, Assum)`	→	`-xE + Abs(xE)`
answer			`null`

sympy-refine no verdict null difference → -x**E + Abs(x**E) · refine → -x**E + Abs(x**E) 0.153 2026-10-12 21:54:16 ee702ae2fe06 Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) 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', real=True)
Assum = And(Q.real(x), Q.nonnegative(x), Or(~Q.zero(x), re(exp(1)) > 0))
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`-xE + Abs(xE)`
refine	`refine(Residual, Assum)`	→	`-xE + Abs(xE)`
answer			`null`

sympy-simplify solved true difference → 0 · simplify → 0 0.007 2026-10-13 17:24:01 ba9dc4def822 Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) true

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', real=True, nonnegative=True)
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(exp(1)) > 0)
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`0`
simplify	`simplify(Residual)`	→	`0`
answer			`true`

sympy-simplify solved true difference → 0 · simplify → 0 0.008 2026-10-12 21:54:43 ee702ae2fe06 Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) true

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', real=True, nonnegative=True)
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(exp(1)) > 0)
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`0`
simplify	`simplify(Residual)`	→	`0`
answer			`true`

wolfram

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

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

wolfram-refine solved true difference → -x^E + Abs[x]^E · result → 0 0.022 2026-10-13 17:24:31 ba9dc4def822 Element[x, Reals] ∧ (Element[x, Reals] && x >= 0) ∧ ((x != 0) || (Re[Exp[1]] > 0)) ⊢ (Abs[Power[x, Exp[1]]] == Power[x, Exp[1]]) 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, Reals]) && ((Element[x, Reals] && x >= 0)) && (((x != 0) || (Re[Exp[1]] > 0)));
  Residual = (Abs[x^Exp[1]]) - (x^Exp[1]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

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

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

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

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

wolfram-refine solved true difference → -x^E + Abs[x]^E · result → 0 0.022 2026-10-13 16:42:50 3ba0dfac4bca Element[x, Reals] ∧ (Element[x, Reals] && x >= 0) ∧ ((x != 0) || (Re[Exp[1]] > 0)) ⊢ (Abs[Power[x, Exp[1]]] == Power[x, Exp[1]]) 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, Reals]) && ((Element[x, Reals] && x >= 0)) && (((x != 0) || (Re[Exp[1]] > 0)));
  Residual = (Abs[x^Exp[1]]) - (x^Exp[1]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

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

wolfram-simplify solved true difference → -x^E + Abs[x]^E · result → 0 0.023 2026-10-13 16:42:35 3ba0dfac4bca Element[x, Reals] ∧ (Element[x, Reals] && x >= 0) ∧ ((x != 0) || (Re[Exp[1]] > 0)) ⊢ (Abs[Power[x, Exp[1]]] == Power[x, Exp[1]]) 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, Reals]) && ((Element[x, Reals] && x >= 0)) && (((x != 0) || (Re[Exp[1]] > 0)));
  Residual = (Abs[x^Exp[1]]) - (x^Exp[1]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

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

sympy-simplify solved true difference → 0 · simplify → 0 0.007 2026-10-13 16:42:18 3ba0dfac4bca Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) true

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', real=True, nonnegative=True)
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(exp(1)) > 0)
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`0`
simplify	`simplify(Residual)`	→	`0`
answer			`true`

sympy-refine no verdict null difference → -x**E + Abs(x**E) · refine → -x**E + Abs(x**E) 0.183 2026-10-13 16:40:40 3ba0dfac4bca Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) 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', real=True)
Assum = And(Q.real(x), Q.nonnegative(x), Or(~Q.zero(x), re(exp(1)) > 0))
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`-xE + Abs(xE)`
refine	`refine(Residual, Assum)`	→	`-xE + Abs(xE)`
answer			`null`

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

sympy-ask no verdict null difference → -x**E + Abs(x**E) · ask → None 0.235 2026-10-13 16:39:28 3ba0dfac4bca Q.real(x) ∧ Q.nonnegative(x) ∧ Or((~Q.zero(x)), (re(exp(1)) > 0)) ⊢ Eq(Abs(Pow(x, exp(1))), Pow(x, exp(1))) 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', real=True)
Assum = And(Q.real(x), Q.nonnegative(x), Or(~Q.zero(x), re(exp(1)) > 0))
Residual = Abs(Pow(x, exp(1))) - Pow(x, exp(1))
# 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	`Abs(Pow(x, exp(1))) - Pow(x, exp(1))`	→	`-xE + Abs(xE)`
ask	`Q.zero(Residual)`	→	`None`
answer			`null`

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

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

wolfram-refine solved true difference → -x^E + Abs[x]^E · result → 0 0.022 2026-10-12 21:55:14 ee702ae2fe06 Element[x, Reals] ∧ (Element[x, Reals] && x >= 0) ∧ ((x != 0) || (Re[Exp[1]] > 0)) ⊢ (Abs[Power[x, Exp[1]]] == Power[x, Exp[1]]) 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, Reals]) && ((Element[x, Reals] && x >= 0)) && (((x != 0) || (Re[Exp[1]] > 0)));
  Residual = (Abs[x^Exp[1]]) - (x^Exp[1]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

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

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

wolfram-simplify solved true difference → -x^E + Abs[x]^E · result → 0 0.023 2026-10-12 21:55:00 ee702ae2fe06 Element[x, Reals] ∧ (Element[x, Reals] && x >= 0) ∧ ((x != 0) || (Re[Exp[1]] > 0)) ⊢ (Abs[Power[x, Exp[1]]] == Power[x, Exp[1]]) 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, Reals]) && ((Element[x, Reals] && x >= 0)) && (((x != 0) || (Re[Exp[1]] > 0)));
  Residual = (Abs[x^Exp[1]]) - (x^Exp[1]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)

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

Source (conditional.sexp)

(case sp-acj4-136-cond (category simplipy-conditional)
  (note "SimpliPy acj-4 (MIT) rules_real.json[136] + rules.json[104]: abs pow _0 np.e  ->  pow _0 np.e  [weakest assumption found: nonnegative]")
  (var x real)
  (assume (nonnegative x))
  (assume (or (nonzero x) (> (re (exp 1)) 0)))
  (ask (= (abs (pow x (exp 1))) (pow x (exp 1))))
  (expect true)
  (lean-proof "obtain ⟨r, rfl⟩ := AE.IsReal.exists hd0; have hr : 0 ≤ r := (by simpa using h0.2); have hD : AE.pow.D (↑r) (AE.exp 1) := (AE.pow.D_iff _ _).mpr (Or.inr (by rw [AE.cond_exp_one_eq, Complex.ofReal_re]; exact Real.exp_pos 1)); refine ⟨⟨⟨hD, by simp⟩, hD⟩, ?_⟩; rw [AE.cond_exp_one_eq, AE.cond_abs_pow_ofReal hr (Real.exp_pos 1).ne']"))