%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN045+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 : Sun Dec 26 13:09:47 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :   44 (   6 avg)
%            Number of connectives :  125 (  44   ~;  58   |;  21   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 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
        & r ) )
  <=> ( ( p
        | q )
      & ( p
        | r ) ) ),
    file('/tmp/tmpdJCZmJ/sel_SYN045+1.p_1',pel13) ).

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

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

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

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

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

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

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

cnf(17,negated_conjecture,
    q,
    inference(sr,[status(thm)],[8,16,theory(equality)]) ).

cnf(18,negated_conjecture,
    r,
    inference(sr,[status(thm)],[5,16,theory(equality)]) ).

cnf(29,negated_conjecture,
    ( $false
    | ~ r ),
    inference(rw,[status(thm)],[9,17,theory(equality)]) ).

cnf(30,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[29,18,theory(equality)]) ).

cnf(31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[30,theory(equality)]) ).

cnf(32,negated_conjecture,
    $false,
    31,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN045+1.p
% --creating new selector for []
% -running prover on /tmp/tmpdJCZmJ/sel_SYN045+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN045+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN045+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN045+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
% 
%------------------------------------------------------------------------------