%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU306+1 : TPTP v5.0.0. Released v3.3.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 : Sun Dec 26 07:04:41 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(12,conjecture,
    ! [X1] :
      ( one_sorted_str(X1)
     => cast_as_carrier_subset(X1) = the_carrier(X1) ),
    file('/tmp/tmpzDF12U/sel_SEU306+1.p_1',t12_pre_topc) ).

fof(36,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => cast_as_carrier_subset(X1) = the_carrier(X1) ),
    file('/tmp/tmpzDF12U/sel_SEU306+1.p_1',d3_pre_topc) ).

fof(41,negated_conjecture,
    ~ ! [X1] :
        ( one_sorted_str(X1)
       => cast_as_carrier_subset(X1) = the_carrier(X1) ),
    inference(assume_negation,[status(cth)],[12]) ).

fof(75,negated_conjecture,
    ? [X1] :
      ( one_sorted_str(X1)
      & cast_as_carrier_subset(X1) != the_carrier(X1) ),
    inference(fof_nnf,[status(thm)],[41]) ).

fof(76,negated_conjecture,
    ? [X2] :
      ( one_sorted_str(X2)
      & cast_as_carrier_subset(X2) != the_carrier(X2) ),
    inference(variable_rename,[status(thm)],[75]) ).

fof(77,negated_conjecture,
    ( one_sorted_str(esk1_0)
    & cast_as_carrier_subset(esk1_0) != the_carrier(esk1_0) ),
    inference(skolemize,[status(esa)],[76]) ).

cnf(78,negated_conjecture,
    cast_as_carrier_subset(esk1_0) != the_carrier(esk1_0),
    inference(split_conjunct,[status(thm)],[77]) ).

cnf(79,negated_conjecture,
    one_sorted_str(esk1_0),
    inference(split_conjunct,[status(thm)],[77]) ).

fof(185,plain,
    ! [X1] :
      ( ~ one_sorted_str(X1)
      | cast_as_carrier_subset(X1) = the_carrier(X1) ),
    inference(fof_nnf,[status(thm)],[36]) ).

fof(186,plain,
    ! [X2] :
      ( ~ one_sorted_str(X2)
      | cast_as_carrier_subset(X2) = the_carrier(X2) ),
    inference(variable_rename,[status(thm)],[185]) ).

cnf(187,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    inference(split_conjunct,[status(thm)],[186]) ).

cnf(212,negated_conjecture,
    ~ one_sorted_str(esk1_0),
    inference(spm,[status(thm)],[78,187,theory(equality)]) ).

cnf(213,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[212,79,theory(equality)]) ).

cnf(214,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[213,theory(equality)]) ).

cnf(215,negated_conjecture,
    $false,
    214,
    [proof] ).

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