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

% Computer : art07.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:16:38 EST 2010

% Result   : Theorem 0.22s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   58 (  20   ~;  14   |;  15   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  17   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ! [X1] :
          ( big_r(X1)
         => big_p(X1) )
      & ! [X1] :
          ( ~ big_q(X1)
         => big_r(X1) ) )
   => ! [X1] :
        ( big_p(X1)
        | big_q(X1) ) ),
    file('/tmp/tmptN_txO/sel_SYN355+1.p_1',x2106) ).

fof(2,negated_conjecture,
    ~ ( ( ! [X1] :
            ( big_r(X1)
           => big_p(X1) )
        & ! [X1] :
            ( ~ big_q(X1)
           => big_r(X1) ) )
     => ! [X1] :
          ( big_p(X1)
          | big_q(X1) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ~ ( ( ! [X1] :
            ( big_r(X1)
           => big_p(X1) )
        & ! [X1] :
            ( ~ big_q(X1)
           => big_r(X1) ) )
     => ! [X1] :
          ( big_p(X1)
          | big_q(X1) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(4,negated_conjecture,
    ( ! [X1] :
        ( ~ big_r(X1)
        | big_p(X1) )
    & ! [X1] :
        ( big_q(X1)
        | big_r(X1) )
    & ? [X1] :
        ( ~ big_p(X1)
        & ~ big_q(X1) ) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ( ! [X2] :
        ( ~ big_r(X2)
        | big_p(X2) )
    & ! [X3] :
        ( big_q(X3)
        | big_r(X3) )
    & ? [X4] :
        ( ~ big_p(X4)
        & ~ big_q(X4) ) ),
    inference(variable_rename,[status(thm)],[4]) ).

fof(6,negated_conjecture,
    ( ! [X2] :
        ( ~ big_r(X2)
        | big_p(X2) )
    & ! [X3] :
        ( big_q(X3)
        | big_r(X3) )
    & ~ big_p(esk1_0)
    & ~ big_q(esk1_0) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X2,X3] :
      ( ( big_q(X3)
        | big_r(X3) )
      & ( ~ big_r(X2)
        | big_p(X2) )
      & ~ big_p(esk1_0)
      & ~ big_q(esk1_0) ),
    inference(shift_quantors,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    ~ big_q(esk1_0),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(9,negated_conjecture,
    ~ big_p(esk1_0),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(10,negated_conjecture,
    ( big_p(X1)
    | ~ big_r(X1) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(11,negated_conjecture,
    ( big_r(X1)
    | big_q(X1) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(12,negated_conjecture,
    ( big_p(X1)
    | big_q(X1) ),
    inference(spm,[status(thm)],[10,11,theory(equality)]) ).

cnf(13,negated_conjecture,
    big_q(esk1_0),
    inference(spm,[status(thm)],[9,12,theory(equality)]) ).

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

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

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