↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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 02:35:24 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof('_HAMMER_GOAL',conjecture,
    ! [X2199] :
      ( cRedblack_2ecolor___24t(X2199)
     => ! [X153] :
          ( cRedblack_2eTREES_2etree___24t(X153)
         => ! [X593] :
              ( cRedblack_2ekey___24t(X593)
             => ! [X767] :
                  ( cV___24t(X767)
                 => ! [X2283] :
                      ( cRedblack_2eTREES_2etree___24t(X2283)
                     => cRedblack_2eTREES_2eT___24a5(X2199,X153,X593,X767,X2283) != cRedblack_2eTREES_2eE ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','_HAMMER_GOAL') ).

fof('$_discrim_Redblack.TREES.E$Redblack.TREES.T',axiom,
    ! [X844,X845,X846,X847,X848] : cRedblack_2eTREES_2eE != cRedblack_2eTREES_2eT___24a5(X844,X845,X846,X847,X848),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_discrim_Redblack.TREES.E$Redblack.TREES.T') ).

fof(c_0_2,negated_conjecture,
    ~ ! [X2199] :
        ( cRedblack_2ecolor___24t(X2199)
       => ! [X153] :
            ( cRedblack_2eTREES_2etree___24t(X153)
           => ! [X593] :
                ( cRedblack_2ekey___24t(X593)
               => ! [X767] :
                    ( cV___24t(X767)
                   => ! [X2283] :
                        ( cRedblack_2eTREES_2etree___24t(X2283)
                       => cRedblack_2eTREES_2eT___24a5(X2199,X153,X593,X767,X2283) != cRedblack_2eTREES_2eE ) ) ) ) ),
    inference(assume_negation,[status(cth)],['_HAMMER_GOAL']) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X2199] :
        ( cRedblack_2ecolor___24t(X2199)
       => ! [X153] :
            ( cRedblack_2eTREES_2etree___24t(X153)
           => ! [X593] :
                ( cRedblack_2ekey___24t(X593)
               => ! [X767] :
                    ( cV___24t(X767)
                   => ! [X2283] :
                        ( cRedblack_2eTREES_2etree___24t(X2283)
                       => cRedblack_2eTREES_2eT___24a5(X2199,X153,X593,X767,X2283) != cRedblack_2eTREES_2eE ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_4,plain,
    ! [X844,X845,X846,X847,X848] : cRedblack_2eTREES_2eE != cRedblack_2eTREES_2eT___24a5(X844,X845,X846,X847,X848),
    inference(fof_simplification,[status(thm)],['$_discrim_Redblack.TREES.E$Redblack.TREES.T']) ).

fof(c_0_5,negated_conjecture,
    ( cRedblack_2eTREES_2eT___24a5(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0) = cRedblack_2eTREES_2eE
    & cRedblack_2eTREES_2etree___24t(esk5_0)
    & cV___24t(esk4_0)
    & cRedblack_2ekey___24t(esk3_0)
    & cRedblack_2eTREES_2etree___24t(esk2_0)
    & cRedblack_2ecolor___24t(esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_6,plain,
    ! [X2289,X2290,X2291,X2292,X2293] : cRedblack_2eTREES_2eE != cRedblack_2eTREES_2eT___24a5(X2289,X2290,X2291,X2292,X2293),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).

cnf(c_0_7,negated_conjecture,
    cRedblack_2eTREES_2eT___24a5(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0) = cRedblack_2eTREES_2eE,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    cRedblack_2eTREES_2eE != cRedblack_2eTREES_2eT___24a5(X1,X2,X3,X4,X5),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV668+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n016.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 07:39:37 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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.32/0.62  % Version: 3.5.1
% 0.32/0.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.32/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.62  % Starting new_bool_3 with 900s (3) cores
% 0.32/0.62  % Starting new_bool_1 with 900s (3) cores
% 0.32/0.62  % Starting sh5l with 300s (1) cores
% 0.32/0.62  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.32/0.62  % new_bool_1 with pid 1917329 completed with status 0
% 0.32/0.62  % Result found by new_bool_1
% 0.32/0.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.32/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.62  % Starting new_bool_3 with 900s (3) cores
% 0.32/0.62  % Starting new_bool_1 with 900s (3) cores
% 0.32/0.62  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.62  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.62  % Search class: FGUSF-FFSM31-SFFFFFNN
% 0.32/0.62  % partial match(1): FGUSF-FFSM11-SFFFFFNN
% 0.32/0.62  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.32/0.62  % Starting SubtermCWHack with 91s (1) cores
% 0.32/0.62  % Starting SAT001_MinMin_p005000_rr_RG with 541s (1) cores
% 0.32/0.62  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 91s (1) cores
% 0.32/0.62  % SAT001_MinMin_p005000_rr_RG with pid 1917337 completed with status 0
% 0.32/0.62  % Result found by SAT001_MinMin_p005000_rr_RG
% 0.32/0.62  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.32/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.62  % Starting new_bool_3 with 900s (3) cores
% 0.32/0.62  % Starting new_bool_1 with 900s (3) cores
% 0.32/0.62  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.62  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.62  % Search class: FGUSF-FFSM31-SFFFFFNN
% 0.32/0.62  % partial match(1): FGUSF-FFSM11-SFFFFFNN
% 0.32/0.62  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.32/0.62  % Starting SubtermCWHack with 91s (1) cores
% 0.32/0.62  % Starting SAT001_MinMin_p005000_rr_RG with 541s (1) cores
% 0.32/0.62  % Preprocessing time       : 0.004 s
% 0.32/0.62  % Presaturation interreduction done
% 0.32/0.62  
% 0.32/0.62  % Proof found!
% 0.32/0.62  % SZS status Theorem
% 0.32/0.62  % SZS output start CNFRefutation
% See solution above
% 0.32/0.62  % Parsed axioms                        : 2821
% 0.32/0.62  % Removed by relevancy pruning/SinE    : 2816
% 0.32/0.62  % Initial clauses                      : 19
% 0.32/0.62  % Removed in clause preprocessing      : 0
% 0.32/0.62  % Initial clauses in saturation        : 19
% 0.32/0.62  % Processed clauses                    : 8
% 0.32/0.62  % ...of these trivial                  : 0
% 0.32/0.62  % ...subsumed                          : 0
% 0.32/0.62  % ...remaining for further processing  : 8
% 0.32/0.62  % Other redundant clauses eliminated   : 0
% 0.32/0.62  % Clauses deleted for lack of memory   : 0
% 0.32/0.62  % Backward-subsumed                    : 0
% 0.32/0.62  % Backward-rewritten                   : 0
% 0.32/0.62  % Generated clauses                    : 1
% 0.32/0.62  % ...of the previous two non-redundant : 0
% 0.32/0.62  % ...aggressively subsumed             : 0
% 0.32/0.62  % Contextual simplify-reflections      : 0
% 0.32/0.62  % Paramodulations                      : 0
% 0.32/0.62  % Factorizations                       : 0
% 0.32/0.62  % NegExts                              : 0
% 0.32/0.62  % Equation resolutions                 : 0
% 0.32/0.62  % Disequality decompositions           : 0
% 0.32/0.62  % Total rewrite steps                  : 0
% 0.32/0.62  % ...of those cached                   : 0
% 0.32/0.62  % Propositional unsat checks           : 0
% 0.32/0.62  %    Propositional check models        : 0
% 0.32/0.62  %    Propositional check unsatisfiable : 0
% 0.32/0.62  %    Propositional clauses             : 0
% 0.32/0.62  %    Propositional clauses after purity: 0
% 0.32/0.62  %    Propositional unsat core size     : 0
% 0.32/0.62  %    Propositional preprocessing time  : 0.000
% 0.32/0.62  %    Propositional encoding time       : 0.000
% 0.32/0.62  %    Propositional solver time         : 0.000
% 0.32/0.62  %    Success case prop preproc time    : 0.000
% 0.32/0.62  %    Success case prop encoding time   : 0.000
% 0.32/0.62  %    Success case prop solver time     : 0.000
% 0.32/0.62  % Current number of processed clauses  : 7
% 0.32/0.62  %    Positive orientable unit clauses  : 6
% 0.32/0.62  %    Positive unorientable unit clauses: 0
% 0.32/0.62  %    Negative unit clauses             : 1
% 0.32/0.62  %    Non-unit-clauses                  : 0
% 0.32/0.62  % Current number of unprocessed clauses: 11
% 0.32/0.62  % ...number of literals in the above   : 28
% 0.32/0.62  % Current number of archived formulas  : 0
% 0.32/0.62  % Current number of archived clauses   : 1
% 0.32/0.62  % Clause-clause subsumption calls (NU) : 0
% 0.32/0.62  % Rec. Clause-clause subsumption calls : 0
% 0.32/0.62  % Non-unit clause-clause subsumptions  : 0
% 0.32/0.62  % Unit Clause-clause subsumption calls : 0
% 0.32/0.62  % Rewrite failures with RHS unbound    : 0
% 0.32/0.62  % BW rewrite match attempts            : 0
% 0.32/0.62  % BW rewrite match successes           : 0
% 0.32/0.62  % Condensation attempts                : 0
% 0.32/0.62  % Condensation successes               : 0
% 0.32/0.62  % Termbank termtop insertions          : 44401
% 0.32/0.62  % Search garbage collected termcells   : 34199
% 0.32/0.62  
% 0.32/0.62  % -------------------------------------------------
% 0.32/0.62  % User time                : 0.017 s
% 0.32/0.62  % System time              : 0.021 s
% 0.32/0.62  % Total time               : 0.038 s
% 0.32/0.62  % Maximum resident set size: 14540 pages
% 0.32/0.62  
% 0.32/0.62  % -------------------------------------------------
% 0.32/0.62  % User time                : 0.187 s
% 0.32/0.62  % System time              : 0.041 s
% 0.32/0.62  % Total time               : 0.228 s
% 0.32/0.62  % Maximum resident set size: 11264 pages
% 0.32/0.62  % E exiting
%------------------------------------------------------------------------------