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

% Computer : art03.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:50:56 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(and_1,plain,
    ! [A,B] :
      ( ( ~ and_1
        | is_a_theorem(implies(and(A,B),A)) )
      & ( and_1
        | ~ is_a_theorem(implies(and(x(A,B),y(A,B)),x(A,B))) ) ),
    file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),
    [] ).

cnf(150619536,plain,
    ( ~ and_1
    | is_a_theorem(implies(and(A,B),A)) ),
    inference(rewrite,[status(thm)],[and_1]),
    [] ).

fof(hilbert_and_1,plain,
    and_1,
    file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),
    [] ).

cnf(151426888,plain,
    and_1,
    inference(rewrite,[status(thm)],[hilbert_and_1]),
    [] ).

cnf(159992480,plain,
    is_a_theorem(implies(and(A,B),A)),
    inference(resolution,[status(thm)],[150619536,151426888]),
    [] ).

fof(kn2,plain,
    ! [A,B] :
      ( ( ~ kn2
        | is_a_theorem(implies(and(A,B),A)) )
      & ( kn2
        | ~ is_a_theorem(implies(and(p(A,B),q(A,B)),p(A,B))) ) ),
    file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),
    [] ).

cnf(150938048,plain,
    ( kn2
    | ~ is_a_theorem(implies(and(p(A,B),q(A,B)),p(A,B))) ),
    inference(rewrite,[status(thm)],[kn2]),
    [] ).

fof(rosser_kn2,plain,
    ~ kn2,
    file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),
    [] ).

cnf(151546544,plain,
    ~ kn2,
    inference(rewrite,[status(thm)],[rosser_kn2]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[159992480,150938048,151546544]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(and_1,plain,(((~and_1|is_a_theorem(implies(and(A,B),A)))&(and_1|~is_a_theorem(implies(and(x(A,B),y(A,B)),x(A,B)))))),file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),[]).
% 
% cnf(150619536,plain,(~and_1|is_a_theorem(implies(and(A,B),A))),inference(rewrite,[status(thm)],[and_1]),[]).
% 
% fof(hilbert_and_1,plain,(and_1),file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),[]).
% 
% cnf(151426888,plain,(and_1),inference(rewrite,[status(thm)],[hilbert_and_1]),[]).
% 
% cnf(159992480,plain,(is_a_theorem(implies(and(A,B),A))),inference(resolution,[status(thm)],[150619536,151426888]),[]).
% 
% fof(kn2,plain,(((~kn2|is_a_theorem(implies(and(A,B),A)))&(kn2|~is_a_theorem(implies(and(p(A,B),q(A,B)),p(A,B)))))),file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),[]).
% 
% cnf(150938048,plain,(kn2|~is_a_theorem(implies(and(p(A,B),q(A,B)),p(A,B)))),inference(rewrite,[status(thm)],[kn2]),[]).
% 
% fof(rosser_kn2,plain,(~kn2),file('/tmp/SystemOnTPTP6066/LCL460+1.p',unknown),[]).
% 
% cnf(151546544,plain,(~kn2),inference(rewrite,[status(thm)],[rosser_kn2]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[159992480,150938048,151546544]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------