%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV240-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 : n019.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:02 PM UTC 2026
% Result : Unsatisfiable 1.91s 0.71s
% Output : CNFRefutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 9 unt; 2 nHn; 16 RR)
% Number of literals : 34 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 37 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Message_Oanalz__subset__cong_0,axiom,
( ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__cong_0) ).
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_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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_Message_Oanalz_OInj_0,axiom,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV004-0.ax',cls_Message_Oanalz_OInj_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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(c_0_6,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_7,plain,
( ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__subset__cong_0]) ).
cnf(c_0_8,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
c_0_6 ).
cnf(c_0_9,plain,
( ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
c_0_7 ).
cnf(c_0_10,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_11,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_12,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(v_G),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz_OInj_0]) ).
cnf(c_0_15,negated_conjecture,
~ c_in(c_Main_OsubsetI__1(c_Message_Oanalz(v_G),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_Message_Omsg),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
c_0_14 ).
cnf(c_0_17,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_18,negated_conjecture,
~ c_in(c_Main_OsubsetI__1(c_Message_Oanalz(v_G),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_Message_Omsg),c_Message_Oanalz(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV240-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n019.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:35:34 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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
% 1.91/0.71 % Version: 3.5.1
% 1.91/0.71 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.91/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.91/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.91/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.91/0.71 % Starting sh5l with 300s (1) cores
% 1.91/0.71 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2158609 completed with status 0
% 1.91/0.71 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.91/0.71 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.91/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.91/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.91/0.71 % No SInE strategy applied
% 1.91/0.71 % Search class: FGHSM-SSLM32-MFFFFFNN
% 1.91/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.91/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.91/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.91/0.71 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.91/0.71 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 1.91/0.71 % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1.91/0.71 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 2158625 completed with status 0
% 1.91/0.71 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 1.91/0.71 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.91/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.91/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.91/0.71 % No SInE strategy applied
% 1.91/0.71 % Search class: FGHSM-SSLM32-MFFFFFNN
% 1.91/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.91/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.91/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.91/0.71 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.91/0.71 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 1.91/0.71 % Preprocessing time : 0.012 s
% 1.91/0.71 % Presaturation interreduction done
% 1.91/0.71
% 1.91/0.71 % Proof found!
% 1.91/0.71 % SZS status Unsatisfiable
% 1.91/0.71 % SZS output start CNFRefutation
% See solution above
% 1.91/0.71 % Parsed axioms : 1400
% 1.91/0.71 % Removed by relevancy pruning/SinE : 0
% 1.91/0.71 % Initial clauses : 1400
% 1.91/0.71 % Removed in clause preprocessing : 1
% 1.91/0.71 % Initial clauses in saturation : 1399
% 1.91/0.71 % Processed clauses : 3015
% 1.91/0.71 % ...of these trivial : 8
% 1.91/0.71 % ...subsumed : 357
% 1.91/0.71 % ...remaining for further processing : 2649
% 1.91/0.71 % Other redundant clauses eliminated : 4
% 1.91/0.71 % Clauses deleted for lack of memory : 0
% 1.91/0.71 % Backward-subsumed : 1
% 1.91/0.71 % Backward-rewritten : 6
% 1.91/0.71 % Generated clauses : 3684
% 1.91/0.71 % ...of the previous two non-redundant : 2867
% 1.91/0.71 % ...aggressively subsumed : 0
% 1.91/0.71 % Contextual simplify-reflections : 2
% 1.91/0.71 % Paramodulations : 3643
% 1.91/0.71 % Factorizations : 0
% 1.91/0.71 % NegExts : 0
% 1.91/0.71 % Equation resolutions : 41
% 1.91/0.71 % Disequality decompositions : 0
% 1.91/0.71 % Total rewrite steps : 848
% 1.91/0.71 % ...of those cached : 740
% 1.91/0.71 % Propositional unsat checks : 0
% 1.91/0.71 % Propositional check models : 0
% 1.91/0.71 % Propositional check unsatisfiable : 0
% 1.91/0.71 % Propositional clauses : 0
% 1.91/0.71 % Propositional clauses after purity: 0
% 1.91/0.71 % Propositional unsat core size : 0
% 1.91/0.71 % Propositional preprocessing time : 0.000
% 1.91/0.71 % Propositional encoding time : 0.000
% 1.91/0.71 % Propositional solver time : 0.000
% 1.91/0.71 % Success case prop preproc time : 0.000
% 1.91/0.71 % Success case prop encoding time : 0.000
% 1.91/0.71 % Success case prop solver time : 0.000
% 1.91/0.71 % Current number of processed clauses : 1282
% 1.91/0.71 % Positive orientable unit clauses : 176
% 1.91/0.71 % Positive unorientable unit clauses: 0
% 1.91/0.71 % Negative unit clauses : 51
% 1.91/0.71 % Non-unit-clauses : 1055
% 1.91/0.71 % Current number of unprocessed clauses: 2611
% 1.91/0.71 % ...number of literals in the above : 5286
% 1.91/0.71 % Current number of archived formulas : 0
% 1.91/0.71 % Current number of archived clauses : 1367
% 1.91/0.71 % Clause-clause subsumption calls (NU) : 992857
% 1.91/0.71 % Rec. Clause-clause subsumption calls : 969881
% 1.91/0.71 % Non-unit clause-clause subsumptions : 331
% 1.91/0.71 % Unit Clause-clause subsumption calls : 13204
% 1.91/0.71 % Rewrite failures with RHS unbound : 0
% 1.91/0.71 % BW rewrite match attempts : 62
% 1.91/0.71 % BW rewrite match successes : 6
% 1.91/0.71 % Condensation attempts : 0
% 1.91/0.71 % Condensation successes : 0
% 1.91/0.71 % Termbank termtop insertions : 62464
% 1.91/0.71 % Search garbage collected termcells : 1692
% 1.91/0.71
% 1.91/0.71 % -------------------------------------------------
% 1.91/0.71 % User time : 0.245 s
% 1.91/0.71 % System time : 0.018 s
% 1.91/0.71 % Total time : 0.263 s
% 1.91/0.71 % Maximum resident set size: 5920 pages
% 1.91/0.71
% 1.91/0.71 % -------------------------------------------------
% 1.91/0.71 % User time : 1.152 s
% 1.91/0.71 % System time : 0.067 s
% 1.91/0.71 % Total time : 1.220 s
% 1.91/0.71 % Maximum resident set size: 5632 pages
% 1.91/0.71 % E exiting
%------------------------------------------------------------------------------