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

% Computer : art09.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:55 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :  203 (   0 equ)
%            Maximal formula atoms :  114 (  10 avg)
%            Number of connectives :  275 (  92   ~; 129   |;  45   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   37 (   6 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    5 (   4 usr;   5 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 ) )
     => s )
  <=> ( ( ~ p
        | q
        | s )
      & ( ~ p
        | ~ r
        | s ) ) ),
    file('/tmp/tmp3Zjcix/sel_SYN047+1.p_1',pel17) ).

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

fof(3,negated_conjecture,
    ~ ( ( ( p
          & ( q
           => r ) )
       => s )
    <=> ( ( ~ p
          | q
          | s )
        & ( ~ p
          | ~ r
          | s ) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

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

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

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

cnf(9,negated_conjecture,
    ( s
    | q
    | s
    | q
    | ~ p
    | ~ p ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(10,negated_conjecture,
    ( ~ s
    | ~ s
    | ~ s ),
    inference(split_conjunct,[status(thm)],[5]) ).

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

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

cnf(51,negated_conjecture,
    ( q
    | s
    | $false ),
    inference(rw,[status(thm)],[9,36,theory(equality)]) ).

cnf(52,negated_conjecture,
    ( q
    | s ),
    inference(cn,[status(thm)],[51,theory(equality)]) ).

cnf(53,negated_conjecture,
    q,
    inference(sr,[status(thm)],[52,10,theory(equality)]) ).

cnf(54,negated_conjecture,
    ( r
    | $false ),
    inference(rw,[status(thm)],[23,53,theory(equality)]) ).

cnf(55,negated_conjecture,
    r,
    inference(cn,[status(thm)],[54,theory(equality)]) ).

cnf(70,negated_conjecture,
    ( s
    | $false
    | ~ r ),
    inference(rw,[status(thm)],[6,36,theory(equality)]) ).

cnf(71,negated_conjecture,
    ( s
    | ~ r ),
    inference(cn,[status(thm)],[70,theory(equality)]) ).

cnf(72,negated_conjecture,
    ~ r,
    inference(sr,[status(thm)],[71,10,theory(equality)]) ).

cnf(85,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[55,72,theory(equality)]) ).

cnf(86,negated_conjecture,
    $false,
    85,
    [proof] ).

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