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

View Problem - Process Solution

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

% Computer : n129.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:22:02 EST 2018

% Result   : Theorem 3.66s
% Output   : CNFRefutation 3.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (  11 unt;   0 def)
%            Number of atoms       :   69 (   1 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   64 (  18   ~;  15   |;  28   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(13,axiom,
    ( aFunction0(xe)
    & equal(szDzozmdt0(xe),szNzAzT0)
    & ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
          & ! [X2] :
              ( aElementOf0(X2,sdtlpdtrp0(xN,X1))
             => sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
          & equal(sdtlpdtrp0(xe,X1),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmpmo0lsG/sel_theBenchmark.p_1',m__4660) ).

fof(19,conjecture,
    aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    file('/export/starexec/sandbox2/tmp/tmpmo0lsG/sel_theBenchmark.p_1',m__) ).

fof(85,axiom,
    ( aElementOf0(xn,szDzozmdt0(xd))
    & equal(sdtlpdtrp0(xd,xn),szDzizrdt0(xd))
    & aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(xn,szNzAzT0)
    & equal(sdtlpdtrp0(xe,xn),xp) ),
    file('/export/starexec/sandbox2/tmp/tmpmo0lsG/sel_theBenchmark.p_1',m__5309) ).

fof(91,axiom,
    ( ! [X1] :
        ( aElementOf0(X1,sdtlpdtrp0(xN,xn))
       => aElementOf0(X1,sdtlpdtrp0(xN,xm)) )
    & aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
    file('/export/starexec/sandbox2/tmp/tmpmo0lsG/sel_theBenchmark.p_1',m__5461) ).

fof(120,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(assume_negation,[status(cth)],[19]) ).

fof(122,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(fof_simplification,[status(thm)],[120,theory(equality)]) ).

fof(217,plain,
    ( aFunction0(xe)
    & equal(szDzozmdt0(xe),szNzAzT0)
    & ! [X1] :
        ( ~ aElementOf0(X1,szNzAzT0)
        | ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
          & ! [X2] :
              ( ~ aElementOf0(X2,sdtlpdtrp0(xN,X1))
              | sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
          & equal(sdtlpdtrp0(xe,X1),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ) ),
    inference(fof_nnf,[status(thm)],[13]) ).

fof(218,plain,
    ( aFunction0(xe)
    & equal(szDzozmdt0(xe),szNzAzT0)
    & ! [X3] :
        ( ~ aElementOf0(X3,szNzAzT0)
        | ( aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))
          & ! [X4] :
              ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
              | sdtlseqdt0(sdtlpdtrp0(xe,X3),X4) )
          & equal(sdtlpdtrp0(xe,X3),szmzizndt0(sdtlpdtrp0(xN,X3))) ) ) ),
    inference(variable_rename,[status(thm)],[217]) ).

fof(219,plain,
    ! [X3,X4] :
      ( ( ( ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
            | sdtlseqdt0(sdtlpdtrp0(xe,X3),X4) )
          & aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))
          & equal(sdtlpdtrp0(xe,X3),szmzizndt0(sdtlpdtrp0(xN,X3))) )
        | ~ aElementOf0(X3,szNzAzT0) )
      & aFunction0(xe)
      & equal(szDzozmdt0(xe),szNzAzT0) ),
    inference(shift_quantors,[status(thm)],[218]) ).

fof(220,plain,
    ! [X3,X4] :
      ( ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
        | sdtlseqdt0(sdtlpdtrp0(xe,X3),X4)
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( equal(sdtlpdtrp0(xe,X3),szmzizndt0(sdtlpdtrp0(xN,X3)))
        | ~ aElementOf0(X3,szNzAzT0) )
      & aFunction0(xe)
      & equal(szDzozmdt0(xe),szNzAzT0) ),
    inference(distribute,[status(thm)],[219]) ).

cnf(224,plain,
    ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[220]) ).

cnf(247,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(split_conjunct,[status(thm)],[122]) ).

cnf(621,plain,
    sdtlpdtrp0(xe,xn) = xp,
    inference(split_conjunct,[status(thm)],[85]) ).

cnf(622,plain,
    aElementOf0(xn,szNzAzT0),
    inference(split_conjunct,[status(thm)],[85]) ).

fof(643,plain,
    ( ! [X1] :
        ( ~ aElementOf0(X1,sdtlpdtrp0(xN,xn))
        | aElementOf0(X1,sdtlpdtrp0(xN,xm)) )
    & aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
    inference(fof_nnf,[status(thm)],[91]) ).

fof(644,plain,
    ( ! [X2] :
        ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xn))
        | aElementOf0(X2,sdtlpdtrp0(xN,xm)) )
    & aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
    inference(variable_rename,[status(thm)],[643]) ).

fof(645,plain,
    ! [X2] :
      ( ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xn))
        | aElementOf0(X2,sdtlpdtrp0(xN,xm)) )
      & aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
    inference(shift_quantors,[status(thm)],[644]) ).

cnf(647,plain,
    ( aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,xn)) ),
    inference(split_conjunct,[status(thm)],[645]) ).

cnf(5596,plain,
    aElementOf0(sdtlpdtrp0(xe,xn),sdtlpdtrp0(xN,xn)),
    inference(spm,[status(thm)],[224,622,theory(equality)]) ).

cnf(5600,plain,
    aElementOf0(xp,sdtlpdtrp0(xN,xn)),
    inference(rw,[status(thm)],[5596,621,theory(equality)]) ).

cnf(29886,plain,
    aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(spm,[status(thm)],[647,5600,theory(equality)]) ).

cnf(29917,plain,
    $false,
    inference(sr,[status(thm)],[29886,247,theory(equality)]) ).

cnf(29918,plain,
    $false,
    29917,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM622+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.24  % Computer : n129.star.cs.uiowa.edu
% 0.02/0.24  % Model    : x86_64 x86_64
% 0.02/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24  % Memory   : 32218.625MB
% 0.02/0.24  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24  % CPULimit : 300
% 0.02/0.24  % DateTime : Fri Jan  5 10:55:45 CST 2018
% 0.02/0.24  % CPUTime  : 
% 0.07/0.28  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.29  --creating new selector for []
% 3.66/3.87  -running prover on /export/starexec/sandbox2/tmp/tmpmo0lsG/sel_theBenchmark.p_1 with time limit 29
% 3.66/3.87  -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/tmpmo0lsG/sel_theBenchmark.p_1']
% 3.66/3.87  -prover status Theorem
% 3.66/3.87  Problem theBenchmark.p solved in phase 0.
% 3.66/3.87  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.66/3.87  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.66/3.87  Solved 1 out of 1.
% 3.66/3.87  # Problem is unsatisfiable (or provable), constructing proof object
% 3.66/3.87  # SZS status Theorem
% 3.66/3.87  # SZS output start CNFRefutation.
% See solution above
% 3.66/3.87  # SZS output end CNFRefutation
%------------------------------------------------------------------------------