%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN356+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:16:43 EST 2010

% Result   : Theorem 0.20s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   20 (   9 unt;   0 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   73 (  25   ~;  18   |;  24   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   30 (   1 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( big_r(a,b)
      & ! [X1,X2] :
          ( big_r(X1,X2)
         => ( big_r(X2,X1)
            & big_q(X1,X2) ) )
      & ! [X3,X4] :
          ( big_q(X3,X4)
         => big_q(X3,X3) ) )
   => ( big_q(a,a)
      & big_q(b,b) ) ),
    file('/tmp/tmp1yxOPG/sel_SYN356+1.p_1',x2107) ).

fof(2,negated_conjecture,
    ~ ( ( big_r(a,b)
        & ! [X1,X2] :
            ( big_r(X1,X2)
           => ( big_r(X2,X1)
              & big_q(X1,X2) ) )
        & ! [X3,X4] :
            ( big_q(X3,X4)
           => big_q(X3,X3) ) )
     => ( big_q(a,a)
        & big_q(b,b) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ( big_r(a,b)
    & ! [X1,X2] :
        ( ~ big_r(X1,X2)
        | ( big_r(X2,X1)
          & big_q(X1,X2) ) )
    & ! [X3,X4] :
        ( ~ big_q(X3,X4)
        | big_q(X3,X3) )
    & ( ~ big_q(a,a)
      | ~ big_q(b,b) ) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(4,negated_conjecture,
    ( big_r(a,b)
    & ! [X5,X6] :
        ( ~ big_r(X5,X6)
        | ( big_r(X6,X5)
          & big_q(X5,X6) ) )
    & ! [X7,X8] :
        ( ~ big_q(X7,X8)
        | big_q(X7,X7) )
    & ( ~ big_q(a,a)
      | ~ big_q(b,b) ) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( ( ~ big_q(X7,X8)
        | big_q(X7,X7) )
      & ( ~ big_r(X5,X6)
        | ( big_r(X6,X5)
          & big_q(X5,X6) ) )
      & big_r(a,b)
      & ( ~ big_q(a,a)
        | ~ big_q(b,b) ) ),
    inference(shift_quantors,[status(thm)],[4]) ).

fof(6,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( ( ~ big_q(X7,X8)
        | big_q(X7,X7) )
      & ( big_r(X6,X5)
        | ~ big_r(X5,X6) )
      & ( big_q(X5,X6)
        | ~ big_r(X5,X6) )
      & big_r(a,b)
      & ( ~ big_q(a,a)
        | ~ big_q(b,b) ) ),
    inference(distribute,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    ( ~ big_q(b,b)
    | ~ big_q(a,a) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    big_r(a,b),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(9,negated_conjecture,
    ( big_q(X1,X2)
    | ~ big_r(X1,X2) ),
    inference(split_conjunct,[status(thm)],[6]) ).

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

cnf(11,negated_conjecture,
    ( big_q(X1,X1)
    | ~ big_q(X1,X2) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(12,negated_conjecture,
    big_r(b,a),
    inference(spm,[status(thm)],[10,8,theory(equality)]) ).

cnf(13,negated_conjecture,
    big_q(a,b),
    inference(spm,[status(thm)],[9,8,theory(equality)]) ).

cnf(15,negated_conjecture,
    big_q(b,a),
    inference(spm,[status(thm)],[9,12,theory(equality)]) ).

cnf(17,negated_conjecture,
    big_q(a,a),
    inference(spm,[status(thm)],[11,13,theory(equality)]) ).

cnf(18,negated_conjecture,
    big_q(b,b),
    inference(spm,[status(thm)],[11,15,theory(equality)]) ).

cnf(20,negated_conjecture,
    ( $false
    | ~ big_q(b,b) ),
    inference(rw,[status(thm)],[7,17,theory(equality)]) ).

cnf(21,negated_conjecture,
    ~ big_q(b,b),
    inference(cn,[status(thm)],[20,theory(equality)]) ).

cnf(23,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[18,21,theory(equality)]) ).

cnf(24,negated_conjecture,
    $false,
    23,
    [proof] ).

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