%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : LCL230+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art02.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 17:23:41 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ( p
        | q )
     => ( p
        | r ) )
   => ( p
      | ( q
       => r ) ) ),
    file('/tmp/tmpnKxRpq/sel_LCL230+1.p_1',pel5) ).

fof(2,negated_conjecture,
    ~ ( ( ( p
          | q )
       => ( p
          | r ) )
     => ( p
        | ( q
         => r ) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ( ( ( ~ p
        & ~ q )
      | p
      | r )
    & ~ p
    & q
    & ~ r ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(4,negated_conjecture,
    ( ( ~ p
      | p
      | r )
    & ( ~ q
      | p
      | r )
    & ~ p
    & q
    & ~ r ),
    inference(distribute,[status(thm)],[3]) ).

cnf(5,negated_conjecture,
    ~ r,
    inference(split_conjunct,[status(thm)],[4]) ).

cnf(6,negated_conjecture,
    q,
    inference(split_conjunct,[status(thm)],[4]) ).

cnf(7,negated_conjecture,
    ~ p,
    inference(split_conjunct,[status(thm)],[4]) ).

cnf(8,negated_conjecture,
    ( r
    | p
    | ~ q ),
    inference(split_conjunct,[status(thm)],[4]) ).

cnf(10,negated_conjecture,
    ( p
    | r
    | $false ),
    inference(rw,[status(thm)],[8,6,theory(equality)]) ).

cnf(11,negated_conjecture,
    ( p
    | r ),
    inference(cn,[status(thm)],[10,theory(equality)]) ).

cnf(12,negated_conjecture,
    r,
    inference(sr,[status(thm)],[11,7,theory(equality)]) ).

cnf(13,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[12,5,theory(equality)]) ).

cnf(14,negated_conjecture,
    $false,
    13,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL230+1.p
% --creating new selector for []
% -running prover on /tmp/tmpnKxRpq/sel_LCL230+1.p_1 with time limit 29
% -prover status Theorem
% Problem LCL230+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL230+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL230+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------