%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM011-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 : n008.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 12:11:27 PM UTC 2026
% Result : Unsatisfiable 1.88s 0.78s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 10 unt; 3 nHn; 30 RR)
% Number of literals : 67 ( 0 equ; 34 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 : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 87 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_UNITY_Oconstrains__weaken__L_0,axiom,
( ~ c_lessequals(X5,X2,tc_set(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(X2,X3,X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_UNITY_Oconstrains(X5,X3,X4),tc_UNITY_Oprogram(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_UNITY_Oconstrains__weaken__L_0) ).
cnf(cls_WFair_Otransient__strengthen_0,axiom,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,c_WFair_Otransient(X2,X3),tc_UNITY_Oprogram(X3))
| c_in(X1,c_WFair_Otransient(X4,X3),tc_UNITY_Oprogram(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_WFair_Otransient__strengthen_0) ).
cnf(cls_WFair_OensuresI_0,axiom,
( ~ c_in(X1,c_WFair_Otransient(c_minus(X2,X3,tc_set(X4)),X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(c_minus(X2,X3,tc_set(X4)),c_union(X2,X3,X4),X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_WFair_OensuresI_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_ODiffE_1,axiom,
( ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4)
| c_in(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffE_1) ).
cnf(cls_WFair_OleadsTo__Basis_0,axiom,
( ~ c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_WFair_OleadsTo(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_WFair_OleadsTo__Basis_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
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/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
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/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(c_0_10,plain,
( ~ c_lessequals(X5,X2,tc_set(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(X2,X3,X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_UNITY_Oconstrains(X5,X3,X4),tc_UNITY_Oprogram(X4)) ),
inference(fof_simplification,[status(thm)],[cls_UNITY_Oconstrains__weaken__L_0]) ).
cnf(c_0_11,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,c_WFair_Otransient(X2,X3),tc_UNITY_Oprogram(X3))
| c_in(X1,c_WFair_Otransient(X4,X3),tc_UNITY_Oprogram(X3)) ),
inference(fof_simplification,[status(thm)],[cls_WFair_Otransient__strengthen_0]) ).
cnf(c_0_12,plain,
( ~ c_in(X1,c_WFair_Otransient(c_minus(X2,X3,tc_set(X4)),X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(c_minus(X2,X3,tc_set(X4)),c_union(X2,X3,X4),X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
inference(fof_simplification,[status(thm)],[cls_WFair_OensuresI_0]) ).
cnf(c_0_13,plain,
( ~ c_lessequals(X5,X2,tc_set(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(X2,X3,X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_UNITY_Oconstrains(X5,X3,X4),tc_UNITY_Oprogram(X4)) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
cls_conjecture_0 ).
cnf(c_0_15,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,c_WFair_Otransient(X2,X3),tc_UNITY_Oprogram(X3))
| c_in(X1,c_WFair_Otransient(X4,X3),tc_UNITY_Oprogram(X3)) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
cls_conjecture_1 ).
cnf(c_0_17,plain,
( ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4)
| c_in(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiffE_1]) ).
cnf(c_0_18,plain,
( ~ c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_WFair_OleadsTo(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
inference(fof_simplification,[status(thm)],[cls_WFair_OleadsTo__Basis_0]) ).
cnf(c_0_19,plain,
( ~ c_in(X1,c_WFair_Otransient(c_minus(X2,X3,tc_set(X4)),X4),tc_UNITY_Oprogram(X4))
| ~ c_in(X1,c_UNITY_Oconstrains(c_minus(X2,X3,tc_set(X4)),c_union(X2,X3,X4),X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
c_0_12 ).
cnf(c_0_20,negated_conjecture,
( ~ c_lessequals(X1,v_A,tc_set(t_a))
| c_in(v_F,c_UNITY_Oconstrains(X1,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( ~ c_lessequals(X1,v_A,tc_set(t_a))
| c_in(v_F,c_WFair_Otransient(X1,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_23,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_24,plain,
( ~ c_in(X1,c_minus(X2,X3,tc_set(X4)),X4)
| c_in(X1,X2,X4) ),
c_0_17 ).
cnf(c_0_25,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_26,plain,
( ~ c_in(X1,c_WFair_Oensures(X2,X3,X4),tc_UNITY_Oprogram(X4))
| c_in(X1,c_WFair_OleadsTo(X2,X3,X4),tc_UNITY_Oprogram(X4)) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
( ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a))
| c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
c_0_22 ).
cnf(c_0_29,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_23 ).
cnf(c_0_30,plain,
( c_in(c_Main_OsubsetI__1(c_minus(X1,X2,tc_set(X3)),X4,X3),X1,X3)
| c_lessequals(c_minus(X1,X2,tc_set(X3)),X4,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_32,plain,
c_lessequals(c_minus(X1,X2,tc_set(X3)),X1,tc_set(X3)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM011-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 14:15:10 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 1.88/0.78 % Version: 3.5.1
% 1.88/0.78 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.88/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.88/0.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.88/0.78 % Starting new_bool_3 with 300s (1) cores
% 1.88/0.78 % Starting new_bool_1 with 300s (1) cores
% 1.88/0.78 % Starting sh5l with 300s (1) cores
% 1.88/0.78 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1192895 completed with status 0
% 1.88/0.78 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.88/0.78 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.88/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.88/0.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.88/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.88/0.78 % No SInE strategy applied
% 1.88/0.78 % Search class: FGHSM-SSLM33-MFFFFFNN
% 1.88/0.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.88/0.78 % Starting SubtermCWHack with 136s (1) cores
% 1.88/0.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.88/0.78 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 1.88/0.78 % Starting new_bool_3 with 136s (1) cores
% 1.88/0.78 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.88/0.78 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1192903 completed with status 0
% 1.88/0.78 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.88/0.78 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.88/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.88/0.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.88/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.88/0.78 % No SInE strategy applied
% 1.88/0.78 % Search class: FGHSM-SSLM33-MFFFFFNN
% 1.88/0.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.88/0.78 % Starting SubtermCWHack with 136s (1) cores
% 1.88/0.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.88/0.78 % Preprocessing time : 0.007 s
% 1.88/0.78 % Presaturation interreduction done
% 1.88/0.78
% 1.88/0.78 % Proof found!
% 1.88/0.78 % SZS status Unsatisfiable
% 1.88/0.78 % SZS output start CNFRefutation
% See solution above
% 1.88/0.78 % Parsed axioms : 1374
% 1.88/0.78 % Removed by relevancy pruning/SinE : 0
% 1.88/0.78 % Initial clauses : 1374
% 1.88/0.78 % Removed in clause preprocessing : 1
% 1.88/0.78 % Initial clauses in saturation : 1373
% 1.88/0.78 % Processed clauses : 6508
% 1.88/0.78 % ...of these trivial : 99
% 1.88/0.78 % ...subsumed : 3104
% 1.88/0.78 % ...remaining for further processing : 3305
% 1.88/0.78 % Other redundant clauses eliminated : 34
% 1.88/0.78 % Clauses deleted for lack of memory : 0
% 1.88/0.78 % Backward-subsumed : 74
% 1.88/0.78 % Backward-rewritten : 102
% 1.88/0.78 % Generated clauses : 10962
% 1.88/0.78 % ...of the previous two non-redundant : 9586
% 1.88/0.78 % ...aggressively subsumed : 0
% 1.88/0.78 % Contextual simplify-reflections : 3
% 1.88/0.78 % Paramodulations : 10894
% 1.88/0.78 % Factorizations : 4
% 1.88/0.78 % NegExts : 0
% 1.88/0.78 % Equation resolutions : 64
% 1.88/0.78 % Disequality decompositions : 0
% 1.88/0.78 % Total rewrite steps : 2634
% 1.88/0.78 % ...of those cached : 2055
% 1.88/0.78 % Propositional unsat checks : 0
% 1.88/0.78 % Propositional check models : 0
% 1.88/0.78 % Propositional check unsatisfiable : 0
% 1.88/0.78 % Propositional clauses : 0
% 1.88/0.78 % Propositional clauses after purity: 0
% 1.88/0.78 % Propositional unsat core size : 0
% 1.88/0.78 % Propositional preprocessing time : 0.000
% 1.88/0.78 % Propositional encoding time : 0.000
% 1.88/0.78 % Propositional solver time : 0.000
% 1.88/0.78 % Success case prop preproc time : 0.000
% 1.88/0.78 % Success case prop encoding time : 0.000
% 1.88/0.78 % Success case prop solver time : 0.000
% 1.88/0.78 % Current number of processed clauses : 1794
% 1.88/0.78 % Positive orientable unit clauses : 275
% 1.88/0.78 % Positive unorientable unit clauses: 0
% 1.88/0.78 % Negative unit clauses : 137
% 1.88/0.78 % Non-unit-clauses : 1382
% 1.88/0.78 % Current number of unprocessed clauses: 5463
% 1.88/0.78 % ...number of literals in the above : 11759
% 1.88/0.78 % Current number of archived formulas : 0
% 1.88/0.78 % Current number of archived clauses : 1511
% 1.88/0.78 % Clause-clause subsumption calls (NU) : 1573474
% 1.88/0.78 % Rec. Clause-clause subsumption calls : 1478597
% 1.88/0.78 % Non-unit clause-clause subsumptions : 2958
% 1.88/0.78 % Unit Clause-clause subsumption calls : 36207
% 1.88/0.78 % Rewrite failures with RHS unbound : 0
% 1.88/0.78 % BW rewrite match attempts : 250
% 1.88/0.78 % BW rewrite match successes : 81
% 1.88/0.78 % Condensation attempts : 0
% 1.88/0.78 % Condensation successes : 0
% 1.88/0.78 % Termbank termtop insertions : 189279
% 1.88/0.78 % Search garbage collected termcells : 1615
% 1.88/0.78
% 1.88/0.78 % -------------------------------------------------
% 1.88/0.78 % User time : 0.296 s
% 1.88/0.78 % System time : 0.013 s
% 1.88/0.78 % Total time : 0.309 s
% 1.88/0.78 % Maximum resident set size: 5640 pages
% 1.88/0.78
% 1.88/0.78 % -------------------------------------------------
% 1.88/0.78 % User time : 1.405 s
% 1.88/0.78 % System time : 0.089 s
% 1.88/0.78 % Total time : 1.494 s
% 1.88/0.78 % Maximum resident set size: 5376 pages
% 1.88/0.78 % E exiting
%------------------------------------------------------------------------------