%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET820-1 : 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 : n020.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:18:36 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.56s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 12 unt; 7 nHn; 25 RR)
% Number of literals : 58 ( 22 equ; 28 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 14 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/Axioms/MSC001-2.ax',cls_Set_OComplD__dest_0) ).
cnf(cls_Datatype_Oelem__o2s__iff2_0,axiom,
c_in(X1,c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2),X2),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Datatype_Oelem__o2s__iff2_0) ).
cnf(cls_Datatype_Onot__Some__eq__iff1_0,axiom,
( X1 = c_Datatype_Ooption_OSome(c_Main_Onot__Some__eq__iff1__1(X1,X2),X2)
| X1 = c_Datatype_Ooption_ONone ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Datatype_Onot__Some__eq__iff1_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_in(X1,X2,tc_IntDef_Oint)
| c_in(v_x(X2),X2,tc_IntDef_Oint) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
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/Axioms/MSC001-2.ax',cls_Set_OComplI_0) ).
cnf(cls_Datatype_Oelem__o2s__iff1_0,axiom,
( ~ c_in(X1,c_Datatype_Oo2s(X2,X3),X3)
| X2 = c_Datatype_Ooption_OSome(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Datatype_Oelem__o2s__iff1_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ v_P(v_x(X2))
| ~ c_in(X1,X2,tc_IntDef_Oint) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Datatype_Ooption_Oinject__iff1_0,axiom,
( c_Datatype_Ooption_OSome(X1,X2) != c_Datatype_Ooption_OSome(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Datatype_Ooption_Oinject__iff1_0) ).
cnf(cls_Datatype_Ooption_Odistinct__1__iff1_0,axiom,
c_Datatype_Ooption_ONone != c_Datatype_Ooption_OSome(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Datatype_Ooption_Odistinct__1__iff1_0) ).
cnf(cls_conjecture_0,negated_conjecture,
v_P(v_a),
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,plain,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_12,axiom,
c_in(X1,c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2),X2),
cls_Datatype_Oelem__o2s__iff2_0 ).
cnf(c_0_13,plain,
~ c_in(X1,c_uminus(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2),tc_set(X2)),X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
( X1 = c_Datatype_Ooption_OSome(c_Main_Onot__Some__eq__iff1__1(X1,X2),X2)
| X1 = c_Datatype_Ooption_ONone ),
cls_Datatype_Onot__Some__eq__iff1_0 ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(X1,X2,tc_IntDef_Oint)
| c_in(v_x(X2),X2,tc_IntDef_Oint) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_16,plain,
( ~ c_in(c_Main_Onot__Some__eq__iff1__1(X1,X2),c_uminus(c_Datatype_Oo2s(X1,X2),tc_set(X2)),X2)
| X1 = c_Datatype_Ooption_ONone ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| c_in(X1,X2,X3) ),
cls_Set_OComplI_0 ).
cnf(c_0_18,plain,
( ~ c_in(X1,c_Datatype_Oo2s(X2,X3),X3)
| X2 = c_Datatype_Ooption_OSome(X1,X3) ),
inference(fof_simplification,[status(thm)],[cls_Datatype_Oelem__o2s__iff1_0]) ).
cnf(c_0_19,negated_conjecture,
( ~ c_in(X1,X2,tc_IntDef_Oint)
| c_in(v_x(X2),X2,tc_IntDef_Oint) ),
c_0_15 ).
cnf(c_0_20,plain,
( c_in(c_Main_Onot__Some__eq__iff1__1(X1,X2),c_Datatype_Oo2s(X1,X2),X2)
| X1 = c_Datatype_Ooption_ONone ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( ~ v_P(v_x(X2))
| ~ c_in(X1,X2,tc_IntDef_Oint) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_22,plain,
( c_Datatype_Ooption_OSome(X1,X2) != c_Datatype_Ooption_OSome(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[cls_Datatype_Ooption_Oinject__iff1_0]) ).
cnf(c_0_23,plain,
( ~ c_in(X1,c_Datatype_Oo2s(X2,X3),X3)
| X2 = c_Datatype_Ooption_OSome(X1,X3) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
( c_in(v_x(c_Datatype_Oo2s(X1,tc_IntDef_Oint)),c_Datatype_Oo2s(X1,tc_IntDef_Oint),tc_IntDef_Oint)
| X1 = c_Datatype_Ooption_ONone ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
c_Datatype_Ooption_ONone != c_Datatype_Ooption_OSome(X1,X2),
inference(fof_simplification,[status(thm)],[cls_Datatype_Ooption_Odistinct__1__iff1_0]) ).
cnf(c_0_26,negated_conjecture,
( ~ v_P(v_x(X2))
| ~ c_in(X1,X2,tc_IntDef_Oint) ),
c_0_21 ).
cnf(c_0_27,plain,
( c_Datatype_Ooption_OSome(X1,X2) != c_Datatype_Ooption_OSome(X3,X2)
| X1 = X3 ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
( X1 = c_Datatype_Ooption_ONone
| c_Datatype_Ooption_OSome(v_x(c_Datatype_Oo2s(X1,tc_IntDef_Oint)),tc_IntDef_Oint) = X1 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
c_Datatype_Ooption_ONone != c_Datatype_Ooption_OSome(X1,X2),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
~ v_P(v_x(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,tc_IntDef_Oint),tc_IntDef_Oint))),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_31,negated_conjecture,
v_x(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,tc_IntDef_Oint),tc_IntDef_Oint)) = X1,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
v_P(v_a),
cls_conjecture_0 ).
cnf(c_0_33,negated_conjecture,
~ v_P(X1),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET820-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.34 % Computer : n020.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Mon Sep 21 05:40:33 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.25/0.56 % Version: 3.5.1
% 0.25/0.56 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.56 % Starting sh5l with 300s (1) cores
% 0.25/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2116121 completed with status 0
% 0.25/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.25/0.56 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.56 % No SInE strategy applied
% 0.25/0.56 % Search class: FGHSM-SSLM33-MFFFFFNN
% 0.25/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.56 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 0.25/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.25/0.56 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.25/0.56 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2116134 completed with status 0
% 0.25/0.56 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.25/0.56 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.56 % No SInE strategy applied
% 0.25/0.56 % Search class: FGHSM-SSLM33-MFFFFFNN
% 0.25/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.56 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 0.25/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.25/0.56 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.25/0.56 % Preprocessing time : 0.011 s
% 0.25/0.56
% 0.25/0.56 % Proof found!
% 0.25/0.56 % SZS status Unsatisfiable
% 0.25/0.56 % SZS output start CNFRefutation
% See solution above
% 0.25/0.56 % Parsed axioms : 1360
% 0.25/0.56 % Removed by relevancy pruning/SinE : 0
% 0.25/0.56 % Initial clauses : 1360
% 0.25/0.56 % Removed in clause preprocessing : 1
% 0.25/0.56 % Initial clauses in saturation : 1359
% 0.25/0.56 % Processed clauses : 1691
% 0.25/0.56 % ...of these trivial : 8
% 0.25/0.56 % ...subsumed : 217
% 0.25/0.56 % ...remaining for further processing : 1466
% 0.25/0.56 % Other redundant clauses eliminated : 6
% 0.25/0.56 % Clauses deleted for lack of memory : 0
% 0.25/0.56 % Backward-subsumed : 10
% 0.25/0.56 % Backward-rewritten : 22
% 0.25/0.56 % Generated clauses : 2387
% 0.25/0.56 % ...of the previous two non-redundant : 1363
% 0.25/0.56 % ...aggressively subsumed : 0
% 0.25/0.56 % Contextual simplify-reflections : 0
% 0.25/0.56 % Paramodulations : 2349
% 0.25/0.56 % Factorizations : 0
% 0.25/0.56 % NegExts : 0
% 0.25/0.56 % Equation resolutions : 37
% 0.25/0.56 % Disequality decompositions : 0
% 0.25/0.56 % Total rewrite steps : 1127
% 0.25/0.56 % ...of those cached : 923
% 0.25/0.56 % Propositional unsat checks : 0
% 0.25/0.56 % Propositional check models : 0
% 0.25/0.56 % Propositional check unsatisfiable : 0
% 0.25/0.56 % Propositional clauses : 0
% 0.25/0.56 % Propositional clauses after purity: 0
% 0.25/0.56 % Propositional unsat core size : 0
% 0.25/0.56 % Propositional preprocessing time : 0.000
% 0.25/0.56 % Propositional encoding time : 0.000
% 0.25/0.56 % Propositional solver time : 0.000
% 0.25/0.56 % Success case prop preproc time : 0.000
% 0.25/0.56 % Success case prop encoding time : 0.000
% 0.25/0.56 % Success case prop solver time : 0.000
% 0.25/0.56 % Current number of processed clauses : 1433
% 0.25/0.56 % Positive orientable unit clauses : 180
% 0.25/0.56 % Positive unorientable unit clauses: 1
% 0.25/0.56 % Negative unit clauses : 71
% 0.25/0.56 % Non-unit-clauses : 1181
% 0.25/0.56 % Current number of unprocessed clauses: 1014
% 0.25/0.56 % ...number of literals in the above : 1777
% 0.25/0.56 % Current number of archived formulas : 0
% 0.25/0.56 % Current number of archived clauses : 33
% 0.25/0.56 % Clause-clause subsumption calls (NU) : 379533
% 0.25/0.56 % Rec. Clause-clause subsumption calls : 353866
% 0.25/0.56 % Non-unit clause-clause subsumptions : 188
% 0.25/0.56 % Unit Clause-clause subsumption calls : 10193
% 0.25/0.56 % Rewrite failures with RHS unbound : 0
% 0.25/0.56 % BW rewrite match attempts : 52
% 0.25/0.56 % BW rewrite match successes : 30
% 0.25/0.56 % Condensation attempts : 0
% 0.25/0.56 % Condensation successes : 0
% 0.25/0.56 % Termbank termtop insertions : 56546
% 0.25/0.56 % Search garbage collected termcells : 1593
% 0.25/0.56
% 0.25/0.56 % -------------------------------------------------
% 0.25/0.56 % User time : 0.092 s
% 0.25/0.56 % System time : 0.016 s
% 0.25/0.56 % Total time : 0.108 s
% 0.25/0.56 % Maximum resident set size: 5576 pages
% 0.25/0.56
% 0.25/0.56 % -------------------------------------------------
% 0.25/0.56 % User time : 0.515 s
% 0.25/0.56 % System time : 0.045 s
% 0.25/0.56 % Total time : 0.560 s
% 0.25/0.56 % Maximum resident set size: 5376 pages
% 0.25/0.56 % E exiting
%------------------------------------------------------------------------------