%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT002-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 : n019.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:33 PM UTC 2026
% Result : Unsatisfiable 4.09s 6.08s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 43 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 42 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
( ~ hBOOL(c_in(X2,X1,X3))
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_trans__def_0,axiom,
( ~ c_Relation_Otrans(X4,X3)
| ~ hBOOL(c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3)))
| hBOOL(c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_trans__def_0) ).
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_conjecture_3,negated_conjecture,
hBOOL(c_in(c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_1,negated_conjecture,
c_Relation_Otrans(v_L,tc_Arrow__Order__Mirabelle_Oalt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_4,negated_conjecture,
hBOOL(c_in(c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_2,negated_conjecture,
~ hBOOL(c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_7,plain,
( ~ hBOOL(c_in(X2,X1,X3))
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_8,plain,
( ~ c_Relation_Otrans(X4,X3)
| ~ hBOOL(c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3)))
| hBOOL(c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3))) ),
inference(fof_simplification,[status(thm)],[cls_trans__def_0]) ).
cnf(c_0_9,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_10,plain,
( ~ hBOOL(c_in(X2,X1,X3))
| hBOOL(hAPP(X1,X2)) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
hBOOL(c_in(c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
cls_conjecture_3 ).
cnf(c_0_12,plain,
( ~ c_Relation_Otrans(X4,X3)
| ~ hBOOL(c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3)))
| hBOOL(c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3))) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
c_Relation_Otrans(v_L,tc_Arrow__Order__Mirabelle_Oalt),
cls_conjecture_1 ).
cnf(c_0_14,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
c_0_9 ).
cnf(c_0_15,negated_conjecture,
hBOOL(hAPP(v_L,c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
hBOOL(c_in(c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
cls_conjecture_4 ).
cnf(c_0_17,negated_conjecture,
( ~ hBOOL(c_in(c_Pair(X1,X3,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| ~ hBOOL(c_in(c_Pair(X3,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
hBOOL(c_in(c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
hBOOL(hAPP(v_L,c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ hBOOL(c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_21,negated_conjecture,
( ~ hBOOL(c_in(c_Pair(X1,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| hBOOL(c_in(c_Pair(X1,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
hBOOL(c_in(c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ hBOOL(c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SCT002-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.17/5.45 % Computer : n019.cluster.edu
% 0.17/5.45 % Model : x86_64 x86_64
% 0.17/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.45 % Memory : 8046.5625MB
% 0.17/5.45 % OS : Linux 6.8.0-71-generic
% 0.17/5.45 % CPULimit : 300
% 0.17/5.45 % WCLimit : 300
% 0.17/5.45 % DateTime : Mon Sep 21 04:25:57 UTC 2026
% 0.17/5.46 % CPUTime :
% 0.17/5.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.53 Running first-order theorem proving
% 0.22/5.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
% 4.09/6.08 % Version: 3.5.1
% 4.09/6.08 % Preprocessing class: FSLMSMSMSSSNFFN.
% 4.09/6.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/6.08 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 4.09/6.08 % Starting new_bool_3 with 600s (2) cores
% 4.09/6.08 % Starting new_bool_1 with 300s (1) cores
% 4.09/6.08 % Starting sh5l with 300s (1) cores
% 4.09/6.08 % new_bool_3 with pid 1678711 completed with status 0
% 4.09/6.08 % Result found by new_bool_3
% 4.09/6.08 % Preprocessing class: FSLMSMSMSSSNFFN.
% 4.09/6.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/6.08 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 4.09/6.08 % Starting new_bool_3 with 600s (2) cores
% 4.09/6.08 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.09/6.08 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.09/6.08 % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.09/6.08 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 4.09/6.08 % Starting SubtermCWHack with 55s (1) cores
% 4.09/6.08 % Starting new_bool_3 with 61s (1) cores
% 4.09/6.08 % new_bool_3 with pid 1678716 completed with status 0
% 4.09/6.08 % Result found by new_bool_3
% 4.09/6.08 % Preprocessing class: FSLMSMSMSSSNFFN.
% 4.09/6.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/6.08 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 4.09/6.08 % Starting new_bool_3 with 600s (2) cores
% 4.09/6.08 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.09/6.08 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.09/6.08 % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.09/6.08 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 4.09/6.08 % Starting SubtermCWHack with 55s (1) cores
% 4.09/6.08 % Starting new_bool_3 with 61s (1) cores
% 4.09/6.08 % Preprocessing time : 0.011 s
% 4.09/6.08 % Presaturation interreduction done
% 4.09/6.08
% 4.09/6.08 % Proof found!
% 4.09/6.08 % SZS status Unsatisfiable
% 4.09/6.08 % SZS output start CNFRefutation
% See solution above
% 4.09/6.08 % Parsed axioms : 677
% 4.09/6.08 % Removed by relevancy pruning/SinE : 234
% 4.09/6.08 % Initial clauses : 443
% 4.09/6.08 % Removed in clause preprocessing : 0
% 4.09/6.08 % Initial clauses in saturation : 443
% 4.09/6.08 % Processed clauses : 2412
% 4.09/6.08 % ...of these trivial : 77
% 4.09/6.08 % ...subsumed : 1128
% 4.09/6.08 % ...remaining for further processing : 1207
% 4.09/6.08 % Other redundant clauses eliminated : 22
% 4.09/6.08 % Clauses deleted for lack of memory : 0
% 4.09/6.08 % Backward-subsumed : 36
% 4.09/6.08 % Backward-rewritten : 88
% 4.09/6.08 % Generated clauses : 12497
% 4.09/6.08 % ...of the previous two non-redundant : 9929
% 4.09/6.08 % ...aggressively subsumed : 0
% 4.09/6.08 % Contextual simplify-reflections : 1
% 4.09/6.08 % Paramodulations : 12466
% 4.09/6.08 % Factorizations : 2
% 4.09/6.08 % NegExts : 0
% 4.09/6.08 % Equation resolutions : 29
% 4.09/6.08 % Disequality decompositions : 0
% 4.09/6.08 % Total rewrite steps : 5562
% 4.09/6.08 % ...of those cached : 4299
% 4.09/6.08 % Propositional unsat checks : 0
% 4.09/6.08 % Propositional check models : 0
% 4.09/6.08 % Propositional check unsatisfiable : 0
% 4.09/6.08 % Propositional clauses : 0
% 4.09/6.08 % Propositional clauses after purity: 0
% 4.09/6.08 % Propositional unsat core size : 0
% 4.09/6.08 % Propositional preprocessing time : 0.000
% 4.09/6.08 % Propositional encoding time : 0.000
% 4.09/6.08 % Propositional solver time : 0.000
% 4.09/6.08 % Success case prop preproc time : 0.000
% 4.09/6.08 % Success case prop encoding time : 0.000
% 4.09/6.08 % Success case prop solver time : 0.000
% 4.09/6.08 % Current number of processed clauses : 709
% 4.09/6.08 % Positive orientable unit clauses : 314
% 4.09/6.08 % Positive unorientable unit clauses: 8
% 4.09/6.08 % Negative unit clauses : 102
% 4.09/6.08 % Non-unit-clauses : 285
% 4.09/6.08 % Current number of unprocessed clauses: 8194
% 4.09/6.08 % ...number of literals in the above : 14237
% 4.09/6.08 % Current number of archived formulas : 0
% 4.09/6.08 % Current number of archived clauses : 498
% 4.09/6.08 % Clause-clause subsumption calls (NU) : 18768
% 4.09/6.08 % Rec. Clause-clause subsumption calls : 17116
% 4.09/6.08 % Non-unit clause-clause subsumptions : 224
% 4.09/6.08 % Unit Clause-clause subsumption calls : 2185
% 4.09/6.08 % Rewrite failures with RHS unbound : 0
% 4.09/6.08 % BW rewrite match attempts : 1247
% 4.09/6.08 % BW rewrite match successes : 191
% 4.09/6.08 % Condensation attempts : 0
% 4.09/6.08 % Condensation successes : 0
% 4.09/6.08 % Termbank termtop insertions : 229467
% 4.09/6.08 % Search garbage collected termcells : 2008
% 4.09/6.08
% 4.09/6.08 % -------------------------------------------------
% 4.09/6.08 % User time : 0.446 s
% 4.09/6.08 % System time : 0.032 s
% 4.09/6.08 % Total time : 0.478 s
% 4.09/6.08 % Maximum resident set size: 4668 pages
% 4.09/6.08
% 4.09/6.08 % -------------------------------------------------
% 4.09/6.08 % User time : 0.918 s
% 4.09/6.08 % System time : 0.067 s
% 4.09/6.08 % Total time : 0.985 s
% 4.09/6.08 % Maximum resident set size: 5376 pages
% 4.09/6.08 % E exiting
%------------------------------------------------------------------------------