%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : LCL648+1.001 : TPTP v5.0.0. Released v4.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 : Sat Dec 25 19:05:15 EST 2010

% Result   : Theorem 0.23s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   81 (  41   ~;  22   |;  18   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   18 (   0 sgn  10   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( p201(X2)
                    & p101(X2) ) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | ~ ( p201(X2)
                  & p101(X2) ) ) ),
    file('/tmp/tmpCY6FFa/sel_LCL648+1.001.p_1',main) ).

fof(2,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( p201(X2)
                      & p101(X2) ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( p201(X2)
                    & p101(X2) ) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( p201(X2)
                      & p101(X2) ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( p201(X2)
                    & p101(X2) ) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(4,negated_conjecture,
    ? [X1] :
      ( ! [X2] :
          ( ~ r1(X1,X2)
          | ~ p201(X2)
          | ~ p101(X2) )
      & ? [X2] :
          ( r1(X1,X2)
          & p201(X2)
          & p101(X2) ) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ? [X3] :
      ( ! [X4] :
          ( ~ r1(X3,X4)
          | ~ p201(X4)
          | ~ p101(X4) )
      & ? [X5] :
          ( r1(X3,X5)
          & p201(X5)
          & p101(X5) ) ),
    inference(variable_rename,[status(thm)],[4]) ).

fof(6,negated_conjecture,
    ( ! [X4] :
        ( ~ r1(esk1_0,X4)
        | ~ p201(X4)
        | ~ p101(X4) )
    & r1(esk1_0,esk2_0)
    & p201(esk2_0)
    & p101(esk2_0) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X4] :
      ( ( ~ r1(esk1_0,X4)
        | ~ p201(X4)
        | ~ p101(X4) )
      & r1(esk1_0,esk2_0)
      & p201(esk2_0)
      & p101(esk2_0) ),
    inference(shift_quantors,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    p101(esk2_0),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(9,negated_conjecture,
    p201(esk2_0),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(10,negated_conjecture,
    r1(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(11,negated_conjecture,
    ( ~ p101(X1)
    | ~ p201(X1)
    | ~ r1(esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(12,negated_conjecture,
    ( ~ p101(esk2_0)
    | ~ p201(esk2_0) ),
    inference(spm,[status(thm)],[11,10,theory(equality)]) ).

cnf(13,negated_conjecture,
    ( $false
    | ~ p201(esk2_0) ),
    inference(rw,[status(thm)],[12,8,theory(equality)]) ).

cnf(14,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[13,9,theory(equality)]) ).

cnf(15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[14,theory(equality)]) ).

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

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