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

% Computer : art03.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:38:23 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(9,axiom,
    ! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
    file('/tmp/tmpv8XWZM/sel_SWV400+1.p_1',ax22) ).

fof(10,conjecture,
    ! [X1,X2,X3,X4] :
      ( ( pair_in_list(create_slb,X2,X3)
        & less_than(X4,X3) )
     => pair_in_list(update_slb(create_slb,X4),X2,X3) ),
    file('/tmp/tmpv8XWZM/sel_SWV400+1.p_1',l36_co) ).

fof(11,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( ( pair_in_list(create_slb,X2,X3)
          & less_than(X4,X3) )
       => pair_in_list(update_slb(create_slb,X4),X2,X3) ),
    inference(assume_negation,[status(cth)],[10]) ).

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

fof(41,plain,
    ! [X3,X4] : ~ pair_in_list(create_slb,X3,X4),
    inference(variable_rename,[status(thm)],[13]) ).

cnf(42,plain,
    ~ pair_in_list(create_slb,X1,X2),
    inference(split_conjunct,[status(thm)],[41]) ).

fof(43,negated_conjecture,
    ? [X1,X2,X3,X4] :
      ( pair_in_list(create_slb,X2,X3)
      & less_than(X4,X3)
      & ~ pair_in_list(update_slb(create_slb,X4),X2,X3) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(44,negated_conjecture,
    ? [X5,X6,X7,X8] :
      ( pair_in_list(create_slb,X6,X7)
      & less_than(X8,X7)
      & ~ pair_in_list(update_slb(create_slb,X8),X6,X7) ),
    inference(variable_rename,[status(thm)],[43]) ).

fof(45,negated_conjecture,
    ( pair_in_list(create_slb,esk2_0,esk3_0)
    & less_than(esk4_0,esk3_0)
    & ~ pair_in_list(update_slb(create_slb,esk4_0),esk2_0,esk3_0) ),
    inference(skolemize,[status(esa)],[44]) ).

cnf(48,negated_conjecture,
    pair_in_list(create_slb,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[45]) ).

cnf(49,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[48,42,theory(equality)]) ).

cnf(50,negated_conjecture,
    $false,
    49,
    [proof] ).

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