↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n019.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:12 PM UTC 2026

% Result   : Theorem 0.23s 5.57s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   8 unt;   0 def)
%            Number of atoms       :   46 (   4 equ)
%            Maximal formula atoms :   13 (   2 avg)
%            Number of connectives :   54 (  24   ~;  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/benchmark/theBenchmark.p',m__) ).

fof(mDefLE,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X2)
        & aNaturalNumber0(X1) )
     => ( sdtlseqdt0(X1,X2)
      <=> ? [X3] :
            ( sdtpldt0(X1,X3) = X2
            & aNaturalNumber0(X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).

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

fof(m__1324,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xl) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).

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

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

fof(c_0_6,plain,
    ! [X4,X5,X7] :
      ( ( ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X4)
        | sdtlseqdt0(X4,X5)
        | sdtpldt0(X4,X7) != X5
        | ~ aNaturalNumber0(X7) )
      & ( ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X4)
        | ~ sdtlseqdt0(X4,X5)
        | sdtpldt0(X4,esk1_2(X4,X5)) = X5 )
      & ( ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X4)
        | ~ sdtlseqdt0(X4,X5)
        | aNaturalNumber0(esk1_2(X4,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_7,plain,
    ! [X25,X26] :
      ( aNaturalNumber0(sdtpldt0(X25,X26))
      | ~ aNaturalNumber0(X26)
      | ~ aNaturalNumber0(X25) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM472+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.46  % Computer : n019.cluster.edu
% 0.18/5.46  % Model    : x86_64 x86_64
% 0.18/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46  % Memory   : 8046.5625MB
% 0.18/5.46  % OS       : Linux 6.8.0-71-generic
% 0.18/5.46  % CPULimit : 300
% 0.18/5.46  % WCLimit  : 300
% 0.18/5.46  % DateTime : Mon Sep 21 02:33:26 UTC 2026
% 0.18/5.46  % CPUTime  : 
% 0.18/5.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.53  Running first-order theorem proving
% 0.23/5.53  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/5.57  % Version: 3.5.1
% 0.23/5.57  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.57  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.57  % Starting new_bool_3 with 300s (1) cores
% 0.23/5.57  % Starting new_bool_1 with 300s (1) cores
% 0.23/5.57  % Starting sh5l with 300s (1) cores
% 0.23/5.57  % sh5l with pid 1499605 completed with status 0
% 0.23/5.57  % Result found by sh5l
% 0.23/5.57  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.57  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.57  % Starting new_bool_3 with 300s (1) cores
% 0.23/5.57  % Starting new_bool_1 with 300s (1) cores
% 0.23/5.57  % Starting sh5l with 300s (1) cores
% 0.23/5.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/5.57  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/5.57  % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.23/5.57  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/5.57  % Starting SubtermCWHack with 28s (1) cores
% 0.23/5.57  % SubtermCWHack with pid 1499606 completed with status 0
% 0.23/5.57  % Result found by SubtermCWHack
% 0.23/5.57  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.57  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.57  % Starting new_bool_3 with 300s (1) cores
% 0.23/5.57  % Starting new_bool_1 with 300s (1) cores
% 0.23/5.57  % Starting sh5l with 300s (1) cores
% 0.23/5.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/5.57  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/5.57  % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.23/5.57  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/5.57  % Starting SubtermCWHack with 28s (1) cores
% 0.23/5.57  % Preprocessing time       : 0.003 s
% 0.23/5.57  
% 0.23/5.57  % Proof found!
% 0.23/5.57  % SZS status Theorem
% 0.23/5.57  % SZS output start CNFRefutation
% See solution above
% 0.23/5.57  % Parsed axioms                        : 39
% 0.23/5.57  % Removed by relevancy pruning/SinE    : 3
% 0.23/5.57  % Initial clauses                      : 61
% 0.23/5.57  % Removed in clause preprocessing      : 2
% 0.23/5.57  % Initial clauses in saturation        : 59
% 0.23/5.57  % Processed clauses                    : 116
% 0.23/5.57  % ...of these trivial                  : 0
% 0.23/5.57  % ...subsumed                          : 45
% 0.23/5.57  % ...remaining for further processing  : 71
% 0.23/5.57  % Other redundant clauses eliminated   : 4
% 0.23/5.57  % Clauses deleted for lack of memory   : 0
% 0.23/5.57  % Backward-subsumed                    : 1
% 0.23/5.57  % Backward-rewritten                   : 1
% 0.23/5.57  % Generated clauses                    : 146
% 0.23/5.57  % ...of the previous two non-redundant : 117
% 0.23/5.57  % ...aggressively subsumed             : 0
% 0.23/5.57  % Contextual simplify-reflections      : 2
% 0.23/5.57  % Paramodulations                      : 142
% 0.23/5.57  % Factorizations                       : 0
% 0.23/5.57  % NegExts                              : 0
% 0.23/5.57  % Equation resolutions                 : 4
% 0.23/5.57  % Disequality decompositions           : 0
% 0.23/5.57  % Total rewrite steps                  : 71
% 0.23/5.57  % ...of those cached                   : 64
% 0.23/5.57  % Propositional unsat checks           : 0
% 0.23/5.57  %    Propositional check models        : 0
% 0.23/5.57  %    Propositional check unsatisfiable : 0
% 0.23/5.57  %    Propositional clauses             : 0
% 0.23/5.57  %    Propositional clauses after purity: 0
% 0.23/5.57  %    Propositional unsat core size     : 0
% 0.23/5.57  %    Propositional preprocessing time  : 0.000
% 0.23/5.57  %    Propositional encoding time       : 0.000
% 0.23/5.57  %    Propositional solver time         : 0.000
% 0.23/5.57  %    Success case prop preproc time    : 0.000
% 0.23/5.57  %    Success case prop encoding time   : 0.000
% 0.23/5.57  %    Success case prop solver time     : 0.000
% 0.23/5.57  % Current number of processed clauses  : 65
% 0.23/5.57  %    Positive orientable unit clauses  : 15
% 0.23/5.57  %    Positive unorientable unit clauses: 0
% 0.23/5.57  %    Negative unit clauses             : 3
% 0.23/5.57  %    Non-unit-clauses                  : 47
% 0.23/5.57  % Current number of unprocessed clauses: 52
% 0.23/5.57  % ...number of literals in the above   : 268
% 0.23/5.57  % Current number of archived formulas  : 0
% 0.23/5.57  % Current number of archived clauses   : 2
% 0.23/5.57  % Clause-clause subsumption calls (NU) : 244
% 0.23/5.57  % Rec. Clause-clause subsumption calls : 195
% 0.23/5.57  % Non-unit clause-clause subsumptions  : 48
% 0.23/5.57  % Unit Clause-clause subsumption calls : 32
% 0.23/5.57  % Rewrite failures with RHS unbound    : 0
% 0.23/5.57  % BW rewrite match attempts            : 1
% 0.23/5.57  % BW rewrite match successes           : 1
% 0.23/5.57  % Condensation attempts                : 0
% 0.23/5.57  % Condensation successes               : 0
% 0.23/5.57  % Termbank termtop insertions          : 6665
% 0.23/5.57  % Search garbage collected termcells   : 939
% 0.23/5.57  
% 0.23/5.57  % -------------------------------------------------
% 0.23/5.57  % User time                : 0.015 s
% 0.23/5.57  % System time              : 0.002 s
% 0.23/5.57  % Total time               : 0.017 s
% 0.23/5.57  % Maximum resident set size: 3672 pages
% 0.23/5.57  
% 0.23/5.57  % -------------------------------------------------
% 0.23/5.57  % User time                : 0.018 s
% 0.23/5.57  % System time              : 0.009 s
% 0.23/5.57  % Total time               : 0.027 s
% 0.23/5.57  % Maximum resident set size: 4864 pages
% 0.23/5.57  % E exiting
%------------------------------------------------------------------------------