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

View Problem - Process Solution

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

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

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  15 unt;   0 def)
%            Number of atoms       :  104 (  22 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  127 (  56   ~;  52   |;  12   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn;  19   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefLE,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
      <=> ? [X3] :
            ( aNaturalNumber0(X3)
            & sdtpldt0(X1,X3) = X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',mDefLE) ).

fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',mSortsB) ).

fof(mDefDiff,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
       => ! [X3] :
            ( X3 = sdtmndt0(X2,X1)
          <=> ( aNaturalNumber0(X3)
              & sdtpldt0(X1,X3) = X2 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',mDefDiff) ).

fof(m__,conjecture,
    sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',m__) ).

fof(m__1951,hypothesis,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',m__1951) ).

fof(mSortsB_02,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',mSortsB_02) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',m__1837) ).

fof(m__1870,hypothesis,
    sdtlseqdt0(xp,xn),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',m__1870) ).

fof(m__1883,hypothesis,
    xr = sdtmndt0(xn,xp),
    file('/export/starexec/sandbox/tmp/tmp.9231A3fu1G/E---3.1_23405.p',m__1883) ).

fof(c_0_9,plain,
    ! [X34,X35,X37] :
      ( ( aNaturalNumber0(esk1_2(X34,X35))
        | ~ sdtlseqdt0(X34,X35)
        | ~ aNaturalNumber0(X34)
        | ~ aNaturalNumber0(X35) )
      & ( sdtpldt0(X34,esk1_2(X34,X35)) = X35
        | ~ sdtlseqdt0(X34,X35)
        | ~ aNaturalNumber0(X34)
        | ~ aNaturalNumber0(X35) )
      & ( ~ aNaturalNumber0(X37)
        | sdtpldt0(X34,X37) != X35
        | sdtlseqdt0(X34,X35)
        | ~ aNaturalNumber0(X34)
        | ~ aNaturalNumber0(X35) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefLE])])])])]) ).

fof(c_0_10,plain,
    ! [X4,X5] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | aNaturalNumber0(sdtpldt0(X4,X5)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).

fof(c_0_11,plain,
    ! [X38,X39,X40] :
      ( ( aNaturalNumber0(X40)
        | X40 != sdtmndt0(X39,X38)
        | ~ sdtlseqdt0(X38,X39)
        | ~ aNaturalNumber0(X38)
        | ~ aNaturalNumber0(X39) )
      & ( sdtpldt0(X38,X40) = X39
        | X40 != sdtmndt0(X39,X38)
        | ~ sdtlseqdt0(X38,X39)
        | ~ aNaturalNumber0(X38)
        | ~ aNaturalNumber0(X39) )
      & ( ~ aNaturalNumber0(X40)
        | sdtpldt0(X38,X40) != X39
        | X40 = sdtmndt0(X39,X38)
        | ~ sdtlseqdt0(X38,X39)
        | ~ aNaturalNumber0(X38)
        | ~ aNaturalNumber0(X39) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])]) ).

cnf(c_0_12,plain,
    ( sdtlseqdt0(X2,X3)
    | ~ aNaturalNumber0(X1)
    | sdtpldt0(X2,X1) != X3
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( X1 = sdtmndt0(X3,X2)
    | ~ aNaturalNumber0(X1)
    | sdtpldt0(X2,X1) != X3
    | ~ sdtlseqdt0(X2,X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    ( sdtlseqdt0(X1,sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13]) ).

fof(c_0_16,negated_conjecture,
    sdtasdt0(xr,xm) != sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_17,plain,
    ( sdtmndt0(sdtpldt0(X1,X2),X1) = X2
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_13]),c_0_15]) ).

cnf(c_0_18,hypothesis,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    inference(split_conjunct,[status(thm)],[m__1951]) ).

