TSTP Solution File: COM016+1 by E-SAT---3.1.00

View Problem - Process Solution

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

% 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  : 300s
% DateTime : Mon May 20 19:08:17 EDT 2024

% Result   : Theorem 0.18s 0.47s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  11 unt;   0 def)
%            Number of atoms       :  119 (   4 equ)
%            Maximal formula atoms :   30 (   4 avg)
%            Number of connectives :  156 (  64   ~;  69   |;  19   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-3 aty)
%            Number of variables   :   35 (   0 sgn  14   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ? [X1] :
      ( aElement0(X1)
      & aReductOfIn0(X1,xa,xR)
      & sdtmndtasgtdt0(X1,xR,xb) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(mTCRDef,axiom,
    ! [X1,X2,X3] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2)
        & aElement0(X3) )
     => ( sdtmndtasgtdt0(X1,X2,X3)
      <=> ( X1 = X3
          | sdtmndtplgtdt0(X1,X2,X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).

fof(mTCDef,axiom,
    ! [X1,X2,X3] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2)
        & aElement0(X3) )
     => ( sdtmndtplgtdt0(X1,X2,X3)
      <=> ( aReductOfIn0(X3,X1,X2)
          | ? [X4] :
              ( aElement0(X4)
              & aReductOfIn0(X4,X1,X2)
              & sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).

fof(m__731,hypothesis,
    ( aElement0(xa)
    & aElement0(xb)
    & aElement0(xc) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).

fof(m__656,hypothesis,
    aRewritingSystem0(xR),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).

fof(m__731_02,hypothesis,
    ( sdtmndtplgtdt0(xa,xR,xb)
    & sdtmndtplgtdt0(xa,xR,xc) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731_02) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X1] :
        ( aElement0(X1)
        & aReductOfIn0(X1,xa,xR)
        & sdtmndtasgtdt0(X1,xR,xb) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_7,plain,
    ! [X30,X31,X32] :
      ( ( ~ sdtmndtasgtdt0(X30,X31,X32)
        | X30 = X32
        | sdtmndtplgtdt0(X30,X31,X32)
        | ~ aElement0(X30)
        | ~ aRewritingSystem0(X31)
        | ~ aElement0(X32) )
      & ( X30 != X32
        | sdtmndtasgtdt0(X30,X31,X32)
        | ~ aElement0(X30)
        | ~ aRewritingSystem0(X31)
        | ~ aElement0(X32) )
      & ( ~ sdtmndtplgtdt0(X30,X31,X32)
        | sdtmndtasgtdt0(X30,X31,X32)
        | ~ aElement0(X30)
        | ~ aRewritingSystem0(X31)
        | ~ aElement0(X32) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).

fof(c_0_8,negated_conjecture,
    ! [X10] :
      ( ~ aElement0(X10)
      | ~ aReductOfIn0(X10,xa,xR)
      | ~ sdtmndtasgtdt0(X10,xR,xb) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

cnf(c_0_9,plain,
    ( sdtmndtasgtdt0(X1,X3,X2)
    | X1 != X2
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X3)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X42,X43,X44,X46] :
      ( ( aElement0(esk9_3(X42,X43,X44))
        | aReductOfIn0(X44,X42,X43)
        | ~ sdtmndtplgtdt0(X42,X43,X44)
        | ~ aElement0(X42)
        | ~ aRewritingSystem0(X43)
        | ~ aElement0(X44) )
      & ( aReductOfIn0(esk9_3(X42,X43,X44),X42,X43)
        | aReductOfIn0(X44,X42,X43)
        | ~ sdtmndtplgtdt0(X42,X43,X44)
        | ~ aElement0(X42)
        | ~ aRewritingSystem0(X43)
        | ~ aElement0(X44) )
      & ( sdtmndtplgtdt0(esk9_3(X42,X43,X44),X43,X44)
        | aReductOfIn0(X44,X42,X43)
        | ~ sdtmndtplgtdt0(X42,X43,X44)
        | ~ aElement0(X42)
        | ~ aRewritingSystem0(X43)
        | ~ aElement0(X44) )
      & ( ~ aReductOfIn0(X44,X42,X43)
        | sdtmndtplgtdt0(X42,X43,X44)
        | ~ aElement0(X42)
        | ~ aRewritingSystem0(X43)
        | ~ aElement0(X44) )
      & ( ~ aElement0(X46)
        | ~ aReductOfIn0(X46,X42,X43)
        | ~ sdtmndtplgtdt0(X46,X43,X44)
        | sdtmndtplgtdt0(X42,X43,X44)
        | ~ aElement0(X42)
        | ~ aRewritingSystem0(X43)
        | ~ aElement0(X44) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCDef])])])])])]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ aReductOfIn0(X1,xa,xR)
    | ~ sdtmndtasgtdt0(X1,xR,xb) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( sdtmndtasgtdt0(X1,X2,X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X1) ),
    inference(er,[status(thm)],[c_0_9]) ).

