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

% Computer : art01.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:45:16 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
    ~ theorem(or(not(not(p)),or(not(p),q))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),
    [] ).

cnf(156009728,plain,
    ~ theorem(or(not(not(p)),or(not(p),q))),
    inference(rewrite,[status(thm)],[prove_this]),
    [] ).

fof(rule_3,plain,
    ! [A,B,C] :
      ( theorem(or(not(A),B))
      | ~ axiom(or(not(A),C))
      | ~ theorem(or(not(C),B)) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),
    [] ).

cnf(156005296,plain,
    ( theorem(or(not(A),B))
    | ~ axiom(or(not(A),C))
    | ~ theorem(or(not(C),B)) ),
    inference(rewrite,[status(thm)],[rule_3]),
    [] ).

fof(axiom_1_3,plain,
    ! [A,B] : axiom(or(not(A),or(B,A))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),
    [] ).

cnf(155945984,plain,
    axiom(or(not(A),or(B,A))),
    inference(rewrite,[status(thm)],[axiom_1_3]),
    [] ).

cnf(163849576,plain,
    ( theorem(or(not(A),B))
    | ~ theorem(or(not(or(C,A)),B)) ),
    inference(resolution,[status(thm)],[156005296,155945984]),
    [] ).

fof(rule_1,plain,
    ! [A] :
      ( theorem(A)
      | ~ axiom(A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),
    [] ).

cnf(155968248,plain,
    ( theorem(A)
    | ~ axiom(A) ),
    inference(rewrite,[status(thm)],[rule_1]),
    [] ).

fof(axiom_1_4,plain,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),
    [] ).

cnf(155949824,plain,
    axiom(or(not(or(A,B)),or(B,A))),
    inference(rewrite,[status(thm)],[axiom_1_4]),
    [] ).

cnf(163985584,plain,
    theorem(or(not(or(A,B)),or(B,A))),
    inference(resolution,[status(thm)],[155968248,155949824]),
    [] ).

cnf(179427592,plain,
    theorem(or(not(A),or(A,B))),
    inference(resolution,[status(thm)],[163849576,163985584]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[156009728,179427592]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(not(p)),or(not(p),q)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),[]).
% 
% cnf(156009728,plain,(~theorem(or(not(not(p)),or(not(p),q)))),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% fof(rule_3,plain,(theorem(or(not(A),B))|~axiom(or(not(A),C))|~theorem(or(not(C),B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),[]).
% 
% cnf(156005296,plain,(theorem(or(not(A),B))|~axiom(or(not(A),C))|~theorem(or(not(C),B))),inference(rewrite,[status(thm)],[rule_3]),[]).
% 
% fof(axiom_1_3,plain,(axiom(or(not(A),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),[]).
% 
% cnf(155945984,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
% 
% cnf(163849576,plain,(theorem(or(not(A),B))|~theorem(or(not(or(C,A)),B))),inference(resolution,[status(thm)],[156005296,155945984]),[]).
% 
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),[]).
% 
% cnf(155968248,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
% 
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL186-1.tptp',unknown),[]).
% 
% cnf(155949824,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
% 
% cnf(163985584,plain,(theorem(or(not(or(A,B)),or(B,A)))),inference(resolution,[status(thm)],[155968248,155949824]),[]).
% 
% cnf(179427592,plain,(theorem(or(not(A),or(A,B)))),inference(resolution,[status(thm)],[163849576,163985584]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[156009728,179427592]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------