↑ Up

SInE---0.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU308+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:05:22 EST 2010

% Result   : Theorem 0.32s
% Output   : CNFRefutation 0.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   39 (  13 unt;   0 def)
%            Number of atoms       :   81 (  25 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   76 (  34   ~;  25   |;   9   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :   46 (   2 sgn  32   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(5,axiom,
    ! [X1,X2,X3] :
      ( ( element(X2,powerset(X1))
        & element(X3,powerset(X1)) )
     => subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
    file('/tmp/tmp2BzgKF/sel_SEU308+1.p_1',redefinition_k6_subset_1) ).

fof(16,conjecture,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ) ),
    file('/tmp/tmp2BzgKF/sel_SEU308+1.p_1',t17_pre_topc) ).

fof(23,axiom,
    ! [X1,X2] :
      ( element(X1,powerset(X2))
    <=> subset(X1,X2) ),
    file('/tmp/tmp2BzgKF/sel_SEU308+1.p_1',t3_subset) ).

fof(29,axiom,
    ! [X1,X2] : subset(X1,X1),
    file('/tmp/tmp2BzgKF/sel_SEU308+1.p_1',reflexivity_r1_tarski) ).

fof(35,axiom,
    ! [X1,X2] :
      ( element(X2,powerset(X1))
     => subset_complement(X1,X2) = set_difference(X1,X2) ),
    file('/tmp/tmp2BzgKF/sel_SEU308+1.p_1',d5_subset_1) ).

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

fof(54,negated_conjecture,
    ~ ! [X1] :
        ( one_sorted_str(X1)
       => ! [X2] :
            ( element(X2,powerset(the_carrier(X1)))
           => subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ) ),
    inference(assume_negation,[status(cth)],[16]) ).

fof(69,plain,
    ! [X1,X2,X3] :
      ( ~ element(X2,powerset(X1))
      | ~ element(X3,powerset(X1))
      | subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(70,plain,
    ! [X4,X5,X6] :
      ( ~ element(X5,powerset(X4))
      | ~ element(X6,powerset(X4))
      | subset_difference(X4,X5,X6) = set_difference(X5,X6) ),
    inference(variable_rename,[status(thm)],[69]) ).

cnf(71,plain,
    ( subset_difference(X1,X2,X3) = set_difference(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    inference(split_conjunct,[status(thm)],[70]) ).

fof(108,negated_conjecture,
    ? [X1] :
      ( one_sorted_str(X1)
      & ? [X2] :
          ( element(X2,powerset(the_carrier(X1)))
          & subset_complement(the_carrier(X1),X2) != subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ) ),
    inference(fof_nnf,[status(thm)],[54]) ).

fof(109,negated_conjecture,
    ? [X3] :
      ( one_sorted_str(X3)
      & ? [X4] :
          ( element(X4,powerset(the_carrier(X3)))
          & subset_complement(the_carrier(X3),X4) != subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4) ) ),
    inference(variable_rename,[status(thm)],[108]) ).

fof(110,negated_conjecture,
    ( one_sorted_str(esk1_0)
    & element(esk2_0,powerset(the_carrier(esk1_0)))
    & subset_complement(the_carrier(esk1_0),esk2_0) != subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0) ),
    inference(skolemize,[status(esa)],[109]) ).

cnf(111,negated_conjecture,
    subset_complement(the_carrier(esk1_0),esk2_0) != subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0),
    inference(split_conjunct,[status(thm)],[110]) ).

cnf(112,negated_conjecture,
    element(esk2_0,powerset(the_carrier(esk1_0))),
    inference(split_conjunct,[status(thm)],[110]) ).

cnf(113,negated_conjecture,
    one_sorted_str(esk1_0),
    inference(split_conjunct,[status(thm)],[110]) ).

fof(139,plain,
    ! [X1,X2] :
      ( ( ~ element(X1,powerset(X2))
        | subset(X1,X2) )
      & ( ~ subset(X1,X2)
        | element(X1,powerset(X2)) ) ),
    inference(fof_nnf,[status(thm)],[23]) ).

fof(140,plain,
    ! [X3,X4] :
      ( ( ~ element(X3,powerset(X4))
        | subset(X3,X4) )
      & ( ~ subset(X3,X4)
        | element(X3,powerset(X4)) ) ),
    inference(variable_rename,[status(thm)],[139]) ).

cnf(141,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[140]) ).

fof(160,plain,
    ! [X3,X4] : subset(X3,X3),
    inference(variable_rename,[status(thm)],[29]) ).

cnf(161,plain,
    subset(X1,X1),
    inference(split_conjunct,[status(thm)],[160]) ).

fof(191,plain,
    ! [X1,X2] :
      ( ~ element(X2,powerset(X1))
      | subset_complement(X1,X2) = set_difference(X1,X2) ),
    inference(fof_nnf,[status(thm)],[35]) ).

fof(192,plain,
    ! [X3,X4] :
      ( ~ element(X4,powerset(X3))
      | subset_complement(X3,X4) = set_difference(X3,X4) ),
    inference(variable_rename,[status(thm)],[191]) ).

cnf(193,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    inference(split_conjunct,[status(thm)],[192]) ).

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

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

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

cnf(291,plain,
    element(X1,powerset(X1)),
    inference(spm,[status(thm)],[141,161,theory(equality)]) ).

cnf(558,negated_conjecture,
    ( subset_difference(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0)
    | ~ one_sorted_str(esk1_0) ),
    inference(spm,[status(thm)],[111,250,theory(equality)]) ).

cnf(559,negated_conjecture,
    ( subset_difference(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0)
    | $false ),
    inference(rw,[status(thm)],[558,113,theory(equality)]) ).

cnf(560,negated_conjecture,
    subset_difference(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0),
    inference(cn,[status(thm)],[559,theory(equality)]) ).

cnf(644,negated_conjecture,
    ( set_difference(the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0)
    | ~ element(esk2_0,powerset(the_carrier(esk1_0)))
    | ~ element(the_carrier(esk1_0),powerset(the_carrier(esk1_0))) ),
    inference(spm,[status(thm)],[560,71,theory(equality)]) ).

cnf(645,negated_conjecture,
    ( set_difference(the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0)
    | $false
    | ~ element(the_carrier(esk1_0),powerset(the_carrier(esk1_0))) ),
    inference(rw,[status(thm)],[644,112,theory(equality)]) ).

cnf(646,negated_conjecture,
    ( set_difference(the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0)
    | $false
    | $false ),
    inference(rw,[status(thm)],[645,291,theory(equality)]) ).

cnf(647,negated_conjecture,
    set_difference(the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0),
    inference(cn,[status(thm)],[646,theory(equality)]) ).

cnf(698,negated_conjecture,
    ~ element(esk2_0,powerset(the_carrier(esk1_0))),
    inference(spm,[status(thm)],[647,193,theory(equality)]) ).

cnf(699,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[698,112,theory(equality)]) ).

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

cnf(701,negated_conjecture,
    $false,
    700,
    [proof] ).

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