↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM508+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:49:21 PM UTC 2026

% Result   : Theorem 0.11s 0.46s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  14 unt;   0 def)
%            Number of atoms       :   91 (   8 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   96 (  40   ~;  31   |;  17   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( doDivides0(xr,xm)
    | doDivides0(xr,xn) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(mIH_03,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X2)
        & aNaturalNumber0(X1) )
     => ( ( sdtlseqdt0(X1,X2)
          & X1 != X2 )
       => iLess0(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIH_03) ).

fof(m__2478,hypothesis,
    ( sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))
    & sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2478) ).

fof(m__1799,hypothesis,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X3)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X1) )
     => ( ( doDivides0(X3,sdtasdt0(X1,X2))
          & isPrime0(X3) )
       => ( iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
         => ( doDivides0(X3,X2)
            | doDivides0(X3,X1) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1799) ).

fof(m__2362,hypothesis,
    ( doDivides0(xr,sdtasdt0(xn,xm))
    & sdtlseqdt0(xr,xk) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2362) ).

fof(m__2342,hypothesis,
    ( isPrime0(xr)
    & doDivides0(xr,xk)
    & aNaturalNumber0(xr) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2342) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xp)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).

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

fof(c_0_8,negated_conjecture,
    ~ ( doDivides0(xr,xm)
      | doDivides0(xr,xn) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_9,plain,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X2)
        & aNaturalNumber0(X1) )
     => ( ( sdtlseqdt0(X1,X2)
          & X1 != X2 )
       => iLess0(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[mIH_03]) ).

fof(c_0_10,hypothesis,
    ( sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))
    & sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp) ),
    inference(fof_simplification,[status(thm)],[m__2478]) ).

fof(c_0_11,hypothesis,
    ! [X89,X90,X91] :
      ( doDivides0(X91,X90)
      | doDivides0(X91,X89)
      | ~ iLess0(sdtpldt0(sdtpldt0(X89,X90),X91),sdtpldt0(sdtpldt0(xn,xm),xp))
      | ~ doDivides0(X91,sdtasdt0(X89,X90))
      | ~ isPrime0(X91)
      | ~ aNaturalNumber0(X91)
      | ~ aNaturalNumber0(X90)
      | ~ aNaturalNumber0(X89) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1799])])]) ).

fof(c_0_12,negated_conjecture,
    ( ~ doDivides0(xr,xm)
    & ~ doDivides0(xr,xn) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).

fof(c_0_13,plain,
    ! [X61,X62] :
      ( iLess0(X61,X62)
      | ~ sdtlseqdt0(X61,X62)
      | X61 = X62
      | ~ aNaturalNumber0(X62)
      | ~ aNaturalNumber0(X61) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

fof(c_0_14,hypothesis,
    ( sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))
    & sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp) ),
    inference(fof_nnf,[status(thm)],[c_0_10]) ).

cnf(c_0_15,hypothesis,
    ( ~ iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
    | ~ doDivides0(X3,sdtasdt0(X1,X2))
    | ~ isPrime0(X3)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | doDivides0(X3,X2)
    | doDivides0(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,hypothesis,
    doDivides0(xr,sdtasdt0(xn,xm)),
    inference(split_conjunct,[status(thm)],[m__2362]) ).

cnf(c_0_17,hypothesis,
    isPrime0(xr),
    inference(split_conjunct,[status(thm)],[m__2342]) ).

cnf(c_0_18,hypothesis,
    aNaturalNumber0(xr),
    inference(split_conjunct,[status(thm)],[m__2342]) ).

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

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

cnf(c_0_21,negated_conjecture,
    ~ doDivides0(xr,xm),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_22,negated_conjecture,
    ~ doDivides0(xr,xn),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_23,plain,
    ( ~ sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | iLess0(X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_24,hypothesis,
    sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_25,hypothesis,
    sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_26,hypothesis,
    ~ iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_22]) ).

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

cnf(c_0_28,hypothesis,
    ( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))
    | ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).

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

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

cnf(c_0_31,hypothesis,
    ( ~ aNaturalNumber0(sdtpldt0(xn,xm))
    | ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_32,hypothesis,
    ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_19]),c_0_20])]) ).

cnf(c_0_33,hypothesis,
    ~ aNaturalNumber0(sdtpldt0(xn,xm)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_18])]) ).

