↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV262-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 : n020.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:08 PM UTC 2026

% Result   : Unsatisfiable 0.36s 1.02s
% Output   : CNFRefutation 0.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (  29 unt;   0 nHn;   8 RR)
%            Number of literals    :   29 (  28 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;   9 con; 0-3 aty)
%            Number of variables   :   36 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_List_Oset__empty2_1,axiom,
    c_emptyset = c_List_Oset(c_List_Olist_ONil,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_List_Oset__empty2_1) ).

cnf(cls_SetInterval_OlessThan__0_0,axiom,
    c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_OlessThan__0_0) ).

cnf(cls_List_Oset__empty_1,axiom,
    c_List_Oset(c_List_Olist_ONil,X1) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_List_Oset__empty_1) ).

cnf(cls_Set_OCompl__UNIV__eq_0,axiom,
    c_uminus(c_UNIV,tc_set(X1)) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OCompl__UNIV__eq_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Set_ODiff__cancel_0,axiom,
    c_minus(X1,X1,tc_set(X2)) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__cancel_0) ).

cnf(cls_Message_Oparts__insert_0,axiom,
    c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(X2),tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__insert_0) ).

cnf(cls_Datatype_Oo2s_Osimps__2_0,axiom,
    c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2) = c_insert(X1,c_emptyset,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Datatype_Oo2s_Osimps__2_0) ).

cnf(cls_Set_OUn__assoc_0,axiom,
    c_union(c_union(X1,X2,X3),X4,X3) = c_union(X1,c_union(X2,X4,X3),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__assoc_0) ).

cnf(c_0_9,axiom,
    c_emptyset = c_List_Oset(c_List_Olist_ONil,X1),
    cls_List_Oset__empty2_1 ).

cnf(c_0_10,axiom,
    c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
    cls_SetInterval_OlessThan__0_0 ).

cnf(c_0_11,axiom,
    c_List_Oset(c_List_Olist_ONil,X1) = c_emptyset,
    cls_List_Oset__empty_1 ).

cnf(c_0_12,plain,
    c_SetInterval_OlessThan(c_0,tc_nat) = c_List_Oset(c_List_Olist_ONil,X1),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,axiom,
    c_uminus(c_UNIV,tc_set(X1)) = c_emptyset,
    cls_Set_OCompl__UNIV__eq_0 ).

cnf(c_0_14,plain,
    c_List_Oset(c_List_Olist_ONil,X1) = c_List_Oset(c_List_Olist_ONil,c_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).

cnf(c_0_15,plain,
    c_uminus(c_UNIV,tc_set(X1)) = c_List_Oset(c_List_Olist_ONil,c_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_17,axiom,
    c_minus(X1,X1,tc_set(X2)) = c_emptyset,
    cls_Set_ODiff__cancel_0 ).

cnf(c_0_18,plain,
    c_List_Oset(c_List_Olist_ONil,X1) = c_uminus(c_UNIV,tc_set(c_0)),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
    c_0_16 ).

cnf(c_0_20,axiom,
    c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(X2),tc_Message_Omsg),
    cls_Message_Oparts__insert_0 ).

cnf(c_0_21,plain,
    c_minus(X1,X1,tc_set(X2)) = c_uminus(c_UNIV,tc_set(c_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10]),c_0_12]),c_0_18]) ).

cnf(c_0_22,axiom,
    c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2) = c_insert(X1,c_emptyset,X2),
    cls_Datatype_Oo2s_Osimps__2_0 ).

cnf(c_0_23,negated_conjecture,
    c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_SetInterval_OlessThan(c_0,tc_nat),tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_SetInterval_OlessThan(c_0,tc_nat),tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_10]),c_0_10]) ).

cnf(c_0_24,plain,
    c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(c_insert(X1,c_minus(c_0,c_0,tc_set(c_0)),tc_Message_Omsg)),c_Message_Oparts(X2),tc_Message_Omsg),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_10]),c_0_12]),c_0_18]),c_0_21]) ).

cnf(c_0_25,plain,
    c_insert(X1,c_minus(c_0,c_0,tc_set(c_0)),X2) = c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_10]),c_0_12]),c_0_18]),c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    c_union(c_union(c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_X,tc_Message_Omsg),tc_Message_Omsg)),c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_Y,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg) != c_union(c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_X,tc_Message_Omsg),tc_Message_Omsg)),c_union(c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_Y,tc_Message_Omsg),tc_Message_Omsg)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_Message_Omsg),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_12]),c_0_18]),c_0_21]),c_0_12]),c_0_18]),c_0_21]),c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_27,axiom,
    c_union(c_union(X1,X2,X3),X4,X3) = c_union(X1,c_union(X2,X4,X3),X3),
    cls_Set_OUn__assoc_0 ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWV262-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.42  % Computer : n020.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Mon Sep 21 08:37:47 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.50  Running first-order theorem proving
