%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV273-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 : 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:11 PM UTC 2026
% Result : Unsatisfiable 0.87s 0.63s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 14 RR)
% Number of literals : 31 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Oparts__subset__iff_0,axiom,
( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV005-1.ax',cls_Message_Oparts__subset__iff_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OUn__subset__iff_2,axiom,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__subset__iff_2) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(cls_Message_Oparts__mono_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__mono_0) ).
cnf(cls_Message_Osynth__increasing_0,axiom,
c_lessequals(X1,c_Message_Osynth(X1),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Osynth__increasing_0) ).
cnf(c_0_6,plain,
( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_0]) ).
cnf(c_0_7,negated_conjecture,
~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_2]) ).
cnf(c_0_9,plain,
( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_6 ).
cnf(c_0_10,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_11,negated_conjecture,
~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
c_0_7 ).
cnf(c_0_12,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
c_0_8 ).
cnf(c_0_13,plain,
c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__mono_0]) ).
cnf(c_0_15,negated_conjecture,
~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_14 ).
cnf(c_0_17,axiom,
c_lessequals(X1,c_Message_Osynth(X1),tc_set(tc_Message_Omsg)),
cls_Message_Osynth__increasing_0 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV273-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.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:37:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 0.87/0.63 % Version: 3.5.1
% 0.87/0.63 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.87/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.87/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.87/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.87/0.63 % Starting sh5l with 300s (1) cores
% 0.87/0.63 % new_bool_1 with pid 1338442 completed with status 0
% 0.87/0.63 % Result found by new_bool_1
% 0.87/0.63 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.87/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.87/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.87/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.87/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.87/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.87/0.63 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.87/0.63 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.87/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.87/0.63 % SubtermCWHack with pid 1338445 completed with status 0
% 0.87/0.63 % Result found by SubtermCWHack
% 0.87/0.63 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.87/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.87/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.87/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.87/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.87/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.87/0.63 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.87/0.63 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.87/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.87/0.63 % Preprocessing time : 0.007 s
% 0.87/0.63
% 0.87/0.63 % Proof found!
% 0.87/0.63 % SZS status Unsatisfiable
% 0.87/0.63 % SZS output start CNFRefutation
% See solution above
% 0.87/0.63 % Parsed axioms : 2826
% 0.87/0.63 % Removed by relevancy pruning/SinE : 2392
% 0.87/0.63 % Initial clauses : 434
% 0.87/0.63 % Removed in clause preprocessing : 0
% 0.87/0.63 % Initial clauses in saturation : 434
% 0.87/0.63 % Processed clauses : 2102
% 0.87/0.63 % ...of these trivial : 51
% 0.87/0.63 % ...subsumed : 1402
% 0.87/0.63 % ...remaining for further processing : 649
% 0.87/0.63 % Other redundant clauses eliminated : 130
% 0.87/0.63 % Clauses deleted for lack of memory : 0
% 0.87/0.63 % Backward-subsumed : 12
% 0.87/0.63 % Backward-rewritten : 40
% 0.87/0.63 % Generated clauses : 6881
% 0.87/0.63 % ...of the previous two non-redundant : 4903
% 0.87/0.63 % ...aggressively subsumed : 0
% 0.87/0.63 % Contextual simplify-reflections : 0
% 0.87/0.63 % Paramodulations : 6734
% 0.87/0.63 % Factorizations : 0
% 0.87/0.63 % NegExts : 0
% 0.87/0.63 % Equation resolutions : 147
% 0.87/0.63 % Disequality decompositions : 0
% 0.87/0.63 % Total rewrite steps : 3063
% 0.87/0.63 % ...of those cached : 2532
% 0.87/0.63 % Propositional unsat checks : 0
% 0.87/0.63 % Propositional check models : 0
% 0.87/0.63 % Propositional check unsatisfiable : 0
% 0.87/0.63 % Propositional clauses : 0
% 0.87/0.63 % Propositional clauses after purity: 0
% 0.87/0.63 % Propositional unsat core size : 0
% 0.87/0.63 % Propositional preprocessing time : 0.000
% 0.87/0.63 % Propositional encoding time : 0.000
% 0.87/0.63 % Propositional solver time : 0.000
% 0.87/0.63 % Success case prop preproc time : 0.000
% 0.87/0.63 % Success case prop encoding time : 0.000
% 0.87/0.63 % Success case prop solver time : 0.000
% 0.87/0.63 % Current number of processed clauses : 597
% 0.87/0.63 % Positive orientable unit clauses : 180
% 0.87/0.63 % Positive unorientable unit clauses: 3
% 0.87/0.63 % Negative unit clauses : 134
% 0.87/0.63 % Non-unit-clauses : 280
% 0.87/0.63 % Current number of unprocessed clauses: 3151
% 0.87/0.63 % ...number of literals in the above : 7661
% 0.87/0.63 % Current number of archived formulas : 0
% 0.87/0.63 % Current number of archived clauses : 52
% 0.87/0.63 % Clause-clause subsumption calls (NU) : 15421
% 0.87/0.63 % Rec. Clause-clause subsumption calls : 10993
% 0.87/0.63 % Non-unit clause-clause subsumptions : 287
% 0.87/0.63 % Unit Clause-clause subsumption calls : 4631
% 0.87/0.63 % Rewrite failures with RHS unbound : 0
% 0.87/0.63 % BW rewrite match attempts : 247
% 0.87/0.63 % BW rewrite match successes : 61
% 0.87/0.63 % Condensation attempts : 0
% 0.87/0.63 % Condensation successes : 0
% 0.87/0.63 % Termbank termtop insertions : 100938
% 0.87/0.63 % Search garbage collected termcells : 7553
% 0.87/0.63
% 0.87/0.63 % -------------------------------------------------
% 0.87/0.63 % User time : 0.126 s
% 0.87/0.63 % System time : 0.014 s
% 0.87/0.63 % Total time : 0.140 s
% 0.87/0.63 % Maximum resident set size: 6228 pages
% 0.87/0.63
% 0.87/0.63 % -------------------------------------------------
% 0.87/0.63 % User time : 0.178 s
% 0.87/0.63 % System time : 0.022 s
% 0.87/0.63 % Total time : 0.200 s
% 0.87/0.63 % Maximum resident set size: 6656 pages
% 0.87/0.63 % E exiting
%------------------------------------------------------------------------------