%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV246-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 : n007.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 03:00:55 PM UTC 2026
% Result : Unsatisfiable 5.68s 1.61s
% Output : CNFRefutation 5.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 11 unt; 7 nHn; 24 RR)
% Number of literals : 59 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 68 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OUnE_0,axiom,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnE_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_OUnCI_1,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_1) ).
cnf(cls_Message_OMPair__analz_0,axiom,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV004-0.ax',cls_Message_OMPair__analz_0) ).
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/sandbox2/benchmark/Axioms/SWV004-0.ax',cls_Message_Oanalz_OInj_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_OUnCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).
cnf(cls_Message_OMPair__synth_0,axiom,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV004-0.ax',cls_Message_OMPair__synth_0) ).
cnf(c_0_8,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_10,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_11,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OMPair__analz_0]) ).
cnf(c_0_12,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_13,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_15,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
c_0_9 ).
cnf(c_0_16,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_10 ).
cnf(c_0_17,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).
cnf(c_0_18,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
c_0_11 ).
cnf(c_0_19,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
c_0_12 ).
cnf(c_0_20,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OMPair__synth_0]) ).
cnf(c_0_21,negated_conjecture,
( c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_17 ).
cnf(c_0_24,plain,
( ~ c_in(c_Message_Omsg_OMPair(X3,X1),X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ c_in(v_Y,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_28,plain,
( ~ c_in(c_Message_Omsg_OMPair(X4,X1),X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),v_G,tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
c_in(v_Y,c_Message_Oanalz(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV246-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.47 % Computer : n007.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Mon Sep 21 08:33:35 UTC 2026
% 0.21/0.48 % CPUTime :
% 0.21/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.57 Running first-order theorem proving
% 0.26/0.57 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
% 5.68/1.61 % Version: 3.5.1
% 5.68/1.61 % Preprocessing class: FMLMSMSMSSSNFFN.
% 5.68/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.68/1.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.68/1.61 % Starting new_bool_3 with 300s (1) cores
% 5.68/1.61 % Starting new_bool_1 with 300s (1) cores
% 5.68/1.61 % Starting sh5l with 300s (1) cores
% 5.68/1.61 % sh5l with pid 667703 completed with status 0
% 5.68/1.61 % Result found by sh5l
% 5.68/1.61 % Preprocessing class: FMLMSMSMSSSNFFN.
% 5.68/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.68/1.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.68/1.61 % Starting new_bool_3 with 300s (1) cores
% 5.68/1.61 % Starting new_bool_1 with 300s (1) cores
% 5.68/1.61 % Starting sh5l with 300s (1) cores
% 5.68/1.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 5.68/1.61 % SinE strategy is gf500_gu_R04_F100_L20000
% 5.68/1.61 % Search class: FGHSM-SSLM32-MFFFFFNN
% 5.68/1.61 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 5.68/1.61 % Starting SubtermCWHack with 28s (1) cores
% 5.68/1.61 % SubtermCWHack with pid 667711 completed with status 0
% 5.68/1.61 % Result found by SubtermCWHack
% 5.68/1.61 % Preprocessing class: FMLMSMSMSSSNFFN.
% 5.68/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.68/1.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.68/1.61 % Starting new_bool_3 with 300s (1) cores
% 5.68/1.61 % Starting new_bool_1 with 300s (1) cores
% 5.68/1.61 % Starting sh5l with 300s (1) cores
% 5.68/1.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 5.68/1.61 % SinE strategy is gf500_gu_R04_F100_L20000
% 5.68/1.61 % Search class: FGHSM-SSLM32-MFFFFFNN
% 5.68/1.61 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 5.68/1.61 % Starting SubtermCWHack with 28s (1) cores
% 5.68/1.61 % Preprocessing time : 0.015 s
% 5.68/1.61
% 5.68/1.61 % Proof found!
% 5.68/1.61 % SZS status Unsatisfiable
% 5.68/1.61 % SZS output start CNFRefutation
% See solution above
% 5.68/1.61 % Parsed axioms : 1403
% 5.68/1.61 % Removed by relevancy pruning/SinE : 182
% 5.68/1.61 % Initial clauses : 1221
% 5.68/1.61 % Removed in clause preprocessing : 1
% 5.68/1.61 % Initial clauses in saturation : 1220
% 5.68/1.61 % Processed clauses : 5314
% 5.68/1.61 % ...of these trivial : 672
% 5.68/1.61 % ...subsumed : 2657
% 5.68/1.61 % ...remaining for further processing : 1985
% 5.68/1.61 % Other redundant clauses eliminated : 12
% 5.68/1.61 % Clauses deleted for lack of memory : 0
% 5.68/1.61 % Backward-subsumed : 2
% 5.68/1.61 % Backward-rewritten : 12
% 5.68/1.61 % Generated clauses : 30316
% 5.68/1.61 % ...of the previous two non-redundant : 27883
% 5.68/1.61 % ...aggressively subsumed : 0
% 5.68/1.61 % Contextual simplify-reflections : 0
% 5.68/1.61 % Paramodulations : 30280
% 5.68/1.61 % Factorizations : 0
% 5.68/1.61 % NegExts : 0
% 5.68/1.61 % Equation resolutions : 36
% 5.68/1.61 % Disequality decompositions : 0
% 5.68/1.61 % Total rewrite steps : 3471
% 5.68/1.61 % ...of those cached : 2584
% 5.68/1.61 % Propositional unsat checks : 0
% 5.68/1.61 % Propositional check models : 0
% 5.68/1.61 % Propositional check unsatisfiable : 0
% 5.68/1.61 % Propositional clauses : 0
% 5.68/1.61 % Propositional clauses after purity: 0
% 5.68/1.61 % Propositional unsat core size : 0
% 5.68/1.61 % Propositional preprocessing time : 0.000
% 5.68/1.61 % Propositional encoding time : 0.000
% 5.68/1.61 % Propositional solver time : 0.000
% 5.68/1.61 % Success case prop preproc time : 0.000
% 5.68/1.61 % Success case prop encoding time : 0.000
% 5.68/1.61 % Success case prop solver time : 0.000
% 5.68/1.61 % Current number of processed clauses : 1971
% 5.68/1.61 % Positive orientable unit clauses : 718
% 5.68/1.61 % Positive unorientable unit clauses: 0
% 5.68/1.61 % Negative unit clauses : 25
% 5.68/1.61 % Non-unit-clauses : 1228
% 5.68/1.61 % Current number of unprocessed clauses: 23785
% 5.68/1.61 % ...number of literals in the above : 29377
% 5.68/1.61 % Current number of archived formulas : 0
% 5.68/1.61 % Current number of archived clauses : 14
% 5.68/1.61 % Clause-clause subsumption calls (NU) : 1048205
% 5.68/1.61 % Rec. Clause-clause subsumption calls : 1025645
% 5.68/1.61 % Non-unit clause-clause subsumptions : 2625
% 5.68/1.61 % Unit Clause-clause subsumption calls : 3731
% 5.68/1.61 % Rewrite failures with RHS unbound : 0
% 5.68/1.61 % BW rewrite match attempts : 18501
% 5.68/1.61 % BW rewrite match successes : 12
% 5.68/1.61 % Condensation attempts : 0
% 5.68/1.61 % Condensation successes : 0
% 5.68/1.61 % Termbank termtop insertions : 501742
% 5.68/1.61 % Search garbage collected termcells : 2060
% 5.68/1.61
% 5.68/1.61 % -------------------------------------------------
% 5.68/1.61 % User time : 0.802 s
% 5.68/1.61 % System time : 0.052 s
% 5.68/1.61 % Total time : 0.855 s
% 5.68/1.61 % Maximum resident set size: 6176 pages
% 5.68/1.61
% 5.68/1.61 % -------------------------------------------------
% 5.68/1.61 % User time : 0.849 s
% 5.68/1.61 % System time : 0.062 s
% 5.68/1.61 % Total time : 0.910 s
% 5.68/1.61 % Maximum resident set size: 5632 pages
% 5.68/1.61 % E exiting
%------------------------------------------------------------------------------