↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n018.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:12 PM UTC 2026

% Result   : Unsatisfiable 18.22s 2.80s
% Output   : CNFRefutation 18.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   23 (  12 unt;   4 nHn;  17 RR)
%            Number of literals    :   37 (   3 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :   37 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_ODiff__iff_2,axiom,
    ( ~ c_in(X1,X2,X3)
    | c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
    | c_in(X1,X4,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__iff_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_Set_ODiff__eq__empty__iff_1,axiom,
    ( ~ c_lessequals(X1,X2,tc_set(X3))
    | c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__eq__empty__iff_1) ).

cnf(cls_Set_Oempty__iff_0,axiom,
    ~ c_in(X1,c_emptyset,X2),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_Oempty__iff_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Message_OkeysFor__mono_0,axiom,
    ( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_OkeysFor__mono_0) ).

cnf(cls_Message_Oanalz__subset__parts_0,axiom,
    c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__parts_0) ).

cnf(c_0_7,plain,
    ( ~ c_in(X1,X2,X3)
    | c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
    | c_in(X1,X4,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_ODiff__iff_2]) ).

cnf(c_0_8,plain,
    ( ~ c_in(X1,X2,X3)
    | c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
    | c_in(X1,X4,X3) ),
    c_0_7 ).

cnf(c_0_9,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
    cls_conjecture_3 ).

cnf(c_0_10,plain,
    ( ~ c_lessequals(X1,X2,tc_set(X3))
    | c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
    inference(fof_simplification,[status(thm)],[cls_Set_ODiff__eq__empty__iff_1]) ).

cnf(c_0_11,plain,
    ~ c_in(X1,c_emptyset,X2),
    inference(fof_simplification,[status(thm)],[cls_Set_Oempty__iff_0]) ).

cnf(c_0_12,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).

cnf(c_0_13,negated_conjecture,
    ( c_in(v_K,X1,tc_nat)
    | c_in(v_K,c_minus(c_Message_OkeysFor(c_Message_Oanalz(v_H)),X1,tc_set(tc_nat)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    ( ~ c_lessequals(X1,X2,tc_set(X3))
    | c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
    c_0_10 ).

cnf(c_0_15,plain,
    ~ c_in(X1,c_emptyset,X2),
    c_0_11 ).

cnf(c_0_16,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    c_0_12 ).

cnf(c_0_17,negated_conjecture,
    ( ~ c_lessequals(c_Message_OkeysFor(c_Message_Oanalz(v_H)),X1,tc_set(tc_nat))
    | c_in(v_K,X1,tc_nat) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_18,plain,
    ( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat)) ),
    inference(fof_simplification,[status(thm)],[cls_Message_OkeysFor__mono_0]) ).

cnf(c_0_19,negated_conjecture,
    ~ c_lessequals(c_Message_OkeysFor(c_Message_Oanalz(v_H)),c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_set(tc_nat)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat)) ),
    c_0_18 ).

cnf(c_0_21,axiom,
    c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    cls_Message_Oanalz__subset__parts_0 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV277-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n018.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 08:39:58 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/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
% 18.22/2.80  % Version: 3.5.1
% 18.22/2.80  % Preprocessing class: FMLMSMSMSSSNFFN.
% 18.22/2.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.22/2.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.22/2.80  % Starting new_bool_3 with 300s (1) cores
% 18.22/2.80  % Starting new_bool_1 with 300s (1) cores
% 18.22/2.80  % Starting sh5l with 300s (1) cores
% 18.22/2.80  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1477835 completed with status 0
% 18.22/2.80  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.22/2.80  % Preprocessing class: FMLMSMSMSSSNFFN.
% 18.22/2.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.22/2.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.22/2.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.22/2.80  % No SInE strategy applied
% 18.22/2.80  % Search class: FGHSM-SMLM32-DFFFFFNN
% 18.22/2.80  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 18.22/2.80  % Starting SubtermCWHack with 136s (1) cores
% 18.22/2.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.22/2.80  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 18.22/2.80  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 18.22/2.80  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 18.22/2.80  % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1477855 completed with status 0
% 18.22/2.80  % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 18.22/2.80  % Preprocessing class: FMLMSMSMSSSNFFN.
% 18.22/2.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.22/2.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.22/2.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.22/2.80  % No SInE strategy applied
% 18.22/2.80  % Search class: FGHSM-SMLM32-DFFFFFNN
% 18.22/2.80  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 18.22/2.80  % Starting SubtermCWHack with 136s (1) cores
% 18.22/2.80  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.22/2.80  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 18.22/2.80  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 18.22/2.80  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 18.22/2.80  % Preprocessing time       : 0.044 s
% 18.22/2.80  % Presaturation interreduction done
% 18.22/2.80  
% 18.22/2.80  % Proof found!
% 18.22/2.80  % SZS status Unsatisfiable
% 18.22/2.80  % SZS output start CNFRefutation
% See solution above
% 18.22/2.80  % Parsed axioms                        : 2899
% 18.22/2.80  % Removed by relevancy pruning/SinE    : 0
% 18.22/2.80  % Initial clauses                      : 2899
% 18.22/2.80  % Removed in clause preprocessing      : 12
% 18.22/2.80  % Initial clauses in saturation        : 2887
% 18.22/2.80  % Processed clauses                    : 14557
% 18.22/2.80  % ...of these trivial                  : 96
% 18.22/2.80  % ...subsumed                          : 7630
% 18.22/2.80  % ...remaining for further processing  : 6831
% 18.22/2.80  % Other redundant clauses eliminated   : 271
% 18.22/2.80  % Clauses deleted for lack of memory   : 0
% 18.22/2.80  % Backward-subsumed                    : 118
% 18.22/2.80  % Backward-rewritten                   : 330
% 18.22/2.80  % Generated clauses                    : 35059
% 18.22/2.80  % ...of the previous two non-redundant : 30751
% 18.22/2.80  % ...aggressively subsumed             : 0
% 18.22/2.80  % Contextual simplify-reflections      : 30
% 18.22/2.80  % Paramodulations                      : 34722
% 18.22/2.80  % Factorizations                       : 6
% 18.22/2.80  % NegExts                              : 0
% 18.22/2.80  % Equation resolutions                 : 331
% 18.22/2.80  % Disequality decompositions           : 0
% 18.22/2.80  % Total rewrite steps                  : 17371
% 18.22/2.80  % ...of those cached                   : 15355
% 18.22/2.80  % Propositional unsat checks           : 1
% 18.22/2.80  %    Propositional check models        : 1
% 18.22/2.80  %    Propositional check unsatisfiable : 0
% 18.22/2.80  %    Propositional clauses             : 0
% 18.22/2.80  %    Propositional clauses after purity: 0
% 18.22/2.80  %    Propositional unsat core size     : 0
% 18.22/2.80  %    Propositional preprocessing time  : 0.000
% 18.22/2.80  %    Propositional encoding time       : 0.010
% 18.22/2.80  %    Propositional solver time         : 0.012
% 18.22/2.80  %    Success case prop preproc time    : 0.000
% 18.22/2.80  %    Success case prop encoding time   : 0.000
% 18.22/2.80  %    Success case prop solver time     : 0.000
% 18.22/2.80  % Current number of processed clauses  : 3656
% 18.22/2.80  %    Positive orientable unit clauses  : 642
% 18.22/2.80  %    Positive unorientable unit clauses: 27
% 18.22/2.80  %    Negative unit clauses             : 358
% 18.22/2.80  %    Non-unit-clauses                  : 2629
% 18.22/2.80  % Current number of unprocessed clauses: 20288
% 18.22/2.80  % ...number of literals in the above   : 51261
% 18.22/2.80  % Current number of archived formulas  : 0
% 18.22/2.80  % Current number of archived clauses   : 3185
% 18.22/2.80  % Clause-clause subsumption calls (NU) : 5271829
% 18.22/2.80  % Rec. Clause-clause subsumption calls : 3617591
% 18.22/2.80  % Non-unit clause-clause subsumptions  : 4664
% 18.22/2.80  % Unit Clause-clause subsumption calls : 165595
% 18.22/2.80  % Rewrite failures with RHS unbound    : 0
% 18.22/2.80  % BW rewrite match attempts            : 1215
% 18.22/2.80  % BW rewrite match successes           : 155
% 18.22/2.80  % Condensation attempts                : 0
% 18.22/2.80  % Condensation successes               : 0
% 18.22/2.80  % Termbank termtop insertions          : 601671
% 18.22/2.80  % Search garbage collected termcells   : 4191
% 18.22/2.80  
% 18.22/2.80  % -------------------------------------------------
% 18.22/2.80  % User time                : 2.151 s
% 18.22/2.80  % System time              : 0.056 s
% 18.22/2.80  % Total time               : 2.207 s
% 18.22/2.80  % Maximum resident set size: 8784 pages
% 18.22/2.80  
% 18.22/2.80  % -------------------------------------------------
% 18.22/2.80  % User time                : 10.699 s
% 18.22/2.80  % System time              : 0.377 s
% 18.22/2.80  % Total time               : 11.076 s
% 18.22/2.80  % Maximum resident set size: 6400 pages
% 18.22/2.80  % E exiting
%------------------------------------------------------------------------------