cnf(c_0_13,hypothesis,
    aElement0(xb),
    inference(split_conjunct,[status(thm)],[m__731]) ).

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

cnf(c_0_15,plain,
    ( sdtmndtplgtdt0(esk9_3(X1,X2,X3),X2,X3)
    | aReductOfIn0(X3,X1,X2)
    | ~ sdtmndtplgtdt0(X1,X2,X3)
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,hypothesis,
    sdtmndtplgtdt0(xa,xR,xb),
    inference(split_conjunct,[status(thm)],[m__731_02]) ).

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

cnf(c_0_18,negated_conjecture,
    ~ aReductOfIn0(xb,xa,xR),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_19,plain,
    ( aElement0(esk9_3(X1,X2,X3))
    | aReductOfIn0(X3,X1,X2)
    | ~ sdtmndtplgtdt0(X1,X2,X3)
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,plain,
    ( sdtmndtasgtdt0(X1,X2,X3)
    | ~ sdtmndtplgtdt0(X1,X2,X3)
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,hypothesis,
    sdtmndtplgtdt0(esk9_3(xa,xR,xb),xR,xb),
    inference(sr,[status(thm)],[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_14]),c_0_13]),c_0_17])]),c_0_18]) ).

cnf(c_0_22,hypothesis,
    aElement0(esk9_3(xa,xR,xb)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_14]),c_0_13]),c_0_17])]),c_0_18]) ).

cnf(c_0_23,plain,
    ( aReductOfIn0(esk9_3(X1,X2,X3),X1,X2)
    | aReductOfIn0(X3,X1,X2)
    | ~ sdtmndtplgtdt0(X1,X2,X3)
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_24,hypothesis,
    sdtmndtasgtdt0(esk9_3(xa,xR,xb),xR,xb),
    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_14]),c_0_13]),c_0_22])]) ).

cnf(c_0_25,hypothesis,
    aReductOfIn0(esk9_3(xa,xR,xb),xa,xR),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_14]),c_0_13]),c_0_17])]),c_0_18]) ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_24]),c_0_25]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem    : COM016+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun May 19 10:29:23 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.45  Running first-order model finding
