TSTP Solution File: NUN073+2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : NUN073+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n031.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:09:26 EDT 2023

% Result   : Theorem 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  12 unt;   0 def)
%            Number of atoms       :   85 (  30 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  107 (  53   ~;  42   |;  12   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   51 (   2 sgn;  34   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_3a,axiom,
    ! [X26,X27] :
      ( ! [X28] :
          ( ! [X29] :
              ( ~ r2(X26,X29)
              | X29 != X28 )
          | ~ r2(X27,X28) )
      | X26 = X27 ),
    file('/export/starexec/sandbox/tmp/tmp.Xo98yh44k9/E---3.1_20160.p',axiom_3a) ).

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/tmp/tmp.Xo98yh44k9/E---3.1_20160.p',oneuneqtwo) ).

fof(axiom_1,axiom,
    ? [X1] :
    ! [X2] :
      ( ( ~ r1(X2)
        & X2 != X1 )
      | ( r1(X2)
        & X2 = X1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.Xo98yh44k9/E---3.1_20160.p',axiom_1) ).

fof(axiom_7a,axiom,
    ! [X41,X42] :
      ( ! [X43] :
          ( ~ r1(X43)
          | X43 != X42 )
      | ~ r2(X41,X42) ),
    file('/export/starexec/sandbox/tmp/tmp.Xo98yh44k9/E---3.1_20160.p',axiom_7a) ).

fof(c_0_4,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_5,negated_conjecture,
    ~ ! [X39] :
        ( ! [X22] :
            ( ! [X16] :
                ( ~ r1(X16)
                | ~ r2(X16,X22) )
            | X22 != X39 )
        | ! [X23] :
            ( ! [X17] :
                ( ~ r1(X17)
                | ~ r2(X17,X23) )
            | ~ r2(X23,X39) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[oneuneqtwo])]) ).

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,
    ! [X41,X42] :
      ( ! [X43] :
          ( ~ r1(X43)
          | X43 != X42 )
      | ~ r2(X41,X42) ),
    inference(fof_simplification,[status(thm)],[axiom_7a]) ).

fof(c_0_8,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)],[c_0_4])]) ).

fof(c_0_9,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)],[c_0_5])])]) ).

fof(c_0_10,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)],[c_0_6])])]) ).

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

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

cnf(c_0_13,negated_conjecture,
    r2(esk23_0,esk22_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    esk22_0 = esk21_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_16,negated_conjecture,
    r1(esk23_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

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

cnf(c_0_19,negated_conjecture,
    r2(esk24_0,esk21_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_21,negated_conjecture,
    esk23_0 = esk1_0,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_23,negated_conjecture,
    r2(esk25_0,esk24_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_24,negated_conjecture,
    ( X1 = esk24_0
    | ~ r2(X1,esk21_0) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    r2(esk1_0,esk21_0),
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

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

cnf(c_0_27,negated_conjecture,
    ~ r1(esk24_0),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,negated_conjecture,
    esk24_0 = esk1_0,
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    r1(esk1_0),
    inference(er,[status(thm)],[c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUN073+2 : TPTP v8.1.2. Released v7.3.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n031.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Oct  2 21:17:58 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Xo98yh44k9/E---3.1_20160.p
% 0.19/0.49  # Version: 3.1pre001
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20237 completed with status 0
% 0.19/0.49  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.19/0.49  # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.19/0.49  # G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with pid 20245 completed with status 0
% 0.19/0.49  # Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.19/0.49  # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Theorem
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 12
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  # Initial clauses                      : 45
% 0.19/0.49  # Removed in clause preprocessing      : 12
% 0.19/0.49  # Initial clauses in saturation        : 33
% 0.19/0.49  # Processed clauses                    : 82
% 0.19/0.49  # ...of these trivial                  : 0
% 0.19/0.49  # ...subsumed                          : 4
% 0.19/0.49  # ...remaining for further processing  : 78
% 0.19/0.49  # Other redundant clauses eliminated   : 6
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 0
% 0.19/0.49  # Backward-rewritten                   : 12
% 0.19/0.49  # Generated clauses                    : 36
% 0.19/0.49  # ...of the previous two non-redundant : 40
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 0
% 0.19/0.49  # Paramodulations                      : 30
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 6
% 0.19/0.49  # Total rewrite steps                  : 20
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 27
% 0.19/0.49  #    Positive orientable unit clauses  : 14
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 4
% 0.19/0.49  #    Non-unit-clauses                  : 9
% 0.19/0.49  # Current number of unprocessed clauses: 21
% 0.19/0.49  # ...number of literals in the above   : 29
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 49
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 19
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 13
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.49  # Unit Clause-clause subsumption calls : 21
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 18
% 0.19/0.49  # BW rewrite match successes           : 6
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 1632
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.005 s
% 0.19/0.49  # System time              : 0.004 s
% 0.19/0.49  # Total time               : 0.008 s
% 0.19/0.49  # Maximum resident set size: 1824 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.016 s
% 0.19/0.49  # System time              : 0.010 s
% 0.19/0.49  # Total time               : 0.026 s
% 0.19/0.49  # Maximum resident set size: 1720 pages
% 0.19/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------