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

% Computer : art06.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:15 EST 2010

% Result   : Theorem 0.22s
% Output   : CNFRefutation 0.22s
% 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(13,axiom,
    ( mtvisible(c_englishmt)
   => prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege) ),
    file('/tmp/tmpFzYhs4/sel_CSR035+1.p_1',just1) ).

fof(20,conjecture,
    ? [X1] :
      ( mtvisible(c_englishmt)
     => prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X1) ),
    file('/tmp/tmpFzYhs4/sel_CSR035+1.p_1',query35) ).

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

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

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

fof(95,negated_conjecture,
    ! [X1] :
      ( mtvisible(c_englishmt)
      & ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X1) ),
    inference(fof_nnf,[status(thm)],[40]) ).

fof(96,negated_conjecture,
    ! [X2] :
      ( mtvisible(c_englishmt)
      & ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X2) ),
    inference(variable_rename,[status(thm)],[95]) ).

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

cnf(98,negated_conjecture,
    mtvisible(c_englishmt),
    inference(split_conjunct,[status(thm)],[96]) ).

cnf(151,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)
    | $false ),
    inference(rw,[status(thm)],[76,98,theory(equality)]) ).

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

cnf(153,plain,
    $false,
    inference(sr,[status(thm)],[152,97,theory(equality)]) ).

cnf(154,plain,
    $false,
    153,
    [proof] ).

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