TSTP Solution File: RNG109+4 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : RNG109+4 : TPTP v8.2.0. 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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 02:37:11 EDT 2024

% Result   : Theorem 0.16s 0.46s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (  11 unt;   0 def)
%            Number of atoms       :  115 (  53 equ)
%            Maximal formula atoms :   26 (   3 avg)
%            Number of connectives :  121 (  35   ~;  35   |;  42   &)
%                                         (   4 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   7 con; 0-2 aty)
%            Number of variables   :   38 (   0 sgn  15   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ? [X1] :
      ( ( ! [X2] :
            ( aElementOf0(X2,slsdtgt0(xa))
          <=> ? [X3] :
                ( aElement0(X3)
                & sdtasdt0(xa,X3) = X2 ) )
       => ( ! [X2] :
              ( aElementOf0(X2,slsdtgt0(xb))
            <=> ? [X3] :
                  ( aElement0(X3)
                  & sdtasdt0(xb,X3) = X2 ) )
         => ( ? [X2,X3] :
                ( aElementOf0(X2,slsdtgt0(xa))
                & aElementOf0(X3,slsdtgt0(xb))
                & sdtpldt0(X2,X3) = X1 )
            | aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) )
      & X1 != sz00 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__2203,hypothesis,
    ( ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xa,X1) = sz00 )
    & aElementOf0(sz00,slsdtgt0(xa))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xa,X1) = xa )
    & aElementOf0(xa,slsdtgt0(xa))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xb,X1) = sz00 )
    & aElementOf0(sz00,slsdtgt0(xb))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xb,X1) = xb )
    & aElementOf0(xb,slsdtgt0(xb)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2203) ).

fof(mAddZero,axiom,
    ! [X1] :
      ( aElement0(X1)
     => ( sdtpldt0(X1,sz00) = X1
        & X1 = sdtpldt0(sz00,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddZero) ).

fof(m__2110,hypothesis,
    ( xa != sz00
    | xb != sz00 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2110) ).

fof(m__2091,hypothesis,
    ( aElement0(xa)
    & aElement0(xb) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X1] :
        ( ( ! [X2] :
              ( aElementOf0(X2,slsdtgt0(xa))
            <=> ? [X3] :
                  ( aElement0(X3)
                  & sdtasdt0(xa,X3) = X2 ) )
         => ( ! [X2] :
                ( aElementOf0(X2,slsdtgt0(xb))
              <=> ? [X3] :
                    ( aElement0(X3)
                    & sdtasdt0(xb,X3) = X2 ) )
           => ( ? [X2,X3] :
                  ( aElementOf0(X2,slsdtgt0(xa))
                  & aElementOf0(X3,slsdtgt0(xb))
                  & sdtpldt0(X2,X3) = X1 )
              | aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) )
        & X1 != sz00 ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_6,negated_conjecture,
    ! [X143,X144,X146,X147,X148,X150,X151,X152,X153] :
      ( ( aElement0(esk32_2(X143,X144))
        | ~ aElementOf0(X144,slsdtgt0(xa))
        | X143 = sz00 )
      & ( sdtasdt0(xa,esk32_2(X143,X144)) = X144
        | ~ aElementOf0(X144,slsdtgt0(xa))
        | X143 = sz00 )
      & ( ~ aElement0(X147)
        | sdtasdt0(xa,X147) != X146
        | aElementOf0(X146,slsdtgt0(xa))
        | X143 = sz00 )
      & ( aElement0(esk33_2(X143,X148))
        | ~ aElementOf0(X148,slsdtgt0(xb))
        | X143 = sz00 )
      & ( sdtasdt0(xb,esk33_2(X143,X148)) = X148
        | ~ aElementOf0(X148,slsdtgt0(xb))
        | X143 = sz00 )
      & ( ~ aElement0(X151)
        | sdtasdt0(xb,X151) != X150
        | aElementOf0(X150,slsdtgt0(xb))
        | X143 = sz00 )
      & ( ~ aElementOf0(X152,slsdtgt0(xa))
        | ~ aElementOf0(X153,slsdtgt0(xb))
        | sdtpldt0(X152,X153) != X143
        | X143 = sz00 )
      & ( ~ aElementOf0(X143,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
        | X143 = sz00 ) ),
    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)],[c_0_5])])])])])])]) ).

