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

% Computer : art05.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:25:10 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(11,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('/tmp/tmpJ7SHl0/sel_CSR051+1.p_1',just1) ).

fof(28,conjecture,
    ? [X1] :
      ( mtvisible(c_tptp_member3356_mt)
     => marriagelicensedocument(X1) ),
    file('/tmp/tmpJ7SHl0/sel_CSR051+1.p_1',query51) ).

fof(29,negated_conjecture,
    ~ ? [X1] :
        ( mtvisible(c_tptp_member3356_mt)
       => marriagelicensedocument(X1) ),
    inference(assume_negation,[status(cth)],[28]) ).

fof(58,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    inference(fof_nnf,[status(thm)],[11]) ).

cnf(59,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(split_conjunct,[status(thm)],[58]) ).

fof(108,negated_conjecture,
    ! [X1] :
      ( mtvisible(c_tptp_member3356_mt)
      & ~ marriagelicensedocument(X1) ),
    inference(fof_nnf,[status(thm)],[29]) ).

fof(109,negated_conjecture,
    ! [X2] :
      ( mtvisible(c_tptp_member3356_mt)
      & ~ marriagelicensedocument(X2) ),
    inference(variable_rename,[status(thm)],[108]) ).

cnf(110,negated_conjecture,
    ~ marriagelicensedocument(X1),
    inference(split_conjunct,[status(thm)],[109]) ).

cnf(111,negated_conjecture,
    mtvisible(c_tptp_member3356_mt),
    inference(split_conjunct,[status(thm)],[109]) ).

cnf(112,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | $false ),
    inference(rw,[status(thm)],[59,111,theory(equality)]) ).

cnf(113,plain,
    marriagelicensedocument(c_tptpmarriagelicensedocument),
    inference(cn,[status(thm)],[112,theory(equality)]) ).

cnf(114,plain,
    $false,
    inference(sr,[status(thm)],[113,110,theory(equality)]) ).

cnf(115,plain,
    $false,
    114,
    [proof] ).

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