%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT028-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:36 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 8 unt; 3 nHn; 10 RR)
% Number of literals : 27 ( 7 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 20 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',cls_mktop__Lin_0) ).
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/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_CHAINED_0,axiom,
c_in(v_R____,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_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/sandbox2/benchmark/theBenchmark.p',cls_in__mktop_4) ).
cnf(cls_assms_0,axiom,
v_a != v_b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_assms_0) ).
cnf(c_0_5,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_6,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_7,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_5 ).
cnf(c_0_8,axiom,
c_in(v_R____,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
cls_CHAINED_0 ).
cnf(c_0_9,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_6 ).
cnf(c_0_10,plain,
c_in(c_Arrow__Order__Mirabelle_Omktop(v_R____,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_7,c_0_8]) ).
cnf(c_0_11,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_12,plain,
v_a != v_b,
inference(fof_simplification,[status(thm)],[cls_assms_0]) ).
cnf(c_0_13,negated_conjecture,
~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_Omktop(v_R____,X1),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,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_11 ).
cnf(c_0_15,plain,
v_a != v_b,
c_0_12 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SCT028-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 04:27:24 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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
% 0.20/0.56 % Version: 3.5.1
% 0.20/0.56 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.56 % Starting new_bool_3 with 600s (2) cores
% 0.20/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.56 % Starting sh5l with 300s (1) cores
% 0.20/0.56 % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 21633 completed with status 0
% 0.20/0.56 % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.20/0.56 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.56 % No SInE strategy applied
% 0.20/0.56 % Search class: FGHSM-FSLM33-MFFFFFNN
% 0.20/0.56 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.56 % Starting SubtermCWHack with 109s (1) cores
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.20/0.56 % Starting new_bool_3 with 314s (1) cores
% 0.20/0.56 % Starting G-E--_303_C18_F1_URBAN_S0Y with 264s (1) cores
% 0.20/0.56 % new_bool_3 with pid 21645 completed with status 0
% 0.20/0.56 % Result found by new_bool_3
% 0.20/0.56 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.56 % No SInE strategy applied
% 0.20/0.56 % Search class: FGHSM-FSLM33-MFFFFFNN
% 0.20/0.56 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.56 % Starting SubtermCWHack with 109s (1) cores
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.20/0.56 % Starting new_bool_3 with 314s (1) cores
% 0.20/0.56 % Preprocessing time : 0.009 s
% 0.20/0.56 % Presaturation interreduction done
% 0.20/0.56
% 0.20/0.56 % Proof found!
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start CNFRefutation
% See solution above
% 0.20/0.56 % Parsed axioms : 533
% 0.20/0.56 % Removed by relevancy pruning/SinE : 0
% 0.20/0.56 % Initial clauses : 533
% 0.20/0.56 % Removed in clause preprocessing : 5
% 0.20/0.56 % Initial clauses in saturation : 528
% 0.20/0.56 % Processed clauses : 826
% 0.20/0.56 % ...of these trivial : 32
% 0.20/0.56 % ...subsumed : 102
% 0.20/0.56 % ...remaining for further processing : 692
% 0.20/0.56 % Other redundant clauses eliminated : 6
% 0.20/0.56 % Clauses deleted for lack of memory : 0
% 0.20/0.56 % Backward-subsumed : 1
% 0.20/0.56 % Backward-rewritten : 16
% 0.20/0.56 % Generated clauses : 928
% 0.20/0.56 % ...of the previous two non-redundant : 561
% 0.20/0.56 % ...aggressively subsumed : 0
% 0.20/0.56 % Contextual simplify-reflections : 2
% 0.20/0.56 % Paramodulations : 918
% 0.20/0.56 % Factorizations : 2
% 0.20/0.56 % NegExts : 0
% 0.20/0.56 % Equation resolutions : 8
% 0.20/0.56 % Disequality decompositions : 0
% 0.20/0.56 % Total rewrite steps : 485
% 0.20/0.56 % ...of those cached : 349
% 0.20/0.56 % Propositional unsat checks : 0
% 0.20/0.56 % Propositional check models : 0
% 0.20/0.56 % Propositional check unsatisfiable : 0
% 0.20/0.56 % Propositional clauses : 0
% 0.20/0.56 % Propositional clauses after purity: 0
% 0.20/0.56 % Propositional unsat core size : 0
% 0.20/0.56 % Propositional preprocessing time : 0.000
% 0.20/0.56 % Propositional encoding time : 0.000
% 0.20/0.56 % Propositional solver time : 0.000
% 0.20/0.56 % Success case prop preproc time : 0.000
% 0.20/0.56 % Success case prop encoding time : 0.000
% 0.20/0.56 % Success case prop solver time : 0.000
% 0.20/0.56 % Current number of processed clauses : 230
% 0.20/0.56 % Positive orientable unit clauses : 92
% 0.20/0.56 % Positive unorientable unit clauses: 1
% 0.20/0.56 % Negative unit clauses : 23
% 0.20/0.56 % Non-unit-clauses : 114
% 0.20/0.56 % Current number of unprocessed clauses: 685
% 0.20/0.56 % ...number of literals in the above : 1558
% 0.20/0.56 % Current number of archived formulas : 0
% 0.20/0.56 % Current number of archived clauses : 465
% 0.20/0.56 % Clause-clause subsumption calls (NU) : 34508
% 0.20/0.56 % Rec. Clause-clause subsumption calls : 20972
% 0.20/0.56 % Non-unit clause-clause subsumptions : 64
% 0.20/0.56 % Unit Clause-clause subsumption calls : 883
% 0.20/0.56 % Rewrite failures with RHS unbound : 0
% 0.20/0.56 % BW rewrite match attempts : 121
% 0.20/0.56 % BW rewrite match successes : 47
% 0.20/0.56 % Condensation attempts : 0
% 0.20/0.56 % Condensation successes : 0
% 0.20/0.56 % Termbank termtop insertions : 37020
% 0.20/0.56 % Search garbage collected termcells : 1168
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.086 s
% 0.20/0.56 % System time : 0.011 s
% 0.20/0.56 % Total time : 0.097 s
% 0.20/0.56 % Maximum resident set size: 4856 pages
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.319 s
% 0.20/0.56 % System time : 0.041 s
% 0.20/0.56 % Total time : 0.361 s
% 0.20/0.56 % Maximum resident set size: 5376 pages
% 0.20/0.56 % E exiting
%------------------------------------------------------------------------------