For questions requiring inference, the focus of this paper,
an explanation is sometimes taken as the chain of steps (typically sentences)
leading to an answer.
Because of the difficulty of generating detailed decomposition steps, existing datasets typically include
one or more simplifications that ultimately limit their utility (see Table REF  for a comparison).
For example, HotpotQA's support task goes partway towards this goal
by asking for answer-supporting sentences [1]}
or triples (in the derivative R4C dataset [2]}),
but neither dataset describes how these sentences combine to arrive at the answer. Similarly, WorldTree V2 [3]} contains supporting sentences but no
information about how they combine. More recently, StrategyQA goes further by including derivations for its answers, but using deductive steps and at a coarse granularity [4]}.
Similarly, eQASC [5]} includes reasoning annotations but limited to a single entailment step. In this
work we generalize to tasks requiring multi-step entailment trees. Table REF  illustrating these comparisons in more detail.
