%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : CSR034+5 : TPTP v5.0.0. Bugfixed v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art03.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:08:53 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(91,axiom,
    individual(c_wanica_districtsuriname),
    file('/tmp/tmpgysllU/sel_CSR034+5.p_5',ax4_169830) ).

fof(111,axiom,
    ! [X5] :
      ( individual(X5)
     => isa(X5,c_individual) ),
    file('/tmp/tmpgysllU/sel_CSR034+5.p_5',ax4_540242) ).

fof(152,conjecture,
    ? [X15] :
      ( mtvisible(c_tptp_member3515_mt)
     => isa(c_wanica_districtsuriname,X15) ),
    file('/tmp/tmpgysllU/sel_CSR034+5.p_5',query234) ).

fof(153,negated_conjecture,
    ~ ? [X15] :
        ( mtvisible(c_tptp_member3515_mt)
       => isa(c_wanica_districtsuriname,X15) ),
    inference(assume_negation,[status(cth)],[152]) ).

cnf(366,plain,
    individual(c_wanica_districtsuriname),
    inference(split_conjunct,[status(thm)],[91]) ).

fof(412,plain,
    ! [X5] :
      ( ~ individual(X5)
      | isa(X5,c_individual) ),
    inference(fof_nnf,[status(thm)],[111]) ).

fof(413,plain,
    ! [X6] :
      ( ~ individual(X6)
      | isa(X6,c_individual) ),
    inference(variable_rename,[status(thm)],[412]) ).

cnf(414,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    inference(split_conjunct,[status(thm)],[413]) ).

fof(517,negated_conjecture,
    ! [X15] :
      ( mtvisible(c_tptp_member3515_mt)
      & ~ isa(c_wanica_districtsuriname,X15) ),
    inference(fof_nnf,[status(thm)],[153]) ).

fof(518,negated_conjecture,
    ! [X16] :
      ( mtvisible(c_tptp_member3515_mt)
      & ~ isa(c_wanica_districtsuriname,X16) ),
    inference(variable_rename,[status(thm)],[517]) ).

cnf(519,negated_conjecture,
    ~ isa(c_wanica_districtsuriname,X1),
    inference(split_conjunct,[status(thm)],[518]) ).

cnf(534,plain,
    isa(c_wanica_districtsuriname,c_individual),
    inference(spm,[status(thm)],[414,366,theory(equality)]) ).

cnf(536,plain,
    $false,
    inference(sr,[status(thm)],[534,519,theory(equality)]) ).

cnf(537,plain,
    $false,
    536,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR034+5.p
% --creating new selector for [CSR002+4.ax]
% -running prover on /tmp/tmpgysllU/sel_CSR034+5.p_1 with time limit 29
% -prover status CounterSatisfiable
% -running prover on /tmp/tmpgysllU/sel_CSR034+5.p_2 with time limit 60
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+4.ax]
% -running prover on /tmp/tmpgysllU/sel_CSR034+5.p_3 with time limit 80
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+4.ax]
% -running prover on /tmp/tmpgysllU/sel_CSR034+5.p_4 with time limit 85
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+4.ax]
% -running prover on /tmp/tmpgysllU/sel_CSR034+5.p_5 with time limit 137
% -prover status Theorem
% Problem CSR034+5.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR034+5.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR034+5.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
% 
%------------------------------------------------------------------------------