%------------------------------------------------------------------------------
% File     : jens_prop : JProver test formulae (2000)
% Domain   : Syntactic
% Problem  : 
% Version  : Especial.
% 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
%            [OK96] J. Otten und C. Kreitz. A uniform proof procedure
%                   for classical and non-classical logics. In KI-96: 
%                   Advances in Artificial Intelligence, LNAI 1137, 
%                   p. 307-319, Springer Verlag, 1996.
% Source   : [SN00]
% Names    : 

% Status   : Theorem
% Rating   : 0.00 v 1.0
% Syntax   : Number of formulae    :    3 (   1 unit)
%            Number of atoms       :   11 (   0 equality)
%            Maximal formula depth :    5 (   3 average)
%            Number of connectives :   12 (   4 ~  ;   0  |;   3  &)
%                                         (   0 <=>;   5 =>;   0 <=)
%                                         (   0 <~>;   0 ~|;   0 ~&)
%            Number of predicates  :    5 (   5 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 : 
%          : tptp2X -f ljt sch_jens_prop.p 
%------------------------------------------------------------------------------

f((

% axiom1, axiom.
(s)

 & 

% axiom2, axiom.
(( ( ~ ( t -> r ) ) -> p ))

  ->

% conjecture_name, conjecture.
(( ( ~ ( ( p -> q ) & ( t -> r ) ) ) -> ( ( ~ ( ~ p ) ) & ( s & s ) ) ))

)).

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