% 0.17/0.50  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.36/1.02  % Version: 3.5.1
% 0.36/1.02  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.36/1.02  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/1.02  % Starting new_bool_3 with 300s (1) cores
% 0.36/1.02  % Starting new_bool_1 with 300s (1) cores
% 0.36/1.02  % Starting sh5l with 300s (1) cores
% 0.36/1.02  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2514392 completed with status 0
% 0.36/1.02  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.36/1.02  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.36/1.02  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/1.02  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.36/1.02  % No SInE strategy applied
% 0.36/1.02  % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.36/1.02  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/1.02  % Starting SubtermCWHack with 136s (1) cores
% 0.36/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.36/1.02  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 0.36/1.02  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 0.36/1.02  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.36/1.02  % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2514403 completed with status 0
% 0.36/1.02  % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.36/1.02  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.36/1.02  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/1.02  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.36/1.02  % No SInE strategy applied
% 0.36/1.02  % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.36/1.02  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/1.02  % Starting SubtermCWHack with 136s (1) cores
% 0.36/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.36/1.02  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 0.36/1.02  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 0.36/1.02  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.36/1.02  % Preprocessing time       : 0.038 s
% 0.36/1.02  % Presaturation interreduction done
% 0.36/1.02  
% 0.36/1.02  % Proof found!
% 0.36/1.02  % SZS status Unsatisfiable
% 0.36/1.02  % SZS output start CNFRefutation
% See solution above
% 0.36/1.02  % Parsed axioms                        : 2775
% 0.36/1.02  % Removed by relevancy pruning/SinE    : 0
% 0.36/1.02  % Initial clauses                      : 2775
% 0.36/1.02  % Removed in clause preprocessing      : 9
% 0.36/1.02  % Initial clauses in saturation        : 2766
% 0.36/1.02  % Processed clauses                    : 1896
% 0.36/1.02  % ...of these trivial                  : 20
% 0.36/1.02  % ...subsumed                          : 56
% 0.36/1.02  % ...remaining for further processing  : 1820
% 0.36/1.02  % Other redundant clauses eliminated   : 0
% 0.36/1.02  % Clauses deleted for lack of memory   : 0
% 0.36/1.02  % Backward-subsumed                    : 3
% 0.36/1.02  % Backward-rewritten                   : 133
% 0.36/1.02  % Generated clauses                    : 0
% 0.36/1.02  % ...of the previous two non-redundant : 122
% 0.36/1.02  % ...aggressively subsumed             : 0
% 0.36/1.02  % Contextual simplify-reflections      : 0
% 0.36/1.02  % Paramodulations                      : 0
% 0.36/1.02  % Factorizations                       : 0
% 0.36/1.02  % NegExts                              : 0
% 0.36/1.02  % Equation resolutions                 : 0
% 0.36/1.02  % Disequality decompositions           : 0
% 0.36/1.02  % Total rewrite steps                  : 553
% 0.36/1.02  % ...of those cached                   : 485
% 0.36/1.02  % Propositional unsat checks           : 0
% 0.36/1.02  %    Propositional check models        : 0
% 0.36/1.02  %    Propositional check unsatisfiable : 0
% 0.36/1.02  %    Propositional clauses             : 0
% 0.36/1.02  %    Propositional clauses after purity: 0
% 0.36/1.02  %    Propositional unsat core size     : 0
% 0.36/1.02  %    Propositional preprocessing time  : 0.000
% 0.36/1.02  %    Propositional encoding time       : 0.000
% 0.36/1.02  %    Propositional solver time         : 0.000
% 0.36/1.02  %    Success case prop preproc time    : 0.000
% 0.36/1.02  %    Success case prop encoding time   : 0.000
% 0.36/1.02  %    Success case prop solver time     : 0.000
% 0.36/1.02  % Current number of processed clauses  : 1684
% 0.36/1.02  %    Positive orientable unit clauses  : 382
% 0.36/1.02  %    Positive unorientable unit clauses: 8
% 0.36/1.02  %    Negative unit clauses             : 32
% 0.36/1.02  %    Non-unit-clauses                  : 1262
% 0.36/1.02  % Current number of unprocessed clauses: 992
% 0.36/1.02  % ...number of literals in the above   : 2813
% 0.36/1.02  % Current number of archived formulas  : 0
% 0.36/1.02  % Current number of archived clauses   : 144
% 0.36/1.02  % Clause-clause subsumption calls (NU) : 567875
% 0.36/1.02  % Rec. Clause-clause subsumption calls : 503305
% 0.36/1.02  % Non-unit clause-clause subsumptions  : 38
% 0.36/1.02  % Unit Clause-clause subsumption calls : 31832
% 0.36/1.02  % Rewrite failures with RHS unbound    : 0
% 0.36/1.02  % BW rewrite match attempts            : 156
% 0.36/1.02  % BW rewrite match successes           : 37
% 0.36/1.02  % Condensation attempts                : 0
% 0.36/1.02  % Condensation successes               : 0
% 0.36/1.02  % Termbank termtop insertions          : 82798
% 0.36/1.02  % Search garbage collected termcells   : 4018
% 0.36/1.02  
% 0.36/1.02  % -------------------------------------------------
% 0.36/1.02  % User time                : 0.358 s
% 0.36/1.02  % System time              : 0.025 s
% 0.36/1.02  % Total time               : 0.383 s
% 0.36/1.02  % Maximum resident set size: 8492 pages
% 0.36/1.02  
% 0.36/1.02  % -------------------------------------------------
% 0.36/1.02  % User time                : 1.561 s
% 0.36/1.02  % System time              : 0.102 s
% 0.36/1.02  % Total time               : 1.663 s
% 0.36/1.02  % Maximum resident set size: 6400 pages
% 0.36/1.02  % E exiting
%------------------------------------------------------------------------------