TSTP Solution File: NUN073+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUN073+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% 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  : 600s
% DateTime : Mon Jul 18 16:24:56 EDT 2022

% Result   : Theorem 8.85s 3.34s
% Output   : CNFRefutation 8.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (  16 unt;   0 def)
%            Number of atoms       :   92 (  36 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  109 (  52   ~;  42   |;  15   &)
%                                         (   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    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   49 (   2 sgn  30   !;   2   ?)

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

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

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

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

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

fof(c_0_5,negated_conjecture,
    ~ ! [X39] :
        ( ! [X22] :
            ( ! [X16] :
                ( ~ r1(X16)
                | ~ r2(X16,X22) )
            | X22 != X39 )
        | ! [X23] :
            ( ! [X17] :
                ( ~ r1(X17)
                | ~ r2(X17,X23) )
            | ~ r2(X23,X39) ) ),
    inference(assume_negation,[status(cth)],[oneuneqtwo]) ).

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

fof(c_0_7,negated_conjecture,
    ( r1(esk23_0)
    & r2(esk23_0,esk22_0)
    & esk22_0 = esk21_0
    & r1(esk25_0)
    & r2(esk25_0,esk24_0)
    & r2(esk24_0,esk21_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])]) ).

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

cnf(c_0_9,negated_conjecture,
    r1(esk25_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X46,X48] :
      ( ( r2(X46,X48)
        | ~ r2(X46,X48) )
      & ( X48 = esk2_1(X46)
        | ~ r2(X46,X48) )
      & ( r2(X46,X48)
        | X48 != esk2_1(X46) )
      & ( X48 = esk2_1(X46)
        | X48 != esk2_1(X46) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_2])])])]) ).

cnf(c_0_11,negated_conjecture,
    esk1_0 = esk25_0,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    r2(esk23_0,esk22_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    esk22_0 = esk21_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_14,plain,
    ! [X69,X70,X71,X72] :
      ( ~ r2(X69,X72)
      | X72 != X71
      | ~ r2(X70,X71)
      | X69 = X70 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_3a])])]) ).

cnf(c_0_15,plain,
    ( X1 = esk2_1(X2)
    | ~ r2(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    r2(esk25_0,esk24_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_17,plain,
    ( X1 = esk25_0
    | ~ r1(X1) ),
    inference(rw,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    r1(esk23_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,negated_conjecture,
    r2(esk23_0,esk21_0),
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_21,negated_conjecture,
    esk2_1(esk25_0) = esk24_0,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    esk25_0 = esk23_0,
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    esk2_1(esk23_0) = esk21_0,
    inference(spm,[status(thm)],[c_0_15,c_0_19]) ).

fof(c_0_24,plain,
    ! [X84,X85,X86] :
      ( ~ r1(X86)
      | X86 != X85
      | ~ r2(X84,X85) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7a])])]) ).

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

cnf(c_0_26,negated_conjecture,
    r2(esk24_0,esk21_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_27,negated_conjecture,
    esk24_0 = esk21_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

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

cnf(c_0_29,negated_conjecture,
    ( X1 = esk23_0
    | ~ r2(X1,esk21_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_19]) ).

cnf(c_0_30,negated_conjecture,
    r2(esk21_0,esk21_0),
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

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

cnf(c_0_32,negated_conjecture,
    esk23_0 = esk21_0,
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    ~ r1(esk21_0),
    inference(spm,[status(thm)],[c_0_31,c_0_26]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_32]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem  : NUN073+2 : TPTP v8.1.0. Released v7.3.0.
% 0.09/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.30  % Computer : n024.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 600
% 0.09/0.30  % DateTime : Thu Jun  2 06:35:08 EDT 2022
% 0.09/0.31  % CPUTime  : 
% 0.15/0.40  # ENIGMATIC: Selected SinE mode:
% 0.15/0.41  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.15/0.41  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.15/0.41  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.85/3.34  # ENIGMATIC: Solved by autoschedule:
% 8.85/3.34  # No SInE strategy applied
% 8.85/3.34  # Trying AutoSched0 for 150 seconds
% 8.85/3.34  # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.85/3.34  # and selection function SelectComplexG.
% 8.85/3.34  #
% 8.85/3.34  # Preprocessing time       : 0.023 s
% 8.85/3.34  
% 8.85/3.34  # Proof found!
% 8.85/3.34  # SZS status Theorem
% 8.85/3.34  # SZS output start CNFRefutation
% See solution above
% 8.85/3.34  # Training examples: 0 positive, 0 negative
% 8.85/3.34  
% 8.85/3.34  # -------------------------------------------------
% 8.85/3.34  # User time                : 0.028 s
% 8.85/3.34  # System time              : 0.004 s
% 8.85/3.34  # Total time               : 0.032 s
% 8.85/3.34  # Maximum resident set size: 7120 pages
% 8.85/3.34  
%------------------------------------------------------------------------------