↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SEU215+1 : TPTP v9.2.1. Released v3.3.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:11:05 PM UTC 2026

% Result   : Theorem 1.36s 1.79s
% Output   : CNFRefutation 1.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   33 (   9 unt;   0 def)
%            Number of atoms       :  171 (  29 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  222 (  84   ~;  85   |;  29   &)
%                                         (   5 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t23_funct_1,conjecture,
    ! [X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ! [X3] :
          ( ( relation(X3)
            & function(X3) )
         => ( in(X1,relation_dom(X2))
           => apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_funct_1) ).

fof(d4_funct_1,axiom,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2,X3] :
          ( ( in(X2,relation_dom(X1))
           => ( X3 = apply(X1,X2)
            <=> in(ordered_pair(X2,X3),X1) ) )
          & ( ~ in(X2,relation_dom(X1))
           => ( X3 = apply(X1,X2)
            <=> X3 = empty_set ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).

fof(t21_funct_1,axiom,
    ! [X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ! [X3] :
          ( ( relation(X3)
            & function(X3) )
         => ( in(X1,relation_dom(relation_composition(X3,X2)))
          <=> ( in(X1,relation_dom(X3))
              & in(apply(X3,X1),relation_dom(X2)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_funct_1) ).

fof(t22_funct_1,axiom,
    ! [X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ! [X3] :
          ( ( relation(X3)
            & function(X3) )
         => ( in(X1,relation_dom(relation_composition(X3,X2)))
           => apply(relation_composition(X3,X2),X1) = apply(X2,apply(X3,X1)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_funct_1) ).

fof(fc1_funct_1,axiom,
    ! [X1,X2] :
      ( ( relation(X1)
        & function(X1)
        & relation(X2)
        & function(X2) )
     => ( relation(relation_composition(X1,X2))
        & function(relation_composition(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_funct_1) ).

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

fof(c_0_6,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( relation(X2)
          & function(X2) )
       => ! [X3] :
            ( ( relation(X3)
              & function(X3) )
           => ( in(X1,relation_dom(X2))
             => apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
    inference(assume_negation,[status(cth)],[t23_funct_1]) ).

fof(c_0_7,plain,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2,X3] :
          ( ( in(X2,relation_dom(X1))
           => ( X3 = apply(X1,X2)
            <=> in(ordered_pair(X2,X3),X1) ) )
          & ( ~ in(X2,relation_dom(X1))
           => ( X3 = apply(X1,X2)
            <=> X3 = empty_set ) ) ) ),
    inference(fof_simplification,[status(thm)],[d4_funct_1]) ).

fof(c_0_8,plain,
    ! [X92,X93,X94] :
      ( ( in(X92,relation_dom(X94))
        | ~ in(X92,relation_dom(relation_composition(X94,X93)))
        | ~ relation(X94)
        | ~ function(X94)
        | ~ relation(X93)
        | ~ function(X93) )
      & ( in(apply(X94,X92),relation_dom(X93))
        | ~ in(X92,relation_dom(relation_composition(X94,X93)))
        | ~ relation(X94)
        | ~ function(X94)
        | ~ relation(X93)
        | ~ function(X93) )
      & ( ~ in(X92,relation_dom(X94))
        | ~ in(apply(X94,X92),relation_dom(X93))
        | in(X92,relation_dom(relation_composition(X94,X93)))
        | ~ relation(X94)
        | ~ function(X94)
        | ~ relation(X93)
        | ~ function(X93) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_funct_1])])])]) ).

fof(c_0_9,negated_conjecture,
    ( relation(esk9_0)
    & function(esk9_0)
    & relation(esk10_0)
    & function(esk10_0)
    & in(esk8_0,relation_dom(esk9_0))
    & apply(relation_composition(esk9_0,esk10_0),esk8_0) != apply(esk10_0,apply(esk9_0,esk8_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_10,plain,
    ! [X62,X63,X64] :
      ( ( X64 != apply(X62,X63)
        | in(ordered_pair(X63,X64),X62)
        | ~ in(X63,relation_dom(X62))
        | ~ relation(X62)
        | ~ function(X62) )
      & ( ~ in(ordered_pair(X63,X64),X62)
        | X64 = apply(X62,X63)
        | ~ in(X63,relation_dom(X62))
        | ~ relation(X62)
        | ~ function(X62) )
      & ( X64 != apply(X62,X63)
        | X64 = empty_set
        | in(X63,relation_dom(X62))
        | ~ relation(X62)
        | ~ function(X62) )
      & ( X64 != empty_set
        | X64 = apply(X62,X63)
        | in(X63,relation_dom(X62))
        | ~ relation(X62)
        | ~ function(X62) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_11,plain,
    ( in(X1,relation_dom(relation_composition(X2,X3)))
    | ~ in(X1,relation_dom(X2))
    | ~ in(apply(X2,X1),relation_dom(X3))
    | ~ relation(X2)
    | ~ function(X2)
    | ~ relation(X3)
    | ~ function(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    in(esk8_0,relation_dom(esk9_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    relation(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    function(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( X1 = empty_set
    | in(X3,relation_dom(X2))
    | X1 != apply(X2,X3)
    | ~ relation(X2)
    | ~ function(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_16,plain,
    ! [X95,X96,X97] :
      ( ~ relation(X96)
      | ~ function(X96)
      | ~ relation(X97)
      | ~ function(X97)
      | ~ in(X95,relation_dom(relation_composition(X97,X96)))
      | apply(relation_composition(X97,X96),X95) = apply(X96,apply(X97,X95)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t22_funct_1])])]) ).

cnf(c_0_17,negated_conjecture,
    ( in(esk8_0,relation_dom(relation_composition(esk9_0,X1)))
    | ~ relation(X1)
    | ~ function(X1)
    | ~ in(apply(esk9_0,esk8_0),relation_dom(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_18,plain,
    ( apply(X1,X2) = empty_set
    | in(X2,relation_dom(X1))
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(er,[status(thm)],[c_0_15]) ).

cnf(c_0_19,plain,
    ( apply(relation_composition(X2,X1),X3) = apply(X1,apply(X2,X3))
    | ~ relation(X1)
    | ~ function(X1)
    | ~ relation(X2)
    | ~ function(X2)
    | ~ in(X3,relation_dom(relation_composition(X2,X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( apply(X1,apply(esk9_0,esk8_0)) = empty_set
    | in(esk8_0,relation_dom(relation_composition(esk9_0,X1)))
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

fof(c_0_21,plain,
    ! [X73,X74] :
      ( ( relation(relation_composition(X73,X74))
        | ~ relation(X73)
        | ~ function(X73)
        | ~ relation(X74)
        | ~ function(X74) )
      & ( function(relation_composition(X73,X74))
        | ~ relation(X73)
        | ~ function(X73)
        | ~ relation(X74)
        | ~ function(X74) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_funct_1])])]) ).

fof(c_0_22,plain,
    ! [X67,X68] :
      ( ~ relation(X67)
      | ~ relation(X68)
      | relation(relation_composition(X67,X68)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])]) ).

cnf(c_0_23,negated_conjecture,
    apply(relation_composition(esk9_0,esk10_0),esk8_0) != apply(esk10_0,apply(esk9_0,esk8_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_24,negated_conjecture,
    ( apply(X1,apply(esk9_0,esk8_0)) = apply(relation_composition(esk9_0,X1),esk8_0)
    | apply(X1,apply(esk9_0,esk8_0)) = empty_set
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13]),c_0_14])]) ).

cnf(c_0_25,negated_conjecture,
    relation(esk10_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_26,negated_conjecture,
    function(esk10_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_27,plain,
    ( function(relation_composition(X1,X2))
    | ~ relation(X1)
    | ~ function(X1)
    | ~ relation(X2)
    | ~ function(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_28,plain,
    ( relation(relation_composition(X1,X2))
    | ~ relation(X1)
    | ~ relation(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_29,negated_conjecture,
    apply(esk10_0,apply(esk9_0,esk8_0)) = empty_set,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).

cnf(c_0_30,plain,
    ( apply(X1,apply(X2,X3)) = apply(relation_composition(X2,X1),X3)
    | apply(relation_composition(X2,X1),X3) = empty_set
    | ~ relation(X2)
    | ~ relation(X1)
    | ~ function(X2)
    | ~ function(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_27]),c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    apply(relation_composition(esk9_0,esk10_0),esk8_0) != empty_set,
    inference(rw,[status(thm)],[c_0_23,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    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_29,c_0_30]),c_0_13]),c_0_25]),c_0_14]),c_0_26])]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU215+1 : TPTP v9.2.1. Released v3.3.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 02:48:46 EDT 2026
% 0.12/0.32  % CPUTime    : 
% 0.12/0.34  % start to proof: theBenchmark
% 1.36/1.79  % Version  : CSE_E---1.7
% 1.36/1.79  % Problem  : theBenchmark.p
% 1.36/1.79  % SZS status Theorem for theBenchmark.p
% 1.36/1.79  % SZS output start CNFRefutation
% See solution above
% 1.36/1.79  % Total time : 1.374s
%------------------------------------------------------------------------------