%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV274-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 : n011.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.26s 0.54s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 10 unt; 10 nHn; 26 RR)
% Number of literals : 61 ( 7 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Osynth__trans_0,axiom,
( ~ c_lessequals(X2,c_Message_Osynth(X3),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Osynth__trans_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_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_Osynth_OInj_0,axiom,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Osynth_OInj_0) ).
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_conjecture_0,negated_conjecture,
c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,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_Osynth(v_H),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_Osynth(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X2,c_Message_Osynth(X3),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Osynth__trans_0]) ).
cnf(c_0_9,plain,
( ~ c_lessequals(X2,c_Message_Osynth(X3),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
c_0_8 ).
cnf(c_0_10,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_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,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Osynth_OInj_0]) ).
cnf(c_0_13,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_14,plain,
( ~ c_in(X3,c_Message_Osynth(X1),tc_Message_Omsg)
| c_in(X3,c_Message_Osynth(X2),tc_Message_Omsg)
| c_in(c_Main_OsubsetI__1(X1,c_Message_Osynth(X2),tc_Message_Omsg),X1,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_16,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_17,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg) ),
c_0_12 ).
cnf(c_0_18,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
( c_in(v_Y,c_Message_Osynth(X1),tc_Message_Omsg)
| c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_21,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Osynth(X2),tc_Message_Omsg),X2,tc_Message_Omsg)
| c_lessequals(X1,c_Message_Osynth(X2),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( c_in(v_Y,c_Message_Osynth(X1),tc_Message_Omsg)
| c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg),v_H,tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg) = v_X ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
( c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_set(tc_Message_Omsg))
| c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg) = v_X ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( ~ c_in(X1,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(v_H),tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg) = v_X ),
inference(spm,[status(thm)],[c_0_9,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg) = v_X,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_28,negated_conjecture,
c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
( ~ c_in(X1,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(v_H),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_9,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV274-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n011.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 08:37:41 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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.26/0.54 % Version: 3.5.1
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % Starting sh5l with 300s (1) cores
% 0.26/0.54 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1484416 completed with status 0
% 0.26/0.54 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.54 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1484423 completed with status 0
% 0.26/0.54 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.54 % Preprocessing time : 0.002 s
% 0.26/0.54 % Presaturation interreduction done
% 0.26/0.54
% 0.26/0.54 % Proof found!
% 0.26/0.54 % SZS status Unsatisfiable
% 0.26/0.54 % SZS output start CNFRefutation
% See solution above
% 0.26/0.54 % Parsed axioms : 8
% 0.26/0.54 % Removed by relevancy pruning/SinE : 0
% 0.26/0.54 % Initial clauses : 8
% 0.26/0.54 % Removed in clause preprocessing : 0
% 0.26/0.54 % Initial clauses in saturation : 8
% 0.26/0.54 % Processed clauses : 46
% 0.26/0.54 % ...of these trivial : 0
% 0.26/0.54 % ...subsumed : 3
% 0.26/0.54 % ...remaining for further processing : 43
% 0.26/0.54 % Other redundant clauses eliminated : 0
% 0.26/0.54 % Clauses deleted for lack of memory : 0
% 0.26/0.54 % Backward-subsumed : 0
% 0.26/0.54 % Backward-rewritten : 2
% 0.26/0.54 % Generated clauses : 94
% 0.26/0.54 % ...of the previous two non-redundant : 69
% 0.26/0.54 % ...aggressively subsumed : 0
% 0.26/0.54 % Contextual simplify-reflections : 0
% 0.26/0.54 % Paramodulations : 94
% 0.26/0.54 % Factorizations : 0
% 0.26/0.54 % NegExts : 0
% 0.26/0.54 % Equation resolutions : 0
% 0.26/0.54 % Disequality decompositions : 0
% 0.26/0.54 % Total rewrite steps : 24
% 0.26/0.54 % ...of those cached : 4
% 0.26/0.54 % Propositional unsat checks : 0
% 0.26/0.54 % Propositional check models : 0
% 0.26/0.54 % Propositional check unsatisfiable : 0
% 0.26/0.54 % Propositional clauses : 0
% 0.26/0.54 % Propositional clauses after purity: 0
% 0.26/0.54 % Propositional unsat core size : 0
% 0.26/0.54 % Propositional preprocessing time : 0.000
% 0.26/0.54 % Propositional encoding time : 0.000
% 0.26/0.54 % Propositional solver time : 0.000
% 0.26/0.54 % Success case prop preproc time : 0.000
% 0.26/0.54 % Success case prop encoding time : 0.000
% 0.26/0.54 % Success case prop solver time : 0.000
% 0.26/0.54 % Current number of processed clauses : 33
% 0.26/0.54 % Positive orientable unit clauses : 10
% 0.26/0.54 % Positive unorientable unit clauses: 0
% 0.26/0.54 % Negative unit clauses : 2
% 0.26/0.54 % Non-unit-clauses : 21
% 0.26/0.54 % Current number of unprocessed clauses: 39
% 0.26/0.54 % ...number of literals in the above : 111
% 0.26/0.54 % Current number of archived formulas : 0
% 0.26/0.54 % Current number of archived clauses : 10
% 0.26/0.54 % Clause-clause subsumption calls (NU) : 75
% 0.26/0.54 % Rec. Clause-clause subsumption calls : 70
% 0.26/0.54 % Non-unit clause-clause subsumptions : 3
% 0.26/0.54 % Unit Clause-clause subsumption calls : 15
% 0.26/0.54 % Rewrite failures with RHS unbound : 0
% 0.26/0.54 % BW rewrite match attempts : 9
% 0.26/0.54 % BW rewrite match successes : 1
% 0.26/0.54 % Condensation attempts : 0
% 0.26/0.54 % Condensation successes : 0
% 0.26/0.54 % Termbank termtop insertions : 2303
% 0.26/0.54 % Search garbage collected termcells : 16
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.010 s
% 0.26/0.54 % System time : 0.004 s
% 0.26/0.54 % Total time : 0.014 s
% 0.26/0.54 % Maximum resident set size: 3636 pages
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.045 s
% 0.26/0.54 % System time : 0.021 s
% 0.26/0.54 % Total time : 0.066 s
% 0.26/0.54 % Maximum resident set size: 4608 pages
% 0.26/0.54 % E exiting
%------------------------------------------------------------------------------