↑ Up

SInE---0.4.THM-CRf.s

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

% Computer : art02.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 : Sat Dec 25 06:05:31 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(7,axiom,
    ! [X6,X2] :
      ( disjointwith(X6,X2)
     => collection(X6) ),
    file('/tmp/tmpUkCs1I/sel_CSR031+2.p_1',ax1_1119) ).

fof(14,axiom,
    ! [X7] :
      ~ ( collection(X7)
        & individual(X7) ),
    file('/tmp/tmpUkCs1I/sel_CSR031+2.p_1',ax1_289) ).

fof(23,axiom,
    individual(c_tptptptpcol_16_8398),
    file('/tmp/tmpUkCs1I/sel_CSR031+2.p_1',ax1_447) ).

fof(24,conjecture,
    ~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    file('/tmp/tmpUkCs1I/sel_CSR031+2.p_1',query81) ).

fof(25,negated_conjecture,
    ~ ~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    inference(assume_negation,[status(cth)],[24]) ).

fof(26,negated_conjecture,
    disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).

fof(45,plain,
    ! [X6,X2] :
      ( ~ disjointwith(X6,X2)
      | collection(X6) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(46,plain,
    ! [X7,X8] :
      ( ~ disjointwith(X7,X8)
      | collection(X7) ),
    inference(variable_rename,[status(thm)],[45]) ).

cnf(47,plain,
    ( collection(X1)
    | ~ disjointwith(X1,X2) ),
    inference(split_conjunct,[status(thm)],[46]) ).

fof(66,plain,
    ! [X7] :
      ( ~ collection(X7)
      | ~ individual(X7) ),
    inference(fof_nnf,[status(thm)],[14]) ).

fof(67,plain,
    ! [X8] :
      ( ~ collection(X8)
      | ~ individual(X8) ),
    inference(variable_rename,[status(thm)],[66]) ).

cnf(68,plain,
    ( ~ individual(X1)
    | ~ collection(X1) ),
    inference(split_conjunct,[status(thm)],[67]) ).

cnf(93,plain,
    individual(c_tptptptpcol_16_8398),
    inference(split_conjunct,[status(thm)],[23]) ).

cnf(94,negated_conjecture,
    disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    inference(split_conjunct,[status(thm)],[26]) ).

cnf(97,negated_conjecture,
    collection(c_tptptptpcol_16_8398),
    inference(spm,[status(thm)],[47,94,theory(equality)]) ).

cnf(98,plain,
    ~ collection(c_tptptptpcol_16_8398),
    inference(spm,[status(thm)],[68,93,theory(equality)]) ).

cnf(105,plain,
    $false,
    inference(rw,[status(thm)],[98,97,theory(equality)]) ).

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

cnf(107,plain,
    $false,
    106,
    [proof] ).

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