↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV258-1 : TPTP v9.3.1. Released v3.2.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 02:54:07 PM UTC 2026

% Result   : Unsatisfiable 0.37s 0.86s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (  10 unt;   0 nHn;  16 RR)
%            Number of literals    :   31 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   29 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_Message_Oparts__subset__iff_1,axiom,
    ( ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_1) ).

cnf(cls_Message_Oparts__subset__iff_0,axiom,
    ( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_0) ).

cnf(cls_Set_Oinsert__subset_2,axiom,
    ( ~ c_lessequals(X4,X2,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_Oinsert__subset_2) ).

cnf(cls_Set_Osubset__refl_0,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_6,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).

cnf(c_0_7,plain,
    ( ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_1]) ).

cnf(c_0_8,plain,
    ( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_0]) ).

cnf(c_0_9,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    c_0_6 ).

cnf(c_0_10,plain,
    ( ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    c_0_7 ).

cnf(c_0_11,plain,
    ( ~ c_lessequals(X4,X2,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_2]) ).

cnf(c_0_12,plain,
    ( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    c_0_8 ).

cnf(c_0_13,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    cls_Set_Osubset__refl_0 ).

cnf(c_0_14,negated_conjecture,
    ~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( ~ c_lessequals(X4,X2,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3)) ),
    c_0_11 ).

cnf(c_0_16,plain,
    c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
    cls_conjecture_0 ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWV258-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44  % Computer : n007.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Mon Sep 21 08:34:37 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.53  Running first-order theorem proving
% 0.27/0.53  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.37/0.86  % Version: 3.5.1
% 0.37/0.86  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.37/0.86  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.86  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.86  % Starting new_bool_3 with 300s (1) cores
% 0.37/0.86  % Starting new_bool_1 with 300s (1) cores
% 0.37/0.86  % Starting sh5l with 300s (1) cores
% 0.37/0.86  % new_bool_1 with pid 669800 completed with status 0
% 0.37/0.86  % Result found by new_bool_1
% 0.37/0.86  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.37/0.86  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.86  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.86  % Starting new_bool_3 with 300s (1) cores
% 0.37/0.86  % Starting new_bool_1 with 300s (1) cores
% 0.37/0.86  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/0.86  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.86  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.37/0.86  % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.86  % Starting SubtermCWHack with 28s (1) cores
% 0.37/0.86  % SubtermCWHack with pid 669808 completed with status 0
% 0.37/0.86  % Result found by SubtermCWHack
% 0.37/0.86  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.37/0.86  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.86  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.86  % Starting new_bool_3 with 300s (1) cores
% 0.37/0.86  % Starting new_bool_1 with 300s (1) cores
% 0.37/0.86  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/0.86  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.86  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.37/0.86  % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.86  % Starting SubtermCWHack with 28s (1) cores
% 0.37/0.86  % Preprocessing time       : 0.007 s
% 0.37/0.86  
% 0.37/0.86  % Proof found!
% 0.37/0.86  % SZS status Unsatisfiable
% 0.37/0.86  % SZS output start CNFRefutation
% See solution above
% 0.37/0.86  % Parsed axioms                        : 2779
% 0.37/0.86  % Removed by relevancy pruning/SinE    : 2491
% 0.37/0.86  % Initial clauses                      : 288
% 0.37/0.86  % Removed in clause preprocessing      : 0
% 0.37/0.86  % Initial clauses in saturation        : 288
% 0.37/0.86  % Processed clauses                    : 1518
% 0.37/0.86  % ...of these trivial                  : 17
% 0.37/0.86  % ...subsumed                          : 1025
% 0.37/0.86  % ...remaining for further processing  : 476
% 0.37/0.86  % Other redundant clauses eliminated   : 96
% 0.37/0.86  % Clauses deleted for lack of memory   : 0
% 0.37/0.86  % Backward-subsumed                    : 8
% 0.37/0.86  % Backward-rewritten                   : 43
% 0.37/0.86  % Generated clauses                    : 3660
% 0.37/0.86  % ...of the previous two non-redundant : 2785
% 0.37/0.86  % ...aggressively subsumed             : 0
% 0.37/0.86  % Contextual simplify-reflections      : 0
% 0.37/0.86  % Paramodulations                      : 3551
% 0.37/0.86  % Factorizations                       : 0
% 0.37/0.86  % NegExts                              : 0
% 0.37/0.86  % Equation resolutions                 : 109
% 0.37/0.86  % Disequality decompositions           : 0
% 0.37/0.86  % Total rewrite steps                  : 1503
% 0.37/0.86  % ...of those cached                   : 1124
% 0.37/0.86  % Propositional unsat checks           : 0
% 0.37/0.86  %    Propositional check models        : 0
% 0.37/0.86  %    Propositional check unsatisfiable : 0
% 0.37/0.86  %    Propositional clauses             : 0
% 0.37/0.86  %    Propositional clauses after purity: 0
% 0.37/0.86  %    Propositional unsat core size     : 0
% 0.37/0.86  %    Propositional preprocessing time  : 0.000
% 0.37/0.86  %    Propositional encoding time       : 0.000
% 0.37/0.86  %    Propositional solver time         : 0.000
% 0.37/0.86  %    Success case prop preproc time    : 0.000
% 0.37/0.86  %    Success case prop encoding time   : 0.000
% 0.37/0.86  %    Success case prop solver time     : 0.000
% 0.37/0.86  % Current number of processed clauses  : 425
% 0.37/0.86  %    Positive orientable unit clauses  : 132
% 0.37/0.86  %    Positive unorientable unit clauses: 0
% 0.37/0.86  %    Negative unit clauses             : 107
% 0.37/0.86  %    Non-unit-clauses                  : 186
% 0.37/0.86  % Current number of unprocessed clauses: 1473
% 0.37/0.86  % ...number of literals in the above   : 2952
% 0.37/0.86  % Current number of archived formulas  : 0
% 0.37/0.86  % Current number of archived clauses   : 51
% 0.37/0.86  % Clause-clause subsumption calls (NU) : 7219
% 0.37/0.86  % Rec. Clause-clause subsumption calls : 4121
% 0.37/0.86  % Non-unit clause-clause subsumptions  : 136
% 0.37/0.86  % Unit Clause-clause subsumption calls : 2355
% 0.37/0.86  % Rewrite failures with RHS unbound    : 0
% 0.37/0.86  % BW rewrite match attempts            : 120
% 0.37/0.86  % BW rewrite match successes           : 32
% 0.37/0.86  % Condensation attempts                : 0
% 0.37/0.86  % Condensation successes               : 0
% 0.37/0.86  % Termbank termtop insertions          : 61084
% 0.37/0.86  % Search garbage collected termcells   : 7664
% 0.37/0.86  
% 0.37/0.86  % -------------------------------------------------
% 0.37/0.86  % User time                : 0.118 s
% 0.37/0.86  % System time              : 0.015 s
% 0.37/0.86  % Total time               : 0.133 s
% 0.37/0.86  % Maximum resident set size: 6188 pages
% 0.37/0.86  
% 0.37/0.86  % -------------------------------------------------
% 0.37/0.86  % User time                : 0.210 s
% 0.37/0.86  % System time              : 0.026 s
% 0.37/0.86  % Total time               : 0.236 s
% 0.37/0.86  % Maximum resident set size: 6400 pages
% 0.37/0.86  % E exiting
%------------------------------------------------------------------------------