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

% Computer : art02.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:38 EST 2010

% Result   : Theorem 199.86s
% Output   : CNFRefutation 208.43s
% 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(141,axiom,
    ( mtvisible(c_englishmt)
   => prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbc) ),
    file('/tmp/tmp3fD67K/sel_CSR035+5.p_5',ax4_254375) ).

fof(150,conjecture,
    ? [X5] :
      ( mtvisible(c_englishmt)
     => prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X5) ),
    file('/tmp/tmp3fD67K/sel_CSR035+5.p_5',query235) ).

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

fof(502,plain,
    ( ~ mtvisible(c_englishmt)
    | prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbc) ),
    inference(fof_nnf,[status(thm)],[141]) ).

cnf(503,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbc)
    | ~ mtvisible(c_englishmt) ),
    inference(split_conjunct,[status(thm)],[502]) ).

fof(521,negated_conjecture,
    ! [X5] :
      ( mtvisible(c_englishmt)
      & ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X5) ),
    inference(fof_nnf,[status(thm)],[151]) ).

fof(522,negated_conjecture,
    ! [X6] :
      ( mtvisible(c_englishmt)
      & ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X6) ),
    inference(variable_rename,[status(thm)],[521]) ).

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

cnf(524,negated_conjecture,
    mtvisible(c_englishmt),
    inference(split_conjunct,[status(thm)],[522]) ).

cnf(526,plain,
    ( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbc)
    | $false ),
    inference(rw,[status(thm)],[503,524,theory(equality)]) ).

cnf(527,plain,
    prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbc),
    inference(cn,[status(thm)],[526,theory(equality)]) ).

cnf(542,plain,
    $false,
    inference(sr,[status(thm)],[527,523,theory(equality)]) ).

cnf(543,plain,
    $false,
    542,
    [proof] ).

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