TSTP Solution File: NUM609+3 by SInE---0.4

View Problem - Process Solution

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

% Computer : n064.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:59 EST 2018

% Result   : Theorem 0.73s
% Output   : CNFRefutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :   96 (  32   ~;  25   |;  35   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn  12   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(19,conjecture,
    ( ! [X1] :
        ( aElementOf0(X1,xP)
       => aElementOf0(X1,xQ) )
    | aSubsetOf0(xP,xQ) ),
    file('/export/starexec/sandbox2/tmp/tmpY4CazQ/sel_theBenchmark.p_1',m__) ).

fof(95,axiom,
    ( aSet0(xP)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => sdtlseqdt0(szmzizndt0(xQ),X1) )
    & ! [X1] :
        ( aElementOf0(X1,xP)
      <=> ( aElement0(X1)
          & aElementOf0(X1,xQ)
          & ~ equal(X1,szmzizndt0(xQ)) ) )
    & equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
    file('/export/starexec/sandbox2/tmp/tmpY4CazQ/sel_theBenchmark.p_1',m__5164) ).

fof(108,negated_conjecture,
    ~ ( ! [X1] :
          ( aElementOf0(X1,xP)
         => aElementOf0(X1,xQ) )
      | aSubsetOf0(xP,xQ) ),
    inference(assume_negation,[status(cth)],[19]) ).

fof(234,negated_conjecture,
    ( ? [X1] :
        ( aElementOf0(X1,xP)
        & ~ aElementOf0(X1,xQ) )
    & ~ aSubsetOf0(xP,xQ) ),
    inference(fof_nnf,[status(thm)],[108]) ).

fof(235,negated_conjecture,
    ( ? [X2] :
        ( aElementOf0(X2,xP)
        & ~ aElementOf0(X2,xQ) )
    & ~ aSubsetOf0(xP,xQ) ),
    inference(variable_rename,[status(thm)],[234]) ).

fof(236,negated_conjecture,
    ( aElementOf0(esk8_0,xP)
    & ~ aElementOf0(esk8_0,xQ)
    & ~ aSubsetOf0(xP,xQ) ),
    inference(skolemize,[status(esa)],[235]) ).

cnf(238,negated_conjecture,
    ~ aElementOf0(esk8_0,xQ),
    inference(split_conjunct,[status(thm)],[236]) ).

cnf(239,negated_conjecture,
    aElementOf0(esk8_0,xP),
    inference(split_conjunct,[status(thm)],[236]) ).

fof(653,plain,
    ( aSet0(xP)
    & ! [X1] :
        ( ~ aElementOf0(X1,xQ)
        | sdtlseqdt0(szmzizndt0(xQ),X1) )
    & ! [X1] :
        ( ( ~ aElementOf0(X1,xP)
          | ( aElement0(X1)
            & aElementOf0(X1,xQ)
            & ~ equal(X1,szmzizndt0(xQ)) ) )
        & ( ~ aElement0(X1)
          | ~ aElementOf0(X1,xQ)
          | equal(X1,szmzizndt0(xQ))
          | aElementOf0(X1,xP) ) )
    & equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
    inference(fof_nnf,[status(thm)],[95]) ).

fof(654,plain,
    ( aSet0(xP)
    & ! [X2] :
        ( ~ aElementOf0(X2,xQ)
        | sdtlseqdt0(szmzizndt0(xQ),X2) )
    & ! [X3] :
        ( ( ~ aElementOf0(X3,xP)
          | ( aElement0(X3)
            & aElementOf0(X3,xQ)
            & ~ equal(X3,szmzizndt0(xQ)) ) )
        & ( ~ aElement0(X3)
          | ~ aElementOf0(X3,xQ)
          | equal(X3,szmzizndt0(xQ))
          | aElementOf0(X3,xP) ) )
    & equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
    inference(variable_rename,[status(thm)],[653]) ).

fof(655,plain,
    ! [X2,X3] :
      ( ( ~ aElementOf0(X3,xP)
        | ( aElement0(X3)
          & aElementOf0(X3,xQ)
          & ~ equal(X3,szmzizndt0(xQ)) ) )
      & ( ~ aElement0(X3)
        | ~ aElementOf0(X3,xQ)
        | equal(X3,szmzizndt0(xQ))
        | aElementOf0(X3,xP) )
      & ( ~ aElementOf0(X2,xQ)
        | sdtlseqdt0(szmzizndt0(xQ),X2) )
      & aSet0(xP)
      & equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
    inference(shift_quantors,[status(thm)],[654]) ).

fof(656,plain,
    ! [X2,X3] :
      ( ( aElement0(X3)
        | ~ aElementOf0(X3,xP) )
      & ( aElementOf0(X3,xQ)
        | ~ aElementOf0(X3,xP) )
      & ( ~ equal(X3,szmzizndt0(xQ))
        | ~ aElementOf0(X3,xP) )
      & ( ~ aElement0(X3)
        | ~ aElementOf0(X3,xQ)
        | equal(X3,szmzizndt0(xQ))
        | aElementOf0(X3,xP) )
      & ( ~ aElementOf0(X2,xQ)
        | sdtlseqdt0(szmzizndt0(xQ),X2) )
      & aSet0(xP)
      & equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
    inference(distribute,[status(thm)],[655]) ).

cnf(662,plain,
    ( aElementOf0(X1,xQ)
    | ~ aElementOf0(X1,xP) ),
    inference(split_conjunct,[status(thm)],[656]) ).

cnf(5362,negated_conjecture,
    aElementOf0(esk8_0,xQ),
    inference(spm,[status(thm)],[662,239,theory(equality)]) ).

cnf(5363,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[5362,238,theory(equality)]) ).

cnf(5364,negated_conjecture,
    $false,
    5363,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM609+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n064.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 10:35:14 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.28  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28  --creating new selector for []
% 0.73/0.95  -running prover on /export/starexec/sandbox2/tmp/tmpY4CazQ/sel_theBenchmark.p_1 with time limit 29
% 0.73/0.95  -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/tmpY4CazQ/sel_theBenchmark.p_1']
% 0.73/0.95  -prover status Theorem
% 0.73/0.95  Problem theBenchmark.p solved in phase 0.
% 0.73/0.95  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.95  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.95  Solved 1 out of 1.
% 0.73/0.95  # Problem is unsatisfiable (or provable), constructing proof object
% 0.73/0.95  # SZS status Theorem
% 0.73/0.95  # SZS output start CNFRefutation.
% See solution above
% 0.73/0.95  # SZS output end CNFRefutation
%------------------------------------------------------------------------------