Method cleanExpansionResult

src/compute-engine/rubi/driver.ts:752–769

Clean the exponential-fallback antiderivative: collect like terms via a * bounded simplify (the raw expansion repeats `c·x` once per exponential * term, which otherwise bloats high-degree results past the verifier's leaf * cap), then fold the stray `ln(e)` the Chapter-2 rules leave. The val

(F: Expression)

      // of inert `Integrate(term)` placeholders, each patched by its term's own
      // recorded steps as the recursion below fills them in.
      this.record(
        entryNode,
        () =>
          ce.function(
            'Add',
            tcs.map((tc) => inert(tc))
          ),
        'integrate.sum'
      );
      return ce.function(
        'Add',
        tcs.map((tc) => recurse(tc) ?? inert(tc))
      );
    }
    // ∫ c·u dx = c·∫u dx
    if (integrand.operator === 'Multiply' && integrand.ops) {
      const free = integrand.ops.filter((o) => !o.has(variable));
      if (free.length > 0) {
        const rest = integrand.ops.filter((o) => o.has(variable));
        const c = recanonicalize(
          ce,