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

% Computer : art02.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:29:21 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(15,axiom,
    equalelemsP(nil),
    file('/tmp/tmp0-7z1_/sel_SWC328+1.p_1',ax74) ).

fof(25,axiom,
    ! [X1] :
      ( ssList(X1)
     => segmentP(X1,nil) ),
    file('/tmp/tmp0-7z1_/sel_SWC328+1.p_1',ax57) ).

fof(27,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( nil != X3
                    | X2 != X4
                    | X1 != X3
                    | ( segmentP(X2,X1)
                      & equalelemsP(X1) ) ) ) ) ) ),
    file('/tmp/tmp0-7z1_/sel_SWC328+1.p_1',co1) ).

fof(28,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( nil != X3
                      | X2 != X4
                      | X1 != X3
                      | ( segmentP(X2,X1)
                        & equalelemsP(X1) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[27]) ).

cnf(97,plain,
    equalelemsP(nil),
    inference(split_conjunct,[status(thm)],[15]) ).

fof(130,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | segmentP(X1,nil) ),
    inference(fof_nnf,[status(thm)],[25]) ).

fof(131,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | segmentP(X2,nil) ),
    inference(variable_rename,[status(thm)],[130]) ).

cnf(132,plain,
    ( segmentP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[131]) ).

fof(145,negated_conjecture,
    ? [X1] :
      ( ssList(X1)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & ? [X4] :
                  ( ssList(X4)
                  & nil = X3
                  & X2 = X4
                  & X1 = X3
                  & ( ~ segmentP(X2,X1)
                    | ~ equalelemsP(X1) ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[28]) ).

fof(146,negated_conjecture,
    ? [X5] :
      ( ssList(X5)
      & ? [X6] :
          ( ssList(X6)
          & ? [X7] :
              ( ssList(X7)
              & ? [X8] :
                  ( ssList(X8)
                  & nil = X7
                  & X6 = X8
                  & X5 = X7
                  & ( ~ segmentP(X6,X5)
                    | ~ equalelemsP(X5) ) ) ) ) ),
    inference(variable_rename,[status(thm)],[145]) ).

fof(147,negated_conjecture,
    ( ssList(esk11_0)
    & ssList(esk12_0)
    & ssList(esk13_0)
    & ssList(esk14_0)
    & nil = esk13_0
    & esk12_0 = esk14_0
    & esk11_0 = esk13_0
    & ( ~ segmentP(esk12_0,esk11_0)
      | ~ equalelemsP(esk11_0) ) ),
    inference(skolemize,[status(esa)],[146]) ).

cnf(148,negated_conjecture,
    ( ~ equalelemsP(esk11_0)
    | ~ segmentP(esk12_0,esk11_0) ),
    inference(split_conjunct,[status(thm)],[147]) ).

cnf(149,negated_conjecture,
    esk11_0 = esk13_0,
    inference(split_conjunct,[status(thm)],[147]) ).

cnf(150,negated_conjecture,
    esk12_0 = esk14_0,
    inference(split_conjunct,[status(thm)],[147]) ).

cnf(151,negated_conjecture,
    nil = esk13_0,
    inference(split_conjunct,[status(thm)],[147]) ).

cnf(152,negated_conjecture,
    ssList(esk14_0),
    inference(split_conjunct,[status(thm)],[147]) ).

cnf(158,negated_conjecture,
    nil = esk11_0,
    inference(rw,[status(thm)],[149,151,theory(equality)]) ).

cnf(161,negated_conjecture,
    ssList(esk12_0),
    inference(rw,[status(thm)],[152,150,theory(equality)]) ).

cnf(162,negated_conjecture,
    ( $false
    | ~ segmentP(esk12_0,esk11_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[148,158,theory(equality)]),97,theory(equality)]) ).

cnf(163,negated_conjecture,
    ( $false
    | ~ segmentP(esk12_0,nil) ),
    inference(rw,[status(thm)],[162,158,theory(equality)]) ).

cnf(164,negated_conjecture,
    ~ segmentP(esk12_0,nil),
    inference(cn,[status(thm)],[163,theory(equality)]) ).

cnf(165,negated_conjecture,
    ~ ssList(esk12_0),
    inference(spm,[status(thm)],[164,132,theory(equality)]) ).

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

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

cnf(319,negated_conjecture,
    $false,
    318,
    [proof] ).

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