cnf(c_0_34,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM508+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n007.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 02:34:06 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.46  % Version: 3.5.1
% 0.11/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46  % Starting sh5l with 300s (1) cores
% 0.11/0.46  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4177125 completed with status 0
% 0.11/0.46  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46  % No SInE strategy applied
% 0.11/0.46  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.11/0.46  % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.11/0.46  % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.11/0.46  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4177130 completed with status 0
% 0.11/0.46  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46  % No SInE strategy applied
% 0.11/0.46  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.46  % Preprocessing time       : 0.001 s
% 0.11/0.46  % Presaturation interreduction done
% 0.11/0.46  
% 0.11/0.46  % Proof found!
% 0.11/0.46  % SZS status Theorem
% 0.11/0.46  % SZS output start CNFRefutation
% See solution above
% 0.11/0.46  % Parsed axioms                        : 52
% 0.11/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.46  % Initial clauses                      : 98
% 0.11/0.46  % Removed in clause preprocessing      : 3
% 0.11/0.46  % Initial clauses in saturation        : 95
% 0.11/0.46  % Processed clauses                    : 549
% 0.11/0.46  % ...of these trivial                  : 5
% 0.11/0.46  % ...subsumed                          : 139
% 0.11/0.46  % ...remaining for further processing  : 405
% 0.11/0.46  % Other redundant clauses eliminated   : 23
% 0.11/0.46  % Clauses deleted for lack of memory   : 0
% 0.11/0.46  % Backward-subsumed                    : 17
% 0.11/0.46  % Backward-rewritten                   : 23
% 0.11/0.46  % Generated clauses                    : 1264
% 0.11/0.46  % ...of the previous two non-redundant : 1112
% 0.11/0.46  % ...aggressively subsumed             : 0
% 0.11/0.46  % Contextual simplify-reflections      : 35
% 0.11/0.46  % Paramodulations                      : 1235
% 0.11/0.46  % Factorizations                       : 2
% 0.11/0.46  % NegExts                              : 0
% 0.11/0.46  % Equation resolutions                 : 27
% 0.11/0.46  % Disequality decompositions           : 0
% 0.11/0.46  % Total rewrite steps                  : 1408
% 0.11/0.46  % ...of those cached                   : 1359
% 0.11/0.46  % Propositional unsat checks           : 0
% 0.11/0.46  %    Propositional check models        : 0
% 0.11/0.46  %    Propositional check unsatisfiable : 0
% 0.11/0.46  %    Propositional clauses             : 0
% 0.11/0.46  %    Propositional clauses after purity: 0
% 0.11/0.46  %    Propositional unsat core size     : 0
% 0.11/0.46  %    Propositional preprocessing time  : 0.000
% 0.11/0.46  %    Propositional encoding time       : 0.000
% 0.11/0.46  %    Propositional solver time         : 0.000
% 0.11/0.46  %    Success case prop preproc time    : 0.000
% 0.11/0.46  %    Success case prop encoding time   : 0.000
% 0.11/0.46  %    Success case prop solver time     : 0.000
% 0.11/0.46  % Current number of processed clauses  : 266
% 0.11/0.46  %    Positive orientable unit clauses  : 53
% 0.11/0.46  %    Positive unorientable unit clauses: 0
% 0.11/0.46  %    Negative unit clauses             : 33
% 0.11/0.46  %    Non-unit-clauses                  : 180
% 0.11/0.46  % Current number of unprocessed clauses: 730
% 0.11/0.46  % ...number of literals in the above   : 3155
% 0.11/0.46  % Current number of archived formulas  : 0
% 0.11/0.46  % Current number of archived clauses   : 128
% 0.11/0.46  % Clause-clause subsumption calls (NU) : 5005
% 0.11/0.46  % Rec. Clause-clause subsumption calls : 2755
% 0.11/0.46  % Non-unit clause-clause subsumptions  : 153
% 0.11/0.46  % Unit Clause-clause subsumption calls : 389
% 0.11/0.46  % Rewrite failures with RHS unbound    : 0
% 0.11/0.46  % BW rewrite match attempts            : 16
% 0.11/0.46  % BW rewrite match successes           : 16
% 0.11/0.46  % Condensation attempts                : 0
% 0.11/0.46  % Condensation successes               : 0
% 0.11/0.46  % Termbank termtop insertions          : 29186
% 0.11/0.46  % Search garbage collected termcells   : 1365
% 0.11/0.46  
% 0.11/0.46  % -------------------------------------------------
% 0.11/0.46  % User time                : 0.031 s
% 0.11/0.46  % System time              : 0.004 s
% 0.11/0.46  % Total time               : 0.035 s
% 0.11/0.46  % Maximum resident set size: 3944 pages
% 0.11/0.46  
% 0.11/0.46  % -------------------------------------------------
% 0.11/0.46  % User time                : 0.128 s
% 0.11/0.46  % System time              : 0.015 s
% 0.11/0.46  % Total time               : 0.143 s
% 0.11/0.46  % Maximum resident set size: 4608 pages
% 0.11/0.46  % E exiting
%------------------------------------------------------------------------------