%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV268-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 : n006.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:09 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 20 unt; 0 nHn; 14 RR)
% Number of literals : 32 ( 13 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 46 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OUn__subset__iff_1,axiom,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__subset__iff_1) ).
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/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__eq__empty__iff_1) ).
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_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Message_Oparts__Un_0,axiom,
c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV005-0.ax',cls_Message_Oparts__Un_0) ).
cnf(cls_Set_OUn__Diff__cancel_0,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__Diff__cancel_0) ).
cnf(cls_Set_OUn__empty__right_0,axiom,
c_union(X1,c_emptyset,X2) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__empty__right_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oparts__idem_0,axiom,
c_Message_Oparts(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__idem_0) ).
cnf(c_0_9,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_1]) ).
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_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
c_0_9 ).
cnf(c_0_12,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_13,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
cls_conjecture_0 ).
cnf(c_0_15,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
cls_Message_Oparts__Un_0 ).
cnf(c_0_17,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
cls_Set_OUn__Diff__cancel_0 ).
cnf(c_0_18,negated_conjecture,
c_minus(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) = c_emptyset,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
c_union(X1,c_emptyset,X2) = X1,
cls_Set_OUn__empty__right_0 ).
cnf(c_0_20,negated_conjecture,
~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_21,plain,
c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(c_union(X2,X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
c_union(c_Message_Oparts(v_H),v_G,tc_Message_Omsg) = c_Message_Oparts(v_H),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,axiom,
c_Message_Oparts(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
cls_Message_Oparts__idem_0 ).
cnf(c_0_24,negated_conjecture,
~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV268-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:37:27 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.22/0.54 % Version: 3.5.1
% 0.22/0.54 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 % Starting sh5l with 300s (1) cores
% 0.22/0.54 % new_bool_3 with pid 2449606 completed with status 0
% 0.22/0.54 % Result found by new_bool_3
% 0.22/0.54 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 % Search class: FGHSM-FFLS32-MFFFFFNN
% 0.22/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.54 % SubtermCWHack with pid 2449609 completed with status 0
% 0.22/0.54 % Result found by SubtermCWHack
% 0.22/0.54 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 % Search class: FGHSM-FFLS32-MFFFFFNN
% 0.22/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.54 % Preprocessing time : 0.004 s
% 0.22/0.54
% 0.22/0.54 % Proof found!
% 0.22/0.54 % SZS status Unsatisfiable
% 0.22/0.54 % SZS output start CNFRefutation
% See solution above
% 0.22/0.54 % Parsed axioms : 2780
% 0.22/0.54 % Removed by relevancy pruning/SinE : 2583
% 0.22/0.54 % Initial clauses : 197
% 0.22/0.54 % Removed in clause preprocessing : 0
% 0.22/0.54 % Initial clauses in saturation : 197
% 0.22/0.54 % Processed clauses : 1127
% 0.22/0.54 % ...of these trivial : 28
% 0.22/0.54 % ...subsumed : 705
% 0.22/0.54 % ...remaining for further processing : 394
% 0.22/0.54 % Other redundant clauses eliminated : 40
% 0.22/0.54 % Clauses deleted for lack of memory : 0
% 0.22/0.54 % Backward-subsumed : 16
% 0.22/0.54 % Backward-rewritten : 20
% 0.22/0.54 % Generated clauses : 4078
% 0.22/0.54 % ...of the previous two non-redundant : 2509
% 0.22/0.54 % ...aggressively subsumed : 0
% 0.22/0.54 % Contextual simplify-reflections : 0
% 0.22/0.54 % Paramodulations : 4026
% 0.22/0.54 % Factorizations : 0
% 0.22/0.54 % NegExts : 0
% 0.22/0.54 % Equation resolutions : 52
% 0.22/0.54 % Disequality decompositions : 0
% 0.22/0.54 % Total rewrite steps : 2168
% 0.22/0.54 % ...of those cached : 1563
% 0.22/0.54 % Propositional unsat checks : 0
% 0.22/0.54 % Propositional check models : 0
% 0.22/0.54 % Propositional check unsatisfiable : 0
% 0.22/0.54 % Propositional clauses : 0
% 0.22/0.54 % Propositional clauses after purity: 0
% 0.22/0.54 % Propositional unsat core size : 0
% 0.22/0.54 % Propositional preprocessing time : 0.000
% 0.22/0.54 % Propositional encoding time : 0.000
% 0.22/0.54 % Propositional solver time : 0.000
% 0.22/0.54 % Success case prop preproc time : 0.000
% 0.22/0.54 % Success case prop encoding time : 0.000
% 0.22/0.54 % Success case prop solver time : 0.000
% 0.22/0.54 % Current number of processed clauses : 358
% 0.22/0.54 % Positive orientable unit clauses : 148
% 0.22/0.54 % Positive unorientable unit clauses: 1
% 0.22/0.54 % Negative unit clauses : 57
% 0.22/0.54 % Non-unit-clauses : 152
% 0.22/0.54 % Current number of unprocessed clauses: 1571
% 0.22/0.54 % ...number of literals in the above : 3014
% 0.22/0.54 % Current number of archived formulas : 0
% 0.22/0.54 % Current number of archived clauses : 36
% 0.22/0.54 % Clause-clause subsumption calls (NU) : 3729
% 0.22/0.54 % Rec. Clause-clause subsumption calls : 3325
% 0.22/0.54 % Non-unit clause-clause subsumptions : 164
% 0.22/0.54 % Unit Clause-clause subsumption calls : 4143
% 0.22/0.54 % Rewrite failures with RHS unbound : 0
% 0.22/0.54 % BW rewrite match attempts : 158
% 0.22/0.54 % BW rewrite match successes : 36
% 0.22/0.54 % Condensation attempts : 0
% 0.22/0.54 % Condensation successes : 0
% 0.22/0.54 % Termbank termtop insertions : 65386
% 0.22/0.54 % Search garbage collected termcells : 7795
% 0.22/0.54
% 0.22/0.54 % -------------------------------------------------
% 0.22/0.54 % User time : 0.066 s
% 0.22/0.54 % System time : 0.010 s
% 0.22/0.54 % Total time : 0.076 s
% 0.22/0.54 % Maximum resident set size: 6192 pages
% 0.22/0.54
% 0.22/0.54 % -------------------------------------------------
% 0.22/0.54 % User time : 0.118 s
% 0.22/0.54 % System time : 0.016 s
% 0.22/0.54 % Total time : 0.134 s
% 0.22/0.54 % Maximum resident set size: 6400 pages
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------