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

View Problem - Process Solution

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

% Computer : n032.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:37:04 EDT 2024

% Result   : Theorem 0.15s 0.54s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  15 unt;   0 def)
%            Number of atoms       :  145 (  21 equ)
%            Maximal formula atoms :   52 (   4 avg)
%            Number of connectives :  188 (  74   ~;  81   |;  26   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;   9 con; 0-4 aty)
%            Number of variables   :   40 (   0 sgn  23   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefSSum,axiom,
    ! [X1,X2] :
      ( ( aSet0(X1)
        & aSet0(X2) )
     => ! [X3] :
          ( X3 = sdtpldt1(X1,X2)
        <=> ( aSet0(X3)
            & ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ? [X5,X6] :
                    ( aElementOf0(X5,X1)
                    & aElementOf0(X6,X2)
                    & sdtpldt0(X5,X6) = X4 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSSum) ).

fof(mDefIdeal,axiom,
    ! [X1] :
      ( aIdeal0(X1)
    <=> ( aSet0(X1)
        & ! [X2] :
            ( aElementOf0(X2,X1)
           => ( ! [X3] :
                  ( aElementOf0(X3,X1)
                 => aElementOf0(sdtpldt0(X2,X3),X1) )
              & ! [X3] :
                  ( aElement0(X3)
                 => aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).

fof(m__870,hypothesis,
    ( aIdeal0(xI)
    & aIdeal0(xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).

fof(m__,conjecture,
    ( aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
    & aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__1021,hypothesis,
    ( aElementOf0(sdtasdt0(xz,xk),xI)
    & aElementOf0(sdtasdt0(xz,xl),xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1021) ).

fof(m__1098,hypothesis,
    sdtasdt0(xz,xx) = sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1098) ).

fof(m__994,hypothesis,
    ( aElementOf0(sdtpldt0(xk,xm),xI)
    & aElementOf0(sdtpldt0(xl,xn),xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__994) ).

fof(m__1061,hypothesis,
    sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1061) ).

fof(c_0_8,plain,
    ! [X23,X24,X25,X26,X29,X30,X31,X32,X34,X35] :
      ( ( aSet0(X25)
        | X25 != sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( aElementOf0(esk4_4(X23,X24,X25,X26),X23)
        | ~ aElementOf0(X26,X25)
        | X25 != sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( aElementOf0(esk5_4(X23,X24,X25,X26),X24)
        | ~ aElementOf0(X26,X25)
        | X25 != sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( sdtpldt0(esk4_4(X23,X24,X25,X26),esk5_4(X23,X24,X25,X26)) = X26
        | ~ aElementOf0(X26,X25)
        | X25 != sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( ~ aElementOf0(X30,X23)
        | ~ aElementOf0(X31,X24)
        | sdtpldt0(X30,X31) != X29
        | aElementOf0(X29,X25)
        | X25 != sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( ~ aElementOf0(esk6_3(X23,X24,X32),X32)
        | ~ aElementOf0(X34,X23)
        | ~ aElementOf0(X35,X24)
        | sdtpldt0(X34,X35) != esk6_3(X23,X24,X32)
        | ~ aSet0(X32)
        | X32 = sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( aElementOf0(esk7_3(X23,X24,X32),X23)
        | aElementOf0(esk6_3(X23,X24,X32),X32)
        | ~ aSet0(X32)
        | X32 = sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( aElementOf0(esk8_3(X23,X24,X32),X24)
        | aElementOf0(esk6_3(X23,X24,X32),X32)
        | ~ aSet0(X32)
        | X32 = sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) )
      & ( sdtpldt0(esk7_3(X23,X24,X32),esk8_3(X23,X24,X32)) = esk6_3(X23,X24,X32)
        | aElementOf0(esk6_3(X23,X24,X32),X32)
        | ~ aSet0(X32)
        | X32 = sdtpldt1(X23,X24)
        | ~ aSet0(X23)
        | ~ aSet0(X24) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSSum])])])])])])]) ).

fof(c_0_9,plain,
    ! [X7,X8,X9,X10,X11] :
      ( ( aSet0(X7)
        | ~ aIdeal0(X7) )
      & ( ~ aElementOf0(X9,X7)
        | aElementOf0(sdtpldt0(X8,X9),X7)
        | ~ aElementOf0(X8,X7)
        | ~ aIdeal0(X7) )
      & ( ~ aElement0(X10)
        | aElementOf0(sdtasdt0(X10,X8),X7)
        | ~ aElementOf0(X8,X7)
        | ~ aIdeal0(X7) )
      & ( aElementOf0(esk1_1(X11),X11)
        | ~ aSet0(X11)
        | aIdeal0(X11) )
      & ( aElement0(esk3_1(X11))
        | aElementOf0(esk2_1(X11),X11)
        | ~ aSet0(X11)
        | aIdeal0(X11) )
      & ( ~ aElementOf0(sdtasdt0(esk3_1(X11),esk1_1(X11)),X11)
        | aElementOf0(esk2_1(X11),X11)
        | ~ aSet0(X11)
        | aIdeal0(X11) )
      & ( aElement0(esk3_1(X11))
        | ~ aElementOf0(sdtpldt0(esk1_1(X11),esk2_1(X11)),X11)
        | ~ aSet0(X11)
        | aIdeal0(X11) )
      & ( ~ aElementOf0(sdtasdt0(esk3_1(X11),esk1_1(X11)),X11)
        | ~ aElementOf0(sdtpldt0(esk1_1(X11),esk2_1(X11)),X11)
        | ~ aSet0(X11)
        | aIdeal0(X11) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefIdeal])])])])])])]) ).

