%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT026-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:07:35 PM UTC 2026
% Result : Unsatisfiable 0.32s 0.73s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 35 ( 14 unt; 3 nHn; 20 RR)
% Number of literals : 57 ( 10 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 69 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_conjecture_0,negated_conjecture,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_insert__code_1,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_1) ).
cnf(cls_insert__absorb_0,axiom,
( ~ c_in(X1,X2,X3)
| c_Set_Oinsert(X1,X2,X3) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_in__mktop_4,axiom,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_Omktop(X3,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_in__mktop_4) ).
cnf(cls_assms_0,axiom,
v_a != v_b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_assms_0) ).
cnf(cls_mktop__Lin_0,axiom,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| c_in(c_Arrow__Order__Mirabelle_Omktop(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mktop__Lin_0) ).
cnf(cls_mem__def_0,axiom,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_linear__alt_0,axiom,
c_in(v_sko__Arrow__Order__Mirabelle__Xlinear__alt__1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_linear__alt_0) ).
cnf(c_0_9,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_11,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
c_0_9 ).
cnf(c_0_12,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_13,negated_conjecture,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
c_0_10 ).
cnf(c_0_14,plain,
c_in(X1,c_Set_Oinsert(X1,X2,X3),X4),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ c_in(X1,X2,X3)
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_16,negated_conjecture,
~ c_in(c_Set_Oinsert(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ c_in(X1,X2,X3)
| c_Set_Oinsert(X1,X2,X3) = X2 ),
c_0_15 ).
cnf(c_0_18,plain,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_Omktop(X3,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[cls_in__mktop_4]) ).
cnf(c_0_19,plain,
v_a != v_b,
inference(fof_simplification,[status(thm)],[cls_assms_0]) ).
cnf(c_0_20,plain,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| c_in(c_Arrow__Order__Mirabelle_Omktop(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
inference(fof_simplification,[status(thm)],[cls_mktop__Lin_0]) ).
cnf(c_0_21,plain,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_22,negated_conjecture,
( ~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,X2)
| ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_Omktop(X3,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2 ),
c_0_18 ).
cnf(c_0_24,plain,
v_a != v_b,
c_0_19 ).
cnf(c_0_25,plain,
( ~ c_in(X1,X2,X4)
| c_in(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_26,plain,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| c_in(c_Arrow__Order__Mirabelle_Omktop(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
c_0_20 ).
cnf(c_0_27,plain,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
c_0_21 ).
cnf(c_0_28,axiom,
c_in(v_sko__Arrow__Order__Mirabelle__Xlinear__alt__1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
cls_linear__alt_0 ).
cnf(c_0_29,negated_conjecture,
~ c_in(c_Arrow__Order__Mirabelle_Omktop(X1,v_b),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_30,plain,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| c_in(c_Arrow__Order__Mirabelle_Omktop(X1,X2),c_Arrow__Order__Mirabelle_OLin,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
hBOOL(hAPP(c_Arrow__Order__Mirabelle_OLin,v_sko__Arrow__Order__Mirabelle__Xlinear__alt__1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
c_in(v_sko__Arrow__Order__Mirabelle__Xlinear__alt__1,c_Arrow__Order__Mirabelle_OLin,X1),
inference(spm,[status(thm)],[c_0_11,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SCT026-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n017.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 04:22:11 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.53 Running first-order theorem proving
% 0.25/0.53 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.32/0.73 % Version: 3.5.1
% 0.32/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.73 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.73 % Starting new_bool_1 with 300s (1) cores
% 0.32/0.73 % Starting sh5l with 300s (1) cores
% 0.32/0.73 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1415709 completed with status 0
% 0.32/0.73 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.32/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.73 % No SInE strategy applied
% 0.32/0.73 % Search class: FGHSM-FSLM33-MFFFFFNN
% 0.32/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.32/0.73 % Starting new_bool_3 with 393s (1) cores
% 0.32/0.73 % Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 0.32/0.73 % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.32/0.73 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1415716 completed with status 0
% 0.32/0.73 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.32/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.73 % No SInE strategy applied
% 0.32/0.73 % Search class: FGHSM-FSLM33-MFFFFFNN
% 0.32/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.32/0.73 % Preprocessing time : 0.014 s
% 0.32/0.73 % Presaturation interreduction done
% 0.32/0.73
% 0.32/0.73 % Proof found!
% 0.32/0.73 % SZS status Unsatisfiable
% 0.32/0.73 % SZS output start CNFRefutation
% See solution above
% 0.32/0.73 % Parsed axioms : 532
% 0.32/0.73 % Removed by relevancy pruning/SinE : 0
% 0.32/0.73 % Initial clauses : 532
% 0.32/0.73 % Removed in clause preprocessing : 5
% 0.32/0.73 % Initial clauses in saturation : 527
% 0.32/0.73 % Processed clauses : 784
% 0.32/0.73 % ...of these trivial : 24
% 0.32/0.73 % ...subsumed : 99
% 0.32/0.73 % ...remaining for further processing : 661
% 0.32/0.73 % Other redundant clauses eliminated : 6
% 0.32/0.73 % Clauses deleted for lack of memory : 0
% 0.32/0.73 % Backward-subsumed : 19
% 0.32/0.73 % Backward-rewritten : 2
% 0.32/0.73 % Generated clauses : 519
% 0.32/0.73 % ...of the previous two non-redundant : 328
% 0.32/0.73 % ...aggressively subsumed : 0
% 0.32/0.73 % Contextual simplify-reflections : 2
% 0.32/0.73 % Paramodulations : 511
% 0.32/0.73 % Factorizations : 0
% 0.32/0.73 % NegExts : 0
% 0.32/0.73 % Equation resolutions : 8
% 0.32/0.73 % Disequality decompositions : 0
% 0.32/0.73 % Total rewrite steps : 228
% 0.32/0.73 % ...of those cached : 144
% 0.32/0.73 % Propositional unsat checks : 0
% 0.32/0.73 % Propositional check models : 0
% 0.32/0.73 % Propositional check unsatisfiable : 0
% 0.32/0.73 % Propositional clauses : 0
% 0.32/0.73 % Propositional clauses after purity: 0
% 0.32/0.73 % Propositional unsat core size : 0
% 0.32/0.73 % Propositional preprocessing time : 0.000
% 0.32/0.73 % Propositional encoding time : 0.000
% 0.32/0.73 % Propositional solver time : 0.000
% 0.32/0.73 % Success case prop preproc time : 0.000
% 0.32/0.73 % Success case prop encoding time : 0.000
% 0.32/0.73 % Success case prop solver time : 0.000
% 0.32/0.73 % Current number of processed clauses : 196
% 0.32/0.73 % Positive orientable unit clauses : 63
% 0.32/0.73 % Positive unorientable unit clauses: 1
% 0.32/0.73 % Negative unit clauses : 9
% 0.32/0.73 % Non-unit-clauses : 123
% 0.32/0.73 % Current number of unprocessed clauses: 512
% 0.32/0.73 % ...number of literals in the above : 1298
% 0.32/0.73 % Current number of archived formulas : 0
% 0.32/0.73 % Current number of archived clauses : 468
% 0.32/0.73 % Clause-clause subsumption calls (NU) : 34983
% 0.32/0.73 % Rec. Clause-clause subsumption calls : 21432
% 0.32/0.73 % Non-unit clause-clause subsumptions : 89
% 0.32/0.73 % Unit Clause-clause subsumption calls : 843
% 0.32/0.73 % Rewrite failures with RHS unbound : 0
% 0.32/0.73 % BW rewrite match attempts : 127
% 0.32/0.73 % BW rewrite match successes : 35
% 0.32/0.73 % Condensation attempts : 0
% 0.32/0.73 % Condensation successes : 0
% 0.32/0.73 % Termbank termtop insertions : 31996
% 0.32/0.73 % Search garbage collected termcells : 1168
% 0.32/0.73
% 0.32/0.73 % -------------------------------------------------
% 0.32/0.73 % User time : 0.136 s
% 0.32/0.73 % System time : 0.011 s
% 0.32/0.73 % Total time : 0.147 s
% 0.32/0.73 % Maximum resident set size: 4600 pages
% 0.32/0.73
% 0.32/0.73 % -------------------------------------------------
% 0.32/0.73 % User time : 0.634 s
% 0.32/0.73 % System time : 0.056 s
% 0.32/0.73 % Total time : 0.690 s
% 0.32/0.73 % Maximum resident set size: 5120 pages
% 0.32/0.73 % E exiting
%------------------------------------------------------------------------------