← suite simplipy

sp-acj4-56-cond true

category simplipy-conditional

Summary

Given
\(x \in \mathbb{R},\quad x > 0,\quad x \neq 0,\quad x \neq 0 \lor \operatorname{Re}\left(\pi\right) > 0,\quad x^{\pi} \neq 0\)
Claim
\(\displaystyle \log x \, \pi = \log\left(x^{\pi}\right)\)
Expected
true equal at every admissible point

the two sides are equal at every admissible point

SimpliPy acj-4 (MIT) rules_real.json[56]: * log _0 np.pi -> log pow _0 np.pi [weakest assumption found: positive]

Lean proof: included

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

systemoutcomeanswersteps (from the trace)srunquery (as sent)detail
none
always-noneno verdictnull0.02026-10-13 17:21:18 ba9dc4def822(real x) ∧ (positive x) ∧ (nonzero x) ∧ (or (nonzero x) (> (re pi) 0)) ∧ (nonzero (pow x pi)) ⊢ (= (* (log x) pi) (log (pow x pi)))null
sympy
sympy-askno verdictnulldifference → pi*log(x) - log(x**pi) · ask → None0.1792026-10-13 17:21:19 ba9dc4def822Q.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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.positive(x), ~Q.zero(x), Or(~Q.zero(x), re(pi) > 0), ~Q.zero(Pow(x, pi)))
Residual = log(x) * pi - log(Pow(x, pi))
# 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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
askQ.zero(Residual)→None
answernull
sympy-askno verdictnulldifference → pi*log(x) - log(x**pi) · ask → None0.1512026-10-12 21:54:02 ee702ae2fe06Q.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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.positive(x), ~Q.zero(x), Or(~Q.zero(x), re(pi) > 0), ~Q.zero(Pow(x, pi)))
Residual = log(x) * pi - log(Pow(x, pi))
# 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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
askQ.zero(Residual)→None
answernull
sympy-refineno verdictnulldifference → pi*log(x) - log(x**pi) · refine → pi*log(x) - log(x**pi)0.0412026-10-13 17:22:30 ba9dc4def822Q.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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.positive(x), ~Q.zero(x), Or(~Q.zero(x), re(pi) > 0), ~Q.zero(Pow(x, pi)))
Residual = log(x) * pi - log(Pow(x, pi))
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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
refinerefine(Residual, Assum)→pi*log(x) - log(x**pi)
answernull
sympy-refineno verdictnulldifference → pi*log(x) - log(x**pi) · refine → pi*log(x) - log(x**pi)0.0432026-10-12 21:54:16 ee702ae2fe06Q.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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.positive(x), ~Q.zero(x), Or(~Q.zero(x), re(pi) > 0), ~Q.zero(Pow(x, pi)))
Residual = log(x) * pi - log(Pow(x, pi))
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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
refinerefine(Residual, Assum)→pi*log(x) - log(x**pi)
answernull
sympy-simplifysolvedtruedifference → pi*log(x) - log(x**pi) · simplify → 00.0242026-10-13 17:24:01 ba9dc4def822Q.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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, positive=True, zero=False)
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(pi) > 0)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(x, pi))
Residual = log(x) * pi - log(Pow(x, pi))
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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
simplifysimplify(Residual)→0
answertrue
sympy-simplifysolvedtruedifference → pi*log(x) - log(x**pi) · simplify → 00.0252026-10-12 21:54:43 ee702ae2fe06Q.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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, positive=True, zero=False)
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(pi) > 0)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(x, pi))
Residual = log(x) * pi - log(Pow(x, pi))
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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
simplifysimplify(Residual)→0
answertrue
wolfram
wolfram-fullsimplify solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0232026-10-13 17:24:42 ba9dc4def822Element[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultFullSimplify[Residual, Assum]→0
answertrue
wolfram-refine solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0222026-10-13 17:24:31 ba9dc4def822Element[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultRefine[Residual, Assum]→0
answertrue
wolfram-simplify solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0232026-10-13 17:24:17 ba9dc4def822Element[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultSimplify[Residual, Assum]→0
answertrue
Older runs (11)
systemoutcomeanswersteps (from the trace)srunquery (as sent)detail
wolfram-fullsimplify solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0242026-10-13 16:43:00 3ba0dfac4bcaElement[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultFullSimplify[Residual, Assum]→0
answertrue
wolfram-refine solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0232026-10-13 16:42:50 3ba0dfac4bcaElement[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultRefine[Residual, Assum]→0
answertrue
wolfram-simplify solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0232026-10-13 16:42:35 3ba0dfac4bcaElement[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultSimplify[Residual, Assum]→0
answertrue
sympy-simplifysolvedtruedifference → pi*log(x) - log(x**pi) · simplify → 00.0242026-10-13 16:42:18 3ba0dfac4bcaQ.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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, positive=True, zero=False)
# dropped (not a unary fact about one symbol): Or(~Q.zero(x), re(pi) > 0)
# dropped (not a unary fact about one symbol): ~Q.zero(Pow(x, pi))
Residual = log(x) * pi - log(Pow(x, pi))
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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
simplifysimplify(Residual)→0
answertrue
sympy-refineno verdictnulldifference → pi*log(x) - log(x**pi) · refine → pi*log(x) - log(x**pi)0.0412026-10-13 16:40:40 3ba0dfac4bcaQ.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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.positive(x), ~Q.zero(x), Or(~Q.zero(x), re(pi) > 0), ~Q.zero(Pow(x, pi)))
Residual = log(x) * pi - log(Pow(x, pi))
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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
refinerefine(Residual, Assum)→pi*log(x) - log(x**pi)
answernull
always-noneno verdictnull0.02026-10-13 16:39:28 3ba0dfac4bca(real x) ∧ (positive x) ∧ (nonzero x) ∧ (or (nonzero x) (> (re pi) 0)) ∧ (nonzero (pow x pi)) ⊢ (= (* (log x) pi) (log (pow x pi)))null
sympy-askno verdictnulldifference → pi*log(x) - log(x**pi) · ask → None0.1832026-10-13 16:39:28 3ba0dfac4bcaQ.real(x) ∧ Q.positive(x) ∧ (~Q.zero(x)) ∧ Or((~Q.zero(x)), (re(pi) > 0)) ∧ (~Q.zero(Pow(x, pi))) ⊢ Eq((log(x)*pi), log(Pow(x, pi)))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.positive(x), ~Q.zero(x), Or(~Q.zero(x), re(pi) > 0), ~Q.zero(Pow(x, pi)))
Residual = log(x) * pi - log(Pow(x, pi))
# 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')
differencelog(x) * pi - log(Pow(x, pi))→pi*log(x) - log(x**pi)
askQ.zero(Residual)→None
answernull
wolfram-fullsimplify solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0242026-10-12 21:55:24 ee702ae2fe06Element[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = FullSimplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultFullSimplify[Residual, Assum]→0
answertrue
wolfram-refine solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0232026-10-12 21:55:14 ee702ae2fe06Element[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = Refine[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultRefine[Residual, Assum]→0
answertrue
always-noneno verdictnull0.02026-10-12 21:55:00 ee702ae2fe06(real x) ∧ (positive x) ∧ (nonzero x) ∧ (or (nonzero x) (> (re pi) 0)) ∧ (nonzero (pow x pi)) ⊢ (= (* (log x) pi) (log (pow x pi)))null
wolfram-simplify solvedtruedifference → Pi*Log[x] - Log[x^Pi] · result → 00.0232026-10-12 21:55:00 ee702ae2fe06Element[x, Reals] ∧ (Element[x, Reals] && x > 0) ∧ (x != 0) ∧ ((x != 0) || (Re[Pi] > 0)) ∧ (Power[x, Pi] != 0) ⊢ ((Log[x]*Pi) == Log[Power[x, Pi]])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)) && (((x != 0) || (Re[Pi] > 0))) && ((Power[x, Pi] != 0));
  Residual = (Log[x]*Pi) - (Log[x^Pi]);
  Result = Simplify[Residual, Assum];
  Answer = Which[Result === 0, True, NumericQ[Result] && TrueQ[Result != 0], False, True, Null];
  {Residual, Result, Answer}
)
difference(Log[x]*Pi) - (Log[x^Pi])→Pi*Log[x] - Log[x^Pi]
resultSimplify[Residual, Assum]→0
answertrue

Source (conditional.sexp)

(case sp-acj4-56-cond (category simplipy-conditional)
  (note "SimpliPy acj-4 (MIT) rules_real.json[56]: * log _0 np.pi  ->  log pow _0 np.pi  [weakest assumption found: positive]")
  (var x real)
  (assume (positive x))
  (assume (nonzero x))
  (assume (or (nonzero x) (> (re pi) 0)))
  (assume (nonzero (pow x pi)))
  (ask (= (* (log x) pi) (log (pow x pi))))
  (expect true)
  (lean-proof "obtain ⟨r, rfl⟩ := AE.IsReal.exists hd0; have hr : 0 < r := (by simpa using h0.2); refine ⟨⟨h1.2, h3.1.1, h3.2⟩, ?_⟩; rw [AE.pi_def, AE.cond_log_pow_ofReal hr, mul_comm]"))