↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : RNG044+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 : 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 05:05:06 PM UTC 2026

% Result   : Theorem 1.25s 1.71s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   45 (  11 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   47 (  21   ~;  16   |;   8   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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;   4 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

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

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

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

fof(c_0_4,negated_conjecture,
    sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_5,plain,
    ! [X41,X42,X43] :
      ( ( sdtasdt0(X41,sdtpldt0(X42,X43)) = sdtpldt0(sdtasdt0(X41,X42),sdtasdt0(X41,X43))
        | ~ aScalar0(X41)
        | ~ aScalar0(X42)
        | ~ aScalar0(X43) )
      & ( sdtasdt0(sdtpldt0(X41,X42),X43) = sdtpldt0(sdtasdt0(X41,X43),sdtasdt0(X42,X43))
        | ~ aScalar0(X41)
        | ~ aScalar0(X42)
        | ~ aScalar0(X43) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr])])]) ).

cnf(c_0_6,negated_conjecture,
    sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_8,hypothesis,
    aScalar0(xv),
    inference(split_conjunct,[status(thm)],[m__674]) ).

cnf(c_0_9,hypothesis,
    aScalar0(xu),
    inference(split_conjunct,[status(thm)],[m__674]) ).

cnf(c_0_10,hypothesis,
    aScalar0(xy),
    inference(split_conjunct,[status(thm)],[m__674]) ).

cnf(c_0_11,negated_conjecture,
    sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).

cnf(c_0_12,hypothesis,
    aScalar0(xx),
    inference(split_conjunct,[status(thm)],[m__674]) ).

cnf(c_0_13,negated_conjecture,
    sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_8]),c_0_9]),c_0_12])]) ).

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

fof(c_0_15,plain,
    ! [X32,X33] :
      ( ~ aScalar0(X32)
      | ~ aScalar0(X33)
      | aScalar0(sdtpldt0(X32,X33)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])]) ).

cnf(c_0_16,negated_conjecture,
    ~ aScalar0(sdtpldt0(xu,xv)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10]),c_0_12])]) ).

cnf(c_0_17,plain,
    ( aScalar0(sdtpldt0(X1,X2))
    | ~ aScalar0(X1)
    | ~ aScalar0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_8]),c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : RNG044+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.13/0.32  % Computer : n018.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Tue May  5 01:48:02 EDT 2026
% 0.13/0.32  % CPUTime    : 
% 0.13/0.33  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Theorem for theBenchmark.p
% 1.25/1.71  % SZS output start CNFRefutation
% See solution above
% 1.25/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------