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

View Problem - Process Solution

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

% Computer : n018.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:09 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(mAMDistr,axiom,
    ! [X1,X2,X3] :
      ( ( aElement0(X1)
        & aElement0(X2)
        & aElement0(X3) )
     => ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
        & sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAMDistr) ).

fof(m__,conjecture,
    sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__1979,hypothesis,
    ( aElement0(xv)
    & sdtasdt0(xc,xv) = xy ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1979) ).

fof(m__1905,hypothesis,
    aElement0(xc),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1905) ).

fof(m__1956,hypothesis,
    ( aElement0(xu)
    & sdtasdt0(xc,xu) = xx ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1956) ).

fof(c_0_5,plain,
    ! [X33,X34,X35] :
      ( ( sdtasdt0(X33,sdtpldt0(X34,X35)) = sdtpldt0(sdtasdt0(X33,X34),sdtasdt0(X33,X35))
        | ~ aElement0(X33)
        | ~ aElement0(X34)
        | ~ aElement0(X35) )
      & ( sdtasdt0(sdtpldt0(X34,X35),X33) = sdtpldt0(sdtasdt0(X34,X33),sdtasdt0(X35,X33))
        | ~ aElement0(X33)
        | ~ aElement0(X34)
        | ~ aElement0(X35) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])])]) ).

fof(c_0_6,negated_conjecture,
    sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_7,plain,
    ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
    | ~ aElement0(X1)
    | ~ aElement0(X2)
    | ~ aElement0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,hypothesis,
    sdtasdt0(xc,xv) = xy,
    inference(split_conjunct,[status(thm)],[m__1979]) ).

cnf(c_0_9,hypothesis,
    aElement0(xv),
    inference(split_conjunct,[status(thm)],[m__1979]) ).

cnf(c_0_10,hypothesis,
    aElement0(xc),
    inference(split_conjunct,[status(thm)],[m__1905]) ).

fof(c_0_11,negated_conjecture,
    sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

cnf(c_0_12,hypothesis,
    ( sdtpldt0(sdtasdt0(xc,X1),xy) = sdtasdt0(xc,sdtpldt0(X1,xv))
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]) ).

cnf(c_0_13,hypothesis,
    sdtasdt0(xc,xu) = xx,
    inference(split_conjunct,[status(thm)],[m__1956]) ).

cnf(c_0_14,hypothesis,
    aElement0(xu),
    inference(split_conjunct,[status(thm)],[m__1956]) ).

cnf(c_0_15,negated_conjecture,
    sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : RNG103+2 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.11/0.31  % Computer : n018.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Sat May 18 12:10:37 EDT 2024
% 0.11/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order model finding
% 0.16/0.42  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.45  # Version: 3.1.0
% 0.16/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # Starting sh5l with 300s (1) cores
% 0.16/0.45  # new_bool_1 with pid 28305 completed with status 0
% 0.16/0.45  # Result found by new_bool_1
% 0.16/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  # Search class: FGUSF-FFMM31-SFFFFFNN
% 0.16/0.45  # partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.45  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 28307 completed with status 0
% 0.16/0.45  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.16/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  # Search class: FGUSF-FFMM31-SFFFFFNN
% 0.16/0.45  # partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.45  # Preprocessing time       : 0.001 s
% 0.16/0.45  # Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  # Proof found!
% 0.16/0.45  # SZS status Theorem
% 0.16/0.45  # SZS output start CNFRefutation
% See solution above
% 0.16/0.45  # Parsed axioms                        : 42
% 0.16/0.45  # Removed by relevancy pruning/SinE    : 20
% 0.16/0.45  # Initial clauses                      : 49
% 0.16/0.45  # Removed in clause preprocessing      : 2
% 0.16/0.45  # Initial clauses in saturation        : 47
% 0.16/0.45  # Processed clauses                    : 190
% 0.16/0.45  # ...of these trivial                  : 7
% 0.16/0.45  # ...subsumed                          : 27
% 0.16/0.45  # ...remaining for further processing  : 156
% 0.16/0.45  # Other redundant clauses eliminated   : 8
% 0.16/0.45  # Clauses deleted for lack of memory   : 0
% 0.16/0.45  # Backward-subsumed                    : 2
% 0.16/0.45  # Backward-rewritten                   : 3
% 0.16/0.45  # Generated clauses                    : 419
% 0.16/0.45  # ...of the previous two non-redundant : 353
% 0.16/0.45  # ...aggressively subsumed             : 0
% 0.16/0.45  # Contextual simplify-reflections      : 0
% 0.16/0.45  # Paramodulations                      : 404
% 0.16/0.45  # Factorizations                       : 8
% 0.16/0.45  # NegExts                              : 0
% 0.16/0.45  # Equation resolutions                 : 8
% 0.16/0.45  # Disequality decompositions           : 0
% 0.16/0.45  # Total rewrite steps                  : 473
% 0.16/0.45  # ...of those cached                   : 451
% 0.16/0.45  # Propositional unsat checks           : 0
% 0.16/0.45  #    Propositional check models        : 0
% 0.16/0.45  #    Propositional check unsatisfiable : 0
% 0.16/0.45  #    Propositional clauses             : 0
% 0.16/0.45  #    Propositional clauses after purity: 0
% 0.16/0.45  #    Propositional unsat core size     : 0
% 0.16/0.45  #    Propositional preprocessing time  : 0.000
% 0.16/0.45  #    Propositional encoding time       : 0.000
% 0.16/0.45  #    Propositional solver time         : 0.000
% 0.16/0.45  #    Success case prop preproc time    : 0.000
% 0.16/0.45  #    Success case prop encoding time   : 0.000
% 0.16/0.45  #    Success case prop solver time     : 0.000
% 0.16/0.45  # Current number of processed clauses  : 100
% 0.16/0.45  #    Positive orientable unit clauses  : 39
% 0.16/0.45  #    Positive unorientable unit clauses: 0
% 0.16/0.45  #    Negative unit clauses             : 1
% 0.16/0.45  #    Non-unit-clauses                  : 60
% 0.16/0.45  # Current number of unprocessed clauses: 240
% 0.16/0.45  # ...number of literals in the above   : 818
% 0.16/0.45  # Current number of archived formulas  : 0
% 0.16/0.45  # Current number of archived clauses   : 52
% 0.16/0.45  # Clause-clause subsumption calls (NU) : 689
% 0.16/0.45  # Rec. Clause-clause subsumption calls : 441
% 0.16/0.45  # Non-unit clause-clause subsumptions  : 29
% 0.16/0.45  # Unit Clause-clause subsumption calls : 11
% 0.16/0.45  # Rewrite failures with RHS unbound    : 0
% 0.16/0.45  # BW rewrite match attempts            : 3
% 0.16/0.45  # BW rewrite match successes           : 3
% 0.16/0.45  # Condensation attempts                : 0
% 0.16/0.45  # Condensation successes               : 0
% 0.16/0.45  # Termbank termtop insertions          : 10211
% 0.16/0.45  # Search garbage collected termcells   : 913
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.013 s
% 0.16/0.45  # System time              : 0.002 s
% 0.16/0.45  # Total time               : 0.015 s
% 0.16/0.45  # Maximum resident set size: 1844 pages
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.015 s
% 0.16/0.45  # System time              : 0.003 s
% 0.16/0.45  # Total time               : 0.019 s
% 0.16/0.45  # Maximum resident set size: 1752 pages
% 0.16/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------