↑ Up

SInE---0.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : GEO082+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 08:08:32 EST 2010

% Result   : Theorem 0.23s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   33 (   9 unt;   0 def)
%            Number of atoms       :  102 (  17 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  106 (  37   ~;  41   |;  22   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   51 (   0 sgn  33   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X2,X3] :
      ( part_of(X3,X2)
    <=> ! [X1] :
          ( incident_c(X1,X3)
         => incident_c(X1,X2) ) ),
    file('/tmp/tmpgX4O49/sel_GEO082+1.p_1',part_of_defn) ).

fof(3,axiom,
    ! [X2,X3] :
      ( ! [X1] :
          ( incident_c(X1,X2)
        <=> incident_c(X1,X3) )
     => X2 = X3 ),
    file('/tmp/tmpgX4O49/sel_GEO082+1.p_1',c9) ).

fof(7,conjecture,
    ! [X3,X4] :
      ( ( part_of(X3,X4)
        & part_of(X4,X3) )
     => X3 = X4 ),
    file('/tmp/tmpgX4O49/sel_GEO082+1.p_1',part_of_antisymmetry) ).

fof(8,negated_conjecture,
    ~ ! [X3,X4] :
        ( ( part_of(X3,X4)
          & part_of(X4,X3) )
       => X3 = X4 ),
    inference(assume_negation,[status(cth)],[7]) ).

fof(22,plain,
    ! [X2,X3] :
      ( ( ~ part_of(X3,X2)
        | ! [X1] :
            ( ~ incident_c(X1,X3)
            | incident_c(X1,X2) ) )
      & ( ? [X1] :
            ( incident_c(X1,X3)
            & ~ incident_c(X1,X2) )
        | part_of(X3,X2) ) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(23,plain,
    ! [X4,X5] :
      ( ( ~ part_of(X5,X4)
        | ! [X6] :
            ( ~ incident_c(X6,X5)
            | incident_c(X6,X4) ) )
      & ( ? [X7] :
            ( incident_c(X7,X5)
            & ~ incident_c(X7,X4) )
        | part_of(X5,X4) ) ),
    inference(variable_rename,[status(thm)],[22]) ).

fof(24,plain,
    ! [X4,X5] :
      ( ( ~ part_of(X5,X4)
        | ! [X6] :
            ( ~ incident_c(X6,X5)
            | incident_c(X6,X4) ) )
      & ( ( incident_c(esk3_2(X4,X5),X5)
          & ~ incident_c(esk3_2(X4,X5),X4) )
        | part_of(X5,X4) ) ),
    inference(skolemize,[status(esa)],[23]) ).

fof(25,plain,
    ! [X4,X5,X6] :
      ( ( ~ incident_c(X6,X5)
        | incident_c(X6,X4)
        | ~ part_of(X5,X4) )
      & ( ( incident_c(esk3_2(X4,X5),X5)
          & ~ incident_c(esk3_2(X4,X5),X4) )
        | part_of(X5,X4) ) ),
    inference(shift_quantors,[status(thm)],[24]) ).

fof(26,plain,
    ! [X4,X5,X6] :
      ( ( ~ incident_c(X6,X5)
        | incident_c(X6,X4)
        | ~ part_of(X5,X4) )
      & ( incident_c(esk3_2(X4,X5),X5)
        | part_of(X5,X4) )
      & ( ~ incident_c(esk3_2(X4,X5),X4)
        | part_of(X5,X4) ) ),
    inference(distribute,[status(thm)],[25]) ).

cnf(29,plain,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    inference(split_conjunct,[status(thm)],[26]) ).

fof(30,plain,
    ! [X2,X3] :
      ( ? [X1] :
          ( ( ~ incident_c(X1,X2)
            | ~ incident_c(X1,X3) )
          & ( incident_c(X1,X2)
            | incident_c(X1,X3) ) )
      | X2 = X3 ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(31,plain,
    ! [X4,X5] :
      ( ? [X6] :
          ( ( ~ incident_c(X6,X4)
            | ~ incident_c(X6,X5) )
          & ( incident_c(X6,X4)
            | incident_c(X6,X5) ) )
      | X4 = X5 ),
    inference(variable_rename,[status(thm)],[30]) ).

fof(32,plain,
    ! [X4,X5] :
      ( ( ( ~ incident_c(esk4_2(X4,X5),X4)
          | ~ incident_c(esk4_2(X4,X5),X5) )
        & ( incident_c(esk4_2(X4,X5),X4)
          | incident_c(esk4_2(X4,X5),X5) ) )
      | X4 = X5 ),
    inference(skolemize,[status(esa)],[31]) ).

fof(33,plain,
    ! [X4,X5] :
      ( ( ~ incident_c(esk4_2(X4,X5),X4)
        | ~ incident_c(esk4_2(X4,X5),X5)
        | X4 = X5 )
      & ( incident_c(esk4_2(X4,X5),X4)
        | incident_c(esk4_2(X4,X5),X5)
        | X4 = X5 ) ),
    inference(distribute,[status(thm)],[32]) ).

cnf(34,plain,
    ( X1 = X2
    | incident_c(esk4_2(X1,X2),X2)
    | incident_c(esk4_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[33]) ).

cnf(35,plain,
    ( X1 = X2
    | ~ incident_c(esk4_2(X1,X2),X2)
    | ~ incident_c(esk4_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[33]) ).

fof(49,negated_conjecture,
    ? [X3,X4] :
      ( part_of(X3,X4)
      & part_of(X4,X3)
      & X3 != X4 ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(50,negated_conjecture,
    ? [X5,X6] :
      ( part_of(X5,X6)
      & part_of(X6,X5)
      & X5 != X6 ),
    inference(variable_rename,[status(thm)],[49]) ).

fof(51,negated_conjecture,
    ( part_of(esk6_0,esk7_0)
    & part_of(esk7_0,esk6_0)
    & esk6_0 != esk7_0 ),
    inference(skolemize,[status(esa)],[50]) ).

cnf(52,negated_conjecture,
    esk6_0 != esk7_0,
    inference(split_conjunct,[status(thm)],[51]) ).

cnf(53,negated_conjecture,
    part_of(esk7_0,esk6_0),
    inference(split_conjunct,[status(thm)],[51]) ).

cnf(54,negated_conjecture,
    part_of(esk6_0,esk7_0),
    inference(split_conjunct,[status(thm)],[51]) ).

cnf(56,negated_conjecture,
    ( incident_c(X1,esk7_0)
    | ~ incident_c(X1,esk6_0) ),
    inference(spm,[status(thm)],[29,54,theory(equality)]) ).

cnf(57,negated_conjecture,
    ( incident_c(X1,esk6_0)
    | ~ incident_c(X1,esk7_0) ),
    inference(spm,[status(thm)],[29,53,theory(equality)]) ).

cnf(73,negated_conjecture,
    ( incident_c(esk4_2(esk6_0,X1),esk7_0)
    | esk6_0 = X1
    | incident_c(esk4_2(esk6_0,X1),X1) ),
    inference(spm,[status(thm)],[56,34,theory(equality)]) ).

cnf(94,negated_conjecture,
    ( esk6_0 = esk7_0
    | incident_c(esk4_2(esk6_0,esk7_0),esk7_0) ),
    inference(ef,[status(thm)],[73,theory(equality)]) ).

cnf(101,negated_conjecture,
    incident_c(esk4_2(esk6_0,esk7_0),esk7_0),
    inference(sr,[status(thm)],[94,52,theory(equality)]) ).

cnf(103,negated_conjecture,
    ( esk6_0 = esk7_0
    | ~ incident_c(esk4_2(esk6_0,esk7_0),esk6_0) ),
    inference(spm,[status(thm)],[35,101,theory(equality)]) ).

cnf(105,negated_conjecture,
    ~ incident_c(esk4_2(esk6_0,esk7_0),esk6_0),
    inference(sr,[status(thm)],[103,52,theory(equality)]) ).

cnf(118,negated_conjecture,
    ~ incident_c(esk4_2(esk6_0,esk7_0),esk7_0),
    inference(spm,[status(thm)],[105,57,theory(equality)]) ).

cnf(121,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[118,101,theory(equality)]) ).

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

cnf(123,negated_conjecture,
    $false,
    122,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO082+1.p
% --creating new selector for [GEO004+0.ax]
% -running prover on /tmp/tmpgX4O49/sel_GEO082+1.p_1 with time limit 29
% -prover status Theorem
% Problem GEO082+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO082+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO082+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
% 
%------------------------------------------------------------------------------