%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT073-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:40 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.57s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 8 unt; 4 nHn; 12 RR)
% Number of literals : 27 ( 7 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
( ~ 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_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| v_thesis____ ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_that_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_CHAINED_0,axiom,
v_a____ != v_b____,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(cls_complete__Lin_1,axiom,
( X1 = X2
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_complete__Lin_1) ).
cnf(cls_complete__Lin_0,axiom,
( X1 = X2
| c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(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_complete__Lin_0) ).
cnf(c_0_5,plain,
( ~ 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_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| v_thesis____ ),
inference(fof_simplification,[status(thm)],[cls_that_0]) ).
cnf(c_0_6,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_7,plain,
( ~ 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_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| v_thesis____ ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
~ v_thesis____,
c_0_6 ).
cnf(c_0_9,plain,
v_a____ != v_b____,
inference(fof_simplification,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_0_10,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_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(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( X1 = X2
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
cls_complete__Lin_1 ).
cnf(c_0_12,plain,
v_a____ != v_b____,
c_0_9 ).
cnf(c_0_13,plain,
~ c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(v_a____,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_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,axiom,
( X1 = X2
| c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
cls_complete__Lin_0 ).
cnf(c_0_15,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SCT073-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n017.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 04:25:12 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.18/0.57 % Version: 3.5.1
% 0.18/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.57 % Starting sh5l with 300s (1) cores
% 0.18/0.57 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1420182 completed with status 0
% 0.18/0.57 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.57 % No SInE strategy applied
% 0.18/0.57 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.18/0.57 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.57 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.57 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.18/0.57 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.18/0.57 % U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1420190 completed with status 0
% 0.18/0.57 % Result found by U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.57 % No SInE strategy applied
% 0.18/0.57 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.18/0.57 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.57 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.57 % Preprocessing time : 0.007 s
% 0.18/0.57 % Presaturation interreduction done
% 0.18/0.57
% 0.18/0.57 % Proof found!
% 0.18/0.57 % SZS status Unsatisfiable
% 0.18/0.57 % SZS output start CNFRefutation
% See solution above
% 0.18/0.57 % Parsed axioms : 549
% 0.18/0.57 % Removed by relevancy pruning/SinE : 0
% 0.18/0.57 % Initial clauses : 549
% 0.18/0.57 % Removed in clause preprocessing : 6
% 0.18/0.57 % Initial clauses in saturation : 543
% 0.18/0.57 % Processed clauses : 826
% 0.18/0.57 % ...of these trivial : 18
% 0.18/0.57 % ...subsumed : 137
% 0.18/0.57 % ...remaining for further processing : 671
% 0.18/0.57 % Other redundant clauses eliminated : 3
% 0.18/0.57 % Clauses deleted for lack of memory : 0
% 0.18/0.57 % Backward-subsumed : 1
% 0.18/0.57 % Backward-rewritten : 3
% 0.18/0.57 % Generated clauses : 674
% 0.18/0.57 % ...of the previous two non-redundant : 486
% 0.18/0.57 % ...aggressively subsumed : 0
% 0.18/0.57 % Contextual simplify-reflections : 0
% 0.18/0.57 % Paramodulations : 671
% 0.18/0.57 % Factorizations : 0
% 0.18/0.57 % NegExts : 0
% 0.18/0.57 % Equation resolutions : 3
% 0.18/0.57 % Disequality decompositions : 0
% 0.18/0.57 % Total rewrite steps : 331
% 0.18/0.57 % ...of those cached : 191
% 0.18/0.57 % Propositional unsat checks : 0
% 0.18/0.57 % Propositional check models : 0
% 0.18/0.57 % Propositional check unsatisfiable : 0
% 0.18/0.57 % Propositional clauses : 0
% 0.18/0.57 % Propositional clauses after purity: 0
% 0.18/0.57 % Propositional unsat core size : 0
% 0.18/0.57 % Propositional preprocessing time : 0.000
% 0.18/0.57 % Propositional encoding time : 0.000
% 0.18/0.57 % Propositional solver time : 0.000
% 0.18/0.57 % Success case prop preproc time : 0.000
% 0.18/0.57 % Success case prop encoding time : 0.000
% 0.18/0.57 % Success case prop solver time : 0.000
% 0.18/0.57 % Current number of processed clauses : 194
% 0.18/0.57 % Positive orientable unit clauses : 64
% 0.18/0.57 % Positive unorientable unit clauses: 2
% 0.18/0.57 % Negative unit clauses : 16
% 0.18/0.57 % Non-unit-clauses : 112
% 0.18/0.57 % Current number of unprocessed clauses: 672
% 0.18/0.57 % ...number of literals in the above : 1494
% 0.18/0.57 % Current number of archived formulas : 0
% 0.18/0.57 % Current number of archived clauses : 480
% 0.18/0.57 % Clause-clause subsumption calls (NU) : 38175
% 0.18/0.57 % Rec. Clause-clause subsumption calls : 21700
% 0.18/0.57 % Non-unit clause-clause subsumptions : 82
% 0.18/0.57 % Unit Clause-clause subsumption calls : 739
% 0.18/0.57 % Rewrite failures with RHS unbound : 0
% 0.18/0.57 % BW rewrite match attempts : 68
% 0.18/0.57 % BW rewrite match successes : 28
% 0.18/0.57 % Condensation attempts : 0
% 0.18/0.57 % Condensation successes : 0
% 0.18/0.57 % Termbank termtop insertions : 34595
% 0.18/0.57 % Search garbage collected termcells : 1066
% 0.18/0.57
% 0.18/0.57 % -------------------------------------------------
% 0.18/0.57 % User time : 0.079 s
% 0.18/0.57 % System time : 0.009 s
% 0.18/0.57 % Total time : 0.088 s
% 0.18/0.57 % Maximum resident set size: 4604 pages
% 0.18/0.57
% 0.18/0.57 % -------------------------------------------------
% 0.18/0.57 % User time : 0.277 s
% 0.18/0.57 % System time : 0.027 s
% 0.18/0.57 % Total time : 0.304 s
% 0.18/0.57 % Maximum resident set size: 5120 pages
% 0.18/0.57 % E exiting
%------------------------------------------------------------------------------