↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 1.40s 1.79s
% Output   : CNFRefutation 1.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   80 (   4 equ)
%            Maximal formula atoms :   17 (   4 avg)
%            Number of connectives :   88 (  25   ~;  35   |;  28   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn   2   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ? [X1] :
      ( aElement0(X1)
      & aReductOfIn0(X1,xa,xR)
      & ( X1 = xb
        | aReductOfIn0(xb,X1,xR)
        | ? [X2] :
            ( aElement0(X2)
            & aReductOfIn0(X2,X1,xR)
            & sdtmndtplgtdt0(X2,xR,xb) )
        | sdtmndtplgtdt0(X1,xR,xb)
        | sdtmndtasgtdt0(X1,xR,xb) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__731_02,hypothesis,
    ( ( aReductOfIn0(xb,xa,xR)
      | ? [X1] :
          ( aElement0(X1)
          & aReductOfIn0(X1,xa,xR)
          & sdtmndtplgtdt0(X1,xR,xb) ) )
    & sdtmndtplgtdt0(xa,xR,xb)
    & ( aReductOfIn0(xc,xa,xR)
      | ? [X1] :
          ( aElement0(X1)
          & aReductOfIn0(X1,xa,xR)
          & sdtmndtplgtdt0(X1,xR,xc) ) )
    & sdtmndtplgtdt0(xa,xR,xc) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731_02) ).

fof(m__731,hypothesis,
    ( aElement0(xa)
    & aElement0(xb)
    & aElement0(xc) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1] :
        ( aElement0(X1)
        & aReductOfIn0(X1,xa,xR)
        & ( X1 = xb
          | aReductOfIn0(xb,X1,xR)
          | ? [X2] :
              ( aElement0(X2)
              & aReductOfIn0(X2,X1,xR)
              & sdtmndtplgtdt0(X2,xR,xb) )
          | sdtmndtplgtdt0(X1,xR,xb)
          | sdtmndtasgtdt0(X1,xR,xb) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_4,negated_conjecture,
    ! [X142,X143] :
      ( ( X142 != xb
        | ~ aElement0(X142)
        | ~ aReductOfIn0(X142,xa,xR) )
      & ( ~ aReductOfIn0(xb,X142,xR)
        | ~ aElement0(X142)
        | ~ aReductOfIn0(X142,xa,xR) )
      & ( ~ aElement0(X143)
        | ~ aReductOfIn0(X143,X142,xR)
        | ~ sdtmndtplgtdt0(X143,xR,xb)
        | ~ aElement0(X142)
        | ~ aReductOfIn0(X142,xa,xR) )
      & ( ~ sdtmndtplgtdt0(X142,xR,xb)
        | ~ aElement0(X142)
        | ~ aReductOfIn0(X142,xa,xR) )
      & ( ~ sdtmndtasgtdt0(X142,xR,xb)
        | ~ aElement0(X142)
        | ~ aReductOfIn0(X142,xa,xR) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_5,hypothesis,
    ( ( aElement0(esk20_0)
      | aReductOfIn0(xb,xa,xR) )
    & ( aReductOfIn0(esk20_0,xa,xR)
      | aReductOfIn0(xb,xa,xR) )
    & ( sdtmndtplgtdt0(esk20_0,xR,xb)
      | aReductOfIn0(xb,xa,xR) )
    & sdtmndtplgtdt0(xa,xR,xb)
    & ( aElement0(esk21_0)
      | aReductOfIn0(xc,xa,xR) )
    & ( aReductOfIn0(esk21_0,xa,xR)
      | aReductOfIn0(xc,xa,xR) )
    & ( sdtmndtplgtdt0(esk21_0,xR,xc)
      | aReductOfIn0(xc,xa,xR) )
    & sdtmndtplgtdt0(xa,xR,xc) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__731_02])])]) ).

cnf(c_0_6,negated_conjecture,
    ( X1 != xb
    | ~ aElement0(X1)
    | ~ aReductOfIn0(X1,xa,xR) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,hypothesis,
    aElement0(xb),
    inference(split_conjunct,[status(thm)],[m__731]) ).

cnf(c_0_8,hypothesis,
    ( sdtmndtplgtdt0(esk20_0,xR,xb)
    | aReductOfIn0(xb,xa,xR) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ aReductOfIn0(xb,xa,xR),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_6]),c_0_7])]) ).

cnf(c_0_10,hypothesis,
    ( aReductOfIn0(esk20_0,xa,xR)
    | aReductOfIn0(xb,xa,xR) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,hypothesis,
    ( aElement0(esk20_0)
    | aReductOfIn0(xb,xa,xR) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ sdtmndtplgtdt0(X1,xR,xb)
    | ~ aElement0(X1)
    | ~ aReductOfIn0(X1,xa,xR) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,hypothesis,
    sdtmndtplgtdt0(esk20_0,xR,xb),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,hypothesis,
    aReductOfIn0(esk20_0,xa,xR),
    inference(sr,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_15,hypothesis,
    aElement0(esk20_0),
    inference(sr,[status(thm)],[c_0_11,c_0_9]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[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])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : COM016+4 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.13  % 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.16/0.33  % Computer : n018.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.34  % CPULimit   : 300
% 0.16/0.34  % WCLimit    : 300
% 0.16/0.34  % DateTime   : Mon May  4 16:20:02 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.40/1.79  % Version  : CSE_E---1.7
% 1.40/1.79  % Problem  : theBenchmark.p
% 1.40/1.79  % SZS status Theorem for theBenchmark.p
% 1.40/1.79  % SZS output start CNFRefutation
% See solution above
% 1.40/1.79  % Total time : 1.422s
%------------------------------------------------------------------------------