↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : RNG121+4 : 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 : n024.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:25 PM UTC 2026

% Result   : Theorem 1.07s 1.79s
% Output   : CNFRefutation 1.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   60 (  20 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   58 (  14   ~;  11   |;  32   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn   4   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = xb )
    | ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = xb )
    | aElementOf0(xb,xI) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__2203,hypothesis,
    ( ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xa,X1) = sz00 )
    & aElementOf0(sz00,slsdtgt0(xa))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xa,X1) = xa )
    & aElementOf0(xa,slsdtgt0(xa))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xb,X1) = sz00 )
    & aElementOf0(sz00,slsdtgt0(xb))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xb,X1) = xb )
    & aElementOf0(xb,slsdtgt0(xb)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2203) ).

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

fof(m__2091,hypothesis,
    ( aElement0(xa)
    & aElement0(xb) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).

fof(c_0_4,negated_conjecture,
    ~ ( ? [X1,X2] :
          ( aElementOf0(X1,slsdtgt0(xa))
          & aElementOf0(X2,slsdtgt0(xb))
          & sdtpldt0(X1,X2) = xb )
      | aElementOf0(xb,xI) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_5,negated_conjecture,
    ! [X288,X289] :
      ( ( ~ aElementOf0(X288,slsdtgt0(xa))
        | ~ aElementOf0(X289,slsdtgt0(xb))
        | sdtpldt0(X288,X289) != xb )
      & ~ aElementOf0(xb,xI) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,hypothesis,
    ( aElement0(esk28_0)
    & sdtasdt0(xa,esk28_0) = sz00
    & aElementOf0(sz00,slsdtgt0(xa))
    & aElement0(esk29_0)
    & sdtasdt0(xa,esk29_0) = xa
    & aElementOf0(xa,slsdtgt0(xa))
    & aElement0(esk30_0)
    & sdtasdt0(xb,esk30_0) = sz00
    & aElementOf0(sz00,slsdtgt0(xb))
    & aElement0(esk31_0)
    & sdtasdt0(xb,esk31_0) = xb
    & aElementOf0(xb,slsdtgt0(xb)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2203])]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ aElementOf0(X1,slsdtgt0(xa))
    | ~ aElementOf0(X2,slsdtgt0(xb))
    | sdtpldt0(X1,X2) != xb ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,hypothesis,
    aElementOf0(xb,slsdtgt0(xb)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,hypothesis,
    ( sdtpldt0(X1,xb) != xb
    | ~ aElementOf0(X1,slsdtgt0(xa)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,hypothesis,
    aElementOf0(sz00,slsdtgt0(xa)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_11,plain,
    ! [X145] :
      ( ( sdtpldt0(X145,sz00) = X145
        | ~ aElement0(X145) )
      & ( X145 = sdtpldt0(sz00,X145)
        | ~ aElement0(X145) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).

cnf(c_0_12,hypothesis,
    sdtpldt0(sz00,xb) != xb,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( X1 = sdtpldt0(sz00,X1)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,hypothesis,
    aElement0(xb),
    inference(split_conjunct,[status(thm)],[m__2091]) ).

cnf(c_0_15,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.15  % Problem    : RNG121+4 : TPTP v9.2.1. Released v4.0.0.
% 0.05/0.15  % 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.06/0.36  % Computer : n024.cluster.edu
% 0.06/0.36  % Model    : x86_64 x86_64
% 0.06/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.36  % Memory   : 8042.1875MB
% 0.06/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.36  % CPULimit   : 300
% 0.06/0.36  % WCLimit    : 300
% 0.06/0.36  % DateTime   : Mon May  4 20:51:11 EDT 2026
% 0.06/0.36  % CPUTime    : 
% 0.06/0.37  % start to proof: theBenchmark
% 1.07/1.79  % Version  : CSE_E---1.7
% 1.07/1.79  % Problem  : theBenchmark.p
% 1.07/1.79  % SZS status Theorem for theBenchmark.p
% 1.07/1.79  % SZS output start CNFRefutation
% See solution above
% 1.07/1.79  % Total time : 1.402s
%------------------------------------------------------------------------------