TSTP Solution File: NUN087+2 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n002.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 21 02:15:59 EDT 2024

% Result   : Theorem 0.21s 0.50s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (  10 unt;   0 def)
%            Number of atoms       :   57 (  19 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   57 (  22   ~;  16   |;  19   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   34 (   5 sgn   8   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
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(zerotimeszeroeqzero,conjecture,
    ? [X39] :
      ( ? [X22] :
          ( r1(X22)
          & r4(X22,X22,X39) )
      & ? [X23] :
          ( r1(X23)
          & X39 = X23 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerotimeszeroeqzero) ).

fof(axiom_5a,axiom,
    ! [X33] :
    ? [X34] :
      ( ? [X35] :
          ( r1(X35)
          & r4(X33,X35,X34) )
      & ? [X36] :
          ( r1(X36)
          & X34 = X36 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).

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

fof(c_0_4,negated_conjecture,
    ~ ? [X39] :
        ( ? [X22] :
            ( r1(X22)
            & r4(X22,X22,X39) )
        & ? [X23] :
            ( r1(X23)
            & X39 = X23 ) ),
    inference(assume_negation,[status(cth)],[zerotimeszeroeqzero]) ).

fof(c_0_5,plain,
    ! [X52] :
      ( r1(esk5_1(X52))
      & r4(X52,esk5_1(X52),esk4_1(X52))
      & r1(esk6_1(X52))
      & esk4_1(X52) = esk6_1(X52) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).

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

fof(c_0_7,negated_conjecture,
    ! [X44,X45,X46] :
      ( ~ r1(X45)
      | ~ r4(X45,X45,X44)
      | ~ r1(X46)
      | X44 != X46 ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_8,plain,
    r4(X1,esk5_1(X1),esk4_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    esk4_1(X1) = esk6_1(X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_11,plain,
    r1(esk5_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,plain,
    r1(esk6_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ r1(X1)
    | ~ r4(X1,X1,X2)
    | ~ r1(X3)
    | X2 != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,plain,
    r4(X1,esk5_1(X1),esk6_1(X1)),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_15,plain,
    esk5_1(X1) = esk1_0,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    esk6_1(X1) = esk1_0,
    inference(spm,[status(thm)],[c_0_10,c_0_12]) ).

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

cnf(c_0_18,negated_conjecture,
    ( ~ r4(X1,X1,X2)
    | ~ r1(X2)
    | ~ r1(X1) ),
    inference(er,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    r4(X1,esk1_0,esk1_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_20,plain,
    r1(esk1_0),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : NUN087+2 : TPTP v8.2.0. Released v7.3.0.
% 0.10/0.13  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n002.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 15:00:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  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/benchmark/theBenchmark.p
% 0.21/0.50  # Version: 3.1.0
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # new_bool_1 with pid 22580 completed with status 0
% 0.21/0.50  # Result found by new_bool_1
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 181s (1) cores
% 0.21/0.50  # G-E--_208_C18_F1_SE_CS_SP_PS_S4b with pid 22584 completed with status 0
% 0.21/0.50  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4b
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 181s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Theorem
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 12
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.50  # Initial clauses                      : 40
% 0.21/0.50  # Removed in clause preprocessing      : 8
% 0.21/0.50  # Initial clauses in saturation        : 32
% 0.21/0.50  # Processed clauses                    : 72
% 0.21/0.50  # ...of these trivial                  : 0
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 72
% 0.21/0.50  # Other redundant clauses eliminated   : 7
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 0
% 0.21/0.50  # Backward-rewritten                   : 7
% 0.21/0.50  # Generated clauses                    : 22
% 0.21/0.50  # ...of the previous two non-redundant : 23
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 15
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 7
% 0.21/0.50  # Disequality decompositions           : 0
% 0.21/0.50  # Total rewrite steps                  : 19
% 0.21/0.50  # ...of those cached                   : 7
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 26
% 0.21/0.50  #    Positive orientable unit clauses  : 14
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 2
% 0.21/0.50  #    Non-unit-clauses                  : 10
% 0.21/0.50  # Current number of unprocessed clauses: 14
% 0.21/0.50  # ...number of literals in the above   : 20
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 39
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 17
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 17
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.50  # Unit Clause-clause subsumption calls : 15
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 14
% 0.21/0.50  # BW rewrite match successes           : 6
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 1703
% 0.21/0.50  # Search garbage collected termcells   : 291
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.007 s
% 0.21/0.50  # System time              : 0.002 s
% 0.21/0.50  # Total time               : 0.009 s
% 0.21/0.50  # Maximum resident set size: 1852 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.010 s
% 0.21/0.50  # System time              : 0.003 s
% 0.21/0.50  # Total time               : 0.013 s
% 0.21/0.50  # Maximum resident set size: 1740 pages
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------