%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN054+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:10:39 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (   5 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   60 (  27   ~;  24   |;   6   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   26 (   1 sgn  11   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] :
      ( big_p(X1)
      & big_r(X1) ),
    file('/tmp/tmpAW3sBp/sel_SYN054+1.p_1',pel24) ).

fof(2,axiom,
    ! [X1] :
      ( ( big_q(X1)
        | big_r(X1) )
     => big_s(X1) ),
    file('/tmp/tmpAW3sBp/sel_SYN054+1.p_1',pel24_4) ).

fof(3,axiom,
    ( ~ ? [X1] : big_p(X1)
   => ? [X2] : big_q(X2) ),
    file('/tmp/tmpAW3sBp/sel_SYN054+1.p_1',pel24_3) ).

fof(4,axiom,
    ! [X1] :
      ( big_p(X1)
     => ( big_q(X1)
        | big_r(X1) ) ),
    file('/tmp/tmpAW3sBp/sel_SYN054+1.p_1',pel24_2) ).

fof(5,axiom,
    ~ ? [X1] :
        ( big_s(X1)
        & big_q(X1) ),
    file('/tmp/tmpAW3sBp/sel_SYN054+1.p_1',pel24_1) ).

fof(6,negated_conjecture,
    ~ ? [X1] :
        ( big_p(X1)
        & big_r(X1) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(7,negated_conjecture,
    ! [X1] :
      ( ~ big_p(X1)
      | ~ big_r(X1) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(8,negated_conjecture,
    ! [X2] :
      ( ~ big_p(X2)
      | ~ big_r(X2) ),
    inference(variable_rename,[status(thm)],[7]) ).

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

fof(10,plain,
    ! [X1] :
      ( ( ~ big_q(X1)
        & ~ big_r(X1) )
      | big_s(X1) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(11,plain,
    ! [X2] :
      ( ( ~ big_q(X2)
        & ~ big_r(X2) )
      | big_s(X2) ),
    inference(variable_rename,[status(thm)],[10]) ).

fof(12,plain,
    ! [X2] :
      ( ( ~ big_q(X2)
        | big_s(X2) )
      & ( ~ big_r(X2)
        | big_s(X2) ) ),
    inference(distribute,[status(thm)],[11]) ).

cnf(14,plain,
    ( big_s(X1)
    | ~ big_q(X1) ),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(15,plain,
    ( ? [X1] : big_p(X1)
    | ? [X2] : big_q(X2) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(16,plain,
    ( ? [X3] : big_p(X3)
    | ? [X4] : big_q(X4) ),
    inference(variable_rename,[status(thm)],[15]) ).

fof(17,plain,
    ( big_p(esk1_0)
    | big_q(esk2_0) ),
    inference(skolemize,[status(esa)],[16]) ).

cnf(18,plain,
    ( big_q(esk2_0)
    | big_p(esk1_0) ),
    inference(split_conjunct,[status(thm)],[17]) ).

fof(19,plain,
    ! [X1] :
      ( ~ big_p(X1)
      | big_q(X1)
      | big_r(X1) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(20,plain,
    ! [X2] :
      ( ~ big_p(X2)
      | big_q(X2)
      | big_r(X2) ),
    inference(variable_rename,[status(thm)],[19]) ).

cnf(21,plain,
    ( big_r(X1)
    | big_q(X1)
    | ~ big_p(X1) ),
    inference(split_conjunct,[status(thm)],[20]) ).

fof(22,plain,
    ! [X1] :
      ( ~ big_s(X1)
      | ~ big_q(X1) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(23,plain,
    ! [X2] :
      ( ~ big_s(X2)
      | ~ big_q(X2) ),
    inference(variable_rename,[status(thm)],[22]) ).

cnf(24,plain,
    ( ~ big_q(X1)
    | ~ big_s(X1) ),
    inference(split_conjunct,[status(thm)],[23]) ).

cnf(25,plain,
    ( big_q(X1)
    | ~ big_p(X1) ),
    inference(csr,[status(thm)],[21,9]) ).

cnf(27,plain,
    ~ big_q(X1),
    inference(csr,[status(thm)],[24,14]) ).

cnf(28,plain,
    big_p(esk1_0),
    inference(sr,[status(thm)],[18,27,theory(equality)]) ).

cnf(29,plain,
    big_q(esk1_0),
    inference(spm,[status(thm)],[25,28,theory(equality)]) ).

cnf(30,plain,
    $false,
    inference(sr,[status(thm)],[29,27,theory(equality)]) ).

cnf(31,plain,
    $false,
    30,
    [proof] ).

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