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

% Computer : art09.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 11:50:00 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(22,axiom,
    true,
    file('/tmp/tmpRbO5Ao/sel_SWV023+1.p_1',ttrue) ).

fof(55,conjecture,
    ( ( i0_init = init
      & sigma_init = init
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n2) )
         => ! [X5] :
              ( ( leq(n0,X5)
                & leq(X5,n3) )
             => a_select3(simplex7_init,X5,X4) = init ) )
      & ! [X6] :
          ( ( leq(n0,X6)
            & leq(X6,n3) )
         => a_select2(s_values7_init,X6) = init ) )
   => true ),
    file('/tmp/tmpRbO5Ao/sel_SWV023+1.p_1',gauss_init_0005) ).

fof(58,negated_conjecture,
    ~ ( ( i0_init = init
        & sigma_init = init
        & ! [X4] :
            ( ( leq(n0,X4)
              & leq(X4,n2) )
           => ! [X5] :
                ( ( leq(n0,X5)
                  & leq(X5,n3) )
               => a_select3(simplex7_init,X5,X4) = init ) )
        & ! [X6] :
            ( ( leq(n0,X6)
              & leq(X6,n3) )
           => a_select2(s_values7_init,X6) = init ) )
     => true ),
    inference(assume_negation,[status(cth)],[55]) ).

cnf(109,plain,
    true,
    inference(split_conjunct,[status(thm)],[22]) ).

fof(158,negated_conjecture,
    ( i0_init = init
    & sigma_init = init
    & ! [X4] :
        ( ~ leq(n0,X4)
        | ~ leq(X4,n2)
        | ! [X5] :
            ( ~ leq(n0,X5)
            | ~ leq(X5,n3)
            | a_select3(simplex7_init,X5,X4) = init ) )
    & ! [X6] :
        ( ~ leq(n0,X6)
        | ~ leq(X6,n3)
        | a_select2(s_values7_init,X6) = init )
    & ~ true ),
    inference(fof_nnf,[status(thm)],[58]) ).

fof(159,negated_conjecture,
    ( i0_init = init
    & sigma_init = init
    & ! [X7] :
        ( ~ leq(n0,X7)
        | ~ leq(X7,n2)
        | ! [X8] :
            ( ~ leq(n0,X8)
            | ~ leq(X8,n3)
            | a_select3(simplex7_init,X8,X7) = init ) )
    & ! [X9] :
        ( ~ leq(n0,X9)
        | ~ leq(X9,n3)
        | a_select2(s_values7_init,X9) = init )
    & ~ true ),
    inference(variable_rename,[status(thm)],[158]) ).

fof(160,negated_conjecture,
    ! [X7,X8,X9] :
      ( ( ~ leq(n0,X9)
        | ~ leq(X9,n3)
        | a_select2(s_values7_init,X9) = init )
      & ( ~ leq(n0,X8)
        | ~ leq(X8,n3)
        | a_select3(simplex7_init,X8,X7) = init
        | ~ leq(n0,X7)
        | ~ leq(X7,n2) )
      & i0_init = init
      & sigma_init = init
      & ~ true ),
    inference(shift_quantors,[status(thm)],[159]) ).

cnf(161,negated_conjecture,
    ~ true,
    inference(split_conjunct,[status(thm)],[160]) ).

cnf(190,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[161,109,theory(equality)]) ).

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

cnf(192,negated_conjecture,
    $false,
    191,
    [proof] ).

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