↑ Up

SInE---0.4.THM-CRf.s

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

% Computer : n096.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:45 EST 2018

% Result   : Theorem 0.06s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   27 (   7 unt;   0 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   66 (  25   ~;  17   |;  21   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  14   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(4,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aElementOf0(X2,X1)
         => aElement0(X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmpOHt1Gu/sel_theBenchmark.p_1',mEOfElem) ).

fof(5,axiom,
    ( aSet0(xQ)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,xS) )
    & aSubsetOf0(xQ,xS)
    & equal(sbrdtbr0(xQ),xk)
    & aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
    file('/export/starexec/sandbox2/tmp/tmpOHt1Gu/sel_theBenchmark.p_1',m__2270) ).

fof(27,axiom,
    ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
      | equal(xQ,slcrc0) ),
    file('/export/starexec/sandbox2/tmp/tmpOHt1Gu/sel_theBenchmark.p_1',m__2313) ).

fof(44,conjecture,
    ? [X1] :
      ( aElement0(X1)
      & aElementOf0(X1,xQ) ),
    file('/export/starexec/sandbox2/tmp/tmpOHt1Gu/sel_theBenchmark.p_1',m__) ).

fof(69,negated_conjecture,
    ~ ? [X1] :
        ( aElement0(X1)
        & aElementOf0(X1,xQ) ),
    inference(assume_negation,[status(cth)],[44]) ).

fof(82,plain,
    ! [X1] :
      ( ~ aSet0(X1)
      | ! [X2] :
          ( ~ aElementOf0(X2,X1)
          | aElement0(X2) ) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(83,plain,
    ! [X3] :
      ( ~ aSet0(X3)
      | ! [X4] :
          ( ~ aElementOf0(X4,X3)
          | aElement0(X4) ) ),
    inference(variable_rename,[status(thm)],[82]) ).

fof(84,plain,
    ! [X3,X4] :
      ( ~ aElementOf0(X4,X3)
      | aElement0(X4)
      | ~ aSet0(X3) ),
    inference(shift_quantors,[status(thm)],[83]) ).

cnf(85,plain,
    ( aElement0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[84]) ).

fof(86,plain,
    ( aSet0(xQ)
    & ! [X1] :
        ( ~ aElementOf0(X1,xQ)
        | aElementOf0(X1,xS) )
    & aSubsetOf0(xQ,xS)
    & equal(sbrdtbr0(xQ),xk)
    & aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(87,plain,
    ( aSet0(xQ)
    & ! [X2] :
        ( ~ aElementOf0(X2,xQ)
        | aElementOf0(X2,xS) )
    & aSubsetOf0(xQ,xS)
    & equal(sbrdtbr0(xQ),xk)
    & aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
    inference(variable_rename,[status(thm)],[86]) ).

fof(88,plain,
    ! [X2] :
      ( ( ~ aElementOf0(X2,xQ)
        | aElementOf0(X2,xS) )
      & aSet0(xQ)
      & aSubsetOf0(xQ,xS)
      & equal(sbrdtbr0(xQ),xk)
      & aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
    inference(shift_quantors,[status(thm)],[87]) ).

cnf(92,plain,
    aSet0(xQ),
    inference(split_conjunct,[status(thm)],[88]) ).

fof(194,plain,
    ( ? [X1] : aElementOf0(X1,xQ)
    & ~ equal(xQ,slcrc0) ),
    inference(fof_nnf,[status(thm)],[27]) ).

fof(195,plain,
    ( ? [X2] : aElementOf0(X2,xQ)
    & ~ equal(xQ,slcrc0) ),
    inference(variable_rename,[status(thm)],[194]) ).

fof(196,plain,
    ( aElementOf0(esk6_0,xQ)
    & ~ equal(xQ,slcrc0) ),
    inference(skolemize,[status(esa)],[195]) ).

cnf(198,plain,
    aElementOf0(esk6_0,xQ),
    inference(split_conjunct,[status(thm)],[196]) ).

fof(276,negated_conjecture,
    ! [X1] :
      ( ~ aElement0(X1)
      | ~ aElementOf0(X1,xQ) ),
    inference(fof_nnf,[status(thm)],[69]) ).

fof(277,negated_conjecture,
    ! [X2] :
      ( ~ aElement0(X2)
      | ~ aElementOf0(X2,xQ) ),
    inference(variable_rename,[status(thm)],[276]) ).

cnf(278,negated_conjecture,
    ( ~ aElementOf0(X1,xQ)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[277]) ).

cnf(419,plain,
    ( aElement0(esk6_0)
    | ~ aSet0(xQ) ),
    inference(spm,[status(thm)],[85,198,theory(equality)]) ).

cnf(425,plain,
    ( aElement0(esk6_0)
    | $false ),
    inference(rw,[status(thm)],[419,92,theory(equality)]) ).

cnf(426,plain,
    aElement0(esk6_0),
    inference(cn,[status(thm)],[425,theory(equality)]) ).

cnf(1216,plain,
    ~ aElementOf0(esk6_0,xQ),
    inference(spm,[status(thm)],[278,426,theory(equality)]) ).

cnf(1219,plain,
    $false,
    inference(rw,[status(thm)],[1216,198,theory(equality)]) ).

cnf(1220,plain,
    $false,
    inference(cn,[status(thm)],[1219,theory(equality)]) ).

cnf(1221,plain,
    $false,
    1220,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM551+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n096.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.625MB
% 0.02/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Fri Jan  5 08:31:15 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.27  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27  --creating new selector for []
% 0.06/0.37  -running prover on /export/starexec/sandbox2/tmp/tmpOHt1Gu/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.37  -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpOHt1Gu/sel_theBenchmark.p_1']
% 0.06/0.37  -prover status Theorem
% 0.06/0.37  Problem theBenchmark.p solved in phase 0.
% 0.06/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37  % SZS status Ended for /export/starexec/sandbox2/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
%------------------------------------------------------------------------------