%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT031-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 : n026.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.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-4 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_funcset__mem_0,axiom,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X5,X1)),X2),c_FuncSet_OPi(X6,c_COMBK(X4,tc_fun(X1,tc_bool),X5),X5,X1)))
| ~ hBOOL(hAPP(hAPP(c_in(X5),X3),X6))
| hBOOL(hAPP(hAPP(c_in(X1),hAPP(X2,X3)),X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_funcset__mem_0) ).
cnf(cls_CHAINED_0,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),v_F),c_FuncSet_OPi(c_Arrow__Order__Mirabelle_OProf,c_COMBK(c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_bool),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),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(cls_conjecture_0,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),hAPP(v_F,v_Q____)),c_Arrow__Order__Mirabelle_OLin)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_CHAINED_0_01,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),v_Q____),c_Arrow__Order__Mirabelle_OProf)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).
cnf(c_0_4,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X5,X1)),X2),c_FuncSet_OPi(X6,c_COMBK(X4,tc_fun(X1,tc_bool),X5),X5,X1)))
| ~ hBOOL(hAPP(hAPP(c_in(X5),X3),X6))
| hBOOL(hAPP(hAPP(c_in(X1),hAPP(X2,X3)),X4)) ),
inference(fof_simplification,[status(thm)],[cls_funcset__mem_0]) ).
cnf(c_0_5,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X5,X1)),X2),c_FuncSet_OPi(X6,c_COMBK(X4,tc_fun(X1,tc_bool),X5),X5,X1)))
| ~ hBOOL(hAPP(hAPP(c_in(X5),X3),X6))
| hBOOL(hAPP(hAPP(c_in(X1),hAPP(X2,X3)),X4)) ),
c_0_4 ).
cnf(c_0_6,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),v_F),c_FuncSet_OPi(c_Arrow__Order__Mirabelle_OProf,c_COMBK(c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_bool),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)))),
cls_CHAINED_0 ).
cnf(c_0_7,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),hAPP(v_F,v_Q____)),c_Arrow__Order__Mirabelle_OLin)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_8,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),X1),c_Arrow__Order__Mirabelle_OProf))
| hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),hAPP(v_F,X1)),c_Arrow__Order__Mirabelle_OLin)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),v_Q____),c_Arrow__Order__Mirabelle_OProf)),
cls_CHAINED_0_01 ).
cnf(c_0_10,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),hAPP(v_F,v_Q____)),c_Arrow__Order__Mirabelle_OLin)),
c_0_7 ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SCT031-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.37 % Computer : n026.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:29:36 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.23/0.54 % Version: 3.5.1
% 0.23/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 % Starting sh5l with 300s (1) cores
% 0.23/0.54 % new_bool_3 with pid 1364664 completed with status 0
% 0.23/0.54 % Result found by new_bool_3
% 0.23/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 % Search class: FGHSM-FFMF32-DFFFFFNN
% 0.23/0.54 % partial match(1): FGHSM-FFMF32-SFFFFFNN
% 0.23/0.54 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.54 % SubtermCWHack with pid 1364667 completed with status 0
% 0.23/0.54 % Result found by SubtermCWHack
% 0.23/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 % Search class: FGHSM-FFMF32-DFFFFFNN
% 0.23/0.54 % partial match(1): FGHSM-FFMF32-SFFFFFNN
% 0.23/0.54 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.54 % Preprocessing time : 0.002 s
% 0.23/0.54
% 0.23/0.54 % Proof found!
% 0.23/0.54 % SZS status Unsatisfiable
% 0.23/0.54 % SZS output start CNFRefutation
% See solution above
% 0.23/0.54 % Parsed axioms : 696
% 0.23/0.54 % Removed by relevancy pruning/SinE : 673
% 0.23/0.54 % Initial clauses : 23
% 0.23/0.54 % Removed in clause preprocessing : 0
% 0.23/0.54 % Initial clauses in saturation : 23
% 0.23/0.54 % Processed clauses : 90
% 0.23/0.54 % ...of these trivial : 2
% 0.23/0.54 % ...subsumed : 40
% 0.23/0.54 % ...remaining for further processing : 48
% 0.23/0.54 % Other redundant clauses eliminated : 0
% 0.23/0.54 % Clauses deleted for lack of memory : 0
% 0.23/0.54 % Backward-subsumed : 1
% 0.23/0.54 % Backward-rewritten : 3
% 0.23/0.54 % Generated clauses : 84
% 0.23/0.54 % ...of the previous two non-redundant : 79
% 0.23/0.54 % ...aggressively subsumed : 0
% 0.23/0.54 % Contextual simplify-reflections : 0
% 0.23/0.54 % Paramodulations : 82
% 0.23/0.54 % Factorizations : 0
% 0.23/0.54 % NegExts : 0
% 0.23/0.54 % Equation resolutions : 2
% 0.23/0.54 % Disequality decompositions : 0
% 0.23/0.54 % Total rewrite steps : 8
% 0.23/0.54 % ...of those cached : 0
% 0.23/0.54 % Propositional unsat checks : 0
% 0.23/0.54 % Propositional check models : 0
% 0.23/0.54 % Propositional check unsatisfiable : 0
% 0.23/0.54 % Propositional clauses : 0
% 0.23/0.54 % Propositional clauses after purity: 0
% 0.23/0.54 % Propositional unsat core size : 0
% 0.23/0.54 % Propositional preprocessing time : 0.000
% 0.23/0.54 % Propositional encoding time : 0.000
% 0.23/0.54 % Propositional solver time : 0.000
% 0.23/0.54 % Success case prop preproc time : 0.000
% 0.23/0.54 % Success case prop encoding time : 0.000
% 0.23/0.54 % Success case prop solver time : 0.000
% 0.23/0.54 % Current number of processed clauses : 44
% 0.23/0.54 % Positive orientable unit clauses : 9
% 0.23/0.54 % Positive unorientable unit clauses: 2
% 0.23/0.54 % Negative unit clauses : 2
% 0.23/0.54 % Non-unit-clauses : 31
% 0.23/0.54 % Current number of unprocessed clauses: 8
% 0.23/0.54 % ...number of literals in the above : 22
% 0.23/0.54 % Current number of archived formulas : 0
% 0.23/0.54 % Current number of archived clauses : 4
% 0.23/0.54 % Clause-clause subsumption calls (NU) : 313
% 0.23/0.54 % Rec. Clause-clause subsumption calls : 262
% 0.23/0.54 % Non-unit clause-clause subsumptions : 26
% 0.23/0.54 % Unit Clause-clause subsumption calls : 10
% 0.23/0.54 % Rewrite failures with RHS unbound : 25
% 0.23/0.54 % BW rewrite match attempts : 9
% 0.23/0.54 % BW rewrite match successes : 6
% 0.23/0.54 % Condensation attempts : 0
% 0.23/0.54 % Condensation successes : 0
% 0.23/0.54 % Termbank termtop insertions : 12616
% 0.23/0.54 % Search garbage collected termcells : 3092
% 0.23/0.54
% 0.23/0.54 % -------------------------------------------------
% 0.23/0.54 % User time : 0.011 s
% 0.23/0.54 % System time : 0.005 s
% 0.23/0.54 % Total time : 0.016 s
% 0.23/0.54 % Maximum resident set size: 4228 pages
% 0.23/0.54
% 0.23/0.54 % -------------------------------------------------
% 0.23/0.54 % User time : 0.054 s
% 0.23/0.54 % System time : 0.012 s
% 0.23/0.54 % Total time : 0.066 s
% 0.23/0.54 % Maximum resident set size: 5376 pages
% 0.23/0.54 % E exiting
%------------------------------------------------------------------------------