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

View Problem - Process Solution

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

% Computer : n007.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 : Sat May  4 09:06:13 EDT 2024

% Result   : Theorem 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   45 (   4 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :   53 (  23   ~;  20   |;   7   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn   9   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    file('/export/starexec/sandbox/tmp/tmp.ReXGePh8gI/E---3.1_7005.p',m__) ).

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.ReXGePh8gI/E---3.1_7005.p',mDefLE) ).

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

fof(m__1324,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox/tmp/tmp.ReXGePh8gI/E---3.1_7005.p',m__1324) ).

fof(c_0_4,negated_conjecture,
    ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_5,plain,
    ! [X4,X5,X7] :
      ( ( aNaturalNumber0(esk1_2(X4,X5))
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( sdtpldt0(X4,esk1_2(X4,X5)) = X5
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X7)
        | sdtpldt0(X4,X7) != X5
        | sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    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)],[mDefLE])])])])])]) ).

fof(c_0_6,plain,
    ! [X25,X26] :
      ( ~ aNaturalNumber0(X25)
      | ~ aNaturalNumber0(X26)
      | aNaturalNumber0(sdtpldt0(X25,X26)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).

fof(c_0_7,negated_conjecture,
    ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

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

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

cnf(c_0_10,negated_conjecture,
    ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( sdtlseqdt0(X1,sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_8]),c_0_9]) ).

cnf(c_0_12,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_13,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : NUM472+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n007.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Fri May  3 09:22:50 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.15/0.41  Running first-order model finding
% 0.15/0.41  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.ReXGePh8gI/E---3.1_7005.p
% 0.15/0.43  # Version: 3.1.0
% 0.15/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # sh5l with pid 7086 completed with status 0
% 0.15/0.43  # Result found by sh5l
% 0.15/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43  # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.15/0.43  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 163s (1) cores
% 0.15/0.43  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 7087 completed with status 0
% 0.15/0.43  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43  # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.15/0.43  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 163s (1) cores
% 0.15/0.43  # Preprocessing time       : 0.001 s
% 0.15/0.43  # Presaturation interreduction done
% 0.15/0.43  
% 0.15/0.43  # Proof found!
% 0.15/0.43  # SZS status Theorem
% 0.15/0.43  # SZS output start CNFRefutation
% See solution above
% 0.15/0.43  # Parsed axioms                        : 39
% 0.15/0.43  # Removed by relevancy pruning/SinE    : 3
% 0.15/0.43  # Initial clauses                      : 61
% 0.15/0.43  # Removed in clause preprocessing      : 2
% 0.15/0.43  # Initial clauses in saturation        : 59
% 0.15/0.43  # Processed clauses                    : 90
% 0.15/0.43  # ...of these trivial                  : 0
% 0.15/0.43  # ...subsumed                          : 5
% 0.15/0.43  # ...remaining for further processing  : 85
% 0.15/0.43  # Other redundant clauses eliminated   : 6
% 0.15/0.43  # Clauses deleted for lack of memory   : 0
% 0.15/0.43  # Backward-subsumed                    : 0
% 0.15/0.43  # Backward-rewritten                   : 0
% 0.15/0.43  # Generated clauses                    : 17
% 0.15/0.43  # ...of the previous two non-redundant : 6
% 0.15/0.43  # ...aggressively subsumed             : 0
% 0.15/0.43  # Contextual simplify-reflections      : 4
% 0.15/0.43  # Paramodulations                      : 11
% 0.15/0.43  # Factorizations                       : 0
% 0.15/0.43  # NegExts                              : 0
% 0.15/0.43  # Equation resolutions                 : 6
% 0.15/0.43  # Disequality decompositions           : 0
% 0.15/0.43  # Total rewrite steps                  : 12
% 0.15/0.43  # ...of those cached                   : 8
% 0.15/0.43  # Propositional unsat checks           : 0
% 0.15/0.43  #    Propositional check models        : 0
% 0.15/0.43  #    Propositional check unsatisfiable : 0
% 0.15/0.43  #    Propositional clauses             : 0
% 0.15/0.43  #    Propositional clauses after purity: 0
% 0.15/0.43  #    Propositional unsat core size     : 0
% 0.15/0.43  #    Propositional preprocessing time  : 0.000
% 0.15/0.43  #    Propositional encoding time       : 0.000
% 0.15/0.43  #    Propositional solver time         : 0.000
% 0.15/0.43  #    Success case prop preproc time    : 0.000
% 0.15/0.43  #    Success case prop encoding time   : 0.000
% 0.15/0.43  #    Success case prop solver time     : 0.000
% 0.15/0.43  # Current number of processed clauses  : 25
% 0.15/0.43  #    Positive orientable unit clauses  : 9
% 0.15/0.43  #    Positive unorientable unit clauses: 0
% 0.15/0.43  #    Negative unit clauses             : 3
% 0.15/0.43  #    Non-unit-clauses                  : 13
% 0.15/0.43  # Current number of unprocessed clauses: 29
% 0.15/0.43  # ...number of literals in the above   : 139
% 0.15/0.43  # Current number of archived formulas  : 0
% 0.15/0.43  # Current number of archived clauses   : 54
% 0.15/0.43  # Clause-clause subsumption calls (NU) : 339
% 0.15/0.43  # Rec. Clause-clause subsumption calls : 106
% 0.15/0.43  # Non-unit clause-clause subsumptions  : 9
% 0.15/0.43  # Unit Clause-clause subsumption calls : 6
% 0.15/0.43  # Rewrite failures with RHS unbound    : 0
% 0.15/0.43  # BW rewrite match attempts            : 0
% 0.15/0.43  # BW rewrite match successes           : 0
% 0.15/0.43  # Condensation attempts                : 0
% 0.15/0.43  # Condensation successes               : 0
% 0.15/0.43  # Termbank termtop insertions          : 5148
% 0.15/0.43  # Search garbage collected termcells   : 941
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.007 s
% 0.15/0.43  # System time              : 0.003 s
% 0.15/0.43  # Total time               : 0.010 s
% 0.15/0.43  # Maximum resident set size: 1876 pages
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.007 s
% 0.15/0.43  # System time              : 0.006 s
% 0.15/0.43  # Total time               : 0.013 s
% 0.15/0.43  # Maximum resident set size: 1732 pages
% 0.15/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------