An often neglected, but nonetheless central feature of reasoning processes is their goal-directedness. Hence, it is not only important to understand which steps can be made at a certain stage in the reasoning process, but also which of these are relevant in view of the intended goal. As logical proofs are in a sense an attempt to formalize deductive reasoning processes, we are compelled to implement the goal-directedness of these processes in a way it will be efficiently performed within the construction of proofs. For that, we will present a proof format that is particularly suitable for this purpose. It also easily lends itself to the construction of efficient proofs - i.e. proofs in which only sensible search paths are tried out. For decidable fragments of CL it even constitutes a decision method more efficient than tableau-methods because of its goal-directed character. The latter is generated by the exclusive application of analysing rules and a format that clearly reveals the different search paths one should follow to obtain short and strong goal-directed proofs. A clear-cut heuristics guarantees the generation of efficient proofs. These specific features originate from the dynamic proofs of adaptive logics, in which a condition is attached to some derived formulas. This time, however, the condition has a positive connotation as it indicates that a certain formula is derivable from a set of premises whenever some other formulas are also derivable from them. First of all, this conditional proof format allows for the introduction of the goal into the proof. Secondly, it allows for the conditional analysis of formulas with an implication or disjunction as central logical constant.