%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV244-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 : n016.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:54 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 10 unt; 3 nHn; 16 RR)
% Number of literals : 37 ( 0 equ; 19 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 : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 42 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(v_X,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_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_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_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_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_0,negated_conjecture,
c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_6,negated_conjecture,
~ c_in(v_X,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_1]) ).
cnf(c_0_7,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_8,negated_conjecture,
~ c_in(v_X,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_6 ).
cnf(c_0_9,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_7 ).
cnf(c_0_10,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_11,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_12,negated_conjecture,
~ c_in(v_X,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
c_0_10 ).
cnf(c_0_14,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_15,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
~ c_in(v_X,c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_19,negated_conjecture,
~ c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(v_X,v_H,tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV244-1 : 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/5.38 % Computer : n016.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Mon Sep 21 08:40:43 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 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.14/5.49 % Version: 3.5.1
% 0.14/5.49 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.49 % Starting sh5l with 300s (1) cores
% 0.14/5.49 % new_bool_3 with pid 2043109 completed with status 0
% 0.14/5.49 % Result found by new_bool_3
% 0.14/5.49 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.49 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.14/5.49 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.49 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.49 % SubtermCWHack with pid 2043112 completed with status 0
% 0.14/5.49 % Result found by SubtermCWHack
% 0.14/5.49 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.49 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.14/5.49 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.49 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.49 % Preprocessing time : 0.003 s
% 0.14/5.49
% 0.14/5.49 % Proof found!
% 0.14/5.49 % SZS status Unsatisfiable
% 0.14/5.49 % SZS output start CNFRefutation
% See solution above
% 0.14/5.50 % Parsed axioms : 1402
% 0.14/5.50 % Removed by relevancy pruning/SinE : 1320
% 0.14/5.50 % Initial clauses : 82
% 0.14/5.50 % Removed in clause preprocessing : 0
% 0.14/5.50 % Initial clauses in saturation : 82
% 0.14/5.50 % Processed clauses : 198
% 0.14/5.50 % ...of these trivial : 8
% 0.14/5.50 % ...subsumed : 8
% 0.14/5.50 % ...remaining for further processing : 182
% 0.14/5.50 % Other redundant clauses eliminated : 0
% 0.14/5.50 % Clauses deleted for lack of memory : 0
% 0.14/5.50 % Backward-subsumed : 2
% 0.14/5.50 % Backward-rewritten : 2
% 0.14/5.50 % Generated clauses : 2750
% 0.14/5.50 % ...of the previous two non-redundant : 2704
% 0.14/5.50 % ...aggressively subsumed : 0
% 0.14/5.50 % Contextual simplify-reflections : 0
% 0.14/5.50 % Paramodulations : 2745
% 0.14/5.50 % Factorizations : 0
% 0.14/5.50 % NegExts : 0
% 0.14/5.50 % Equation resolutions : 5
% 0.14/5.50 % Disequality decompositions : 0
% 0.14/5.50 % Total rewrite steps : 38
% 0.14/5.50 % ...of those cached : 6
% 0.14/5.50 % Propositional unsat checks : 0
% 0.14/5.50 % Propositional check models : 0
% 0.14/5.50 % Propositional check unsatisfiable : 0
% 0.14/5.50 % Propositional clauses : 0
% 0.14/5.50 % Propositional clauses after purity: 0
% 0.14/5.50 % Propositional unsat core size : 0
% 0.14/5.50 % Propositional preprocessing time : 0.000
% 0.14/5.50 % Propositional encoding time : 0.000
% 0.14/5.50 % Propositional solver time : 0.000
% 0.14/5.50 % Success case prop preproc time : 0.000
% 0.14/5.50 % Success case prop encoding time : 0.000
% 0.14/5.50 % Success case prop solver time : 0.000
% 0.14/5.50 % Current number of processed clauses : 178
% 0.14/5.50 % Positive orientable unit clauses : 73
% 0.14/5.50 % Positive unorientable unit clauses: 0
% 0.14/5.50 % Negative unit clauses : 11
% 0.14/5.50 % Non-unit-clauses : 94
% 0.14/5.50 % Current number of unprocessed clauses: 2588
% 0.14/5.50 % ...number of literals in the above : 2862
% 0.14/5.50 % Current number of archived formulas : 0
% 0.14/5.50 % Current number of archived clauses : 4
% 0.14/5.50 % Clause-clause subsumption calls (NU) : 2234
% 0.14/5.50 % Rec. Clause-clause subsumption calls : 2161
% 0.14/5.50 % Non-unit clause-clause subsumptions : 5
% 0.14/5.50 % Unit Clause-clause subsumption calls : 17
% 0.14/5.50 % Rewrite failures with RHS unbound : 0
% 0.14/5.50 % BW rewrite match attempts : 331
% 0.14/5.50 % BW rewrite match successes : 2
% 0.14/5.50 % Condensation attempts : 0
% 0.14/5.50 % Condensation successes : 0
% 0.14/5.50 % Termbank termtop insertions : 48251
% 0.14/5.50 % Search garbage collected termcells : 2717
% 0.14/5.50
% 0.14/5.50 % -------------------------------------------------
% 0.14/5.50 % User time : 0.035 s
% 0.14/5.50 % System time : 0.007 s
% 0.14/5.50 % Total time : 0.041 s
% 0.14/5.50 % Maximum resident set size: 4896 pages
% 0.14/5.50
% 0.14/5.50 % -------------------------------------------------
% 0.14/5.50 % User time : 0.054 s
% 0.14/5.50 % System time : 0.014 s
% 0.14/5.50 % Total time : 0.068 s
% 0.14/5.50 % Maximum resident set size: 5632 pages
% 0.14/5.50 % E exiting
%------------------------------------------------------------------------------