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

% Computer : art04.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:06:17 EST 2010

% Result   : Theorem 1.16s
% Output   : CNFRefutation 1.16s
% 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    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :    9 (   1 sgn   5   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(227,axiom,
    ! [X1] :
      ( individual(X1)
     => isa(X1,c_individual) ),
    file('/tmp/tmpxi_myM/sel_CSR032+2.p_5',ax1_1014) ).

fof(678,axiom,
    individual(f_citynamedfn(s_agen,c_france)),
    file('/tmp/tmpxi_myM/sel_CSR032+2.p_5',ax1_318) ).

fof(736,conjecture,
    ? [X22] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
     => isa(f_citynamedfn(s_agen,c_france),X22) ),
    file('/tmp/tmpxi_myM/sel_CSR032+2.p_5',query82) ).

fof(737,negated_conjecture,
    ~ ? [X22] :
        ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
       => isa(f_citynamedfn(s_agen,c_france),X22) ),
    inference(assume_negation,[status(cth)],[736]) ).

fof(1339,plain,
    ! [X1] :
      ( ~ individual(X1)
      | isa(X1,c_individual) ),
    inference(fof_nnf,[status(thm)],[227]) ).

fof(1340,plain,
    ! [X2] :
      ( ~ individual(X2)
      | isa(X2,c_individual) ),
    inference(variable_rename,[status(thm)],[1339]) ).

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

cnf(2460,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    inference(split_conjunct,[status(thm)],[678]) ).

fof(2594,negated_conjecture,
    ! [X22] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
      & ~ isa(f_citynamedfn(s_agen,c_france),X22) ),
    inference(fof_nnf,[status(thm)],[737]) ).

fof(2595,negated_conjecture,
    ! [X23] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
      & ~ isa(f_citynamedfn(s_agen,c_france),X23) ),
    inference(variable_rename,[status(thm)],[2594]) ).

cnf(2596,negated_conjecture,
    ~ isa(f_citynamedfn(s_agen,c_france),X1),
    inference(split_conjunct,[status(thm)],[2595]) ).

cnf(2635,plain,
    isa(f_citynamedfn(s_agen,c_france),c_individual),
    inference(spm,[status(thm)],[1341,2460,theory(equality)]) ).

cnf(2636,plain,
    $false,
    inference(sr,[status(thm)],[2635,2596,theory(equality)]) ).

cnf(2637,plain,
    $false,
    2636,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR032+2.p
% --creating new selector for [CSR002+1.ax]
% -running prover on /tmp/tmpxi_myM/sel_CSR032+2.p_1 with time limit 29
% -prover status CounterSatisfiable
% -running prover on /tmp/tmpxi_myM/sel_CSR032+2.p_2 with time limit 89
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+1.ax]
% -running prover on /tmp/tmpxi_myM/sel_CSR032+2.p_3 with time limit 119
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+1.ax]
% -running prover on /tmp/tmpxi_myM/sel_CSR032+2.p_4 with time limit 149
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+1.ax]
% -running prover on /tmp/tmpxi_myM/sel_CSR032+2.p_5 with time limit 299
% -prover status Theorem
% Problem CSR032+2.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR032+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR032+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
% 
%------------------------------------------------------------------------------