↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n003.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:47 PM UTC 2026

% Result   : Theorem 0.54s 0.48s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   46 (  28 unt;   0 def)
%            Number of atoms       :   69 (  24 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   57 (  34   ~;  19   |;   1   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 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   :   78 (   7 sgn  43   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('ass(cond(73, 0), 0)',axiom,
    ! [X42,X43] : X43 != vplus(X42,X43),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).

fof('ass(cond(33, 0), 0)',axiom,
    ! [X49,X50,X51] : vplus(vplus(X49,X50),X51) = vplus(X49,vplus(X50,X51)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).

fof('ass(cond(61, 0), 0)',axiom,
    ! [X44,X45] : vplus(X45,X44) = vplus(X44,X45),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).

fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
    ! [X32,X33] :
      ( greater(X33,X32)
    <=> ? [X34] : X33 = vplus(X32,X34) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).

fof('holds(conseq(204), 332, 0)',conjecture,
    greater(vd328,vd329),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(204), 332, 0)') ).

fof('holds(antec(204), 331, 0)',axiom,
    greater(vplus(vd328,vd330),vplus(vd329,vd330)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(204), 331, 0)') ).

fof('ass(cond(goal(193), 0), 2)',axiom,
    ! [X1,X2,X3] :
      ( greater(X1,X2)
     => greater(vplus(X1,X3),vplus(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 2)') ).

fof('ass(cond(147, 0), 0)',axiom,
    ! [X23,X24] :
      ( less(X23,X24)
     => greater(X24,X23) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).

fof('ass(cond(goal(130), 0), 3)',axiom,
    ! [X27,X28] :
      ( ~ greater(X27,X28)
      | X27 != X28 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).

fof('ass(cond(goal(130), 0), 0)',axiom,
    ! [X27,X28] :
      ( less(X27,X28)
      | greater(X27,X28)
      | X27 = X28 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).

fof(c_0_10,plain,
    ! [X42,X43] : X43 != vplus(X42,X43),
    inference(fof_simplification,[status(thm)],['ass(cond(73, 0), 0)']) ).

fof(c_0_11,plain,
    ! [X130,X131] : X131 != vplus(X130,X131),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).

fof(c_0_12,plain,
    ! [X137,X138,X139] : vplus(vplus(X137,X138),X139) = vplus(X137,vplus(X138,X139)),
    inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).

cnf(c_0_13,plain,
    X1 != vplus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_15,plain,
    ! [X132,X133] : vplus(X133,X132) = vplus(X132,X133),
    inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).

cnf(c_0_16,plain,
    vplus(X1,vplus(X2,X3)) != X3,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    vplus(X1,X2) = vplus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_18,plain,
    ! [X107,X108,X110,X111,X112] :
      ( ( greater(X111,X110)
        | X111 != vplus(X110,X112) )
      & ( X108 = vplus(X107,esk2_2(X107,X108))
        | ~ greater(X108,X107) ) ),
    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(axiom(3)), 11), 1)'])])])])])]) ).

cnf(c_0_19,plain,
    vplus(X1,vplus(X2,X3)) != X2,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( ~ greater(X1,X2)
    | X1 = vplus(X2,esk2_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_21,plain,
    ~ greater(X1,vplus(X2,X1)),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]) ).

fof(c_0_22,negated_conjecture,
    ~ greater(vd328,vd329),
    inference(assume_negation,[status(cth)],['holds(conseq(204), 332, 0)']) ).

cnf(c_0_23,plain,
    ~ greater(X1,vplus(X1,X2)),
    inference(spm,[status(thm)],[c_0_21,c_0_17]) ).

cnf(c_0_24,plain,
    greater(vplus(vd328,vd330),vplus(vd329,vd330)),
    inference(split_conjunct,[status(thm)],['holds(antec(204), 331, 0)']) ).

fof(c_0_25,plain,
    ! [X67,X68,X69] :
      ( greater(vplus(X67,X69),vplus(X68,X69))
      | ~ greater(X67,X68) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 2)'])])]) ).

fof(c_0_26,negated_conjecture,
    ~ greater(vd328,vd329),
    inference(fof_simplification,[status(thm)],[c_0_22]) ).

cnf(c_0_27,plain,
    ( ~ greater(X2,X1)
    | ~ greater(X1,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_20]) ).

cnf(c_0_28,plain,
    greater(vplus(vd328,vd330),vplus(vd330,vd329)),
    inference(rw,[status(thm)],[c_0_24,c_0_17]) ).

cnf(c_0_29,plain,
    ( ~ greater(X1,X2)
    | greater(vplus(X1,X3),vplus(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

fof(c_0_30,negated_conjecture,
    ~ greater(vd328,vd329),
    inference(fof_nnf,[status(thm)],[c_0_26]) ).

fof(c_0_31,plain,
    ! [X89,X90] :
      ( greater(X90,X89)
      | ~ less(X89,X90) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])])]) ).

fof(c_0_32,plain,
    ! [X27,X28] :
      ( ~ greater(X27,X28)
      | X27 != X28 ),
    inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)']) ).

cnf(c_0_33,plain,
    ~ greater(vplus(vd330,vd329),vplus(vd328,vd330)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,plain,
    ( ~ greater(X2,X3)
    | greater(vplus(X1,X2),vplus(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_17]) ).

fof(c_0_35,plain,
    ! [X93,X94] :
      ( less(X93,X94)
      | greater(X93,X94)
      | X93 = X94 ),
    inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).

cnf(c_0_36,negated_conjecture,
    ~ greater(vd328,vd329),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_37,plain,
    ( ~ less(X1,X2)
    | greater(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

fof(c_0_38,plain,
    ! [X99,X100] :
      ( ~ greater(X99,X100)
      | X99 != X100 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_32])]) ).

cnf(c_0_39,plain,
    ~ greater(vd329,vd328),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_40,plain,
    ( less(X1,X2)
    | greater(X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    ~ less(vd329,vd328),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,plain,
    ( ~ greater(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_43,plain,
    vd329 = vd328,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_44,plain,
    ~ greater(X1,X1),
    inference(er,[status(thm)],[c_0_42]) ).

cnf(c_0_45,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_43]),c_0_17]),c_0_44]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM839+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n003.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 03:13:46 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.54/0.48  % Version: 3.5.1
% 0.54/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.54/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.54/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.54/0.48  % Starting sh5l with 300s (1) cores
% 0.54/0.48  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3275510 completed with status 0
% 0.54/0.48  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.54/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.54/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.48  % No SInE strategy applied
% 0.54/0.48  % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.54/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.54/0.48  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.54/0.48  % Starting new_bool_3 with 136s (1) cores
% 0.54/0.48  % Starting new_bool_1 with 136s (1) cores
% 0.54/0.48  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3275515 completed with status 0
% 0.54/0.48  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.54/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.54/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.48  % No SInE strategy applied
% 0.54/0.48  % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.54/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.54/0.48  % Preprocessing time       : 0.002 s
% 0.54/0.48  % Presaturation interreduction done
% 0.54/0.48  
% 0.54/0.48  % Proof found!
% 0.54/0.48  % SZS status Theorem
% 0.54/0.48  % SZS output start CNFRefutation
% See solution above
% 0.54/0.48  % Parsed axioms                        : 37
% 0.54/0.48  % Removed by relevancy pruning/SinE    : 0
% 0.54/0.48  % Initial clauses                      : 45
% 0.54/0.48  % Removed in clause preprocessing      : 2
% 0.54/0.48  % Initial clauses in saturation        : 43
% 0.54/0.48  % Processed clauses                    : 623
% 0.54/0.48  % ...of these trivial                  : 22
% 0.54/0.48  % ...subsumed                          : 364
% 0.54/0.48  % ...remaining for further processing  : 236
% 0.54/0.48  % Other redundant clauses eliminated   : 69
% 0.54/0.48  % Clauses deleted for lack of memory   : 0
% 0.54/0.48  % Backward-subsumed                    : 12
% 0.54/0.48  % Backward-rewritten                   : 51
% 0.54/0.48  % Generated clauses                    : 2472
% 0.54/0.48  % ...of the previous two non-redundant : 2338
% 0.54/0.48  % ...aggressively subsumed             : 0
% 0.54/0.48  % Contextual simplify-reflections      : 1
% 0.54/0.48  % Paramodulations                      : 2395
% 0.54/0.48  % Factorizations                       : 2
% 0.54/0.48  % NegExts                              : 0
% 0.54/0.48  % Equation resolutions                 : 74
% 0.54/0.48  % Disequality decompositions           : 0
% 0.54/0.48  % Total rewrite steps                  : 436
% 0.54/0.48  % ...of those cached                   : 311
% 0.54/0.48  % Propositional unsat checks           : 0
% 0.54/0.48  %    Propositional check models        : 0
% 0.54/0.48  %    Propositional check unsatisfiable : 0
% 0.54/0.48  %    Propositional clauses             : 0
% 0.54/0.48  %    Propositional clauses after purity: 0
% 0.54/0.48  %    Propositional unsat core size     : 0
% 0.54/0.48  %    Propositional preprocessing time  : 0.000
% 0.54/0.48  %    Propositional encoding time       : 0.000
% 0.54/0.48  %    Propositional solver time         : 0.000
% 0.54/0.48  %    Success case prop preproc time    : 0.000
% 0.54/0.48  %    Success case prop encoding time   : 0.000
% 0.54/0.48  %    Success case prop solver time     : 0.000
% 0.54/0.48  % Current number of processed clauses  : 129
% 0.54/0.48  %    Positive orientable unit clauses  : 22
% 0.54/0.48  %    Positive unorientable unit clauses: 3
% 0.54/0.48  %    Negative unit clauses             : 22
% 0.54/0.48  %    Non-unit-clauses                  : 82
% 0.54/0.48  % Current number of unprocessed clauses: 1784
% 0.54/0.48  % ...number of literals in the above   : 4291
% 0.54/0.48  % Current number of archived formulas  : 0
% 0.54/0.48  % Current number of archived clauses   : 99
% 0.54/0.48  % Clause-clause subsumption calls (NU) : 2709
% 0.54/0.48  % Rec. Clause-clause subsumption calls : 2264
% 0.54/0.48  % Non-unit clause-clause subsumptions  : 228
% 0.54/0.48  % Unit Clause-clause subsumption calls : 359
% 0.54/0.48  % Rewrite failures with RHS unbound    : 0
% 0.54/0.48  % BW rewrite match attempts            : 84
% 0.54/0.48  % BW rewrite match successes           : 67
% 0.54/0.48  % Condensation attempts                : 0
% 0.54/0.48  % Condensation successes               : 0
% 0.54/0.48  % Termbank termtop insertions          : 20708
% 0.54/0.48  % Search garbage collected termcells   : 515
% 0.54/0.48  
% 0.54/0.48  % -------------------------------------------------
% 0.54/0.48  % User time                : 0.046 s
% 0.54/0.48  % System time              : 0.006 s
% 0.54/0.48  % Total time               : 0.051 s
% 0.54/0.48  % Maximum resident set size: 3692 pages
% 0.54/0.48  
% 0.54/0.48  % -------------------------------------------------
% 0.54/0.48  % User time                : 0.196 s
% 0.54/0.48  % System time              : 0.021 s
% 0.54/0.48  % Total time               : 0.217 s
% 0.54/0.48  % Maximum resident set size: 4864 pages
% 0.54/0.48  % E exiting
%------------------------------------------------------------------------------