↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM508+1 : 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 : n003.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:36 PM UTC 2026

% Result   : Theorem 1.42s 1.76s
% Output   : CNFRefutation 1.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  14 unt;   0 def)
%            Number of atoms       :   82 (   5 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   87 (  37   ~;  31   |;  13   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( doDivides0(xr,xn)
    | doDivides0(xr,xm) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__1799,hypothesis,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( isPrime0(X3)
          & doDivides0(X3,sdtasdt0(X1,X2)) )
       => ( iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
         => ( doDivides0(X3,X1)
            | doDivides0(X3,X2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1799) ).

fof(mIH_03,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != X2
          & sdtlseqdt0(X1,X2) )
       => iLess0(X1,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIH_03) ).

fof(m__2362,hypothesis,
    ( sdtlseqdt0(xr,xk)
    & doDivides0(xr,sdtasdt0(xn,xm)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2362) ).

fof(m__2342,hypothesis,
    ( aNaturalNumber0(xr)
    & doDivides0(xr,xk)
    & isPrime0(xr) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2342) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).

fof(m__2478,hypothesis,
    ( sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp)
    & sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2478) ).

fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).

fof(c_0_8,negated_conjecture,
    ~ ( doDivides0(xr,xn)
      | doDivides0(xr,xm) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_9,hypothesis,
    ! [X171,X172,X173] :
      ( ~ aNaturalNumber0(X171)
      | ~ aNaturalNumber0(X172)
      | ~ aNaturalNumber0(X173)
      | ~ isPrime0(X173)
      | ~ doDivides0(X173,sdtasdt0(X171,X172))
      | ~ iLess0(sdtpldt0(sdtpldt0(X171,X172),X173),sdtpldt0(sdtpldt0(xn,xm),xp))
      | doDivides0(X173,X171)
      | doDivides0(X173,X172) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1799])]) ).

fof(c_0_10,negated_conjecture,
    ( ~ doDivides0(xr,xn)
    & ~ doDivides0(xr,xm) ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

fof(c_0_11,plain,
    ! [X143,X144] :
      ( ~ aNaturalNumber0(X143)
      | ~ aNaturalNumber0(X144)
      | X143 = X144
      | ~ sdtlseqdt0(X143,X144)
      | iLess0(X143,X144) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH_03])]) ).

cnf(c_0_12,hypothesis,
    ( doDivides0(X3,X1)
    | doDivides0(X3,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ isPrime0(X3)
    | ~ doDivides0(X3,sdtasdt0(X1,X2))
    | ~ iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,hypothesis,
    doDivides0(xr,sdtasdt0(xn,xm)),
    inference(split_conjunct,[status(thm)],[m__2362]) ).

cnf(c_0_14,hypothesis,
    isPrime0(xr),
    inference(split_conjunct,[status(thm)],[m__2342]) ).

cnf(c_0_15,hypothesis,
    aNaturalNumber0(xr),
    inference(split_conjunct,[status(thm)],[m__2342]) ).

cnf(c_0_16,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_17,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_18,negated_conjecture,
    ~ doDivides0(xr,xm),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_19,negated_conjecture,
    ~ doDivides0(xr,xn),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | iLess0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,hypothesis,
    sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
    inference(split_conjunct,[status(thm)],[m__2478]) ).

cnf(c_0_22,hypothesis,
    sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp),
    inference(split_conjunct,[status(thm)],[m__2478]) ).

cnf(c_0_23,hypothesis,
    ~ iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17])]),c_0_18]),c_0_19]) ).

fof(c_0_24,plain,
    ! [X89,X90] :
      ( ~ aNaturalNumber0(X89)
      | ~ aNaturalNumber0(X90)
      | aNaturalNumber0(sdtpldt0(X89,X90)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).

cnf(c_0_25,hypothesis,
    ( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
    | ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).

cnf(c_0_26,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_27,hypothesis,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_28,hypothesis,
    ( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))
    | ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

cnf(c_0_29,hypothesis,
    ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_16]),c_0_17])]) ).

cnf(c_0_30,hypothesis,
    ~ aNaturalNumber0(sdtpldt0(xn,xm)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_15])]) ).

cnf(c_0_31,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM508+1 : 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 : n003.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:40:26 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.42/1.76  % Version  : CSE_E---1.7
% 1.42/1.76  % Problem  : theBenchmark.p
% 1.42/1.76  % SZS status Theorem for theBenchmark.p
% 1.42/1.76  % SZS output start CNFRefutation
% See solution above
% 1.42/1.77  % Total time : 1.369s
%------------------------------------------------------------------------------