↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM514+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:57:38 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ( aNaturalNumber0(sdtsldt0(xn,xr))
      & xn = sdtasdt0(xr,sdtsldt0(xn,xr)) )
   => ( ? [X1] :
          ( aNaturalNumber0(X1)
          & sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X1) )
      | doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__2613,hypothesis,
    ( aNaturalNumber0(sdtsldt0(xk,xr))
    & xk = sdtasdt0(xr,sdtsldt0(xk,xr))
    & aNaturalNumber0(sdtsldt0(xn,xr))
    & xn = sdtasdt0(xr,sdtsldt0(xn,xr))
    & sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2613) ).

fof(c_0_2,negated_conjecture,
    ~ ( ( aNaturalNumber0(sdtsldt0(xn,xr))
        & xn = sdtasdt0(xr,sdtsldt0(xn,xr)) )
     => ( ? [X1] :
            ( aNaturalNumber0(X1)
            & sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X1) )
        | doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_3,negated_conjecture,
    ! [X221] :
      ( aNaturalNumber0(sdtsldt0(xn,xr))
      & xn = sdtasdt0(xr,sdtsldt0(xn,xr))
      & ( ~ aNaturalNumber0(X221)
        | sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X221) )
      & ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ aNaturalNumber0(X1)
    | sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,hypothesis,
    sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
    inference(split_conjunct,[status(thm)],[m__2613]) ).

cnf(c_0_6,hypothesis,
    aNaturalNumber0(sdtsldt0(xk,xr)),
    inference(split_conjunct,[status(thm)],[m__2613]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM514+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n005.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 00:42:00 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.36/1.74  % Version  : CSE_E---1.7
% 1.36/1.74  % Problem  : theBenchmark.p
% 1.36/1.74  % SZS status Theorem for theBenchmark.p
% 1.36/1.74  % SZS output start CNFRefutation
% See solution above
% 1.36/1.74  % Total time : 1.373s
%------------------------------------------------------------------------------