Axioms for not and or are split into separate labels. Combine them into packages Not and Or using + and use the | Label syntax in a proof to direct substitution search. Prove that or(not(true),not(false)) evaluates to true.
Hint
Create packages: Not:+(NF,NT); and Or:+(OF,OT);. Then use <or(<not(true)|Not>,<not(false)|Not>)|Or> to search in specific packages.