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

View Problem - Process Solution

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

% Computer : n040.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:00 EST 2018

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

% Comments : 
%------------------------------------------------------------------------------
fof(19,conjecture,
    ? [X1] :
      ( ( ( aElementOf0(X1,szDzozmdt0(xd))
          & equal(sdtlpdtrp0(xd,X1),szDzizrdt0(xd)) )
        | aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
      & equal(sdtlpdtrp0(xe,X1),xp) ),
    file('/export/starexec/sandbox/tmp/tmpkBPA41/sel_theBenchmark.p_1',m__) ).

fof(89,axiom,
    ? [X1] :
      ( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
      & equal(sdtlpdtrp0(xe,X1),xp) ),
    file('/export/starexec/sandbox/tmp/tmpkBPA41/sel_theBenchmark.p_1',m__5182) ).

fof(112,negated_conjecture,
    ~ ? [X1] :
        ( ( ( aElementOf0(X1,szDzozmdt0(xd))
            & equal(sdtlpdtrp0(xd,X1),szDzizrdt0(xd)) )
          | aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
        & equal(sdtlpdtrp0(xe,X1),xp) ),
    inference(assume_negation,[status(cth)],[19]) ).

fof(238,negated_conjecture,
    ! [X1] :
      ( ( ( ~ aElementOf0(X1,szDzozmdt0(xd))
          | ~ equal(sdtlpdtrp0(xd,X1),szDzizrdt0(xd)) )
        & ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
      | ~ equal(sdtlpdtrp0(xe,X1),xp) ),
    inference(fof_nnf,[status(thm)],[112]) ).

fof(239,negated_conjecture,
    ! [X2] :
      ( ( ( ~ aElementOf0(X2,szDzozmdt0(xd))
          | ~ equal(sdtlpdtrp0(xd,X2),szDzizrdt0(xd)) )
        & ~ aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
      | ~ equal(sdtlpdtrp0(xe,X2),xp) ),
    inference(variable_rename,[status(thm)],[238]) ).

fof(240,negated_conjecture,
    ! [X2] :
      ( ( ~ aElementOf0(X2,szDzozmdt0(xd))
        | ~ equal(sdtlpdtrp0(xd,X2),szDzizrdt0(xd))
        | ~ equal(sdtlpdtrp0(xe,X2),xp) )
      & ( ~ aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
        | ~ equal(sdtlpdtrp0(xe,X2),xp) ) ),
    inference(distribute,[status(thm)],[239]) ).

cnf(241,negated_conjecture,
    ( sdtlpdtrp0(xe,X1) != xp
    | ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    inference(split_conjunct,[status(thm)],[240]) ).

fof(627,plain,
    ? [X2] :
      ( aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
      & equal(sdtlpdtrp0(xe,X2),xp) ),
    inference(variable_rename,[status(thm)],[89]) ).

fof(628,plain,
    ( aElementOf0(esk27_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & equal(sdtlpdtrp0(xe,esk27_0),xp) ),
    inference(skolemize,[status(esa)],[627]) ).

cnf(629,plain,
    sdtlpdtrp0(xe,esk27_0) = xp,
    inference(split_conjunct,[status(thm)],[628]) ).

cnf(630,plain,
    aElementOf0(esk27_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    inference(split_conjunct,[status(thm)],[628]) ).

cnf(5592,plain,
    ~ aElementOf0(esk27_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    inference(spm,[status(thm)],[241,629,theory(equality)]) ).

cnf(5593,plain,
    $false,
    inference(rw,[status(thm)],[5592,630,theory(equality)]) ).

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

cnf(5595,plain,
    $false,
    5594,
    [proof] ).

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