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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 12:25:27 EST 2010

% Result   : Theorem 0.21s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   46 (  27 unt;   0 def)
%            Number of atoms       :   78 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   59 (  27   ~;  17   |;  11   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  26   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    ! [X1,X2,X3] :
      ( ( leq(X1,X2)
        & leq(X2,X3) )
     => leq(X1,X3) ),
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',transitivity_leq) ).

fof(6,axiom,
    ! [X1] : plus(n1,X1) = succ(X1),
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',succ_plus_1_l) ).

fof(11,axiom,
    succ(tptp_minus_1) = n0,
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',succ_tptp_minus_1) ).

fof(14,axiom,
    ! [X1] : plus(X1,n1) = succ(X1),
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',succ_plus_1_r) ).

fof(15,axiom,
    ! [X1] : ~ gt(X1,X1),
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',irreflexivity_gt) ).

fof(16,axiom,
    ! [X1] : gt(succ(X1),X1),
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',gt_succ) ).

fof(21,axiom,
    ! [X1,X2] :
      ( leq(X1,X2)
    <=> gt(succ(X2),X1) ),
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',leq_succ_gt_equiv) ).

fof(34,conjecture,
    ! [X4] :
      ( ( leq(n0,X4)
        & leq(X4,tptp_minus_1) )
     => uninit = init ),
    file('/tmp/tmp_Gdm7Y/sel_SWV165+1.p_1',cl5_nebula_init_0001) ).

fof(57,negated_conjecture,
    ~ ! [X4] :
        ( ( leq(n0,X4)
          & leq(X4,tptp_minus_1) )
       => uninit = init ),
    inference(assume_negation,[status(cth)],[34]) ).

fof(58,plain,
    ! [X1] : ~ gt(X1,X1),
    inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).

fof(64,plain,
    ! [X1,X2,X3] :
      ( ~ leq(X1,X2)
      | ~ leq(X2,X3)
      | leq(X1,X3) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(65,plain,
    ! [X4,X5,X6] :
      ( ~ leq(X4,X5)
      | ~ leq(X5,X6)
      | leq(X4,X6) ),
    inference(variable_rename,[status(thm)],[64]) ).

cnf(66,plain,
    ( leq(X1,X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[65]) ).

fof(73,plain,
    ! [X2] : plus(n1,X2) = succ(X2),
    inference(variable_rename,[status(thm)],[6]) ).

cnf(74,plain,
    plus(n1,X1) = succ(X1),
    inference(split_conjunct,[status(thm)],[73]) ).

cnf(85,plain,
    succ(tptp_minus_1) = n0,
    inference(split_conjunct,[status(thm)],[11]) ).

fof(90,plain,
    ! [X2] : plus(X2,n1) = succ(X2),
    inference(variable_rename,[status(thm)],[14]) ).

cnf(91,plain,
    plus(X1,n1) = succ(X1),
    inference(split_conjunct,[status(thm)],[90]) ).

fof(92,plain,
    ! [X2] : ~ gt(X2,X2),
    inference(variable_rename,[status(thm)],[58]) ).

cnf(93,plain,
    ~ gt(X1,X1),
    inference(split_conjunct,[status(thm)],[92]) ).

fof(94,plain,
    ! [X2] : gt(succ(X2),X2),
    inference(variable_rename,[status(thm)],[16]) ).

cnf(95,plain,
    gt(succ(X1),X1),
    inference(split_conjunct,[status(thm)],[94]) ).

fof(104,plain,
    ! [X1,X2] :
      ( ( ~ leq(X1,X2)
        | gt(succ(X2),X1) )
      & ( ~ gt(succ(X2),X1)
        | leq(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[21]) ).

fof(105,plain,
    ! [X3,X4] :
      ( ( ~ leq(X3,X4)
        | gt(succ(X4),X3) )
      & ( ~ gt(succ(X4),X3)
        | leq(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[104]) ).

cnf(106,plain,
    ( leq(X1,X2)
    | ~ gt(succ(X2),X1) ),
    inference(split_conjunct,[status(thm)],[105]) ).

cnf(107,plain,
    ( gt(succ(X1),X2)
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[105]) ).

fof(124,negated_conjecture,
    ? [X4] :
      ( leq(n0,X4)
      & leq(X4,tptp_minus_1)
      & uninit != init ),
    inference(fof_nnf,[status(thm)],[57]) ).

fof(125,negated_conjecture,
    ? [X5] :
      ( leq(n0,X5)
      & leq(X5,tptp_minus_1)
      & uninit != init ),
    inference(variable_rename,[status(thm)],[124]) ).

fof(126,negated_conjecture,
    ( leq(n0,esk1_0)
    & leq(esk1_0,tptp_minus_1)
    & uninit != init ),
    inference(skolemize,[status(esa)],[125]) ).

cnf(128,negated_conjecture,
    leq(esk1_0,tptp_minus_1),
    inference(split_conjunct,[status(thm)],[126]) ).

cnf(129,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[126]) ).

cnf(164,plain,
    plus(tptp_minus_1,n1) = n0,
    inference(rw,[status(thm)],[85,91,theory(equality)]),
    [unfolding] ).

cnf(166,plain,
    plus(n1,X1) = plus(X1,n1),
    inference(rw,[status(thm)],[74,91,theory(equality)]),
    [unfolding] ).

cnf(168,plain,
    gt(plus(X1,n1),X1),
    inference(rw,[status(thm)],[95,91,theory(equality)]),
    [unfolding] ).

cnf(180,plain,
    ( leq(X1,X2)
    | ~ gt(plus(X2,n1),X1) ),
    inference(rw,[status(thm)],[106,91,theory(equality)]),
    [unfolding] ).

cnf(183,plain,
    ( gt(plus(X1,n1),X2)
    | ~ leq(X2,X1) ),
    inference(rw,[status(thm)],[107,91,theory(equality)]),
    [unfolding] ).

cnf(187,negated_conjecture,
    ( leq(X1,esk1_0)
    | ~ leq(X1,n0) ),
    inference(spm,[status(thm)],[66,129,theory(equality)]) ).

cnf(188,negated_conjecture,
    ( leq(X1,tptp_minus_1)
    | ~ leq(X1,esk1_0) ),
    inference(spm,[status(thm)],[66,128,theory(equality)]) ).

cnf(204,plain,
    plus(n1,tptp_minus_1) = n0,
    inference(rw,[status(thm)],[164,166,theory(equality)]) ).

cnf(213,plain,
    ~ leq(plus(X1,n1),X1),
    inference(spm,[status(thm)],[93,183,theory(equality)]) ).

cnf(214,plain,
    leq(X1,X1),
    inference(spm,[status(thm)],[180,168,theory(equality)]) ).

cnf(385,negated_conjecture,
    ( leq(X1,tptp_minus_1)
    | ~ leq(X1,n0) ),
    inference(spm,[status(thm)],[188,187,theory(equality)]) ).

cnf(389,negated_conjecture,
    ~ leq(plus(tptp_minus_1,n1),n0),
    inference(spm,[status(thm)],[213,385,theory(equality)]) ).

cnf(393,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[389,166,theory(equality)]),204,theory(equality)]),214,theory(equality)]) ).

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

cnf(395,negated_conjecture,
    $false,
    394,
    [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/SWV/SWV165+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmp_Gdm7Y/sel_SWV165+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV165+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV165+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV165+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
% 
%------------------------------------------------------------------------------