%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV410+1 : TPTP v5.0.0. Released v3.3.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 12:39:57 EST 2010

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

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

fof(5,conjecture,
    ! [X1] :
      ( contains_slb(create_slb,X1)
     => ? [X2] : pair_in_list(create_slb,X1,X2) ),
    file('/tmp/tmpM53QeR/sel_SWV410+1.p_1',l46_co) ).

fof(6,negated_conjecture,
    ~ ! [X1] :
        ( contains_slb(create_slb,X1)
       => ? [X2] : pair_in_list(create_slb,X1,X2) ),
    inference(assume_negation,[status(cth)],[5]) ).

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

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

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

fof(26,negated_conjecture,
    ? [X1] :
      ( contains_slb(create_slb,X1)
      & ! [X2] : ~ pair_in_list(create_slb,X1,X2) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(27,negated_conjecture,
    ? [X3] :
      ( contains_slb(create_slb,X3)
      & ! [X4] : ~ pair_in_list(create_slb,X3,X4) ),
    inference(variable_rename,[status(thm)],[26]) ).

fof(28,negated_conjecture,
    ( contains_slb(create_slb,esk1_0)
    & ! [X4] : ~ pair_in_list(create_slb,esk1_0,X4) ),
    inference(skolemize,[status(esa)],[27]) ).

fof(29,negated_conjecture,
    ! [X4] :
      ( ~ pair_in_list(create_slb,esk1_0,X4)
      & contains_slb(create_slb,esk1_0) ),
    inference(shift_quantors,[status(thm)],[28]) ).

cnf(30,negated_conjecture,
    contains_slb(create_slb,esk1_0),
    inference(split_conjunct,[status(thm)],[29]) ).

cnf(32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[30,16,theory(equality)]) ).

cnf(33,negated_conjecture,
    $false,
    32,
    [proof] ).

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