%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV275-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 : n005.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 11.09s 2.36s
% Output : CNFRefutation 11.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 35 ( 8 unt; 7 nHn; 24 RR)
% Number of literals : 70 ( 6 equ; 30 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 94 ( 7 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_Set_OinsertCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_0) ).
cnf(cls_Set_OsubsetD_0,axiom,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Message_Osynth__mono_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Osynth__mono_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_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_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_conjecture_0,negated_conjecture,
~ c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
cnf(c_0_9,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_10,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertCI_0]) ).
cnf(c_0_11,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_12,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Osynth__mono_0]) ).
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_9 ).
cnf(c_0_14,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
c_0_10 ).
cnf(c_0_15,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg)) ),
c_0_12 ).
cnf(c_0_17,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_insert(X2,X3,X4),X4),X3,X4)
| c_lessequals(X1,c_insert(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,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_19,plain,
( ~ c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg)
| ~ c_lessequals(X3,X2,tc_set(tc_Message_Omsg))
| c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,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_22,plain,
( ~ c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(c_insert(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_21 ).
cnf(c_0_24,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_25,negated_conjecture,
~ c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_26,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Osynth(c_insert(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(X3),tc_Message_Omsg)
| c_lessequals(X1,c_Message_Osynth(c_insert(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_27,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_23,c_0_18]) ).
cnf(c_0_28,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg) ),
c_0_24 ).
cnf(c_0_29,negated_conjecture,
~ c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
c_0_25 ).
cnf(c_0_30,plain,
( c_lessequals(c_insert(X1,c_Message_Osynth(X2),tc_Message_Omsg),c_Message_Osynth(c_insert(X3,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| c_Main_OsubsetI__1(c_insert(X1,c_Message_Osynth(X2),tc_Message_Omsg),c_Message_Osynth(c_insert(X3,X2,tc_Message_Omsg)),tc_Message_Omsg) = X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,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_13,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) = v_X,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV275-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n005.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:37:33 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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
% 11.09/2.36 % Version: 3.5.1
% 11.09/2.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 11.09/2.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.09/2.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.09/2.36 % Starting new_bool_3 with 300s (1) cores
% 11.09/2.36 % Starting new_bool_1 with 300s (1) cores
% 11.09/2.36 % Starting sh5l with 300s (1) cores
% 11.09/2.36 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3045019 completed with status 0
% 11.09/2.36 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.09/2.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 11.09/2.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.09/2.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.09/2.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.09/2.36 % No SInE strategy applied
% 11.09/2.36 % Search class: FGUSF-FFSF32-SFFFFFNN
% 11.09/2.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.09/2.36 % Starting SubtermCWHack with 136s (1) cores
% 11.09/2.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.09/2.36 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 11.09/2.36 % Starting new_bool_3 with 136s (1) cores
% 11.09/2.36 % Starting new_bool_1 with 136s (1) cores
% 11.09/2.36 % SubtermCWHack with pid 3045023 completed with status 0
% 11.09/2.36 % Result found by SubtermCWHack
% 11.09/2.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 11.09/2.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.09/2.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.09/2.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.09/2.36 % No SInE strategy applied
% 11.09/2.36 % Search class: FGUSF-FFSF32-SFFFFFNN
% 11.09/2.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.09/2.36 % Starting SubtermCWHack with 136s (1) cores
% 11.09/2.36 % Preprocessing time : 0.001 s
% 11.09/2.36
% 11.09/2.36 % Proof found!
% 11.09/2.36 % SZS status Unsatisfiable
% 11.09/2.36 % SZS output start CNFRefutation
% See solution above
% 11.09/2.36 % Parsed axioms : 9
% 11.09/2.36 % Removed by relevancy pruning/SinE : 0
% 11.09/2.36 % Initial clauses : 9
% 11.09/2.36 % Removed in clause preprocessing : 0
% 11.09/2.36 % Initial clauses in saturation : 9
% 11.09/2.36 % Processed clauses : 2586
% 11.09/2.36 % ...of these trivial : 0
% 11.09/2.36 % ...subsumed : 1931
% 11.09/2.36 % ...remaining for further processing : 655
% 11.09/2.36 % Other redundant clauses eliminated : 0
% 11.09/2.36 % Clauses deleted for lack of memory : 0
% 11.09/2.36 % Backward-subsumed : 12
% 11.09/2.36 % Backward-rewritten : 0
% 11.09/2.36 % Generated clauses : 75926
% 11.09/2.36 % ...of the previous two non-redundant : 75856
% 11.09/2.36 % ...aggressively subsumed : 0
% 11.09/2.36 % Contextual simplify-reflections : 0
% 11.09/2.36 % Paramodulations : 75926
% 11.09/2.36 % Factorizations : 0
% 11.09/2.36 % NegExts : 0
% 11.09/2.36 % Equation resolutions : 0
% 11.09/2.36 % Disequality decompositions : 0
% 11.09/2.36 % Total rewrite steps : 5
% 11.09/2.36 % ...of those cached : 1
% 11.09/2.36 % Propositional unsat checks : 0
% 11.09/2.36 % Propositional check models : 0
% 11.09/2.36 % Propositional check unsatisfiable : 0
% 11.09/2.36 % Propositional clauses : 0
% 11.09/2.36 % Propositional clauses after purity: 0
% 11.09/2.36 % Propositional unsat core size : 0
% 11.09/2.36 % Propositional preprocessing time : 0.000
% 11.09/2.36 % Propositional encoding time : 0.000
% 11.09/2.36 % Propositional solver time : 0.000
% 11.09/2.36 % Success case prop preproc time : 0.000
% 11.09/2.36 % Success case prop encoding time : 0.000
% 11.09/2.36 % Success case prop solver time : 0.000
% 11.09/2.36 % Current number of processed clauses : 643
% 11.09/2.36 % Positive orientable unit clauses : 149
% 11.09/2.36 % Positive unorientable unit clauses: 0
% 11.09/2.36 % Negative unit clauses : 1
% 11.09/2.36 % Non-unit-clauses : 493
% 11.09/2.36 % Current number of unprocessed clauses: 73260
% 11.09/2.36 % ...number of literals in the above : 187426
% 11.09/2.36 % Current number of archived formulas : 0
% 11.09/2.36 % Current number of archived clauses : 12
% 11.09/2.36 % Clause-clause subsumption calls (NU) : 75174
% 11.09/2.36 % Rec. Clause-clause subsumption calls : 74218
% 11.09/2.36 % Non-unit clause-clause subsumptions : 1943
% 11.09/2.36 % Unit Clause-clause subsumption calls : 2383
% 11.09/2.36 % Rewrite failures with RHS unbound : 0
% 11.09/2.37 % BW rewrite match attempts : 3833
% 11.09/2.37 % BW rewrite match successes : 0
% 11.09/2.37 % Condensation attempts : 0
% 11.09/2.37 % Condensation successes : 0
% 11.09/2.37 % Termbank termtop insertions : 1940235
% 11.09/2.37 % Search garbage collected termcells : 21
% 11.09/2.37
% 11.09/2.37 % -------------------------------------------------
% 11.09/2.37 % User time : 1.780 s
% 11.09/2.37 % System time : 0.075 s
% 11.09/2.37 % Total time : 1.856 s
% 11.09/2.37 % Maximum resident set size: 3636 pages
% 11.09/2.37
% 11.09/2.37 % -------------------------------------------------
% 11.09/2.37 % User time : 9.112 s
% 11.09/2.37 % System time : 0.406 s
% 11.09/2.37 % Total time : 9.519 s
% 11.09/2.37 % Maximum resident set size: 4864 pages
% 11.09/2.37 % E exiting
%------------------------------------------------------------------------------