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

View Problem - Process Solution

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

% Computer : n094.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      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (  10 unt;   0 def)
%            Number of atoms       :   76 (  10 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   87 (  36   ~;  30   |;  18   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-1 aty)
%            Number of variables   :   21 (   0 sgn  15   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(10,axiom,
    ( aSet0(xS)
    & aSet0(xT)
    & ~ equal(xk,sz00) ),
    file('/export/starexec/sandbox2/tmp/tmp27jpNA/sel_theBenchmark.p_1',m__2202_02) ).

fof(32,axiom,
    ! [X1] :
      ( equal(X1,slcrc0)
    <=> ( aSet0(X1)
        & ~ ? [X2] : aElementOf0(X2,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp27jpNA/sel_theBenchmark.p_1',mDefEmp) ).

fof(43,conjecture,
    ~ equal(xQ,slcrc0),
    file('/export/starexec/sandbox2/tmp/tmp27jpNA/sel_theBenchmark.p_1',m__) ).

fof(48,axiom,
    ( aSet0(xQ)
    & isFinite0(xQ)
    & equal(sbrdtbr0(xQ),xk) ),
    file('/export/starexec/sandbox2/tmp/tmp27jpNA/sel_theBenchmark.p_1',m__2291) ).

fof(50,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ( equal(sbrdtbr0(X1),sz00)
      <=> equal(X1,slcrc0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp27jpNA/sel_theBenchmark.p_1',mCardEmpty) ).

fof(68,negated_conjecture,
    ~ ~ equal(xQ,slcrc0),
    inference(assume_negation,[status(cth)],[43]) ).

fof(73,negated_conjecture,
    equal(xQ,slcrc0),
    inference(fof_simplification,[status(thm)],[68,theory(equality)]) ).

cnf(113,plain,
    xk != sz00,
    inference(split_conjunct,[status(thm)],[10]) ).

fof(207,plain,
    ! [X1] :
      ( ( ~ equal(X1,slcrc0)
        | ( aSet0(X1)
          & ! [X2] : ~ aElementOf0(X2,X1) ) )
      & ( ~ aSet0(X1)
        | ? [X2] : aElementOf0(X2,X1)
        | equal(X1,slcrc0) ) ),
    inference(fof_nnf,[status(thm)],[32]) ).

fof(208,plain,
    ! [X3] :
      ( ( ~ equal(X3,slcrc0)
        | ( aSet0(X3)
          & ! [X4] : ~ aElementOf0(X4,X3) ) )
      & ( ~ aSet0(X3)
        | ? [X5] : aElementOf0(X5,X3)
        | equal(X3,slcrc0) ) ),
    inference(variable_rename,[status(thm)],[207]) ).

fof(209,plain,
    ! [X3] :
      ( ( ~ equal(X3,slcrc0)
        | ( aSet0(X3)
          & ! [X4] : ~ aElementOf0(X4,X3) ) )
      & ( ~ aSet0(X3)
        | aElementOf0(esk6_1(X3),X3)
        | equal(X3,slcrc0) ) ),
    inference(skolemize,[status(esa)],[208]) ).

fof(210,plain,
    ! [X3,X4] :
      ( ( ( ~ aElementOf0(X4,X3)
          & aSet0(X3) )
        | ~ equal(X3,slcrc0) )
      & ( ~ aSet0(X3)
        | aElementOf0(esk6_1(X3),X3)
        | equal(X3,slcrc0) ) ),
    inference(shift_quantors,[status(thm)],[209]) ).

fof(211,plain,
    ! [X3,X4] :
      ( ( ~ aElementOf0(X4,X3)
        | ~ equal(X3,slcrc0) )
      & ( aSet0(X3)
        | ~ equal(X3,slcrc0) )
      & ( ~ aSet0(X3)
        | aElementOf0(esk6_1(X3),X3)
        | equal(X3,slcrc0) ) ),
    inference(distribute,[status(thm)],[210]) ).

cnf(213,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    inference(split_conjunct,[status(thm)],[211]) ).

cnf(264,negated_conjecture,
    xQ = slcrc0,
    inference(split_conjunct,[status(thm)],[73]) ).

cnf(277,plain,
    sbrdtbr0(xQ) = xk,
    inference(split_conjunct,[status(thm)],[48]) ).

fof(292,plain,
    ! [X1] :
      ( ~ aSet0(X1)
      | ( ( ~ equal(sbrdtbr0(X1),sz00)
          | equal(X1,slcrc0) )
        & ( ~ equal(X1,slcrc0)
          | equal(sbrdtbr0(X1),sz00) ) ) ),
    inference(fof_nnf,[status(thm)],[50]) ).

fof(293,plain,
    ! [X2] :
      ( ~ aSet0(X2)
      | ( ( ~ equal(sbrdtbr0(X2),sz00)
          | equal(X2,slcrc0) )
        & ( ~ equal(X2,slcrc0)
          | equal(sbrdtbr0(X2),sz00) ) ) ),
    inference(variable_rename,[status(thm)],[292]) ).

fof(294,plain,
    ! [X2] :
      ( ( ~ equal(sbrdtbr0(X2),sz00)
        | equal(X2,slcrc0)
        | ~ aSet0(X2) )
      & ( ~ equal(X2,slcrc0)
        | equal(sbrdtbr0(X2),sz00)
        | ~ aSet0(X2) ) ),
    inference(distribute,[status(thm)],[293]) ).

cnf(295,plain,
    ( sbrdtbr0(X1) = sz00
    | ~ aSet0(X1)
    | X1 != slcrc0 ),
    inference(split_conjunct,[status(thm)],[294]) ).

cnf(358,plain,
    sbrdtbr0(slcrc0) = xk,
    inference(rw,[status(thm)],[277,264,theory(equality)]) ).

cnf(368,plain,
    ( sbrdtbr0(X1) = sz00
    | slcrc0 != X1 ),
    inference(csr,[status(thm)],[295,213]) ).

cnf(369,plain,
    sz00 = xk,
    inference(spm,[status(thm)],[358,368,theory(equality)]) ).

cnf(371,plain,
    $false,
    inference(sr,[status(thm)],[369,113,theory(equality)]) ).

cnf(372,plain,
    $false,
    371,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM550+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.22  % Computer : n094.star.cs.uiowa.edu
% 0.02/0.22  % Model    : x86_64 x86_64
% 0.02/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22  % Memory   : 32218.625MB
% 0.02/0.22  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22  % CPULimit : 300
% 0.02/0.22  % DateTime : Fri Jan  5 08:26:45 CST 2018
% 0.02/0.22  % CPUTime  : 
% 0.02/0.27  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27  --creating new selector for []
% 0.06/0.34  -running prover on /export/starexec/sandbox2/tmp/tmp27jpNA/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.34  -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/tmp27jpNA/sel_theBenchmark.p_1']
% 0.06/0.34  -prover status Theorem
% 0.06/0.34  Problem theBenchmark.p solved in phase 0.
% 0.06/0.34  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.34  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.34  Solved 1 out of 1.
% 0.06/0.34  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.34  # SZS status Theorem
% 0.06/0.34  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.34  # SZS output end CNFRefutation
%------------------------------------------------------------------------------