cnf(c_0_7,negated_conjecture,
    ( X3 = sz00
    | ~ aElementOf0(X1,slsdtgt0(xa))
    | ~ aElementOf0(X2,slsdtgt0(xb))
    | sdtpldt0(X1,X2) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_8,hypothesis,
    ( aElement0(esk28_0)
    & sdtasdt0(xa,esk28_0) = sz00
    & aElementOf0(sz00,slsdtgt0(xa))
    & aElement0(esk29_0)
    & sdtasdt0(xa,esk29_0) = xa
    & aElementOf0(xa,slsdtgt0(xa))
    & aElement0(esk30_0)
    & sdtasdt0(xb,esk30_0) = sz00
    & aElementOf0(sz00,slsdtgt0(xb))
    & aElement0(esk31_0)
    & sdtasdt0(xb,esk31_0) = xb
    & aElementOf0(xb,slsdtgt0(xb)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2203])]) ).

cnf(c_0_9,negated_conjecture,
    ( sdtpldt0(X1,X2) = sz00
    | ~ aElementOf0(X2,slsdtgt0(xb))
    | ~ aElementOf0(X1,slsdtgt0(xa)) ),
    inference(er,[status(thm)],[c_0_7]) ).

cnf(c_0_10,hypothesis,
    aElementOf0(xb,slsdtgt0(xb)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_11,plain,
    ! [X18] :
      ( ( sdtpldt0(X18,sz00) = X18
        | ~ aElement0(X18) )
      & ( X18 = sdtpldt0(sz00,X18)
        | ~ aElement0(X18) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).

cnf(c_0_12,hypothesis,
    ( sdtpldt0(X1,xb) = sz00
    | ~ aElementOf0(X1,slsdtgt0(xa)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,hypothesis,
    aElementOf0(sz00,slsdtgt0(xa)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_14,hypothesis,
    ( xa != sz00
    | xb != sz00 ),
    inference(fof_simplification,[status(thm)],[m__2110]) ).

cnf(c_0_15,hypothesis,
    aElementOf0(xa,slsdtgt0(xa)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,plain,
    ( X1 = sdtpldt0(sz00,X1)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,hypothesis,
    sdtpldt0(sz00,xb) = sz00,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,hypothesis,
    aElement0(xb),
    inference(split_conjunct,[status(thm)],[m__2091]) ).

fof(c_0_19,hypothesis,
    ( xa != sz00
    | xb != sz00 ),
    inference(fof_nnf,[status(thm)],[c_0_14]) ).

cnf(c_0_20,hypothesis,
    sdtpldt0(xa,xb) = sz00,
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_21,hypothesis,
    sz00 = xb,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_22,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_23,hypothesis,
    ( xa != sz00
    | xb != sz00 ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,hypothesis,
    sdtpldt0(xa,xb) = xb,
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    ( sdtpldt0(X1,xb) = X1
    | ~ aElement0(X1) ),
    inference(rw,[status(thm)],[c_0_22,c_0_21]) ).

cnf(c_0_26,hypothesis,
    aElement0(xa),
    inference(split_conjunct,[status(thm)],[m__2091]) ).

cnf(c_0_27,hypothesis,
    xb != xa,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_21]),c_0_21])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : RNG109+4 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n026.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Sat May 18 12:20:53 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.16/0.40  Running first-order model finding
% 0.16/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.16/0.46  # Version: 3.1.0
% 0.16/0.46  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46  # Starting sh5l with 300s (1) cores
% 0.16/0.46  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2613 completed with status 0
% 0.16/0.46  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.46  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46  # No SInE strategy applied
% 0.16/0.46  # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.16/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.16/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.46  # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.16/0.46  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.16/0.46  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.46  # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 2621 completed with status 0
% 0.16/0.46  # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46  # No SInE strategy applied
% 0.16/0.46  # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.16/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.16/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.46  # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.16/0.46  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.16/0.46  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.46  # Preprocessing time       : 0.002 s
% 0.16/0.46  # Presaturation interreduction done
% 0.16/0.46  
% 0.16/0.46  # Proof found!
% 0.16/0.46  # SZS status Theorem
% 0.16/0.46  # SZS output start CNFRefutation
% See solution above
% 0.16/0.46  # Parsed axioms                        : 44
% 0.16/0.46  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.46  # Initial clauses                      : 169
% 0.16/0.46  # Removed in clause preprocessing      : 4
% 0.16/0.46  # Initial clauses in saturation        : 165
% 0.16/0.46  # Processed clauses                    : 557
% 0.16/0.46  # ...of these trivial                  : 24
% 0.16/0.46  # ...subsumed                          : 40
% 0.16/0.46  # ...remaining for further processing  : 493
% 0.16/0.46  # Other redundant clauses eliminated   : 50
% 0.16/0.46  # Clauses deleted for lack of memory   : 0
% 0.16/0.46  # Backward-subsumed                    : 3
% 0.16/0.46  # Backward-rewritten                   : 89
% 0.16/0.46  # Generated clauses                    : 2754
% 0.16/0.46  # ...of the previous two non-redundant : 2454
% 0.16/0.46  # ...aggressively subsumed             : 0
% 0.16/0.46  # Contextual simplify-reflections      : 6
% 0.16/0.46  # Paramodulations                      : 2706
% 0.16/0.46  # Factorizations                       : 0
% 0.16/0.46  # NegExts                              : 0
% 0.16/0.46  # Equation resolutions                 : 50
% 0.16/0.46  # Disequality decompositions           : 0
% 0.16/0.46  # Total rewrite steps                  : 1521
% 0.16/0.46  # ...of those cached                   : 1465
% 0.16/0.46  # Propositional unsat checks           : 0
% 0.16/0.46  #    Propositional check models        : 0
% 0.16/0.46  #    Propositional check unsatisfiable : 0
% 0.16/0.46  #    Propositional clauses             : 0
% 0.16/0.46  #    Propositional clauses after purity: 0
% 0.16/0.46  #    Propositional unsat core size     : 0
% 0.16/0.46  #    Propositional preprocessing time  : 0.000
% 0.16/0.46  #    Propositional encoding time       : 0.000
% 0.16/0.46  #    Propositional solver time         : 0.000
% 0.16/0.46  #    Success case prop preproc time    : 0.000
% 0.16/0.46  #    Success case prop encoding time   : 0.000
% 0.16/0.46  #    Success case prop solver time     : 0.000
% 0.16/0.46  # Current number of processed clauses  : 219
% 0.16/0.46  #    Positive orientable unit clauses  : 52
% 0.16/0.46  #    Positive unorientable unit clauses: 0
% 0.16/0.46  #    Negative unit clauses             : 2
% 0.16/0.46  #    Non-unit-clauses                  : 165
% 0.16/0.46  # Current number of unprocessed clauses: 2125
% 0.16/0.46  # ...number of literals in the above   : 7309
% 0.16/0.46  # Current number of archived formulas  : 0
% 0.16/0.46  # Current number of archived clauses   : 254
% 0.16/0.46  # Clause-clause subsumption calls (NU) : 6271
% 0.16/0.46  # Rec. Clause-clause subsumption calls : 2526
% 0.16/0.46  # Non-unit clause-clause subsumptions  : 48
% 0.16/0.46  # Unit Clause-clause subsumption calls : 204
% 0.16/0.46  # Rewrite failures with RHS unbound    : 0
% 0.16/0.46  # BW rewrite match attempts            : 8
% 0.16/0.46  # BW rewrite match successes           : 8
% 0.16/0.46  # Condensation attempts                : 0
% 0.16/0.46  # Condensation successes               : 0
% 0.16/0.46  # Termbank termtop insertions          : 52804
% 0.16/0.46  # Search garbage collected termcells   : 2605
% 0.16/0.46  
% 0.16/0.46  # -------------------------------------------------
% 0.16/0.46  # User time                : 0.038 s
% 0.16/0.46  # System time              : 0.005 s
% 0.16/0.46  # Total time               : 0.044 s
% 0.16/0.46  # Maximum resident set size: 2220 pages
% 0.16/0.46  
% 0.16/0.46  # -------------------------------------------------
% 0.16/0.46  # User time                : 0.184 s
% 0.16/0.46  # System time              : 0.018 s
% 0.16/0.46  # Total time               : 0.201 s
% 0.16/0.46  # Maximum resident set size: 1764 pages
% 0.16/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------