%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : LCL491+1 : TPTP v3.4.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May  6 13:51:30 EDT 2009

% Result   : Theorem 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (   6 unt;   0 def)
%            Number of atoms       :   18 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (   8   ~;   6   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   0 con; 2-2 aty)
%            Number of variables   :   10 (   2 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(r2,plain,
    ! [B,A] :
      ( ( ~ r2
        | is_a_theorem(implies(B,or(A,B))) )
      & ( r2
        | ~ is_a_theorem(implies(q(A,B),or(p(A,B),q(A,B)))) ) ),
    file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),
    [] ).

cnf(153238384,plain,
    ( ~ r2
    | is_a_theorem(implies(B,or(A,B))) ),
    inference(rewrite,[status(thm)],[r2]),
    [] ).

fof(principia_r2,plain,
    r2,
    file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),
    [] ).

cnf(152463472,plain,
    r2,
    inference(rewrite,[status(thm)],[principia_r2]),
    [] ).

cnf(161994032,plain,
    is_a_theorem(implies(B,or(A,B))),
    inference(resolution,[status(thm)],[153238384,152463472]),
    [] ).

fof(or_2,plain,
    ! [B,A] :
      ( ( ~ or_2
        | is_a_theorem(implies(B,or(A,B))) )
      & ( or_2
        | ~ is_a_theorem(implies(y(A,B),or(x(A,B),y(A,B)))) ) ),
    file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),
    [] ).

cnf(152834728,plain,
    ( or_2
    | ~ is_a_theorem(implies(y(A,B),or(x(A,B),y(A,B)))) ),
    inference(rewrite,[status(thm)],[or_2]),
    [] ).

fof(hilbert_or_2,plain,
    ~ or_2,
    file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),
    [] ).

cnf(153578792,plain,
    ~ or_2,
    inference(rewrite,[status(thm)],[hilbert_or_2]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[161994032,152834728,153578792]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(r2,plain,(((~r2|is_a_theorem(implies(B,or(A,B))))&(r2|~is_a_theorem(implies(q(A,B),or(p(A,B),q(A,B))))))),file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),[]).
% 
% cnf(153238384,plain,(~r2|is_a_theorem(implies(B,or(A,B)))),inference(rewrite,[status(thm)],[r2]),[]).
% 
% fof(principia_r2,plain,(r2),file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),[]).
% 
% cnf(152463472,plain,(r2),inference(rewrite,[status(thm)],[principia_r2]),[]).
% 
% cnf(161994032,plain,(is_a_theorem(implies(B,or(A,B)))),inference(resolution,[status(thm)],[153238384,152463472]),[]).
% 
% fof(or_2,plain,(((~or_2|is_a_theorem(implies(B,or(A,B))))&(or_2|~is_a_theorem(implies(y(A,B),or(x(A,B),y(A,B))))))),file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),[]).
% 
% cnf(152834728,plain,(or_2|~is_a_theorem(implies(y(A,B),or(x(A,B),y(A,B))))),inference(rewrite,[status(thm)],[or_2]),[]).
% 
% fof(hilbert_or_2,plain,(~or_2),file('/tmp/SystemOnTPTP7405/LCL491+1.p',unknown),[]).
% 
% cnf(153578792,plain,(~or_2),inference(rewrite,[status(thm)],[hilbert_or_2]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[161994032,152834728,153578792]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------