%------------------------------------------------------------------------------
% File     : mult2 : JProver test formulae (2000)
% Domain   : Syntactic
% Problem  : 
% Version  : Especial.
%            Problem formulation : Intuit. Valid  Size 2
% English  : 

% Refs     : [SN00]  S. Schmitt & A. Nogin: test module "jprover_tests.ml",
%                    test formulas for JProver in MetaPRL, at
%                    http://cvs.metaprl.org:12000/cvsweb/metaprl/theories/
%                         itt/jprover_tests.ml
% Source   : [SN00]
% Names    : 

% Status   : Theorem
% Rating   : 0.00 v 1.0
% Syntax   : Number of formulae    :    1 (   0 unit)
%            Number of atoms       :    2 (   0 equality)
%            Maximal formula depth :    5 (   5 average)
%            Number of connectives :    4 (   3 ~  ;   1  |;   0  &)
%                                         (   0 <=>;   0 =>;   0 <=)
%                                         (   0 <~>;   0 ~|;   0 ~&)
%            Number of predicates  :    1 (   1 propositional; 0-0 arity)
%            Number of functors    :    0 (   0 constant; --- arity)
%            Number of variables   :    0 (   0 singleton;   0 !;   0 ?)
%            Maximal term depth    :    0 (   0 average)

% Comments : Generating muliply used subformulae, i.e. the negation-left 
%            subformula has to be used <size> times in a proof
%          : tptp2X -f ljt sch_mult.002.p 
%------------------------------------------------------------------------------

f((

% conjecture_name, conjecture.
(( ~ ( ~ ( a v ( ~ a ) ) ) ))

)).

%------------------------------------------------------------------------------