cnf(c_0_19,negated_conjecture,
    sdtasdt0(xr,xm) != sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_20,plain,
    ! [X6,X7] :
      ( ~ aNaturalNumber0(X6)
      | ~ aNaturalNumber0(X7)
      | aNaturalNumber0(sdtasdt0(X6,X7)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

cnf(c_0_21,plain,
    ( aNaturalNumber0(X1)
    | X1 != sdtmndt0(X2,X3)
    | ~ sdtlseqdt0(X3,X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_22,hypothesis,
    ( ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_23,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_24,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_25,hypothesis,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_26,plain,
    ( aNaturalNumber0(sdtmndt0(X1,X2))
    | ~ sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[c_0_21]) ).

cnf(c_0_27,hypothesis,
    sdtlseqdt0(xp,xn),
    inference(split_conjunct,[status(thm)],[m__1870]) ).

cnf(c_0_28,hypothesis,
    xr = sdtmndt0(xn,xp),
    inference(split_conjunct,[status(thm)],[m__1883]) ).

cnf(c_0_29,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_30,hypothesis,
    ~ aNaturalNumber0(sdtasdt0(xr,xm)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).

cnf(c_0_31,hypothesis,
    aNaturalNumber0(xr),
    inference(cn,[status(thm)],[inference(rw,[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_25]),c_0_29])]) ).

cnf(c_0_32,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_24]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM490+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n022.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   : 2400
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Oct  2 13:26:54 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.18/0.46  Running first-order model finding
% 0.18/0.46  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.9231A3fu1G/E---3.1_23405.p
% 0.18/0.48  # Version: 3.1pre001
% 0.18/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # Starting sh5l with 300s (1) cores
% 0.18/0.48  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23482 completed with status 0
% 0.18/0.48  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.48  # No SInE strategy applied
% 0.18/0.48  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.18/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.48  # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.18/0.48  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.18/0.48  # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.18/0.48  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 23486 completed with status 0
% 0.18/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.18/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.48  # No SInE strategy applied
% 0.18/0.48  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.18/0.48  # Preprocessing time       : 0.001 s
% 0.18/0.48  # Presaturation interreduction done
% 0.18/0.48  
% 0.18/0.48  # Proof found!
% 0.18/0.48  # SZS status Theorem
% 0.18/0.48  # SZS output start CNFRefutation
% See solution above
% 0.18/0.48  # Parsed axioms                        : 47
% 0.18/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.18/0.48  # Initial clauses                      : 83
% 0.18/0.48  # Removed in clause preprocessing      : 3
% 0.18/0.48  # Initial clauses in saturation        : 80
% 0.18/0.48  # Processed clauses                    : 218
% 0.18/0.48  # ...of these trivial                  : 6
% 0.18/0.48  # ...subsumed                          : 16
% 0.18/0.48  # ...remaining for further processing  : 196
% 0.18/0.48  # Other redundant clauses eliminated   : 19
% 0.18/0.48  # Clauses deleted for lack of memory   : 0
% 0.18/0.48  # Backward-subsumed                    : 8
% 0.18/0.48  # Backward-rewritten                   : 7
% 0.18/0.48  # Generated clauses                    : 410
% 0.18/0.48  # ...of the previous two non-redundant : 374
% 0.18/0.48  # ...aggressively subsumed             : 0
% 0.18/0.48  # Contextual simplify-reflections      : 6
% 0.18/0.48  # Paramodulations                      : 385
% 0.18/0.48  # Factorizations                       : 2
% 0.18/0.48  # NegExts                              : 0
% 0.18/0.48  # Equation resolutions                 : 23
% 0.18/0.48  # Total rewrite steps                  : 321
% 0.18/0.48  # Propositional unsat checks           : 0
% 0.18/0.48  #    Propositional check models        : 0
% 0.18/0.48  #    Propositional check unsatisfiable : 0
% 0.18/0.48  #    Propositional clauses             : 0
% 0.18/0.48  #    Propositional clauses after purity: 0
% 0.18/0.48  #    Propositional unsat core size     : 0
% 0.18/0.48  #    Propositional preprocessing time  : 0.000
% 0.18/0.48  #    Propositional encoding time       : 0.000
% 0.18/0.48  #    Propositional solver time         : 0.000
% 0.18/0.48  #    Success case prop preproc time    : 0.000
% 0.18/0.48  #    Success case prop encoding time   : 0.000
% 0.18/0.48  #    Success case prop solver time     : 0.000
% 0.18/0.48  # Current number of processed clauses  : 95
% 0.18/0.48  #    Positive orientable unit clauses  : 26
% 0.18/0.48  #    Positive unorientable unit clauses: 0
% 0.18/0.48  #    Negative unit clauses             : 8
% 0.18/0.48  #    Non-unit-clauses                  : 61
% 0.18/0.48  # Current number of unprocessed clauses: 309
% 0.18/0.48  # ...number of literals in the above   : 1281
% 0.18/0.48  # Current number of archived formulas  : 0
% 0.18/0.48  # Current number of archived clauses   : 90
% 0.18/0.48  # Clause-clause subsumption calls (NU) : 1179
% 0.18/0.48  # Rec. Clause-clause subsumption calls : 339
% 0.18/0.48  # Non-unit clause-clause subsumptions  : 26
% 0.18/0.48  # Unit Clause-clause subsumption calls : 103
% 0.18/0.48  # Rewrite failures with RHS unbound    : 0
% 0.18/0.48  # BW rewrite match attempts            : 3
% 0.18/0.48  # BW rewrite match successes           : 3
% 0.18/0.48  # Condensation attempts                : 0
% 0.18/0.48  # Condensation successes               : 0
% 0.18/0.48  # Termbank termtop insertions          : 12226
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.013 s
% 0.18/0.48  # System time              : 0.003 s
% 0.18/0.48  # Total time               : 0.016 s
% 0.18/0.48  # Maximum resident set size: 1960 pages
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.058 s
% 0.18/0.48  # System time              : 0.010 s
% 0.18/0.48  # Total time               : 0.068 s
% 0.18/0.48  # Maximum resident set size: 1728 pages
% 0.18/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------