↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM343+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 : 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:44:43 PM UTC 2026

% Result   : Theorem 0.45s 0.67s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :   27 (   5 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   30 (  13   ~;   5   |;   8   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   13 (   1 sgn   7   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(less_property,axiom,
    ! [X1,X2] :
      ( less(X1,X2)
    <=> ( X2 != X1
        & ~ less(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_property) ).

fof(sum_something_n0_samething,conjecture,
    ? [X1] :
      ( ( less(X1,n1)
        & less(nn1,X1) )
     => sum(n21,X1,n21) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_something_n0_samething) ).

fof(c_0_2,plain,
    ! [X1,X2] :
      ( less(X1,X2)
    <=> ( X2 != X1
        & ~ less(X2,X1) ) ),
    inference(fof_simplification,[status(thm)],[less_property]) ).

fof(c_0_3,plain,
    ! [X90,X91] :
      ( ( less(X90,X91)
        | X91 = X90
        | less(X91,X90) )
      & ( ~ less(X90,X91)
        | X91 != X90 )
      & ( ~ less(X90,X91)
        | ~ less(X91,X90) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X1] :
        ( ( less(X1,n1)
          & less(nn1,X1) )
       => sum(n21,X1,n21) ),
    inference(assume_negation,[status(cth)],[sum_something_n0_samething]) ).

cnf(c_0_5,plain,
    ( ~ less(X2,X1)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

fof(c_0_6,negated_conjecture,
    ! [X33] :
      ( ~ sum(n21,X33,n21)
      & less(X33,n1)
      & less(nn1,X33) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_7,plain,
    ~ less(X1,X1),
    inference(er,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    less(nn1,X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_7,c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM343+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.19/0.46  % Computer : n007.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Mon Sep 21 02:20:50 UTC 2026
% 0.19/0.47  % CPUTime  : 
% 0.19/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.57  Running first-order theorem proving
% 0.23/0.57  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.45/0.67  % Version: 3.5.1
% 0.45/0.67  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.45/0.67  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.67  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.45/0.67  % Starting new_bool_3 with 600s (2) cores
% 0.45/0.67  % Starting new_bool_1 with 600s (2) cores
% 0.45/0.67  % Starting sh5l with 300s (1) cores
% 0.45/0.67  % new_bool_3 with pid 4158464 completed with status 0
% 0.45/0.67  % Result found by new_bool_3
% 0.45/0.67  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.45/0.67  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.67  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.45/0.67  % Starting new_bool_3 with 600s (2) cores
% 0.45/0.67  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.45/0.67  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.67  % Search class: FGHSS-FFMM21-MFFFFFNN
% 0.45/0.67  % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.45/0.67  % Starting SubtermCWHack with 61s (1) cores
% 0.45/0.67  % Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 361s (1) cores
% 0.45/0.67  % SubtermCWHack with pid 4158473 completed with status 0
% 0.45/0.67  % Result found by SubtermCWHack
% 0.45/0.67  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.45/0.67  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.67  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.45/0.67  % Starting new_bool_3 with 600s (2) cores
% 0.45/0.67  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.45/0.67  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.67  % Search class: FGHSS-FFMM21-MFFFFFNN
% 0.45/0.67  % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.45/0.67  % Starting SubtermCWHack with 61s (1) cores
% 0.45/0.67  % Preprocessing time       : 0.004 s
% 0.45/0.67  
% 0.45/0.67  % Proof found!
% 0.45/0.67  % SZS status Theorem
% 0.45/0.67  % SZS output start CNFRefutation
% See solution above
% 0.45/0.67  % Parsed axioms                        : 402
% 0.45/0.67  % Removed by relevancy pruning/SinE    : 256
% 0.45/0.67  % Initial clauses                      : 150
% 0.45/0.67  % Removed in clause preprocessing      : 0
% 0.45/0.67  % Initial clauses in saturation        : 150
% 0.45/0.67  % Processed clauses                    : 25
% 0.45/0.67  % ...of these trivial                  : 0
% 0.45/0.67  % ...subsumed                          : 0
% 0.45/0.67  % ...remaining for further processing  : 25
% 0.45/0.67  % Other redundant clauses eliminated   : 1
% 0.45/0.67  % Clauses deleted for lack of memory   : 0
% 0.45/0.67  % Backward-subsumed                    : 0
% 0.45/0.67  % Backward-rewritten                   : 0
% 0.45/0.67  % Generated clauses                    : 3
% 0.45/0.67  % ...of the previous two non-redundant : 1
% 0.45/0.67  % ...aggressively subsumed             : 0
% 0.45/0.67  % Contextual simplify-reflections      : 0
% 0.45/0.67  % Paramodulations                      : 2
% 0.45/0.67  % Factorizations                       : 0
% 0.45/0.67  % NegExts                              : 0
% 0.45/0.67  % Equation resolutions                 : 1
% 0.45/0.67  % Disequality decompositions           : 0
% 0.45/0.67  % Total rewrite steps                  : 0
% 0.45/0.67  % ...of those cached                   : 0
% 0.45/0.67  % Propositional unsat checks           : 0
% 0.45/0.67  %    Propositional check models        : 0
% 0.45/0.67  %    Propositional check unsatisfiable : 0
% 0.45/0.67  %    Propositional clauses             : 0
% 0.45/0.67  %    Propositional clauses after purity: 0
% 0.45/0.67  %    Propositional unsat core size     : 0
% 0.45/0.67  %    Propositional preprocessing time  : 0.000
% 0.45/0.67  %    Propositional encoding time       : 0.000
% 0.45/0.67  %    Propositional solver time         : 0.000
% 0.45/0.67  %    Success case prop preproc time    : 0.000
% 0.45/0.67  %    Success case prop encoding time   : 0.000
% 0.45/0.67  %    Success case prop solver time     : 0.000
% 0.45/0.67  % Current number of processed clauses  : 24
% 0.45/0.67  %    Positive orientable unit clauses  : 22
% 0.45/0.67  %    Positive unorientable unit clauses: 0
% 0.45/0.67  %    Negative unit clauses             : 2
% 0.45/0.67  %    Non-unit-clauses                  : 0
% 0.45/0.67  % Current number of unprocessed clauses: 126
% 0.45/0.67  % ...number of literals in the above   : 193
% 0.45/0.67  % Current number of archived formulas  : 0
% 0.45/0.67  % Current number of archived clauses   : 0
% 0.45/0.67  % Clause-clause subsumption calls (NU) : 0
% 0.45/0.67  % Rec. Clause-clause subsumption calls : 0
% 0.45/0.67  % Non-unit clause-clause subsumptions  : 0
% 0.45/0.67  % Unit Clause-clause subsumption calls : 1
% 0.45/0.67  % Rewrite failures with RHS unbound    : 0
% 0.45/0.67  % BW rewrite match attempts            : 0
% 0.45/0.67  % BW rewrite match successes           : 0
% 0.45/0.67  % Condensation attempts                : 0
% 0.45/0.67  % Condensation successes               : 0
% 0.45/0.67  % Termbank termtop insertions          : 11129
% 0.45/0.67  % Search garbage collected termcells   : 1845
% 0.45/0.67  
% 0.45/0.67  % -------------------------------------------------
% 0.45/0.67  % User time                : 0.013 s
% 0.45/0.67  % System time              : 0.008 s
% 0.45/0.67  % Total time               : 0.021 s
% 0.45/0.67  % Maximum resident set size: 4764 pages
% 0.45/0.67  
% 0.45/0.67  % -------------------------------------------------
% 0.45/0.67  % User time                : 0.030 s
% 0.45/0.67  % System time              : 0.019 s
% 0.45/0.67  % Total time               : 0.049 s
% 0.45/0.67  % Maximum resident set size: 4864 pages
% 0.45/0.67  % E exiting
%------------------------------------------------------------------------------