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

% Computer : art07.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:17:27 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(6,conjecture,
    ( mtvisible(c_tptp_member2862_mt)
   => genls(c_tptpcol_16_30972,c_tptpcol_15_30970) ),
    file('/tmp/tmpjLyD27/sel_CSR043+1.p_1',query43) ).

fof(29,axiom,
    genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    file('/tmp/tmpjLyD27/sel_CSR043+1.p_1',just6) ).

fof(59,negated_conjecture,
    ~ ( mtvisible(c_tptp_member2862_mt)
     => genls(c_tptpcol_16_30972,c_tptpcol_15_30970) ),
    inference(assume_negation,[status(cth)],[6]) ).

fof(73,negated_conjecture,
    ( mtvisible(c_tptp_member2862_mt)
    & ~ genls(c_tptpcol_16_30972,c_tptpcol_15_30970) ),
    inference(fof_nnf,[status(thm)],[59]) ).

cnf(74,negated_conjecture,
    ~ genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    inference(split_conjunct,[status(thm)],[73]) ).

cnf(134,plain,
    genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    inference(split_conjunct,[status(thm)],[29]) ).

cnf(214,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[74,134,theory(equality)]) ).

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

cnf(216,negated_conjecture,
    $false,
    215,
    [proof] ).

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