%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV260-2 : 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 : n009.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 37.83s 6.42s
% Output : CNFRefutation 37.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 41 ( 10 unt; 10 nHn; 27 RR)
% Number of literals : 81 ( 7 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 : 96 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
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/theBenchmark.p',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_Set_OUnCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).
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/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',cls_Set_OsubsetI_0) ).
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_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(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(c_0_10,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_11,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_12,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
c_0_11 ).
cnf(c_0_14,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_15,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_16,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_17,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(X2),tc_Message_Omsg),X2,tc_Message_Omsg)
| c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_16 ).
cnf(c_0_21,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_22,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_23,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),X3,tc_Message_Omsg)
| c_lessequals(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),X2,tc_Message_Omsg)
| c_lessequals(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_25,plain,
( c_in(c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3),X2,X3)
| c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,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_22 ).
cnf(c_0_27,plain,
c_lessequals(X1,c_Message_Oparts(c_union(X2,X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_28,plain,
( c_lessequals(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| c_Main_OsubsetI__1(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) = X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ c_in(X4,c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(X4,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) = X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_31,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_32,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(X3),tc_Message_Omsg)
| c_lessequals(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_12,c_0_29]) ).
cnf(c_0_33,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_30,c_0_31]) ).
cnf(c_0_34,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_35,negated_conjecture,
( ~ c_in(v_X,c_Message_Oparts(X1),tc_Message_Omsg)
| c_in(v_Y,c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg)
| c_lessequals(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_37,negated_conjecture,
~ c_in(v_Y,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
c_0_34 ).
cnf(c_0_38,negated_conjecture,
c_lessequals(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
( ~ c_in(X1,c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(X1,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_26,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV260-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n009.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 08:36:57 UTC 2026
% 0.04/0.37 % CPUTime :
% 0.04/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.44 Running first-order theorem proving
% 0.04/0.44 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
% 37.83/6.42 % Version: 3.5.1
% 37.83/6.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 37.83/6.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.83/6.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 37.83/6.42 % Starting new_bool_3 with 300s (1) cores
% 37.83/6.42 % Starting new_bool_1 with 300s (1) cores
% 37.83/6.42 % Starting sh5l with 300s (1) cores
% 37.83/6.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1337619 completed with status 0
% 37.83/6.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 37.83/6.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 37.83/6.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.83/6.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 37.83/6.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 37.83/6.42 % No SInE strategy applied
% 37.83/6.42 % Search class: FGUSF-FFSF32-SFFFFFNN
% 37.83/6.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 37.83/6.42 % Starting SubtermCWHack with 136s (1) cores
% 37.83/6.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 37.83/6.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 37.83/6.42 % Starting new_bool_3 with 136s (1) cores
% 37.83/6.42 % Starting new_bool_1 with 136s (1) cores
% 37.83/6.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1337624 completed with status 0
% 37.83/6.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 37.83/6.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 37.83/6.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.83/6.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 37.83/6.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 37.83/6.42 % No SInE strategy applied
% 37.83/6.42 % Search class: FGUSF-FFSF32-SFFFFFNN
% 37.83/6.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 37.83/6.42 % Starting SubtermCWHack with 136s (1) cores
% 37.83/6.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 37.83/6.42 % Preprocessing time : 0.001 s
% 37.83/6.42 % Presaturation interreduction done
% 37.83/6.42
% 37.83/6.42 % Proof found!
% 37.83/6.42 % SZS status Unsatisfiable
% 37.83/6.42 % SZS output start CNFRefutation
% See solution above
% 37.83/6.42 % Parsed axioms : 10
% 37.83/6.42 % Removed by relevancy pruning/SinE : 0
% 37.83/6.42 % Initial clauses : 10
% 37.83/6.42 % Removed in clause preprocessing : 0
% 37.83/6.42 % Initial clauses in saturation : 10
% 37.83/6.42 % Processed clauses : 3949
% 37.83/6.42 % ...of these trivial : 296
% 37.83/6.42 % ...subsumed : 1792
% 37.83/6.42 % ...remaining for further processing : 1861
% 37.83/6.42 % Other redundant clauses eliminated : 0
% 37.83/6.42 % Clauses deleted for lack of memory : 0
% 37.83/6.42 % Backward-subsumed : 77
% 37.83/6.42 % Backward-rewritten : 62
% 37.83/6.42 % Generated clauses : 239013
% 37.83/6.42 % ...of the previous two non-redundant : 206532
% 37.83/6.42 % ...aggressively subsumed : 0
% 37.83/6.42 % Contextual simplify-reflections : 0
% 37.83/6.42 % Paramodulations : 238957
% 37.83/6.42 % Factorizations : 52
% 37.83/6.42 % NegExts : 0
% 37.83/6.42 % Equation resolutions : 0
% 37.83/6.42 % Disequality decompositions : 0
% 37.83/6.42 % Total rewrite steps : 35002
% 37.83/6.42 % ...of those cached : 32353
% 37.83/6.42 % Propositional unsat checks : 0
% 37.83/6.42 % Propositional check models : 0
% 37.83/6.42 % Propositional check unsatisfiable : 0
% 37.83/6.42 % Propositional clauses : 0
% 37.83/6.42 % Propositional clauses after purity: 0
% 37.83/6.42 % Propositional unsat core size : 0
% 37.83/6.42 % Propositional preprocessing time : 0.000
% 37.83/6.42 % Propositional encoding time : 0.000
% 37.83/6.42 % Propositional solver time : 0.000
% 37.83/6.42 % Success case prop preproc time : 0.000
% 37.83/6.42 % Success case prop encoding time : 0.000
% 37.83/6.42 % Success case prop solver time : 0.000
% 37.83/6.42 % Current number of processed clauses : 1708
% 37.83/6.42 % Positive orientable unit clauses : 377
% 37.83/6.42 % Positive unorientable unit clauses: 0
% 37.83/6.42 % Negative unit clauses : 14
% 37.83/6.42 % Non-unit-clauses : 1317
% 37.83/6.42 % Current number of unprocessed clauses: 202108
% 37.83/6.42 % ...number of literals in the above : 656884
% 37.83/6.42 % Current number of archived formulas : 0
% 37.83/6.42 % Current number of archived clauses : 153
% 37.83/6.42 % Clause-clause subsumption calls (NU) : 173048
% 37.83/6.42 % Rec. Clause-clause subsumption calls : 141312
% 37.83/6.42 % Non-unit clause-clause subsumptions : 1757
% 37.83/6.42 % Unit Clause-clause subsumption calls : 5122
% 37.83/6.42 % Rewrite failures with RHS unbound : 0
% 37.83/6.42 % BW rewrite match attempts : 10397
% 37.83/6.42 % BW rewrite match successes : 46
% 37.83/6.42 % Condensation attempts : 0
% 37.83/6.42 % Condensation successes : 0
% 37.83/6.42 % Termbank termtop insertions : 7835288
% 37.83/6.42 % Search garbage collected termcells : 20
% 37.83/6.42
% 37.83/6.42 % -------------------------------------------------
% 37.83/6.42 % User time : 5.378 s
% 37.83/6.42 % System time : 0.184 s
% 37.83/6.42 % Total time : 5.562 s
% 37.83/6.42 % Maximum resident set size: 3328 pages
% 37.83/6.42
% 37.83/6.42 % -------------------------------------------------
% 37.83/6.42 % User time : 25.316 s
% 37.83/6.42 % System time : 1.051 s
% 37.83/6.42 % Total time : 26.366 s
% 37.83/6.42 % Maximum resident set size: 4608 pages
% 37.83/6.42 % E exiting
%------------------------------------------------------------------------------