↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n011.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:50:46 PM UTC 2026

% Result   : Theorem 0.09s 15.50s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :   37 (  28 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   37 (  13   ~;  18   |;   5   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   25 (   4 sgn  10   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('def(cond(conseq(105), 0), 1)',axiom,
    ! [X3,X4] :
      ( m(X4)
    <=> ( ? [X6] : X4 = vplus(X3,X6)
        | ? [X5] : X3 = vplus(X4,X5)
        | X3 = X4 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(105), 0), 1)') ).

fof('dis(case_distinction(conseq(110)))',conjecture,
    ( vd151 = vd165
    | ? [X2] : vd151 = vplus(vd165,X2)
    | ? [X1] : vd165 = vplus(vd151,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(case_distinction(conseq(110)))') ).

fof(c_0_2,plain,
    ! [X33,X34,X37,X38,X39,X40] :
      ( ( m(X38)
        | X38 != vplus(X37,X40) )
      & ( m(X38)
        | X37 != vplus(X38,X39) )
      & ( m(X38)
        | X37 != X38 )
      & ( X34 = vplus(X33,esk2_2(X33,X34))
        | X33 = vplus(X34,esk1_2(X33,X34))
        | X33 = X34
        | ~ m(X34) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(105), 0), 1)'])])])])])])]) ).

fof(c_0_3,negated_conjecture,
    ~ ( vd151 = vd165
      | ? [X2] : vd151 = vplus(vd165,X2)
      | ? [X1] : vd165 = vplus(vd151,X1) ),
    inference(assume_negation,[status(cth)],['dis(case_distinction(conseq(110)))']) ).

cnf(c_0_4,plain,
    ( X1 != X2
    | m(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

fof(c_0_5,negated_conjecture,
    ! [X19,X20] :
      ( vd151 != vd165
      & vd151 != vplus(vd165,X20)
      & vd165 != vplus(vd151,X19) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

cnf(c_0_6,plain,
    ( ~ m(X1)
    | X1 = vplus(X2,esk2_2(X2,X1))
    | X2 = vplus(X1,esk1_2(X2,X1))
    | X2 = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,plain,
    m(X1),
    inference(er,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    vd165 != vplus(vd151,X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( X2 = X1
    | vplus(X2,esk1_2(X1,X2)) = X1
    | vplus(X1,esk2_2(X1,X2)) = X2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

cnf(c_0_10,negated_conjecture,
    vd151 != vplus(vd165,X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    vd151 != vd165,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]),c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM835+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.34   % Computer : n011.cluster.edu
% 0.08/0.34   % Model    : x86_64 x86_64
% 0.08/0.34   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34   % Memory   : 8046.5625MB
% 0.08/0.34   % OS       : Linux 6.8.0-71-generic
% 0.09/15.43  % CPULimit : 300
% 0.09/15.43  % WCLimit  : 300
% 0.09/15.43  % DateTime : Mon Sep 21 03:13:10 UTC 2026
% 0.09/15.43  % CPUTime  : 
% 0.09/15.43  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/15.47  Running first-order theorem proving
% 0.09/15.47  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.09/15.50  % Version: 3.5.1
% 0.09/15.50  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/15.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/15.50  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/15.50  % Starting new_bool_3 with 300s (1) cores
% 0.09/15.50  % Starting new_bool_1 with 300s (1) cores
% 0.09/15.50  % Starting sh5l with 300s (1) cores
% 0.09/15.50  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19856 completed with status 0
% 0.09/15.50  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/15.50  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/15.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/15.50  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/15.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/15.50  % No SInE strategy applied
% 0.09/15.50  % Search class: FGUSM-FFMF21-SFFFFFNN
% 0.09/15.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/15.50  % Starting SubtermCWHack with 136s (1) cores
% 0.09/15.50  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/15.50  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/15.50  % Starting new_bool_3 with 136s (1) cores
% 0.09/15.50  % Starting new_bool_1 with 136s (1) cores
% 0.09/15.50  % new_bool_3 with pid 19866 completed with status 0
% 0.09/15.50  % Result found by new_bool_3
% 0.09/15.50  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/15.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/15.50  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/15.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/15.50  % No SInE strategy applied
% 0.09/15.50  % Search class: FGUSM-FFMF21-SFFFFFNN
% 0.09/15.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/15.50  % Starting SubtermCWHack with 136s (1) cores
% 0.09/15.50  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/15.50  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/15.50  % Starting new_bool_3 with 136s (1) cores
% 0.09/15.50  % Preprocessing time       : 0.001 s
% 0.09/15.50  % Presaturation interreduction done
% 0.09/15.50  
% 0.09/15.50  % Proof found!
% 0.09/15.50  % SZS status Theorem
% 0.09/15.50  % SZS output start CNFRefutation
% See solution above
% 0.09/15.50  % Parsed axioms                        : 24
% 0.09/15.50  % Removed by relevancy pruning/SinE    : 0
% 0.09/15.50  % Initial clauses                      : 30
% 0.09/15.50  % Removed in clause preprocessing      : 7
% 0.09/15.50  % Initial clauses in saturation        : 23
% 0.09/15.50  % Processed clauses                    : 50
% 0.09/15.50  % ...of these trivial                  : 10
% 0.09/15.50  % ...subsumed                          : 15
% 0.09/15.50  % ...remaining for further processing  : 25
% 0.09/15.50  % Other redundant clauses eliminated   : 5
% 0.09/15.50  % Clauses deleted for lack of memory   : 0
% 0.09/15.50  % Backward-subsumed                    : 0
% 0.09/15.50  % Backward-rewritten                   : 0
% 0.09/15.50  % Generated clauses                    : 56
% 0.09/15.50  % ...of the previous two non-redundant : 47
% 0.09/15.50  % ...aggressively subsumed             : 0
% 0.09/15.50  % Contextual simplify-reflections      : 0
% 0.09/15.50  % Paramodulations                      : 51
% 0.09/15.50  % Factorizations                       : 0
% 0.09/15.50  % NegExts                              : 0
% 0.09/15.50  % Equation resolutions                 : 5
% 0.09/15.50  % Disequality decompositions           : 0
% 0.09/15.50  % Total rewrite steps                  : 29
% 0.09/15.50  % ...of those cached                   : 12
% 0.09/15.50  % Propositional unsat checks           : 0
% 0.09/15.50  %    Propositional check models        : 0
% 0.09/15.50  %    Propositional check unsatisfiable : 0
% 0.09/15.50  %    Propositional clauses             : 0
% 0.09/15.50  %    Propositional clauses after purity: 0
% 0.09/15.50  %    Propositional unsat core size     : 0
% 0.09/15.50  %    Propositional preprocessing time  : 0.000
% 0.09/15.50  %    Propositional encoding time       : 0.000
% 0.09/15.50  %    Propositional solver time         : 0.000
% 0.09/15.50  %    Success case prop preproc time    : 0.000
% 0.09/15.50  %    Success case prop encoding time   : 0.000
% 0.09/15.50  %    Success case prop solver time     : 0.000
% 0.09/15.50  % Current number of processed clauses  : 15
% 0.09/15.50  %    Positive orientable unit clauses  : 2
% 0.09/15.50  %    Positive unorientable unit clauses: 1
% 0.09/15.50  %    Negative unit clauses             : 10
% 0.09/15.50  %    Non-unit-clauses                  : 2
% 0.09/15.50  % Current number of unprocessed clauses: 21
% 0.09/15.50  % ...number of literals in the above   : 23
% 0.09/15.50  % Current number of archived formulas  : 0
% 0.09/15.50  % Current number of archived clauses   : 10
% 0.09/15.50  % Clause-clause subsumption calls (NU) : 0
% 0.09/15.50  % Rec. Clause-clause subsumption calls : 0
% 0.09/15.50  % Non-unit clause-clause subsumptions  : 0
% 0.09/15.50  % Unit Clause-clause subsumption calls : 11
% 0.09/15.50  % Rewrite failures with RHS unbound    : 0
% 0.09/15.50  % BW rewrite match attempts            : 10
% 0.09/15.50  % BW rewrite match successes           : 10
% 0.09/15.50  % Condensation attempts                : 0
% 0.09/15.50  % Condensation successes               : 0
% 0.09/15.50  % Termbank termtop insertions          : 2094
% 0.09/15.50  % Search garbage collected termcells   : 276
% 0.09/15.50  
% 0.09/15.50  % -------------------------------------------------
% 0.09/15.50  % User time                : 0.005 s
% 0.09/15.50  % System time              : 0.003 s
% 0.09/15.50  % Total time               : 0.008 s
% 0.09/15.50  % Maximum resident set size: 3652 pages
% 0.09/15.50  
% 0.09/15.50  % -------------------------------------------------
% 0.09/15.50  % User time                : 0.013 s
% 0.09/15.50  % System time              : 0.012 s
% 0.09/15.50  % Total time               : 0.026 s
% 0.09/15.50  % Maximum resident set size: 4608 pages
% 0.09/15.50  % E exiting
%------------------------------------------------------------------------------