↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUN065+2 : TPTP v9.2.1. Released v7.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 : n025.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:00:49 PM UTC 2026

% Result   : Theorem 1.32s 1.74s
% Output   : CNFRefutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   41 (   5 unt;   0 def)
%            Number of atoms       :  126 (  53 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  145 (  60   ~;  64   |;  21   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   77 (   4 sgn  37   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(nononesexist,conjecture,
    ? [X39] :
      ( ! [X22] :
          ( ! [X23] :
              ( ~ r1(X23)
              | ~ r2(X23,X22) )
          | X39 != X22 )
      & ! [X16] :
          ( ~ r1(X16)
          | X39 != X16 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nononesexist) ).

fof(axiom_1,axiom,
    ? [X1] :
    ! [X2] :
      ( ( ~ r1(X2)
        & X2 != X1 )
      | ( r1(X2)
        & X2 = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).

fof(axiom_3a,axiom,
    ! [X26,X27] :
      ( ! [X28] :
          ( ! [X29] :
              ( ~ r2(X26,X29)
              | X29 != X28 )
          | ~ r2(X27,X28) )
      | X26 = X27 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_3a) ).

fof(axiom_2,axiom,
    ! [X3] :
    ? [X4] :
    ! [X5] :
      ( ( ~ r2(X3,X5)
        & X5 != X4 )
      | ( r2(X3,X5)
        & X5 = X4 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).

fof(axiom_7a,axiom,
    ! [X41,X42] :
      ( ! [X43] :
          ( ~ r1(X43)
          | X43 != X42 )
      | ~ r2(X41,X42) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X39] :
        ( ! [X22] :
            ( ! [X23] :
                ( ~ r1(X23)
                | ~ r2(X23,X22) )
            | X39 != X22 )
        & ! [X16] :
            ( ~ r1(X16)
            | X39 != X16 ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nononesexist])]) ).

fof(c_0_6,plain,
    ? [X1] :
    ! [X2] :
      ( ( ~ r1(X2)
        & X2 != X1 )
      | ( r1(X2)
        & X2 = X1 ) ),
    inference(fof_simplification,[status(thm)],[axiom_1]) ).

fof(c_0_7,plain,
    ! [X26,X27] :
      ( ! [X28] :
          ( ! [X29] :
              ( ~ r2(X26,X29)
              | X29 != X28 )
          | ~ r2(X27,X28) )
      | X26 = X27 ),
    inference(fof_simplification,[status(thm)],[axiom_3a]) ).

fof(c_0_8,plain,
    ! [X3] :
    ? [X4] :
    ! [X5] :
      ( ( ~ r2(X3,X5)
        & X5 != X4 )
      | ( r2(X3,X5)
        & X5 = X4 ) ),
    inference(fof_simplification,[status(thm)],[axiom_2]) ).

fof(c_0_9,negated_conjecture,
    ! [X134] :
      ( ( r1(esk23_1(X134))
        | r1(esk22_1(X134)) )
      & ( X134 = esk23_1(X134)
        | r1(esk22_1(X134)) )
      & ( r1(esk23_1(X134))
        | r2(esk22_1(X134),esk21_1(X134)) )
      & ( X134 = esk23_1(X134)
        | r2(esk22_1(X134),esk21_1(X134)) )
      & ( r1(esk23_1(X134))
        | X134 = esk21_1(X134) )
      & ( X134 = esk23_1(X134)
        | X134 = esk21_1(X134) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_10,plain,
    ! [X92] :
      ( ( r1(X92)
        | ~ r1(X92) )
      & ( X92 = esk1_0
        | ~ r1(X92) )
      & ( r1(X92)
        | X92 != esk1_0 )
      & ( X92 = esk1_0
        | X92 != esk1_0 ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])]) ).

fof(c_0_11,plain,
    ! [X41,X42] :
      ( ! [X43] :
          ( ~ r1(X43)
          | X43 != X42 )
      | ~ r2(X41,X42) ),
    inference(fof_simplification,[status(thm)],[axiom_7a]) ).

fof(c_0_12,plain,
    ! [X116,X117,X118,X119] :
      ( ~ r2(X116,X119)
      | X119 != X118
      | ~ r2(X117,X118)
      | X116 = X117 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).

fof(c_0_13,plain,
    ! [X93,X95] :
      ( ( r2(X93,X95)
        | ~ r2(X93,X95) )
      & ( X95 = esk2_1(X93)
        | ~ r2(X93,X95) )
      & ( r2(X93,X95)
        | X95 != esk2_1(X93) )
      & ( X95 = esk2_1(X93)
        | X95 != esk2_1(X93) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).

cnf(c_0_14,negated_conjecture,
    ( r1(esk23_1(X1))
    | r2(esk22_1(X1),esk21_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    ( r1(esk23_1(X1))
    | X1 = esk21_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,plain,
    ( X1 = esk1_0
    | ~ r1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    ( r1(esk23_1(X1))
    | r1(esk22_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,negated_conjecture,
    ( X1 = esk23_1(X1)
    | r2(esk22_1(X1),esk21_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    ( X1 = esk23_1(X1)
    | X1 = esk21_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_20,negated_conjecture,
    ( X1 = esk23_1(X1)
    | r1(esk22_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_21,plain,
    ! [X131,X132,X133] :
      ( ~ r1(X133)
      | X133 != X132
      | ~ r2(X131,X132) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).

cnf(c_0_22,plain,
    ( X1 = X4
    | ~ r2(X1,X2)
    | X2 != X3
    | ~ r2(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_23,plain,
    ( r2(X1,X2)
    | X2 != esk2_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_24,negated_conjecture,
    ( r2(esk22_1(X1),X1)
    | r1(esk23_1(X1)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    ( esk22_1(X1) = esk1_0
    | r1(esk23_1(X1)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_26,negated_conjecture,
    ( esk23_1(X1) = X1
    | r2(esk22_1(X1),X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_27,negated_conjecture,
    ( esk22_1(X1) = esk1_0
    | esk23_1(X1) = X1 ),
    inference(spm,[status(thm)],[c_0_16,c_0_20]) ).

cnf(c_0_28,plain,
    ( ~ r1(X1)
    | X1 != X2
    | ~ r2(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_29,plain,
    ( X1 = X2
    | ~ r2(X2,X3)
    | ~ r2(X1,X3) ),
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_30,plain,
    r2(X1,esk2_1(X1)),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_31,negated_conjecture,
    ( r2(esk1_0,X1)
    | r1(esk23_1(X1)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,negated_conjecture,
    ( esk23_1(X1) = X1
    | r2(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,plain,
    ( ~ r2(X1,X2)
    | ~ r1(X2) ),
    inference(er,[status(thm)],[c_0_28]) ).

cnf(c_0_34,plain,
    ( X1 = X2
    | ~ r2(X1,esk2_1(X2)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    ( r2(esk1_0,X1)
    | r1(X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    ~ r1(esk2_1(X1)),
    inference(spm,[status(thm)],[c_0_33,c_0_30]) ).

cnf(c_0_37,plain,
    ( r1(X1)
    | X1 != esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_38,negated_conjecture,
    esk1_0 = X1,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_39,plain,
    r1(esk1_0),
    inference(er,[status(thm)],[c_0_37]) ).

cnf(c_0_40,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_38]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUN065+2 : TPTP v9.2.1. Released v7.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.15/0.33  % Computer : n025.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 01:22:58 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.32/1.74  % Version  : CSE_E---1.7
% 1.32/1.74  % Problem  : theBenchmark.p
% 1.32/1.74  % SZS status Theorem for theBenchmark.p
% 1.32/1.74  % SZS output start CNFRefutation
% See solution above
% 1.32/1.74  % Total time : 1.370s
%------------------------------------------------------------------------------