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

% Computer : art06.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:43 EST 2010

% Result   : Theorem 0.16s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   27 (   7 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   45 (  16   ~;  20   |;   4   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 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,axiom,
    ( r
   => ( p
      & q ) ),
    file('/tmp/tmpGWNVww/sel_SYN044+1.p_1',pel10_2) ).

fof(2,axiom,
    ( p
   => ( q
      | r ) ),
    file('/tmp/tmpGWNVww/sel_SYN044+1.p_1',pel10_3) ).

fof(3,axiom,
    ( q
   => r ),
    file('/tmp/tmpGWNVww/sel_SYN044+1.p_1',pel10_1) ).

fof(4,conjecture,
    ( p
  <=> q ),
    file('/tmp/tmpGWNVww/sel_SYN044+1.p_1',pel10) ).

fof(5,negated_conjecture,
    ~ ( p
    <=> q ),
    inference(assume_negation,[status(cth)],[4]) ).

fof(6,plain,
    ( ~ r
    | ( p
      & q ) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(7,plain,
    ( ( p
      | ~ r )
    & ( q
      | ~ r ) ),
    inference(distribute,[status(thm)],[6]) ).

cnf(8,plain,
    ( q
    | ~ r ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(9,plain,
    ( p
    | ~ r ),
    inference(split_conjunct,[status(thm)],[7]) ).

fof(10,plain,
    ( ~ p
    | q
    | r ),
    inference(fof_nnf,[status(thm)],[2]) ).

cnf(11,plain,
    ( r
    | q
    | ~ p ),
    inference(split_conjunct,[status(thm)],[10]) ).

fof(12,plain,
    ( ~ q
    | r ),
    inference(fof_nnf,[status(thm)],[3]) ).

cnf(13,plain,
    ( r
    | ~ q ),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(14,negated_conjecture,
    ( ( ~ p
      | ~ q )
    & ( p
      | q ) ),
    inference(fof_nnf,[status(thm)],[5]) ).

cnf(15,negated_conjecture,
    ( q
    | p ),
    inference(split_conjunct,[status(thm)],[14]) ).

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

cnf(20,plain,
    ( q
    | r ),
    inference(csr,[status(thm)],[11,15]) ).

cnf(21,plain,
    r,
    inference(csr,[status(thm)],[20,13]) ).

cnf(22,plain,
    ( q
    | $false ),
    inference(rw,[status(thm)],[8,21,theory(equality)]) ).

cnf(23,plain,
    q,
    inference(cn,[status(thm)],[22,theory(equality)]) ).

cnf(24,plain,
    ( p
    | $false ),
    inference(rw,[status(thm)],[9,21,theory(equality)]) ).

cnf(25,plain,
    p,
    inference(cn,[status(thm)],[24,theory(equality)]) ).

cnf(27,negated_conjecture,
    ( $false
    | ~ p ),
    inference(rw,[status(thm)],[16,23,theory(equality)]) ).

cnf(28,negated_conjecture,
    ~ p,
    inference(cn,[status(thm)],[27,theory(equality)]) ).

cnf(30,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[28,25,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/SYN044+1.p
% --creating new selector for []
% -running prover on /tmp/tmpGWNVww/sel_SYN044+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN044+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN044+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN044+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
% 
%------------------------------------------------------------------------------