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

% Computer : art01.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 12:35:18 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(4,axiom,
    ! [X1] : ~ contains_slb(create_slb,X1),
    file('/tmp/tmpnfgO48/sel_SWV392+1.p_1',ax20) ).

fof(7,conjecture,
    ! [X1,X2] :
      ( pair_in_list(create_slb,X1,X2)
     => ! [X3] :
          ( contains_slb(create_slb,X3)
         => ( pair_in_list(remove_slb(create_slb,X3),X1,X2)
            | X1 = X3 ) ) ),
    file('/tmp/tmpnfgO48/sel_SWV392+1.p_1',l28_co) ).

fof(8,negated_conjecture,
    ~ ! [X1,X2] :
        ( pair_in_list(create_slb,X1,X2)
       => ! [X3] :
            ( contains_slb(create_slb,X3)
           => ( pair_in_list(remove_slb(create_slb,X3),X1,X2)
              | X1 = X3 ) ) ),
    inference(assume_negation,[status(cth)],[7]) ).

fof(9,plain,
    ! [X1] : ~ contains_slb(create_slb,X1),
    inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).

fof(22,plain,
    ! [X2] : ~ contains_slb(create_slb,X2),
    inference(variable_rename,[status(thm)],[9]) ).

cnf(23,plain,
    ~ contains_slb(create_slb,X1),
    inference(split_conjunct,[status(thm)],[22]) ).

fof(33,negated_conjecture,
    ? [X1,X2] :
      ( pair_in_list(create_slb,X1,X2)
      & ? [X3] :
          ( contains_slb(create_slb,X3)
          & ~ pair_in_list(remove_slb(create_slb,X3),X1,X2)
          & X1 != X3 ) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(34,negated_conjecture,
    ? [X4,X5] :
      ( pair_in_list(create_slb,X4,X5)
      & ? [X6] :
          ( contains_slb(create_slb,X6)
          & ~ pair_in_list(remove_slb(create_slb,X6),X4,X5)
          & X4 != X6 ) ),
    inference(variable_rename,[status(thm)],[33]) ).

fof(35,negated_conjecture,
    ( pair_in_list(create_slb,esk1_0,esk2_0)
    & contains_slb(create_slb,esk3_0)
    & ~ pair_in_list(remove_slb(create_slb,esk3_0),esk1_0,esk2_0)
    & esk1_0 != esk3_0 ),
    inference(skolemize,[status(esa)],[34]) ).

cnf(38,negated_conjecture,
    contains_slb(create_slb,esk3_0),
    inference(split_conjunct,[status(thm)],[35]) ).

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

cnf(41,negated_conjecture,
    $false,
    40,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV392+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax]
% -running prover on /tmp/tmpnfgO48/sel_SWV392+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV392+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV392+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV392+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
% 
%------------------------------------------------------------------------------