cnf(c_0_10,plain,
    ( aElementOf0(X5,X6)
    | ~ aElementOf0(X1,X2)
    | ~ aElementOf0(X3,X4)
    | sdtpldt0(X1,X3) != X5
    | X6 != sdtpldt1(X2,X4)
    | ~ aSet0(X2)
    | ~ aSet0(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    ( aSet0(X1)
    | ~ aIdeal0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,hypothesis,
    aIdeal0(xJ),
    inference(split_conjunct,[status(thm)],[m__870]) ).

fof(c_0_13,negated_conjecture,
    ~ ( aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
      & aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_14,plain,
    ( aElementOf0(sdtpldt0(X1,X2),sdtpldt1(X3,X4))
    | ~ aElementOf0(X2,X4)
    | ~ aElementOf0(X1,X3)
    | ~ aSet0(X4)
    | ~ aSet0(X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).

cnf(c_0_15,hypothesis,
    aElementOf0(sdtasdt0(xz,xl),xJ),
    inference(split_conjunct,[status(thm)],[m__1021]) ).

cnf(c_0_16,hypothesis,
    aSet0(xJ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,hypothesis,
    aIdeal0(xI),
    inference(split_conjunct,[status(thm)],[m__870]) ).

fof(c_0_18,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
    | ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).

cnf(c_0_19,hypothesis,
    ( aElementOf0(sdtpldt0(X1,sdtasdt0(xz,xl)),sdtpldt1(X2,xJ))
    | ~ aElementOf0(X1,X2)
    | ~ aSet0(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_20,hypothesis,
    aElementOf0(sdtasdt0(xz,xk),xI),
    inference(split_conjunct,[status(thm)],[m__1021]) ).

cnf(c_0_21,hypothesis,
    sdtasdt0(xz,xx) = sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)),
    inference(split_conjunct,[status(thm)],[m__1098]) ).

cnf(c_0_22,hypothesis,
    aSet0(xI),
    inference(spm,[status(thm)],[c_0_11,c_0_17]) ).

cnf(c_0_23,hypothesis,
    aElementOf0(sdtpldt0(xl,xn),xJ),
    inference(split_conjunct,[status(thm)],[m__994]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
    | ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,hypothesis,
    aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).

cnf(c_0_26,hypothesis,
    ( aElementOf0(sdtpldt0(X1,sdtpldt0(xl,xn)),sdtpldt1(X2,xJ))
    | ~ aElementOf0(X1,X2)
    | ~ aSet0(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_16])]) ).

cnf(c_0_27,hypothesis,
    aElementOf0(sdtpldt0(xk,xm),xI),
    inference(split_conjunct,[status(thm)],[m__994]) ).

cnf(c_0_28,hypothesis,
    sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
    inference(split_conjunct,[status(thm)],[m__1061]) ).

cnf(c_0_29,negated_conjecture,
    ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).

cnf(c_0_30,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_22])]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : RNG091+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.11  % Command    : run_E %s %d THM
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit   : 300
% 0.11/0.30  % WCLimit    : 300
% 0.11/0.30  % DateTime   : Sat May 18 12:25:37 EDT 2024
% 0.11/0.30  % CPUTime    : 
% 0.15/0.40  Running first-order model finding
% 0.15/0.40  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.54  # Version: 3.1.0
% 0.15/0.54  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.54  # Starting sh5l with 300s (1) cores
% 0.15/0.54  # new_bool_3 with pid 7796 completed with status 0
% 0.15/0.54  # Result found by new_bool_3
% 0.15/0.54  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.54  # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.15/0.54  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.15/0.54  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 7799 completed with status 0
% 0.15/0.54  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.15/0.54  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.54  # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.15/0.54  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.15/0.54  # Preprocessing time       : 0.001 s
% 0.15/0.54  # Presaturation interreduction done
% 0.15/0.54  
% 0.15/0.54  # Proof found!
% 0.15/0.54  # SZS status Theorem
% 0.15/0.54  # SZS output start CNFRefutation
% See solution above
% 0.15/0.54  # Parsed axioms                        : 33
% 0.15/0.54  # Removed by relevancy pruning/SinE    : 11
% 0.15/0.54  # Initial clauses                      : 50
% 0.15/0.54  # Removed in clause preprocessing      : 2
% 0.15/0.54  # Initial clauses in saturation        : 48
% 0.15/0.54  # Processed clauses                    : 589
% 0.15/0.54  # ...of these trivial                  : 29
% 0.15/0.54  # ...subsumed                          : 17
% 0.15/0.54  # ...remaining for further processing  : 543
% 0.15/0.54  # Other redundant clauses eliminated   : 8
% 0.15/0.54  # Clauses deleted for lack of memory   : 0
% 0.15/0.54  # Backward-subsumed                    : 49
% 0.15/0.54  # Backward-rewritten                   : 36
% 0.15/0.54  # Generated clauses                    : 6435
% 0.15/0.54  # ...of the previous two non-redundant : 6343
% 0.15/0.54  # ...aggressively subsumed             : 0
% 0.15/0.54  # Contextual simplify-reflections      : 1
% 0.15/0.54  # Paramodulations                      : 6428
% 0.15/0.54  # Factorizations                       : 0
% 0.15/0.54  # NegExts                              : 0
% 0.15/0.54  # Equation resolutions                 : 8
% 0.15/0.54  # Disequality decompositions           : 0
% 0.15/0.54  # Total rewrite steps                  : 2520
% 0.15/0.54  # ...of those cached                   : 2426
% 0.15/0.54  # Propositional unsat checks           : 0
% 0.15/0.54  #    Propositional check models        : 0
% 0.15/0.54  #    Propositional check unsatisfiable : 0
% 0.15/0.54  #    Propositional clauses             : 0
% 0.15/0.54  #    Propositional clauses after purity: 0
% 0.15/0.54  #    Propositional unsat core size     : 0
% 0.15/0.54  #    Propositional preprocessing time  : 0.000
% 0.15/0.54  #    Propositional encoding time       : 0.000
% 0.15/0.54  #    Propositional solver time         : 0.000
% 0.15/0.54  #    Success case prop preproc time    : 0.000
% 0.15/0.54  #    Success case prop encoding time   : 0.000
% 0.15/0.54  #    Success case prop solver time     : 0.000
% 0.15/0.54  # Current number of processed clauses  : 405
% 0.15/0.54  #    Positive orientable unit clauses  : 193
% 0.15/0.54  #    Positive unorientable unit clauses: 0
% 0.15/0.54  #    Negative unit clauses             : 1
% 0.15/0.54  #    Non-unit-clauses                  : 211
% 0.15/0.54  # Current number of unprocessed clauses: 5711
% 0.15/0.54  # ...number of literals in the above   : 28325
% 0.15/0.54  # Current number of archived formulas  : 0
% 0.15/0.54  # Current number of archived clauses   : 133
% 0.15/0.54  # Clause-clause subsumption calls (NU) : 38762
% 0.15/0.54  # Rec. Clause-clause subsumption calls : 800
% 0.15/0.54  # Non-unit clause-clause subsumptions  : 67
% 0.15/0.54  # Unit Clause-clause subsumption calls : 1180
% 0.15/0.54  # Rewrite failures with RHS unbound    : 0
% 0.15/0.54  # BW rewrite match attempts            : 55
% 0.15/0.54  # BW rewrite match successes           : 20
% 0.15/0.54  # Condensation attempts                : 0
% 0.15/0.54  # Condensation successes               : 0
% 0.15/0.54  # Termbank termtop insertions          : 134562
% 0.15/0.54  # Search garbage collected termcells   : 796
% 0.15/0.54  
% 0.15/0.54  # -------------------------------------------------
% 0.15/0.54  # User time                : 0.114 s
% 0.15/0.54  # System time              : 0.005 s
% 0.15/0.54  # Total time               : 0.119 s
% 0.15/0.54  # Maximum resident set size: 1852 pages
% 0.15/0.54  
% 0.15/0.54  # -------------------------------------------------
% 0.15/0.54  # User time                : 0.117 s
% 0.15/0.54  # System time              : 0.006 s
% 0.15/0.54  # Total time               : 0.122 s
% 0.15/0.54  # Maximum resident set size: 1748 pages
% 0.15/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------