TSTP Solution File: NUM394+1 by SInE---0.4

View Problem - Process Solution

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

% Computer : n042.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.625MB
% OS       : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan  8 15:21:14 EST 2018

% Result   : Theorem 0.07s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   50 (  13 unt;   0 def)
%            Number of atoms       :  168 (   5 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  196 (  78   ~;  74   |;  31   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   59 (   2 sgn  42   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(7,axiom,
    ! [X1,X2] : subset(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1',reflexivity_r1_tarski) ).

fof(13,axiom,
    ! [X1] :
      ( ordinal(X1)
     => ( epsilon_transitive(X1)
        & epsilon_connected(X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1',cc1_ordinal1) ).

fof(16,conjecture,
    ! [X1] :
      ( ordinal(X1)
     => ! [X2] :
          ( ordinal(X2)
         => ( ordinal_subset(X1,X2)
            | in(X2,X1) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1',t26_ordinal1) ).

fof(20,axiom,
    ! [X1,X2] :
      ( ( ordinal(X1)
        & ordinal(X2) )
     => ( ordinal_subset(X1,X2)
      <=> subset(X1,X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1',redefinition_r1_ordinal1) ).

fof(21,axiom,
    ! [X1] :
      ( epsilon_transitive(X1)
    <=> ! [X2] :
          ( in(X2,X1)
         => subset(X2,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1',d2_ordinal1) ).

fof(22,axiom,
    ! [X1] :
      ( ordinal(X1)
     => ! [X2] :
          ( ordinal(X2)
         => ~ ( ~ in(X1,X2)
              & ~ equal(X1,X2)
              & ~ in(X2,X1) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1',t24_ordinal1) ).

fof(37,negated_conjecture,
    ~ ! [X1] :
        ( ordinal(X1)
       => ! [X2] :
            ( ordinal(X2)
           => ( ordinal_subset(X1,X2)
              | in(X2,X1) ) ) ),
    inference(assume_negation,[status(cth)],[16]) ).

fof(41,plain,
    ! [X1] :
      ( ordinal(X1)
     => ! [X2] :
          ( ordinal(X2)
         => ~ ( ~ in(X1,X2)
              & ~ equal(X1,X2)
              & ~ in(X2,X1) ) ) ),
    inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).

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

cnf(64,plain,
    subset(X1,X1),
    inference(split_conjunct,[status(thm)],[63]) ).

fof(84,plain,
    ! [X1] :
      ( ~ ordinal(X1)
      | ( epsilon_transitive(X1)
        & epsilon_connected(X1) ) ),
    inference(fof_nnf,[status(thm)],[13]) ).

fof(85,plain,
    ! [X2] :
      ( ~ ordinal(X2)
      | ( epsilon_transitive(X2)
        & epsilon_connected(X2) ) ),
    inference(variable_rename,[status(thm)],[84]) ).

fof(86,plain,
    ! [X2] :
      ( ( epsilon_transitive(X2)
        | ~ ordinal(X2) )
      & ( epsilon_connected(X2)
        | ~ ordinal(X2) ) ),
    inference(distribute,[status(thm)],[85]) ).

cnf(88,plain,
    ( epsilon_transitive(X1)
    | ~ ordinal(X1) ),
    inference(split_conjunct,[status(thm)],[86]) ).

fof(94,negated_conjecture,
    ? [X1] :
      ( ordinal(X1)
      & ? [X2] :
          ( ordinal(X2)
          & ~ ordinal_subset(X1,X2)
          & ~ in(X2,X1) ) ),
    inference(fof_nnf,[status(thm)],[37]) ).

fof(95,negated_conjecture,
    ? [X3] :
      ( ordinal(X3)
      & ? [X4] :
          ( ordinal(X4)
          & ~ ordinal_subset(X3,X4)
          & ~ in(X4,X3) ) ),
    inference(variable_rename,[status(thm)],[94]) ).

fof(96,negated_conjecture,
    ( ordinal(esk6_0)
    & ordinal(esk7_0)
    & ~ ordinal_subset(esk6_0,esk7_0)
    & ~ in(esk7_0,esk6_0) ),
    inference(skolemize,[status(esa)],[95]) ).

cnf(97,negated_conjecture,
    ~ in(esk7_0,esk6_0),
    inference(split_conjunct,[status(thm)],[96]) ).

cnf(98,negated_conjecture,
    ~ ordinal_subset(esk6_0,esk7_0),
    inference(split_conjunct,[status(thm)],[96]) ).

cnf(99,negated_conjecture,
    ordinal(esk7_0),
    inference(split_conjunct,[status(thm)],[96]) ).

cnf(100,negated_conjecture,
    ordinal(esk6_0),
    inference(split_conjunct,[status(thm)],[96]) ).

fof(116,plain,
    ! [X1,X2] :
      ( ~ ordinal(X1)
      | ~ ordinal(X2)
      | ( ( ~ ordinal_subset(X1,X2)
          | subset(X1,X2) )
        & ( ~ subset(X1,X2)
          | ordinal_subset(X1,X2) ) ) ),
    inference(fof_nnf,[status(thm)],[20]) ).

fof(117,plain,
    ! [X3,X4] :
      ( ~ ordinal(X3)
      | ~ ordinal(X4)
      | ( ( ~ ordinal_subset(X3,X4)
          | subset(X3,X4) )
        & ( ~ subset(X3,X4)
          | ordinal_subset(X3,X4) ) ) ),
    inference(variable_rename,[status(thm)],[116]) ).

fof(118,plain,
    ! [X3,X4] :
      ( ( ~ ordinal_subset(X3,X4)
        | subset(X3,X4)
        | ~ ordinal(X3)
        | ~ ordinal(X4) )
      & ( ~ subset(X3,X4)
        | ordinal_subset(X3,X4)
        | ~ ordinal(X3)
        | ~ ordinal(X4) ) ),
    inference(distribute,[status(thm)],[117]) ).

cnf(119,plain,
    ( ordinal_subset(X2,X1)
    | ~ ordinal(X1)
    | ~ ordinal(X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[118]) ).

fof(121,plain,
    ! [X1] :
      ( ( ~ epsilon_transitive(X1)
        | ! [X2] :
            ( ~ in(X2,X1)
            | subset(X2,X1) ) )
      & ( ? [X2] :
            ( in(X2,X1)
            & ~ subset(X2,X1) )
        | epsilon_transitive(X1) ) ),
    inference(fof_nnf,[status(thm)],[21]) ).

fof(122,plain,
    ! [X3] :
      ( ( ~ epsilon_transitive(X3)
        | ! [X4] :
            ( ~ in(X4,X3)
            | subset(X4,X3) ) )
      & ( ? [X5] :
            ( in(X5,X3)
            & ~ subset(X5,X3) )
        | epsilon_transitive(X3) ) ),
    inference(variable_rename,[status(thm)],[121]) ).

fof(123,plain,
    ! [X3] :
      ( ( ~ epsilon_transitive(X3)
        | ! [X4] :
            ( ~ in(X4,X3)
            | subset(X4,X3) ) )
      & ( ( in(esk10_1(X3),X3)
          & ~ subset(esk10_1(X3),X3) )
        | epsilon_transitive(X3) ) ),
    inference(skolemize,[status(esa)],[122]) ).

fof(124,plain,
    ! [X3,X4] :
      ( ( ~ in(X4,X3)
        | subset(X4,X3)
        | ~ epsilon_transitive(X3) )
      & ( ( in(esk10_1(X3),X3)
          & ~ subset(esk10_1(X3),X3) )
        | epsilon_transitive(X3) ) ),
    inference(shift_quantors,[status(thm)],[123]) ).

fof(125,plain,
    ! [X3,X4] :
      ( ( ~ in(X4,X3)
        | subset(X4,X3)
        | ~ epsilon_transitive(X3) )
      & ( in(esk10_1(X3),X3)
        | epsilon_transitive(X3) )
      & ( ~ subset(esk10_1(X3),X3)
        | epsilon_transitive(X3) ) ),
    inference(distribute,[status(thm)],[124]) ).

cnf(128,plain,
    ( subset(X2,X1)
    | ~ epsilon_transitive(X1)
    | ~ in(X2,X1) ),
    inference(split_conjunct,[status(thm)],[125]) ).

fof(129,plain,
    ! [X1] :
      ( ~ ordinal(X1)
      | ! [X2] :
          ( ~ ordinal(X2)
          | in(X1,X2)
          | equal(X1,X2)
          | in(X2,X1) ) ),
    inference(fof_nnf,[status(thm)],[41]) ).

fof(130,plain,
    ! [X3] :
      ( ~ ordinal(X3)
      | ! [X4] :
          ( ~ ordinal(X4)
          | in(X3,X4)
          | equal(X3,X4)
          | in(X4,X3) ) ),
    inference(variable_rename,[status(thm)],[129]) ).

fof(131,plain,
    ! [X3,X4] :
      ( ~ ordinal(X4)
      | in(X3,X4)
      | equal(X3,X4)
      | in(X4,X3)
      | ~ ordinal(X3) ),
    inference(shift_quantors,[status(thm)],[130]) ).

cnf(132,plain,
    ( in(X2,X1)
    | X1 = X2
    | in(X1,X2)
    | ~ ordinal(X1)
    | ~ ordinal(X2) ),
    inference(split_conjunct,[status(thm)],[131]) ).

cnf(201,negated_conjecture,
    ( ~ subset(esk6_0,esk7_0)
    | ~ ordinal(esk6_0)
    | ~ ordinal(esk7_0) ),
    inference(spm,[status(thm)],[98,119,theory(equality)]) ).

cnf(202,negated_conjecture,
    ( ~ subset(esk6_0,esk7_0)
    | $false
    | ~ ordinal(esk7_0) ),
    inference(rw,[status(thm)],[201,100,theory(equality)]) ).

cnf(203,negated_conjecture,
    ( ~ subset(esk6_0,esk7_0)
    | $false
    | $false ),
    inference(rw,[status(thm)],[202,99,theory(equality)]) ).

cnf(204,negated_conjecture,
    ~ subset(esk6_0,esk7_0),
    inference(cn,[status(thm)],[203,theory(equality)]) ).

cnf(208,negated_conjecture,
    ( X1 = esk6_0
    | in(X1,esk6_0)
    | in(esk6_0,X1)
    | ~ ordinal(X1) ),
    inference(spm,[status(thm)],[132,100,theory(equality)]) ).

cnf(214,plain,
    ( subset(X1,X2)
    | ~ in(X1,X2)
    | ~ ordinal(X2) ),
    inference(spm,[status(thm)],[128,88,theory(equality)]) ).

cnf(299,negated_conjecture,
    ( esk7_0 = esk6_0
    | in(esk6_0,esk7_0)
    | in(esk7_0,esk6_0) ),
    inference(spm,[status(thm)],[208,99,theory(equality)]) ).

cnf(301,negated_conjecture,
    ( esk7_0 = esk6_0
    | in(esk6_0,esk7_0) ),
    inference(sr,[status(thm)],[299,97,theory(equality)]) ).

cnf(330,negated_conjecture,
    ( ~ in(esk6_0,esk7_0)
    | ~ ordinal(esk7_0) ),
    inference(spm,[status(thm)],[204,214,theory(equality)]) ).

cnf(333,negated_conjecture,
    ( ~ in(esk6_0,esk7_0)
    | $false ),
    inference(rw,[status(thm)],[330,99,theory(equality)]) ).

cnf(334,negated_conjecture,
    ~ in(esk6_0,esk7_0),
    inference(cn,[status(thm)],[333,theory(equality)]) ).

cnf(335,negated_conjecture,
    esk7_0 = esk6_0,
    inference(sr,[status(thm)],[301,334,theory(equality)]) ).

cnf(345,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[204,335,theory(equality)]),64,theory(equality)]) ).

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

cnf(347,negated_conjecture,
    $false,
    346,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM394+1 : TPTP v7.0.0. Released v3.2.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.03/0.23  % Computer : n042.star.cs.uiowa.edu
% 0.03/0.23  % Model    : x86_64 x86_64
% 0.03/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23  % Memory   : 32218.625MB
% 0.03/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23  % CPULimit : 300
% 0.03/0.23  % DateTime : Fri Jan  5 03:50:30 CST 2018
% 0.03/0.23  % CPUTime  : 
% 0.07/0.28  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.28  --creating new selector for []
% 0.07/0.35  -running prover on /export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.35  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp6R21j0/sel_theBenchmark.p_1']
% 0.07/0.35  -prover status Theorem
% 0.07/0.35  Problem theBenchmark.p solved in phase 0.
% 0.07/0.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  Solved 1 out of 1.
% 0.07/0.35  # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.35  # SZS status Theorem
% 0.07/0.35  # SZS output start CNFRefutation.
% See solution above
% 0.07/0.35  # SZS output end CNFRefutation
%------------------------------------------------------------------------------