%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWW469+5 : TPTP v5.3.0. Released v5.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 @ 2800MHz
% Memory   : 2005MB
% OS       : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 27 14:41:09 EST 2011

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

% Comments : 
%------------------------------------------------------------------------------
fof(14,conjecture,
    ! [X15] :
      ~ ! [X16] : equal(ti(state,X16),ti(state,X15)),
    file('/tmp/tmpWtN1oc/sel_SWW469+5.p_1',conj_1) ).

fof(51,axiom,
    ( hBOOL(hoare_1883395792gleton)
  <=> ? [X16,X15] : ~ equal(ti(state,X16),ti(state,X15)) ),
    file('/tmp/tmpWtN1oc/sel_SWW469+5.p_1',fact_0_state__not__singleton__def) ).

fof(56,axiom,
    hBOOL(hoare_1883395792gleton),
    file('/tmp/tmpWtN1oc/sel_SWW469+5.p_1',conj_0) ).

fof(64,negated_conjecture,
    ~ ! [X15] :
        ~ ! [X16] : equal(ti(state,X16),ti(state,X15)),
    inference(assume_negation,[status(cth)],[14]) ).

fof(103,negated_conjecture,
    ? [X15] :
    ! [X16] : equal(ti(state,X16),ti(state,X15)),
    inference(fof_nnf,[status(thm)],[64]) ).

fof(104,negated_conjecture,
    ? [X17] :
    ! [X18] : equal(ti(state,X18),ti(state,X17)),
    inference(variable_rename,[status(thm)],[103]) ).

fof(105,negated_conjecture,
    ! [X18] : equal(ti(state,X18),ti(state,esk3_0)),
    inference(skolemize,[status(esa)],[104]) ).

cnf(106,negated_conjecture,
    ti(state,X1) = ti(state,esk3_0),
    inference(split_conjunct,[status(thm)],[105]) ).

fof(213,plain,
    ( ( ~ hBOOL(hoare_1883395792gleton)
      | ? [X16,X15] : ~ equal(ti(state,X16),ti(state,X15)) )
    & ( ! [X16,X15] : equal(ti(state,X16),ti(state,X15))
      | hBOOL(hoare_1883395792gleton) ) ),
    inference(fof_nnf,[status(thm)],[51]) ).

fof(214,plain,
    ( ( ~ hBOOL(hoare_1883395792gleton)
      | ? [X17,X18] : ~ equal(ti(state,X17),ti(state,X18)) )
    & ( ! [X19,X20] : equal(ti(state,X19),ti(state,X20))
      | hBOOL(hoare_1883395792gleton) ) ),
    inference(variable_rename,[status(thm)],[213]) ).

fof(215,plain,
    ( ( ~ hBOOL(hoare_1883395792gleton)
      | ~ equal(ti(state,esk8_0),ti(state,esk9_0)) )
    & ( ! [X19,X20] : equal(ti(state,X19),ti(state,X20))
      | hBOOL(hoare_1883395792gleton) ) ),
    inference(skolemize,[status(esa)],[214]) ).

fof(216,plain,
    ! [X19,X20] :
      ( ( equal(ti(state,X19),ti(state,X20))
        | hBOOL(hoare_1883395792gleton) )
      & ( ~ hBOOL(hoare_1883395792gleton)
        | ~ equal(ti(state,esk8_0),ti(state,esk9_0)) ) ),
    inference(shift_quantors,[status(thm)],[215]) ).

cnf(217,plain,
    ( ti(state,esk8_0) != ti(state,esk9_0)
    | ~ hBOOL(hoare_1883395792gleton) ),
    inference(split_conjunct,[status(thm)],[216]) ).

cnf(228,plain,
    hBOOL(hoare_1883395792gleton),
    inference(split_conjunct,[status(thm)],[56]) ).

cnf(294,plain,
    ( ti(state,esk3_0) != ti(state,esk8_0)
    | ~ hBOOL(hoare_1883395792gleton) ),
    inference(rw,[status(thm)],[217,106,theory(equality)]) ).

cnf(295,plain,
    ( $false
    | ~ hBOOL(hoare_1883395792gleton) ),
    inference(rw,[status(thm)],[294,106,theory(equality)]) ).

cnf(296,plain,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[295,228,theory(equality)]) ).

cnf(297,plain,
    $false,
    inference(cn,[status(thm)],[296,theory(equality)]) ).

cnf(298,plain,
    $false,
    297,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWW/SWW469+5.p
% --creating new selector for []
% -running prover on /tmp/tmpWtN1oc/sel_SWW469+5.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmpWtN1oc/sel_SWW469+5.p_1']
% -prover status Theorem
% Problem SWW469+5.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWW/SWW469+5.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWW/SWW469+5.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
% 
%------------------------------------------------------------------------------