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

% Computer : art05.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 10:23:08 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(5,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ neq(X2,nil)
                    | neq(X4,nil) ) ) ) ) ),
    file('/tmp/tmpAgd5-j/sel_SWC143+1.p_1',co1) ).

fof(6,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ neq(X2,nil)
                      | neq(X4,nil) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[5]) ).

fof(7,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ neq(X2,nil)
                      | neq(X4,nil) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).

fof(26,negated_conjecture,
    ? [X1] :
      ( ssList(X1)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & ? [X4] :
                  ( ssList(X4)
                  & X2 = X4
                  & X1 = X3
                  & neq(X2,nil)
                  & ~ neq(X4,nil) ) ) ) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(27,negated_conjecture,
    ? [X5] :
      ( ssList(X5)
      & ? [X6] :
          ( ssList(X6)
          & ? [X7] :
              ( ssList(X7)
              & ? [X8] :
                  ( ssList(X8)
                  & X6 = X8
                  & X5 = X7
                  & neq(X6,nil)
                  & ~ neq(X8,nil) ) ) ) ),
    inference(variable_rename,[status(thm)],[26]) ).

fof(28,negated_conjecture,
    ( ssList(esk3_0)
    & ssList(esk4_0)
    & ssList(esk5_0)
    & ssList(esk6_0)
    & esk4_0 = esk6_0
    & esk3_0 = esk5_0
    & neq(esk4_0,nil)
    & ~ neq(esk6_0,nil) ),
    inference(skolemize,[status(esa)],[27]) ).

cnf(29,negated_conjecture,
    ~ neq(esk6_0,nil),
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(30,negated_conjecture,
    neq(esk4_0,nil),
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(32,negated_conjecture,
    esk4_0 = esk6_0,
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(40,negated_conjecture,
    neq(esk6_0,nil),
    inference(rw,[status(thm)],[30,32,theory(equality)]) ).

cnf(41,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[29,40,theory(equality)]) ).

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

cnf(43,negated_conjecture,
    $false,
    42,
    [proof] ).

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