↑ Up

SInE---0.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV045+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art01.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:57:17 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(26,axiom,
    true,
    file('/tmp/tmpUedXrJ/sel_SWV045+1.p_1',ttrue) ).

fof(61,conjecture,
    ( ( pv76 = sum(n0,minus(n135300,n1),a_select3(q,pv77,pv25))
      & leq(n0,pv25)
      & leq(pv25,minus(n5,n1)) )
   => true ),
    file('/tmp/tmpUedXrJ/sel_SWV045+1.p_1',cl5_nebula_norm_0007) ).

fof(71,negated_conjecture,
    ~ ( ( pv76 = sum(n0,minus(n135300,n1),a_select3(q,pv77,pv25))
        & leq(n0,pv25)
        & leq(pv25,minus(n5,n1)) )
     => true ),
    inference(assume_negation,[status(cth)],[61]) ).

cnf(133,plain,
    true,
    inference(split_conjunct,[status(thm)],[26]) ).

fof(186,negated_conjecture,
    ( pv76 = sum(n0,minus(n135300,n1),a_select3(q,pv77,pv25))
    & leq(n0,pv25)
    & leq(pv25,minus(n5,n1))
    & ~ true ),
    inference(fof_nnf,[status(thm)],[71]) ).

cnf(187,negated_conjecture,
    ~ true,
    inference(split_conjunct,[status(thm)],[186]) ).

cnf(228,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[187,133,theory(equality)]) ).

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

cnf(230,negated_conjecture,
    $false,
    229,
    [proof] ).

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