%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT074-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:40 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.47s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-4 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Lin__irrefl_0,axiom,
( ~ c_in(X3,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(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Lin__irrefl_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_CHAINED_0_01,axiom,
c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).
cnf(cls_CHAINED_0,axiom,
c_in(v_Lab____,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_CHAINED_0) ).
cnf(c_0_4,plain,
( ~ c_in(X3,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(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(fof_simplification,[status(thm)],[cls_Lin__irrefl_0]) ).
cnf(c_0_5,plain,
( ~ c_in(X3,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(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
c_0_4 ).
cnf(c_0_6,negated_conjecture,
c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
cls_conjecture_0 ).
cnf(c_0_7,axiom,
c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
cls_CHAINED_0_01 ).
cnf(c_0_8,axiom,
c_in(v_Lab____,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,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SCT074-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.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 04:30:05 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.47 % Version: 3.5.1
% 0.11/0.47 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.11/0.47 % Starting new_bool_3 with 600s (2) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % Starting sh5l with 300s (1) cores
% 0.11/0.47 % new_bool_1 with pid 1684338 completed with status 0
% 0.11/0.47 % Result found by new_bool_1
% 0.11/0.47 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.11/0.47 % Starting new_bool_3 with 600s (2) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.47 % Search class: FGHSF-FFSS32-SFFFFFNN
% 0.11/0.47 % partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.11/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.47 % SubtermCWHack with pid 1684341 completed with status 0
% 0.11/0.47 % Result found by SubtermCWHack
% 0.11/0.47 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.11/0.47 % Starting new_bool_3 with 600s (2) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.47 % Search class: FGHSF-FFSS32-SFFFFFNN
% 0.11/0.47 % partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.11/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.47 % Preprocessing time : 0.002 s
% 0.11/0.47
% 0.11/0.47 % Proof found!
% 0.11/0.47 % SZS status Unsatisfiable
% 0.11/0.47 % SZS output start CNFRefutation
% See solution above
% 0.11/0.47 % Parsed axioms : 709
% 0.11/0.47 % Removed by relevancy pruning/SinE : 701
% 0.11/0.47 % Initial clauses : 8
% 0.11/0.47 % Removed in clause preprocessing : 0
% 0.11/0.47 % Initial clauses in saturation : 8
% 0.11/0.47 % Processed clauses : 6
% 0.11/0.47 % ...of these trivial : 0
% 0.11/0.47 % ...subsumed : 0
% 0.11/0.47 % ...remaining for further processing : 6
% 0.11/0.47 % Other redundant clauses eliminated : 0
% 0.11/0.47 % Clauses deleted for lack of memory : 0
% 0.11/0.47 % Backward-subsumed : 0
% 0.11/0.47 % Backward-rewritten : 0
% 0.11/0.47 % Generated clauses : 4
% 0.11/0.47 % ...of the previous two non-redundant : 0
% 0.11/0.47 % ...aggressively subsumed : 0
% 0.11/0.47 % Contextual simplify-reflections : 0
% 0.11/0.47 % Paramodulations : 2
% 0.11/0.47 % Factorizations : 0
% 0.11/0.47 % NegExts : 0
% 0.11/0.47 % Equation resolutions : 2
% 0.11/0.47 % Disequality decompositions : 0
% 0.11/0.47 % Total rewrite steps : 2
% 0.11/0.47 % ...of those cached : 0
% 0.11/0.47 % Propositional unsat checks : 0
% 0.11/0.47 % Propositional check models : 0
% 0.11/0.47 % Propositional check unsatisfiable : 0
% 0.11/0.47 % Propositional clauses : 0
% 0.11/0.47 % Propositional clauses after purity: 0
% 0.11/0.47 % Propositional unsat core size : 0
% 0.11/0.47 % Propositional preprocessing time : 0.000
% 0.11/0.47 % Propositional encoding time : 0.000
% 0.11/0.47 % Propositional solver time : 0.000
% 0.11/0.47 % Success case prop preproc time : 0.000
% 0.11/0.47 % Success case prop encoding time : 0.000
% 0.11/0.47 % Success case prop solver time : 0.000
% 0.11/0.47 % Current number of processed clauses : 6
% 0.11/0.47 % Positive orientable unit clauses : 3
% 0.11/0.47 % Positive unorientable unit clauses: 0
% 0.11/0.47 % Negative unit clauses : 0
% 0.11/0.47 % Non-unit-clauses : 3
% 0.11/0.47 % Current number of unprocessed clauses: 2
% 0.11/0.47 % ...number of literals in the above : 8
% 0.11/0.47 % Current number of archived formulas : 0
% 0.11/0.47 % Current number of archived clauses : 0
% 0.11/0.47 % Clause-clause subsumption calls (NU) : 4
% 0.11/0.47 % Rec. Clause-clause subsumption calls : 4
% 0.11/0.47 % Non-unit clause-clause subsumptions : 0
% 0.11/0.47 % Unit Clause-clause subsumption calls : 0
% 0.11/0.47 % Rewrite failures with RHS unbound : 0
% 0.11/0.47 % BW rewrite match attempts : 0
% 0.11/0.47 % BW rewrite match successes : 0
% 0.11/0.47 % Condensation attempts : 0
% 0.11/0.47 % Condensation successes : 0
% 0.11/0.47 % Termbank termtop insertions : 8623
% 0.11/0.47 % Search garbage collected termcells : 3083
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.007 s
% 0.11/0.47 % System time : 0.002 s
% 0.11/0.47 % Total time : 0.009 s
% 0.11/0.47 % Maximum resident set size: 4220 pages
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.029 s
% 0.11/0.47 % System time : 0.007 s
% 0.11/0.47 % Total time : 0.036 s
% 0.11/0.47 % Maximum resident set size: 5376 pages
% 0.11/0.47 % E exiting
%------------------------------------------------------------------------------