TSTP Solution File: SWV050+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV050+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:02:42 EST 2010

% Result   : Theorem 0.24s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  30 unt;   0 def)
%            Number of atoms       :   54 (  48 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   29 (  11   ~;   8   |;   8   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   23 (  23 usr;  15 con; 0-3 aty)
%            Number of variables   :   19 (   1 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(9,axiom,
    ! [X4] : sum(n0,tptp_minus_1,X4) = n0,
    file('/tmp/tmpNyFJA3/sel_SWV050+1.p_1',sum_plus_base) ).

fof(13,axiom,
    succ(tptp_minus_1) = n0,
    file('/tmp/tmpNyFJA3/sel_SWV050+1.p_1',succ_tptp_minus_1) ).

fof(17,axiom,
    ! [X1] : plus(X1,n1) = succ(X1),
    file('/tmp/tmpNyFJA3/sel_SWV050+1.p_1',succ_plus_1_r) ).

fof(22,axiom,
    ! [X1] : minus(X1,n1) = pred(X1),
    file('/tmp/tmpNyFJA3/sel_SWV050+1.p_1',pred_minus_1) ).

fof(23,axiom,
    ! [X1] : plus(n1,X1) = succ(X1),
    file('/tmp/tmpNyFJA3/sel_SWV050+1.p_1',succ_plus_1_l) ).

fof(27,axiom,
    ! [X1] : pred(succ(X1)) = X1,
    file('/tmp/tmpNyFJA3/sel_SWV050+1.p_1',pred_succ) ).

fof(55,conjecture,
    ( ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
      & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) )
   => ( n0 = sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
      & pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
      & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
    file('/tmp/tmpNyFJA3/sel_SWV050+1.p_1',cl5_nebula_norm_0022) ).

fof(63,negated_conjecture,
    ~ ( ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
        & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) )
     => ( n0 = sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
        & pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
        & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
    inference(assume_negation,[status(cth)],[55]) ).

fof(86,plain,
    ! [X5] : sum(n0,tptp_minus_1,X5) = n0,
    inference(variable_rename,[status(thm)],[9]) ).

cnf(87,plain,
    sum(n0,tptp_minus_1,X1) = n0,
    inference(split_conjunct,[status(thm)],[86]) ).

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

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

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

fof(113,plain,
    ! [X2] : minus(X2,n1) = pred(X2),
    inference(variable_rename,[status(thm)],[22]) ).

cnf(114,plain,
    minus(X1,n1) = pred(X1),
    inference(split_conjunct,[status(thm)],[113]) ).

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

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

fof(128,plain,
    ! [X2] : pred(succ(X2)) = X2,
    inference(variable_rename,[status(thm)],[27]) ).

cnf(129,plain,
    pred(succ(X1)) = X1,
    inference(split_conjunct,[status(thm)],[128]) ).

fof(172,negated_conjecture,
    ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
    & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))
    & ( n0 != sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
      | pv86 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
      | pv88 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
    inference(fof_nnf,[status(thm)],[63]) ).

cnf(173,negated_conjecture,
    ( pv88 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))
    | pv86 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
    | n0 != sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) ),
    inference(split_conjunct,[status(thm)],[172]) ).

cnf(174,negated_conjecture,
    pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))),
    inference(split_conjunct,[status(thm)],[172]) ).

cnf(175,negated_conjecture,
    pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))),
    inference(split_conjunct,[status(thm)],[172]) ).

cnf(184,plain,
    plus(tptp_minus_1,n1) = n0,
    inference(rw,[status(thm)],[96,104,theory(equality)]),
    [unfolding] ).

cnf(186,plain,
    pred(plus(X1,n1)) = X1,
    inference(rw,[status(thm)],[129,104,theory(equality)]),
    [unfolding] ).

cnf(187,plain,
    plus(n1,X1) = plus(X1,n1),
    inference(rw,[status(thm)],[116,104,theory(equality)]),
    [unfolding] ).

cnf(208,plain,
    minus(plus(X1,n1),n1) = X1,
    inference(rw,[status(thm)],[186,114,theory(equality)]),
    [unfolding] ).

cnf(214,plain,
    plus(n1,tptp_minus_1) = n0,
    inference(rw,[status(thm)],[184,187,theory(equality)]) ).

cnf(220,plain,
    minus(plus(n1,X1),n1) = X1,
    inference(spm,[status(thm)],[208,187,theory(equality)]) ).

cnf(415,negated_conjecture,
    ( sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0
    | $false
    | sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) != pv88 ),
    inference(rw,[status(thm)],[173,175,theory(equality)]) ).

cnf(416,negated_conjecture,
    ( sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0
    | $false
    | $false ),
    inference(rw,[status(thm)],[415,174,theory(equality)]) ).

cnf(417,negated_conjecture,
    sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0,
    inference(cn,[status(thm)],[416,theory(equality)]) ).

cnf(509,plain,
    minus(n0,n1) = tptp_minus_1,
    inference(spm,[status(thm)],[220,214,theory(equality)]) ).

cnf(537,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[417,509,theory(equality)]),87,theory(equality)]) ).

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

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