%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV260-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 : n002.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 03:00:58 PM UTC 2026
% Result : Unsatisfiable 231.62s 34.34s
% Output : CNFRefutation 231.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 42 ( 10 unt; 9 nHn; 29 RR)
% Number of literals : 81 ( 6 equ; 32 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 : 81 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Oparts__trans_0,axiom,
( ~ c_lessequals(X2,c_Message_Oparts(X3),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__trans_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_Y,c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_Message_Oparts_OInj_0,axiom,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts_OInj_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_OUnCI_1,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_1) ).
cnf(cls_Set_OinsertE_0,axiom,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertE_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OUnCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_Y,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_10,plain,
( ~ c_lessequals(X2,c_Message_Oparts(X3),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__trans_0]) ).
cnf(c_0_11,plain,
( ~ c_lessequals(X2,c_Message_Oparts(X3),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg) ),
c_0_10 ).
cnf(c_0_12,negated_conjecture,
c_in(v_Y,c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_13,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_14,negated_conjecture,
( ~ c_lessequals(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| c_in(v_Y,c_Message_Oparts(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_13 ).
cnf(c_0_16,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts_OInj_0]) ).
cnf(c_0_17,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_18,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(X1),tc_Message_Omsg),c_Message_Oparts(X1),tc_Message_Omsg)
| c_in(v_Y,c_Message_Oparts(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_21,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertE_0]) ).
cnf(c_0_22,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_23,negated_conjecture,
( ~ c_lessequals(v_H,c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| c_in(v_X,c_Message_Oparts(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(X1),tc_Message_Omsg),X1,tc_Message_Omsg)
| c_in(v_Y,c_Message_Oparts(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_20 ).
cnf(c_0_26,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
( c_in(v_Y,c_Message_Oparts(X1),tc_Message_Omsg)
| c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(X1),tc_Message_Omsg),c_insert(v_X,v_G,tc_Message_Omsg),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(v_H,c_Message_Oparts(X1),tc_Message_Omsg),c_Message_Oparts(X1),tc_Message_Omsg)
| c_in(v_X,c_Message_Oparts(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_29,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).
cnf(c_0_30,negated_conjecture,
~ c_in(v_Y,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_31,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),tc_Message_Omsg),X1,tc_Message_Omsg)
| c_in(v_Y,c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( c_in(v_Y,c_Message_Oparts(X1),tc_Message_Omsg)
| c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(X1),tc_Message_Omsg),v_G,tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(X1),tc_Message_Omsg) = v_X ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(v_H,c_Message_Oparts(X1),tc_Message_Omsg),X1,tc_Message_Omsg)
| c_in(v_X,c_Message_Oparts(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_34,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
~ c_in(v_Y,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( c_in(v_Y,c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg) = v_X ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(v_H,c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),tc_Message_Omsg),X2,tc_Message_Omsg)
| c_in(v_X,c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( c_in(v_X,c_Message_Oparts(X1),tc_Message_Omsg)
| c_in(c_Main_OsubsetI__1(v_H,c_Message_Oparts(X1),tc_Message_Omsg),v_H,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_39,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) = v_X,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
c_in(v_X,c_Message_Oparts(c_union(X1,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_39]),c_0_40])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV260-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.14/0.41 % Computer : n002.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Mon Sep 21 08:39:31 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/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
% 231.62/34.34 % Version: 3.5.1
% 231.62/34.34 % Preprocessing class: FMLMSMSMSSSNFFN.
% 231.62/34.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 231.62/34.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 231.62/34.34 % Starting new_bool_3 with 300s (1) cores
% 231.62/34.34 % Starting new_bool_1 with 300s (1) cores
% 231.62/34.34 % Starting sh5l with 300s (1) cores
% 231.62/34.34 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2894905 completed with status 0
% 231.62/34.34 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 231.62/34.34 % Preprocessing class: FMLMSMSMSSSNFFN.
% 231.62/34.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 231.62/34.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 231.62/34.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 231.62/34.34 % No SInE strategy applied
% 231.62/34.34 % Search class: FGHSM-SSLM32-MFFFFFNN
% 231.62/34.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 231.62/34.34 % Starting SubtermCWHack with 136s (1) cores
% 231.62/34.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 231.62/34.34 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 231.62/34.34 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 231.62/34.34 % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 231.62/34.34 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 2894917 completed with status 0
% 231.62/34.34 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 231.62/34.34 % Preprocessing class: FMLMSMSMSSSNFFN.
% 231.62/34.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 231.62/34.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 231.62/34.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 231.62/34.34 % No SInE strategy applied
% 231.62/34.34 % Search class: FGHSM-SSLM32-MFFFFFNN
% 231.62/34.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 231.62/34.34 % Starting SubtermCWHack with 136s (1) cores
% 231.62/34.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 231.62/34.34 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 231.62/34.34 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 231.62/34.34 % Preprocessing time : 0.018 s
% 231.62/34.34 % Presaturation interreduction done
% 231.62/34.34
% 231.62/34.34 % Proof found!
% 231.62/34.34 % SZS status Unsatisfiable
% 231.62/34.34 % SZS output start CNFRefutation
% See solution above
% 231.62/34.34 % Parsed axioms : 1384
% 231.62/34.34 % Removed by relevancy pruning/SinE : 0
% 231.62/34.34 % Initial clauses : 1384
% 231.62/34.34 % Removed in clause preprocessing : 1
% 231.62/34.34 % Initial clauses in saturation : 1383
% 231.62/34.34 % Processed clauses : 50992
% 231.62/34.34 % ...of these trivial : 805
% 231.62/34.34 % ...subsumed : 40158
% 231.62/34.34 % ...remaining for further processing : 10029
% 231.62/34.34 % Other redundant clauses eliminated : 13
% 231.62/34.34 % Clauses deleted for lack of memory : 0
% 231.62/34.34 % Backward-subsumed : 123
% 231.62/34.34 % Backward-rewritten : 482
% 231.62/34.34 % Generated clauses : 644811
% 231.62/34.34 % ...of the previous two non-redundant : 526931
% 231.62/34.34 % ...aggressively subsumed : 0
% 231.62/34.34 % Contextual simplify-reflections : 19
% 231.62/34.34 % Paramodulations : 644729
% 231.62/34.34 % Factorizations : 16
% 231.62/34.34 % NegExts : 0
% 231.62/34.34 % Equation resolutions : 66
% 231.62/34.34 % Disequality decompositions : 0
% 231.62/34.34 % Total rewrite steps : 747270
% 231.62/34.34 % ...of those cached : 739837
% 231.62/34.34 % Propositional unsat checks : 2
% 231.62/34.34 % Propositional check models : 0
% 231.62/34.34 % Propositional check unsatisfiable : 0
% 231.62/34.34 % Propositional clauses : 0
% 231.62/34.34 % Propositional clauses after purity: 0
% 231.62/34.34 % Propositional unsat core size : 0
% 231.62/34.34 % Propositional preprocessing time : 0.000
% 231.62/34.34 % Propositional encoding time : 4.775
% 231.62/34.34 % Propositional solver time : 2.150
% 231.62/34.34 % Success case prop preproc time : 0.000
% 231.62/34.34 % Success case prop encoding time : 0.000
% 231.62/34.34 % Success case prop solver time : 0.000
% 231.62/34.34 % Current number of processed clauses : 8080
% 231.62/34.34 % Positive orientable unit clauses : 1265
% 231.62/34.34 % Positive unorientable unit clauses: 0
% 231.62/34.34 % Negative unit clauses : 739
% 231.62/34.34 % Non-unit-clauses : 6076
% 231.62/34.34 % Current number of unprocessed clauses: 471677
% 231.62/34.34 % ...number of literals in the above : 1135040
% 231.62/34.34 % Current number of archived formulas : 0
% 231.62/34.34 % Current number of archived clauses : 1949
% 231.62/34.34 % Clause-clause subsumption calls (NU) : 8298709
% 231.62/34.34 % Rec. Clause-clause subsumption calls : 7695547
% 231.62/34.34 % Non-unit clause-clause subsumptions : 13470
% 231.62/34.34 % Unit Clause-clause subsumption calls : 205906
% 231.62/34.34 % Rewrite failures with RHS unbound : 0
% 231.62/34.34 % BW rewrite match attempts : 31555
% 231.62/34.34 % BW rewrite match successes : 240
% 231.62/34.34 % Condensation attempts : 0
% 231.62/34.34 % Condensation successes : 0
% 231.62/34.34 % Termbank termtop insertions : 43582433
% 231.62/34.34 % Search garbage collected termcells : 1650
% 231.62/34.34
% 231.62/34.34 % -------------------------------------------------
% 231.62/34.34 % User time : 31.020 s
% 231.62/34.34 % System time : 0.953 s
% 231.62/34.34 % Total time : 31.973 s
% 231.62/34.34 % Maximum resident set size: 5900 pages
% 231.62/34.34
% 231.62/34.34 % -------------------------------------------------
% 231.62/34.34 % User time : 160.136 s
% 231.62/34.34 % System time : 4.789 s
% 231.62/34.34 % Total time : 164.926 s
% 231.62/34.34 % Maximum resident set size: 5632 pages
% 231.62/34.34 % E exiting
%------------------------------------------------------------------------------