% 0.18/0.45  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.18/0.47  # Version: 3.1.0
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # new_bool_3 with pid 25615 completed with status 0
% 0.18/0.47  # Result found by new_bool_3
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47  # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.18/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.18/0.47  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 25619 completed with status 0
% 0.18/0.47  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47  # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.18/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.18/0.47  # Preprocessing time       : 0.001 s
% 0.18/0.47  # Presaturation interreduction done
% 0.18/0.47  
% 0.18/0.47  # Proof found!
% 0.18/0.47  # SZS status Theorem
% 0.18/0.47  # SZS output start CNFRefutation
% See solution above
% 0.18/0.47  # Parsed axioms                        : 20
% 0.18/0.47  # Removed by relevancy pruning/SinE    : 1
% 0.18/0.47  # Initial clauses                      : 46
% 0.18/0.47  # Removed in clause preprocessing      : 4
% 0.18/0.47  # Initial clauses in saturation        : 42
% 0.18/0.47  # Processed clauses                    : 106
% 0.18/0.47  # ...of these trivial                  : 0
% 0.18/0.47  # ...subsumed                          : 0
% 0.18/0.47  # ...remaining for further processing  : 106
% 0.18/0.47  # Other redundant clauses eliminated   : 1
% 0.18/0.47  # Clauses deleted for lack of memory   : 0
% 0.18/0.47  # Backward-subsumed                    : 0
% 0.18/0.47  # Backward-rewritten                   : 0
% 0.18/0.47  # Generated clauses                    : 75
% 0.18/0.47  # ...of the previous two non-redundant : 61
% 0.18/0.47  # ...aggressively subsumed             : 0
% 0.18/0.47  # Contextual simplify-reflections      : 8
% 0.18/0.47  # Paramodulations                      : 74
% 0.18/0.47  # Factorizations                       : 0
% 0.18/0.47  # NegExts                              : 0
% 0.18/0.47  # Equation resolutions                 : 1
% 0.18/0.47  # Disequality decompositions           : 0
% 0.18/0.47  # Total rewrite steps                  : 164
% 0.18/0.47  # ...of those cached                   : 151
% 0.18/0.47  # Propositional unsat checks           : 0
% 0.18/0.47  #    Propositional check models        : 0
% 0.18/0.47  #    Propositional check unsatisfiable : 0
% 0.18/0.47  #    Propositional clauses             : 0
% 0.18/0.47  #    Propositional clauses after purity: 0
% 0.18/0.47  #    Propositional unsat core size     : 0
% 0.18/0.47  #    Propositional preprocessing time  : 0.000
% 0.18/0.47  #    Propositional encoding time       : 0.000
% 0.18/0.47  #    Propositional solver time         : 0.000
% 0.18/0.47  #    Success case prop preproc time    : 0.000
% 0.18/0.47  #    Success case prop encoding time   : 0.000
% 0.18/0.47  #    Success case prop solver time     : 0.000
% 0.18/0.47  # Current number of processed clauses  : 63
% 0.18/0.47  #    Positive orientable unit clauses  : 19
% 0.18/0.47  #    Positive unorientable unit clauses: 0
% 0.18/0.47  #    Negative unit clauses             : 2
% 0.18/0.47  #    Non-unit-clauses                  : 42
% 0.18/0.47  # Current number of unprocessed clauses: 37
% 0.18/0.47  # ...number of literals in the above   : 121
% 0.18/0.47  # Current number of archived formulas  : 0
% 0.18/0.47  # Current number of archived clauses   : 42
% 0.18/0.47  # Clause-clause subsumption calls (NU) : 467
% 0.18/0.47  # Rec. Clause-clause subsumption calls : 63
% 0.18/0.47  # Non-unit clause-clause subsumptions  : 8
% 0.18/0.47  # Unit Clause-clause subsumption calls : 51
% 0.18/0.47  # Rewrite failures with RHS unbound    : 0
% 0.18/0.47  # BW rewrite match attempts            : 9
% 0.18/0.47  # BW rewrite match successes           : 0
% 0.18/0.47  # Condensation attempts                : 0
% 0.18/0.47  # Condensation successes               : 0
% 0.18/0.47  # Termbank termtop insertions          : 6273
% 0.18/0.47  # Search garbage collected termcells   : 955
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.011 s
% 0.18/0.47  # System time              : 0.003 s
% 0.18/0.47  # Total time               : 0.014 s
% 0.18/0.47  # Maximum resident set size: 1868 pages
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.012 s
% 0.18/0.47  # System time              : 0.005 s
% 0.18/0.47  # Total time               : 0.017 s
% 0.18/0.47  # Maximum resident set size: 1716 pages
% 0.18/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------