TSTP Solution File: COM017+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : COM017+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.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 17:22:19 EDT 2023

% Result   : Theorem 0.19s 0.50s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  10 unt;   0 def)
%            Number of atoms       :  147 (   0 equ)
%            Maximal formula atoms :   44 (   4 avg)
%            Number of connectives :  197 (  82   ~;  84   |;  26   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :   50 (   0 sgn;  16   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mWCRDef,axiom,
    ! [X1] :
      ( aRewritingSystem0(X1)
     => ( isLocallyConfluent0(X1)
      <=> ! [X2,X3,X4] :
            ( ( aElement0(X2)
              & aElement0(X3)
              & aElement0(X4)
              & aReductOfIn0(X3,X2,X1)
              & aReductOfIn0(X4,X2,X1) )
           => ? [X5] :
                ( aElement0(X5)
                & sdtmndtasgtdt0(X3,X1,X5)
                & sdtmndtasgtdt0(X4,X1,X5) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',mWCRDef) ).

fof(mReduct,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2) )
     => ! [X3] :
          ( aReductOfIn0(X3,X1,X2)
         => aElement0(X3) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',mReduct) ).

fof(m__,conjecture,
    ? [X1] :
      ( aElement0(X1)
      & sdtmndtasgtdt0(xu,xR,X1)
      & sdtmndtasgtdt0(xv,xR,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',m__) ).

fof(m__779,hypothesis,
    ( aElement0(xv)
    & aReductOfIn0(xv,xa,xR)
    & sdtmndtasgtdt0(xv,xR,xc) ),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',m__779) ).

fof(m__656_01,hypothesis,
    ( isLocallyConfluent0(xR)
    & isTerminating0(xR) ),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',m__656_01) ).

fof(m__656,hypothesis,
    aRewritingSystem0(xR),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',m__656) ).

fof(m__731,hypothesis,
    ( aElement0(xa)
    & aElement0(xb)
    & aElement0(xc) ),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',m__731) ).

fof(m__755,hypothesis,
    ( aElement0(xu)
    & aReductOfIn0(xu,xa,xR)
    & sdtmndtasgtdt0(xu,xR,xb) ),
    file('/export/starexec/sandbox/tmp/tmp.eHWcaomafm/E---3.1_28952.p',m__755) ).

fof(c_0_8,plain,
    ! [X14,X15,X16,X17,X22] :
      ( ( aElement0(esk1_4(X14,X15,X16,X17))
        | ~ aElement0(X15)
        | ~ aElement0(X16)
        | ~ aElement0(X17)
        | ~ aReductOfIn0(X16,X15,X14)
        | ~ aReductOfIn0(X17,X15,X14)
        | ~ isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( sdtmndtasgtdt0(X16,X14,esk1_4(X14,X15,X16,X17))
        | ~ aElement0(X15)
        | ~ aElement0(X16)
        | ~ aElement0(X17)
        | ~ aReductOfIn0(X16,X15,X14)
        | ~ aReductOfIn0(X17,X15,X14)
        | ~ isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( sdtmndtasgtdt0(X17,X14,esk1_4(X14,X15,X16,X17))
        | ~ aElement0(X15)
        | ~ aElement0(X16)
        | ~ aElement0(X17)
        | ~ aReductOfIn0(X16,X15,X14)
        | ~ aReductOfIn0(X17,X15,X14)
        | ~ isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( aElement0(esk2_1(X14))
        | isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( aElement0(esk3_1(X14))
        | isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( aElement0(esk4_1(X14))
        | isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( aReductOfIn0(esk3_1(X14),esk2_1(X14),X14)
        | isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( aReductOfIn0(esk4_1(X14),esk2_1(X14),X14)
        | isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) )
      & ( ~ aElement0(X22)
        | ~ sdtmndtasgtdt0(esk3_1(X14),X14,X22)
        | ~ sdtmndtasgtdt0(esk4_1(X14),X14,X22)
        | isLocallyConfluent0(X14)
        | ~ aRewritingSystem0(X14) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mWCRDef])])])])]) ).

fof(c_0_9,plain,
    ! [X33,X34,X35] :
      ( ~ aElement0(X33)
      | ~ aRewritingSystem0(X34)
      | ~ aReductOfIn0(X35,X33,X34)
      | aElement0(X35) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])]) ).

cnf(c_0_10,plain,
    ( sdtmndtasgtdt0(X1,X2,esk1_4(X2,X3,X1,X4))
    | ~ aElement0(X3)
    | ~ aElement0(X1)
    | ~ aElement0(X4)
    | ~ aReductOfIn0(X1,X3,X2)
    | ~ aReductOfIn0(X4,X3,X2)
    | ~ isLocallyConfluent0(X2)
    | ~ aRewritingSystem0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    ( aElement0(X3)
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aReductOfIn0(X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,plain,
    ( sdtmndtasgtdt0(X1,X2,esk1_4(X2,X3,X4,X1))
    | ~ aElement0(X3)
    | ~ aElement0(X4)
    | ~ aElement0(X1)
    | ~ aReductOfIn0(X4,X3,X2)
    | ~ aReductOfIn0(X1,X3,X2)
    | ~ isLocallyConfluent0(X2)
    | ~ aRewritingSystem0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( aElement0(esk1_4(X1,X2,X3,X4))
    | ~ aElement0(X2)
    | ~ aElement0(X3)
    | ~ aElement0(X4)
    | ~ aReductOfIn0(X3,X2,X1)
    | ~ aReductOfIn0(X4,X2,X1)
    | ~ isLocallyConfluent0(X1)
    | ~ aRewritingSystem0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_14,negated_conjecture,
    ~ ? [X1] :
        ( aElement0(X1)
        & sdtmndtasgtdt0(xu,xR,X1)
        & sdtmndtasgtdt0(xv,xR,X1) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_15,plain,
    ( sdtmndtasgtdt0(X1,X2,esk1_4(X2,X3,X1,X4))
    | ~ isLocallyConfluent0(X2)
    | ~ aReductOfIn0(X4,X3,X2)
    | ~ aReductOfIn0(X1,X3,X2)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).

cnf(c_0_16,hypothesis,
    aReductOfIn0(xv,xa,xR),
    inference(split_conjunct,[status(thm)],[m__779]) ).

cnf(c_0_17,hypothesis,
    isLocallyConfluent0(xR),
    inference(split_conjunct,[status(thm)],[m__656_01]) ).

cnf(c_0_18,hypothesis,
    aRewritingSystem0(xR),
    inference(split_conjunct,[status(thm)],[m__656]) ).

cnf(c_0_19,hypothesis,
    aElement0(xa),
    inference(split_conjunct,[status(thm)],[m__731]) ).

cnf(c_0_20,plain,
    ( sdtmndtasgtdt0(X1,X2,esk1_4(X2,X3,X4,X1))
    | ~ isLocallyConfluent0(X2)
    | ~ aReductOfIn0(X4,X3,X2)
    | ~ aReductOfIn0(X1,X3,X2)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).

cnf(c_0_21,hypothesis,
    aReductOfIn0(xu,xa,xR),
    inference(split_conjunct,[status(thm)],[m__755]) ).

cnf(c_0_22,plain,
    ( aElement0(esk1_4(X1,X2,X3,X4))
    | ~ isLocallyConfluent0(X1)
    | ~ aReductOfIn0(X4,X2,X1)
    | ~ aReductOfIn0(X3,X2,X1)
    | ~ aRewritingSystem0(X1)
    | ~ aElement0(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_13,c_0_11]),c_0_11]) ).

fof(c_0_23,negated_conjecture,
    ! [X6] :
      ( ~ aElement0(X6)
      | ~ sdtmndtasgtdt0(xu,xR,X6)
      | ~ sdtmndtasgtdt0(xv,xR,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).

cnf(c_0_24,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,esk1_4(xR,xa,X1,xv))
    | ~ aReductOfIn0(X1,xa,xR) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_25,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,esk1_4(xR,xa,xu,X1))
    | ~ aReductOfIn0(X1,xa,xR) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_26,hypothesis,
    ( aElement0(esk1_4(xR,xa,X1,xv))
    | ~ aReductOfIn0(X1,xa,xR) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(xu,xR,X1)
    | ~ sdtmndtasgtdt0(xv,xR,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_28,hypothesis,
    sdtmndtasgtdt0(xu,xR,esk1_4(xR,xa,xu,xv)),
    inference(spm,[status(thm)],[c_0_24,c_0_21]) ).

cnf(c_0_29,hypothesis,
    sdtmndtasgtdt0(xv,xR,esk1_4(xR,xa,xu,xv)),
    inference(spm,[status(thm)],[c_0_25,c_0_16]) ).

cnf(c_0_30,hypothesis,
    aElement0(esk1_4(xR,xa,xu,xv)),
    inference(spm,[status(thm)],[c_0_26,c_0_21]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : COM017+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n026.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   : Tue Oct  3 05:16:29 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.eHWcaomafm/E---3.1_28952.p
% 0.19/0.50  # Version: 3.1pre001
% 0.19/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # sh5l with pid 29033 completed with status 0
% 0.19/0.50  # Result found by sh5l
% 0.19/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50  # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.19/0.50  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 29034 completed with status 0
% 0.19/0.50  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.19/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50  # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.19/0.50  # Preprocessing time       : 0.001 s
% 0.19/0.50  # Presaturation interreduction done
% 0.19/0.50  
% 0.19/0.50  # Proof found!
% 0.19/0.50  # SZS status Theorem
% 0.19/0.50  # SZS output start CNFRefutation
% See solution above
% 0.19/0.50  # Parsed axioms                        : 22
% 0.19/0.50  # Removed by relevancy pruning/SinE    : 1
% 0.19/0.50  # Initial clauses                      : 52
% 0.19/0.50  # Removed in clause preprocessing      : 4
% 0.19/0.50  # Initial clauses in saturation        : 48
% 0.19/0.50  # Processed clauses                    : 172
% 0.19/0.50  # ...of these trivial                  : 0
% 0.19/0.50  # ...subsumed                          : 10
% 0.19/0.50  # ...remaining for further processing  : 162
% 0.19/0.50  # Other redundant clauses eliminated   : 1
% 0.19/0.50  # Clauses deleted for lack of memory   : 0
% 0.19/0.50  # Backward-subsumed                    : 1
% 0.19/0.50  # Backward-rewritten                   : 0
% 0.19/0.50  # Generated clauses                    : 218
% 0.19/0.50  # ...of the previous two non-redundant : 171
% 0.19/0.50  # ...aggressively subsumed             : 0
% 0.19/0.50  # Contextual simplify-reflections      : 9
% 0.19/0.50  # Paramodulations                      : 217
% 0.19/0.50  # Factorizations                       : 0
% 0.19/0.50  # NegExts                              : 0
% 0.19/0.50  # Equation resolutions                 : 1
% 0.19/0.50  # Total rewrite steps                  : 414
% 0.19/0.50  # Propositional unsat checks           : 0
% 0.19/0.50  #    Propositional check models        : 0
% 0.19/0.50  #    Propositional check unsatisfiable : 0
% 0.19/0.50  #    Propositional clauses             : 0
% 0.19/0.50  #    Propositional clauses after purity: 0
% 0.19/0.50  #    Propositional unsat core size     : 0
% 0.19/0.50  #    Propositional preprocessing time  : 0.000
% 0.19/0.50  #    Propositional encoding time       : 0.000
% 0.19/0.50  #    Propositional solver time         : 0.000
% 0.19/0.50  #    Success case prop preproc time    : 0.000
% 0.19/0.50  #    Success case prop encoding time   : 0.000
% 0.19/0.50  #    Success case prop solver time     : 0.000
% 0.19/0.50  # Current number of processed clauses  : 112
% 0.19/0.50  #    Positive orientable unit clauses  : 33
% 0.19/0.50  #    Positive unorientable unit clauses: 0
% 0.19/0.50  #    Negative unit clauses             : 5
% 0.19/0.50  #    Non-unit-clauses                  : 74
% 0.19/0.50  # Current number of unprocessed clauses: 92
% 0.19/0.50  # ...number of literals in the above   : 281
% 0.19/0.50  # Current number of archived formulas  : 0
% 0.19/0.50  # Current number of archived clauses   : 49
% 0.19/0.50  # Clause-clause subsumption calls (NU) : 746
% 0.19/0.50  # Rec. Clause-clause subsumption calls : 240
% 0.19/0.50  # Non-unit clause-clause subsumptions  : 18
% 0.19/0.50  # Unit Clause-clause subsumption calls : 233
% 0.19/0.50  # Rewrite failures with RHS unbound    : 0
% 0.19/0.50  # BW rewrite match attempts            : 52
% 0.19/0.50  # BW rewrite match successes           : 0
% 0.19/0.50  # Condensation attempts                : 0
% 0.19/0.50  # Condensation successes               : 0
% 0.19/0.50  # Termbank termtop insertions          : 8320
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.014 s
% 0.19/0.50  # System time              : 0.002 s
% 0.19/0.50  # Total time               : 0.017 s
% 0.19/0.50  # Maximum resident set size: 1864 pages
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.018 s
% 0.19/0.50  # System time              : 0.003 s
% 0.19/0.50  # Total time               : 0.020 s
% 0.19/0.50  # Maximum resident set size: 1704 pages
% 0.19/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------