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

% Computer : art01.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:09:26 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(235,axiom,
    ( mtvisible(c_englishmt)
   => prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege) ),
    file('/tmp/tmp1HUs3k/sel_CSR035+3.p_5',ax2_4139) ).

fof(503,conjecture,
    ? [X6] :
      ( mtvisible(c_englishmt)
     => prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X6) ),
    file('/tmp/tmp1HUs3k/sel_CSR035+3.p_5',query135) ).

fof(504,negated_conjecture,
    ~ ? [X6] :
        ( mtvisible(c_englishmt)
       => prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X6) ),
    inference(assume_negation,[status(cth)],[503]) ).

fof(993,plain,
    ( ~ mtvisible(c_englishmt)
    | prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege) ),
    inference(fof_nnf,[status(thm)],[235]) ).

cnf(994,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)
    | ~ mtvisible(c_englishmt) ),
    inference(split_conjunct,[status(thm)],[993]) ).

fof(1556,negated_conjecture,
    ! [X6] :
      ( mtvisible(c_englishmt)
      & ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X6) ),
    inference(fof_nnf,[status(thm)],[504]) ).

fof(1557,negated_conjecture,
    ! [X7] :
      ( mtvisible(c_englishmt)
      & ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X7) ),
    inference(variable_rename,[status(thm)],[1556]) ).

cnf(1558,negated_conjecture,
    ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X1),
    inference(split_conjunct,[status(thm)],[1557]) ).

cnf(1559,negated_conjecture,
    mtvisible(c_englishmt),
    inference(split_conjunct,[status(thm)],[1557]) ).

cnf(1566,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)
    | $false ),
    inference(rw,[status(thm)],[994,1559,theory(equality)]) ).

cnf(1567,plain,
    prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege),
    inference(cn,[status(thm)],[1566,theory(equality)]) ).

cnf(1572,plain,
    $false,
    inference(sr,[status(thm)],[1567,1558,theory(equality)]) ).

cnf(1573,plain,
    $false,
    1572,
    [proof] ).

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