%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET821-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:15:28 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 11 unt; 13 nHn; 29 RR)
% Number of literals : 76 ( 11 equ; 31 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 62 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OComplD__dest_0,axiom,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OComplD__dest_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_in(v_b,X1,tc_IntDef_Oint)
| c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_c,X1,tc_IntDef_Oint) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_OComplI_0,axiom,
( c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OComplI_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
cnf(cls_Set_OinsertCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertCI_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/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
cnf(cls_Orderings_Oorder__less__irrefl__iff1_0,axiom,
( ~ c_less(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__less__irrefl__iff1_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(clsarity_IntDef__Oint_31,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_IntDef__Oint_31) ).
cnf(cls_conjecture_0,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_10,plain,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OComplD__dest_0]) ).
cnf(c_0_11,negated_conjecture,
( ~ c_in(v_b,X1,tc_IntDef_Oint)
| c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_c,X1,tc_IntDef_Oint) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_12,plain,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
( ~ c_in(v_b,X1,tc_IntDef_Oint)
| c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_c,X1,tc_IntDef_Oint) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
( ~ c_in(v_c,X1,tc_IntDef_Oint)
| ~ c_in(v_b,c_uminus(X1,tc_set(tc_IntDef_Oint)),tc_IntDef_Oint)
| c_in(v_a,c_uminus(X1,tc_set(tc_IntDef_Oint)),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(v_c,X1,tc_IntDef_Oint)
| ~ c_in(v_a,X1,tc_IntDef_Oint)
| ~ c_in(v_b,c_uminus(X1,tc_set(tc_IntDef_Oint)),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_16,axiom,
( c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| c_in(X1,X2,X3) ),
cls_Set_OComplI_0 ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(v_c,X1,tc_IntDef_Oint)
| ~ c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_b,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_19,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_20,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_21,negated_conjecture,
( ~ c_in(v_a,c_insert(v_c,X1,tc_IntDef_Oint),tc_IntDef_Oint)
| c_in(v_b,c_insert(v_c,X1,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
c_0_19 ).
cnf(c_0_23,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_b,c_insert(v_c,X1,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( ~ c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_b,X1,tc_IntDef_Oint)
| v_c = v_b ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( c_in(v_b,c_insert(v_a,X1,tc_IntDef_Oint),tc_IntDef_Oint)
| v_c = v_b ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( c_in(v_b,X1,tc_IntDef_Oint)
| v_a = v_b
| v_c = v_b ),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_28,plain,
( ~ c_less(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__less__irrefl__iff1_0]) ).
cnf(c_0_29,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
cls_conjecture_1 ).
cnf(c_0_30,negated_conjecture,
( v_c = v_b
| v_a = v_b ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_27]) ).
cnf(c_0_31,plain,
( ~ c_less(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
c_0_28 ).
cnf(c_0_32,negated_conjecture,
( c_less(v_b,v_b,tc_IntDef_Oint)
| v_a = v_b ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
clsarity_IntDef__Oint_31 ).
cnf(c_0_34,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
cls_conjecture_0 ).
cnf(c_0_35,negated_conjecture,
v_a = v_b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
c_less(v_b,v_b,tc_IntDef_Oint),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET821-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:41:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % sh5l with pid 3520531 completed with status 0
% 0.15/0.44 % Result found by sh5l
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 % Search class: FGHSF-FFSS32-SFFFFFNN
% 0.15/0.44 % partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 3520533 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 % Search class: FGHSF-FFSS32-SFFFFFNN
% 0.15/0.44 % partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 10
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 10
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 10
% 0.15/0.44 % Processed clauses : 23
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 1
% 0.15/0.44 % ...remaining for further processing : 22
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 1
% 0.15/0.44 % Backward-rewritten : 10
% 0.15/0.44 % Generated clauses : 28
% 0.15/0.44 % ...of the previous two non-redundant : 21
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 1
% 0.15/0.44 % Paramodulations : 28
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 15
% 0.15/0.44 % ...of those cached : 12
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 11
% 0.15/0.44 % Positive orientable unit clauses : 5
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 0
% 0.15/0.44 % Non-unit-clauses : 6
% 0.15/0.44 % Current number of unprocessed clauses: 1
% 0.15/0.44 % ...number of literals in the above : 3
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 11
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 33
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 29
% 0.15/0.44 % Non-unit clause-clause subsumptions : 3
% 0.15/0.44 % Unit Clause-clause subsumption calls : 1
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 1
% 0.15/0.44 % BW rewrite match successes : 1
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 668
% 0.15/0.44 % Search garbage collected termcells : 15
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.002 s
% 0.15/0.44 % System time : 0.003 s
% 0.15/0.44 % Total time : 0.005 s
% 0.15/0.44 % Maximum resident set size: 3636 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.002 s
% 0.15/0.44 % System time : 0.009 s
% 0.15/0.44 % Total time : 0.011 s
% 0.15/0.44 % Maximum resident set size: 4608 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------