↑ Up

SInE---0.4.THM-CRf.s

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

% Computer : n077.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:15 EST 2018

% Result   : Theorem 0.06s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   27 (   6 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   83 (  37   ~;  30   |;  12   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   40 (   2 sgn  22   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(10,conjecture,
    ! [X1] :
      ~ ! [X2] :
          ( ordinal(X2)
         => in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmpQe8BLH/sel_theBenchmark.p_1',t38_ordinal1) ).

fof(18,axiom,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( in(X3,X2)
    <=> ( in(X3,X1)
        & ordinal(X3) ) ),
    file('/export/starexec/sandbox/tmp/tmpQe8BLH/sel_theBenchmark.p_1',s1_xboole_0__e2_43__ordinal1) ).

fof(23,axiom,
    ! [X1] :
      ~ ! [X2] :
          ( in(X2,X1)
        <=> ordinal(X2) ),
    file('/export/starexec/sandbox/tmp/tmpQe8BLH/sel_theBenchmark.p_1',t37_ordinal1) ).

fof(34,negated_conjecture,
    ~ ! [X1] :
        ~ ! [X2] :
            ( ordinal(X2)
           => in(X2,X1) ),
    inference(assume_negation,[status(cth)],[10]) ).

fof(84,negated_conjecture,
    ? [X1] :
    ! [X2] :
      ( ~ ordinal(X2)
      | in(X2,X1) ),
    inference(fof_nnf,[status(thm)],[34]) ).

fof(85,negated_conjecture,
    ? [X3] :
    ! [X4] :
      ( ~ ordinal(X4)
      | in(X4,X3) ),
    inference(variable_rename,[status(thm)],[84]) ).

fof(86,negated_conjecture,
    ! [X4] :
      ( ~ ordinal(X4)
      | in(X4,esk6_0) ),
    inference(skolemize,[status(esa)],[85]) ).

cnf(87,negated_conjecture,
    ( in(X1,esk6_0)
    | ~ ordinal(X1) ),
    inference(split_conjunct,[status(thm)],[86]) ).

fof(117,plain,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( ( ~ in(X3,X2)
        | ( in(X3,X1)
          & ordinal(X3) ) )
      & ( ~ in(X3,X1)
        | ~ ordinal(X3)
        | in(X3,X2) ) ),
    inference(fof_nnf,[status(thm)],[18]) ).

fof(118,plain,
    ! [X4] :
    ? [X5] :
    ! [X6] :
      ( ( ~ in(X6,X5)
        | ( in(X6,X4)
          & ordinal(X6) ) )
      & ( ~ in(X6,X4)
        | ~ ordinal(X6)
        | in(X6,X5) ) ),
    inference(variable_rename,[status(thm)],[117]) ).

fof(119,plain,
    ! [X4,X6] :
      ( ( ~ in(X6,esk10_1(X4))
        | ( in(X6,X4)
          & ordinal(X6) ) )
      & ( ~ in(X6,X4)
        | ~ ordinal(X6)
        | in(X6,esk10_1(X4)) ) ),
    inference(skolemize,[status(esa)],[118]) ).

fof(120,plain,
    ! [X4,X6] :
      ( ( in(X6,X4)
        | ~ in(X6,esk10_1(X4)) )
      & ( ordinal(X6)
        | ~ in(X6,esk10_1(X4)) )
      & ( ~ in(X6,X4)
        | ~ ordinal(X6)
        | in(X6,esk10_1(X4)) ) ),
    inference(distribute,[status(thm)],[119]) ).

cnf(121,plain,
    ( in(X1,esk10_1(X2))
    | ~ ordinal(X1)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[120]) ).

cnf(122,plain,
    ( ordinal(X1)
    | ~ in(X1,esk10_1(X2)) ),
    inference(split_conjunct,[status(thm)],[120]) ).

fof(139,plain,
    ! [X1] :
    ? [X2] :
      ( ( ~ in(X2,X1)
        | ~ ordinal(X2) )
      & ( in(X2,X1)
        | ordinal(X2) ) ),
    inference(fof_nnf,[status(thm)],[23]) ).

fof(140,plain,
    ! [X3] :
    ? [X4] :
      ( ( ~ in(X4,X3)
        | ~ ordinal(X4) )
      & ( in(X4,X3)
        | ordinal(X4) ) ),
    inference(variable_rename,[status(thm)],[139]) ).

fof(141,plain,
    ! [X3] :
      ( ( ~ in(esk11_1(X3),X3)
        | ~ ordinal(esk11_1(X3)) )
      & ( in(esk11_1(X3),X3)
        | ordinal(esk11_1(X3)) ) ),
    inference(skolemize,[status(esa)],[140]) ).

cnf(142,plain,
    ( ordinal(esk11_1(X1))
    | in(esk11_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[141]) ).

cnf(143,plain,
    ( ~ ordinal(esk11_1(X1))
    | ~ in(esk11_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[141]) ).

cnf(210,plain,
    ordinal(esk11_1(esk10_1(X1))),
    inference(spm,[status(thm)],[122,142,theory(equality)]) ).

cnf(225,plain,
    ( ~ ordinal(esk11_1(esk10_1(X1)))
    | ~ in(esk11_1(esk10_1(X1)),X1) ),
    inference(spm,[status(thm)],[143,121,theory(equality)]) ).

cnf(304,plain,
    ( $false
    | ~ in(esk11_1(esk10_1(X1)),X1) ),
    inference(rw,[status(thm)],[225,210,theory(equality)]) ).

cnf(305,plain,
    ~ in(esk11_1(esk10_1(X1)),X1),
    inference(cn,[status(thm)],[304,theory(equality)]) ).

cnf(306,negated_conjecture,
    ~ ordinal(esk11_1(esk10_1(esk6_0))),
    inference(spm,[status(thm)],[305,87,theory(equality)]) ).

cnf(309,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[306,210,theory(equality)]) ).

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

cnf(311,negated_conjecture,
    $false,
    310,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM405+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 : n077.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 02:49:14 CST 2018
% 0.03/0.23  % CPUTime  : 
% 0.06/0.29  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.29  --creating new selector for []
% 0.06/0.36  -running prover on /export/starexec/sandbox/tmp/tmpQe8BLH/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.36  -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/tmpQe8BLH/sel_theBenchmark.p_1']
% 0.06/0.36  -prover status Theorem
% 0.06/0.36  Problem theBenchmark.p solved in phase 0.
% 0.06/0.36  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.36  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37  Solved 1 out of 1.
% 0.06/0.37  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37  # SZS status Theorem
% 0.06/0.37  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37  # SZS output end CNFRefutation
%------------------------------------------------------------------------------