↑ Up

CSE_E---1.7.THM-CRf.s

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

% Computer : n006.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 05:05:06 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(mMNeg,axiom,
    ! [X1,X2] :
      ( ( aScalar0(X1)
        & aScalar0(X2) )
     => ( sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2))
        & sdtasdt0(smndt0(X1),X2) = smndt0(sdtasdt0(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMNeg) ).

fof(mNegSc,axiom,
    ! [X1] :
      ( aScalar0(X1)
     => aScalar0(smndt0(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNegSc) ).

fof(m__799,hypothesis,
    ( aScalar0(xx)
    & aScalar0(xy) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__799) ).

fof(mScZero,axiom,
    ! [X1] :
      ( aScalar0(X1)
     => ( sdtpldt0(X1,sz0z00) = X1
        & sdtpldt0(sz0z00,X1) = X1
        & sdtasdt0(X1,sz0z00) = sz0z00
        & sdtasdt0(sz0z00,X1) = sz0z00
        & sdtpldt0(X1,smndt0(X1)) = sz0z00
        & sdtpldt0(smndt0(X1),X1) = sz0z00
        & smndt0(smndt0(X1)) = X1
        & smndt0(sz0z00) = sz0z00 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mScZero) ).

fof(m__,conjecture,
    sdtasdt0(smndt0(xx),smndt0(xy)) = sdtasdt0(xx,xy),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(c_0_5,plain,
    ! [X55,X56] :
      ( ( sdtasdt0(X55,smndt0(X56)) = smndt0(sdtasdt0(X55,X56))
        | ~ aScalar0(X55)
        | ~ aScalar0(X56) )
      & ( sdtasdt0(smndt0(X55),X56) = smndt0(sdtasdt0(X55,X56))
        | ~ aScalar0(X55)
        | ~ aScalar0(X56) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMNeg])])]) ).

fof(c_0_6,plain,
    ! [X43] :
      ( ~ aScalar0(X43)
      | aScalar0(smndt0(X43)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNegSc])]) ).

cnf(c_0_7,plain,
    ( sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2))
    | ~ aScalar0(X1)
    | ~ aScalar0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,hypothesis,
    aScalar0(xy),
    inference(split_conjunct,[status(thm)],[m__799]) ).

cnf(c_0_9,plain,
    ( aScalar0(smndt0(X1))
    | ~ aScalar0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,hypothesis,
    aScalar0(xx),
    inference(split_conjunct,[status(thm)],[m__799]) ).

fof(c_0_11,plain,
    ! [X44] :
      ( ( sdtpldt0(X44,sz0z00) = X44
        | ~ aScalar0(X44) )
      & ( sdtpldt0(sz0z00,X44) = X44
        | ~ aScalar0(X44) )
      & ( sdtasdt0(X44,sz0z00) = sz0z00
        | ~ aScalar0(X44) )
      & ( sdtasdt0(sz0z00,X44) = sz0z00
        | ~ aScalar0(X44) )
      & ( sdtpldt0(X44,smndt0(X44)) = sz0z00
        | ~ aScalar0(X44) )
      & ( sdtpldt0(smndt0(X44),X44) = sz0z00
        | ~ aScalar0(X44) )
      & ( smndt0(smndt0(X44)) = X44
        | ~ aScalar0(X44) )
      & ( smndt0(sz0z00) = sz0z00
        | ~ aScalar0(X44) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mScZero])])]) ).

cnf(c_0_12,plain,
    ( sdtasdt0(smndt0(X1),X2) = smndt0(sdtasdt0(X1,X2))
    | ~ aScalar0(X1)
    | ~ aScalar0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,hypothesis,
    ( smndt0(sdtasdt0(X1,xy)) = sdtasdt0(X1,smndt0(xy))
    | ~ aScalar0(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_14,hypothesis,
    aScalar0(smndt0(xx)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( smndt0(smndt0(X1)) = X1
    | ~ aScalar0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_16,negated_conjecture,
    sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_17,hypothesis,
    ( smndt0(sdtasdt0(X1,xy)) = sdtasdt0(smndt0(X1),xy)
    | ~ aScalar0(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_8]) ).

cnf(c_0_18,hypothesis,
    smndt0(sdtasdt0(smndt0(xx),xy)) = sdtasdt0(smndt0(xx),smndt0(xy)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,hypothesis,
    smndt0(smndt0(xx)) = xx,
    inference(spm,[status(thm)],[c_0_15,c_0_10]) ).

cnf(c_0_20,negated_conjecture,
    sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_18]),c_0_19]),c_0_20]),
    [proof] ).

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