↑ Up

SInE---0.4.THM-CRf.s

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

% Computer : n041.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 0.73s
% Output   : CNFRefutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   8 unt;   0 def)
%            Number of atoms       :   28 (   4 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   20 (   5   ~;   3   |;  11   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(26,axiom,
    ( aElementOf0(xp,xQ)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => sdtlseqdt0(xp,X1) )
    & equal(xp,szmzizndt0(xQ)) ),
    file('/export/starexec/sandbox2/tmp/tmpcpcoX3/sel_theBenchmark.p_1',m__5147) ).

fof(94,axiom,
    ( aElement0(xx)
    & aElementOf0(xx,xQ)
    & ~ equal(xx,szmzizndt0(xQ))
    & aElementOf0(xx,xP) ),
    file('/export/starexec/sandbox2/tmp/tmpcpcoX3/sel_theBenchmark.p_1',m__5348) ).

fof(112,axiom,
    equal(xp,xx),
    file('/export/starexec/sandbox2/tmp/tmpcpcoX3/sel_theBenchmark.p_1',m__5496) ).

fof(295,plain,
    ( aElementOf0(xp,xQ)
    & ! [X1] :
        ( ~ aElementOf0(X1,xQ)
        | sdtlseqdt0(xp,X1) )
    & equal(xp,szmzizndt0(xQ)) ),
    inference(fof_nnf,[status(thm)],[26]) ).

fof(296,plain,
    ( aElementOf0(xp,xQ)
    & ! [X2] :
        ( ~ aElementOf0(X2,xQ)
        | sdtlseqdt0(xp,X2) )
    & equal(xp,szmzizndt0(xQ)) ),
    inference(variable_rename,[status(thm)],[295]) ).

fof(297,plain,
    ! [X2] :
      ( ( ~ aElementOf0(X2,xQ)
        | sdtlseqdt0(xp,X2) )
      & aElementOf0(xp,xQ)
      & equal(xp,szmzizndt0(xQ)) ),
    inference(shift_quantors,[status(thm)],[296]) ).

cnf(298,plain,
    xp = szmzizndt0(xQ),
    inference(split_conjunct,[status(thm)],[297]) ).

cnf(657,plain,
    xx != szmzizndt0(xQ),
    inference(split_conjunct,[status(thm)],[94]) ).

cnf(4708,plain,
    xp = xx,
    inference(split_conjunct,[status(thm)],[112]) ).

cnf(5415,plain,
    szmzizndt0(xQ) = xx,
    inference(rw,[status(thm)],[298,4708,theory(equality)]) ).

cnf(5418,plain,
    $false,
    inference(rw,[status(thm)],[657,5415,theory(equality)]) ).

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

cnf(5420,plain,
    $false,
    5419,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM625+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 : n041.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:59:15 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 []
% 0.73/0.94  -running prover on /export/starexec/sandbox2/tmp/tmpcpcoX3/sel_theBenchmark.p_1 with time limit 29
% 0.73/0.94  -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/tmpcpcoX3/sel_theBenchmark.p_1']
% 0.73/0.94  -prover status Theorem
% 0.73/0.94  Problem theBenchmark.p solved in phase 0.
% 0.73/0.94  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.94  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.94  Solved 1 out of 1.
% 0.73/0.94  # Problem is unsatisfiable (or provable), constructing proof object
% 0.73/0.94  # SZS status Theorem
% 0.73/0.94  # SZS output start CNFRefutation.
% See solution above
% 0.73/0.94  # SZS output end CNFRefutation
%------------------------------------------------------------------------------