↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n026.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:44:39 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(something_less_nn2,conjecture,
    ? [X1] : less(X1,nn2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_less_nn2) ).

fof(less_entry_point_neg_neg,axiom,
    ! [X1,X2,X10,X11] :
      ( ( rdn_positive_less(X11,X10)
        & rdn_translate(X2,rdn_neg(X11))
        & rdn_translate(X1,rdn_neg(X10)) )
     => less(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).

fof(rdnn2,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn2) ).

fof(rdn_positive_less23,axiom,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).

fof(rdnn3,axiom,
    rdn_translate(nn3,rdn_neg(rdnn(n3))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn3) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X1] : less(X1,nn2),
    inference(assume_negation,[status(cth)],[something_less_nn2]) ).

fof(c_0_6,plain,
    ! [X57,X58,X59,X60] :
      ( less(X57,X58)
      | ~ rdn_positive_less(X60,X59)
      | ~ rdn_translate(X58,rdn_neg(X60))
      | ~ rdn_translate(X57,rdn_neg(X59)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_neg])])]) ).

fof(c_0_7,negated_conjecture,
    ! [X154] : ~ less(X154,nn2),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_8,plain,
    ( ~ rdn_positive_less(X4,X2)
    | ~ rdn_translate(X3,rdn_neg(X4))
    | ~ rdn_translate(X1,rdn_neg(X2))
    | less(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    inference(split_conjunct,[status(thm)],[rdnn2]) ).

cnf(c_0_10,negated_conjecture,
    ~ less(X1,nn2),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ rdn_translate(X2,rdn_neg(X1))
    | ~ rdn_positive_less(rdnn(n2),X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

cnf(c_0_12,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).

cnf(c_0_13,plain,
    rdn_translate(nn3,rdn_neg(rdnn(n3))),
    inference(split_conjunct,[status(thm)],[rdnn3]) ).

cnf(c_0_14,plain,
    ~ rdn_translate(X1,rdn_neg(rdnn(n3))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    $false,
    inference(sr,[status(thm)],[c_0_13,c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM301+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  % Computer : n026.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Mon Sep 21 02:23:52 UTC 2026
% 0.15/0.41  % CPUTime  : 
% 0.15/0.41  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46  Running first-order theorem proving
% 0.21/0.46  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
% 71.14/10.73  % Version: 3.5.1
% 71.14/10.73  % Preprocessing class: FSLMSMSLSSSNFFN.
% 71.14/10.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.14/10.73  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 71.14/10.73  % Starting new_bool_3 with 600s (2) cores
% 71.14/10.73  % Starting new_bool_1 with 600s (2) cores
% 71.14/10.73  % Starting sh5l with 300s (1) cores
% 71.14/10.73  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1158323 completed with status 0
% 71.14/10.73  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 71.14/10.73  % Preprocessing class: FSLMSMSLSSSNFFN.
% 71.14/10.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.14/10.73  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 71.14/10.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.14/10.73  % No SInE strategy applied
% 71.14/10.73  % Search class: FGHSF-FSLM21-MFFFFFNN
% 71.14/10.73  % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 71.14/10.73  % Starting SubtermCWHack with 82s (1) cores
% 71.14/10.73  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 71.14/10.73  % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 82s (1) cores
% 71.14/10.73  % SubtermCWHack with pid 1158332 completed with status 0
% 71.14/10.73  % Result found by SubtermCWHack
% 71.14/10.73  % Preprocessing class: FSLMSMSLSSSNFFN.
% 71.14/10.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.14/10.73  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 71.14/10.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.14/10.73  % No SInE strategy applied
% 71.14/10.73  % Search class: FGHSF-FSLM21-MFFFFFNN
% 71.14/10.73  % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 71.14/10.73  % Starting SubtermCWHack with 82s (1) cores
% 71.14/10.73  % Preprocessing time       : 0.005 s
% 71.14/10.73  
% 71.14/10.73  % Proof found!
% 71.14/10.73  % SZS status Theorem
% 71.14/10.73  % SZS output start CNFRefutation
% See solution above
% 71.14/10.73  % Parsed axioms                        : 402
% 71.14/10.73  % Removed by relevancy pruning/SinE    : 0
% 71.14/10.73  % Initial clauses                      : 407
% 71.14/10.73  % Removed in clause preprocessing      : 0
% 71.14/10.73  % Initial clauses in saturation        : 407
% 71.14/10.73  % Processed clauses                    : 19734
% 71.14/10.73  % ...of these trivial                  : 0
% 71.14/10.73  % ...subsumed                          : 45
% 71.14/10.73  % ...remaining for further processing  : 19689
% 71.14/10.73  % Other redundant clauses eliminated   : 2
% 71.14/10.73  % Clauses deleted for lack of memory   : 0
% 71.14/10.73  % Backward-subsumed                    : 97
% 71.14/10.73  % Backward-rewritten                   : 0
% 71.14/10.73  % Generated clauses                    : 62027
% 71.14/10.73  % ...of the previous two non-redundant : 61492
% 71.14/10.73  % ...aggressively subsumed             : 0
% 71.14/10.73  % Contextual simplify-reflections      : 0
% 71.14/10.73  % Paramodulations                      : 62022
% 71.14/10.73  % Factorizations                       : 2
% 71.14/10.73  % NegExts                              : 0
% 71.14/10.73  % Equation resolutions                 : 2
% 71.14/10.73  % Disequality decompositions           : 0
% 71.14/10.73  % Total rewrite steps                  : 1425
% 71.14/10.73  % ...of those cached                   : 1144
% 71.14/10.73  % Propositional unsat checks           : 0
% 71.14/10.73  %    Propositional check models        : 0
% 71.14/10.73  %    Propositional check unsatisfiable : 0
% 71.14/10.73  %    Propositional clauses             : 0
% 71.14/10.73  %    Propositional clauses after purity: 0
% 71.14/10.73  %    Propositional unsat core size     : 0
% 71.14/10.73  %    Propositional preprocessing time  : 0.000
% 71.14/10.73  %    Propositional encoding time       : 0.000
% 71.14/10.73  %    Propositional solver time         : 0.000
% 71.14/10.73  %    Success case prop preproc time    : 0.000
% 71.14/10.73  %    Success case prop encoding time   : 0.000
% 71.14/10.73  %    Success case prop solver time     : 0.000
% 71.14/10.73  % Current number of processed clauses  : 19589
% 71.14/10.73  %    Positive orientable unit clauses  : 13174
% 71.14/10.73  %    Positive unorientable unit clauses: 0
% 71.14/10.73  %    Negative unit clauses             : 5471
% 71.14/10.73  %    Non-unit-clauses                  : 944
% 71.14/10.73  % Current number of unprocessed clauses: 42165
% 71.14/10.73  % ...number of literals in the above   : 80001
% 71.14/10.73  % Current number of archived formulas  : 0
% 71.14/10.73  % Current number of archived clauses   : 98
% 71.14/10.73  % Clause-clause subsumption calls (NU) : 254708
% 71.14/10.73  % Rec. Clause-clause subsumption calls : 188670
% 71.14/10.73  % Non-unit clause-clause subsumptions  : 98
% 71.14/10.73  % Unit Clause-clause subsumption calls : 11549997
% 71.14/10.73  % Rewrite failures with RHS unbound    : 0
% 71.14/10.73  % BW rewrite match attempts            : 0
% 71.14/10.73  % BW rewrite match successes           : 0
% 71.14/10.73  % Condensation attempts                : 0
% 71.14/10.73  % Condensation successes               : 0
% 71.14/10.73  % Termbank termtop insertions          : 614867
% 71.14/10.73  % Search garbage collected termcells   : 764
% 71.14/10.73  
% 71.14/10.73  % -------------------------------------------------
% 71.14/10.73  % User time                : 10.036 s
% 71.14/10.73  % System time              : 0.133 s
% 71.14/10.73  % Total time               : 10.169 s
% 71.14/10.73  % Maximum resident set size: 4508 pages
% 71.14/10.73  
% 71.14/10.73  % -------------------------------------------------
% 71.14/10.73  % User time                : 30.147 s
% 71.14/10.73  % System time              : 0.397 s
% 71.14/10.73  % Total time               : 30.544 s
% 71.14/10.73  % Maximum resident set size: 4864 pages
% 71.14/10.73  % E exiting
%------------------------------------------------------------------------------