%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT083-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 : n008.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:41 PM UTC 2026
% Result : Unsatisfiable 0.14s 20.71s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 11 unt; 0 nHn; 21 RR)
% Number of literals : 44 ( 2 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-4 aty)
% Number of variables : 50 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PiE_0,axiom,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X1,X4)),X5),c_FuncSet_OPi(X3,X6,X1,X4)))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| hBOOL(hAPP(hAPP(c_in(X4),hAPP(X5,X2)),hAPP(X6,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PiE_0) ).
cnf(cls_CHAINED_0_01,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_01) ).
cnf(cls_COMBK__def_0,axiom,
hAPP(c_COMBK(X1,X2,X3),X4) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_COMBK__def_0) ).
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X3,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).
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,c_COMBK(v_Lab____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi))),c_Arrow__Order__Mirabelle_OLin)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_mem__def_0,axiom,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_const__Lin__Prof_0,axiom,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),X1),c_Arrow__Order__Mirabelle_OLin))
| 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))),c_COMBK(X1,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi)),c_Arrow__Order__Mirabelle_OProf)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_const__Lin__Prof_0) ).
cnf(cls_CHAINED_0,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),v_Lab____),c_Arrow__Order__Mirabelle_OLin)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(c_0_8,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X1,X4)),X5),c_FuncSet_OPi(X3,X6,X1,X4)))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| hBOOL(hAPP(hAPP(c_in(X4),hAPP(X5,X2)),hAPP(X6,X2))) ),
inference(fof_simplification,[status(thm)],[cls_PiE_0]) ).
cnf(c_0_9,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X1,X4)),X5),c_FuncSet_OPi(X3,X6,X1,X4)))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| hBOOL(hAPP(hAPP(c_in(X4),hAPP(X5,X2)),hAPP(X6,X2))) ),
c_0_8 ).
cnf(c_0_10,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_01 ).
cnf(c_0_11,axiom,
hAPP(c_COMBK(X1,X2,X3),X4) = X1,
cls_COMBK__def_0 ).
cnf(c_0_12,plain,
( ~ hBOOL(hAPP(X3,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_13,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,c_COMBK(v_Lab____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi))),c_Arrow__Order__Mirabelle_OLin)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_14,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
( ~ hBOOL(hAPP(X3,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_17,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),X1),c_Arrow__Order__Mirabelle_OLin))
| 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))),c_COMBK(X1,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi)),c_Arrow__Order__Mirabelle_OProf)) ),
inference(fof_simplification,[status(thm)],[cls_const__Lin__Prof_0]) ).
cnf(c_0_18,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,c_COMBK(v_Lab____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi))),c_Arrow__Order__Mirabelle_OLin)),
c_0_13 ).
cnf(c_0_19,plain,
( ~ hBOOL(hAPP(c_Arrow__Order__Mirabelle_OProf,X1))
| 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_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
| hBOOL(hAPP(X1,X2)) ),
c_0_16 ).
cnf(c_0_21,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),X1),c_Arrow__Order__Mirabelle_OLin))
| 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))),c_COMBK(X1,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi)),c_Arrow__Order__Mirabelle_OProf)) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
~ hBOOL(hAPP(c_Arrow__Order__Mirabelle_OProf,c_COMBK(v_Lab____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),X1),c_Arrow__Order__Mirabelle_OLin))
| hBOOL(hAPP(c_Arrow__Order__Mirabelle_OProf,c_COMBK(X1,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),v_Lab____),c_Arrow__Order__Mirabelle_OLin)),
cls_CHAINED_0 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SCT083-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.09/20.39 % Computer : n008.cluster.edu
% 0.09/20.39 % Model : x86_64 x86_64
% 0.09/20.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/20.39 % Memory : 8046.5625MB
% 0.09/20.39 % OS : Linux 6.8.0-71-generic
% 0.09/20.39 % CPULimit : 300
% 0.09/20.39 % WCLimit : 300
% 0.09/20.39 % DateTime : Mon Sep 21 04:31:15 UTC 2026
% 0.09/20.39 % CPUTime :
% 0.09/20.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/20.44 Running first-order theorem proving
% 0.14/20.44 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.14/20.71 % Version: 3.5.1
% 0.14/20.71 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/20.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/20.71 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/20.71 % Starting new_bool_3 with 600s (2) cores
% 0.14/20.71 % Starting new_bool_1 with 300s (1) cores
% 0.14/20.71 % Starting sh5l with 300s (1) cores
% 0.14/20.71 % new_bool_3 with pid 141061 completed with status 0
% 0.14/20.71 % Result found by new_bool_3
% 0.14/20.71 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/20.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/20.71 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/20.71 % Starting new_bool_3 with 600s (2) cores
% 0.14/20.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/20.71 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/20.71 % Search class: FGHSM-FSLS32-DFFFFFNN
% 0.14/20.71 % Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.14/20.71 % Starting SubtermCWHack with 61s (1) cores
% 0.14/20.71 % Starting SAT001_MinMin_p005000_rr_RG with 200s (1) cores
% 0.14/20.71 % SAT001_MinMin_p005000_rr_RG with pid 141066 completed with status 0
% 0.14/20.71 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/20.71 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/20.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/20.71 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/20.71 % Starting new_bool_3 with 600s (2) cores
% 0.14/20.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/20.71 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/20.71 % Search class: FGHSM-FSLS32-DFFFFFNN
% 0.14/20.71 % Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.14/20.71 % Starting SubtermCWHack with 61s (1) cores
% 0.14/20.71 % Starting SAT001_MinMin_p005000_rr_RG with 200s (1) cores
% 0.14/20.71 % Preprocessing time : 0.007 s
% 0.14/20.71 % Presaturation interreduction done
% 0.14/20.71
% 0.14/20.71 % Proof found!
% 0.14/20.71 % SZS status Unsatisfiable
% 0.14/20.71 % SZS output start CNFRefutation
% See solution above
% 0.14/20.71 % Parsed axioms : 752
% 0.14/20.71 % Removed by relevancy pruning/SinE : 451
% 0.14/20.71 % Initial clauses : 301
% 0.14/20.71 % Removed in clause preprocessing : 0
% 0.14/20.71 % Initial clauses in saturation : 301
% 0.14/20.71 % Processed clauses : 1720
% 0.14/20.71 % ...of these trivial : 24
% 0.14/20.71 % ...subsumed : 1036
% 0.14/20.71 % ...remaining for further processing : 660
% 0.14/20.71 % Other redundant clauses eliminated : 86
% 0.14/20.71 % Clauses deleted for lack of memory : 0
% 0.14/20.71 % Backward-subsumed : 9
% 0.14/20.71 % Backward-rewritten : 6
% 0.14/20.71 % Generated clauses : 7467
% 0.14/20.71 % ...of the previous two non-redundant : 6324
% 0.14/20.71 % ...aggressively subsumed : 0
% 0.14/20.71 % Contextual simplify-reflections : 0
% 0.14/20.71 % Paramodulations : 7375
% 0.14/20.71 % Factorizations : 0
% 0.14/20.71 % NegExts : 0
% 0.14/20.71 % Equation resolutions : 92
% 0.14/20.71 % Disequality decompositions : 0
% 0.14/20.71 % Total rewrite steps : 2519
% 0.14/20.71 % ...of those cached : 1630
% 0.14/20.71 % Propositional unsat checks : 0
% 0.14/20.71 % Propositional check models : 0
% 0.14/20.71 % Propositional check unsatisfiable : 0
% 0.14/20.71 % Propositional clauses : 0
% 0.14/20.71 % Propositional clauses after purity: 0
% 0.14/20.71 % Propositional unsat core size : 0
% 0.14/20.71 % Propositional preprocessing time : 0.000
% 0.14/20.71 % Propositional encoding time : 0.000
% 0.14/20.71 % Propositional solver time : 0.000
% 0.14/20.71 % Success case prop preproc time : 0.000
% 0.14/20.71 % Success case prop encoding time : 0.000
% 0.14/20.71 % Success case prop solver time : 0.000
% 0.14/20.71 % Current number of processed clauses : 403
% 0.14/20.71 % Positive orientable unit clauses : 95
% 0.14/20.71 % Positive unorientable unit clauses: 8
% 0.14/20.71 % Negative unit clauses : 59
% 0.14/20.71 % Non-unit-clauses : 241
% 0.14/20.71 % Current number of unprocessed clauses: 5110
% 0.14/20.71 % ...number of literals in the above : 10697
% 0.14/20.71 % Current number of archived formulas : 0
% 0.14/20.71 % Current number of archived clauses : 257
% 0.14/20.71 % Clause-clause subsumption calls (NU) : 15440
% 0.14/20.71 % Rec. Clause-clause subsumption calls : 13547
% 0.14/20.71 % Non-unit clause-clause subsumptions : 307
% 0.14/20.71 % Unit Clause-clause subsumption calls : 1228
% 0.14/20.71 % Rewrite failures with RHS unbound : 0
% 0.14/20.71 % BW rewrite match attempts : 705
% 0.14/20.71 % BW rewrite match successes : 122
% 0.14/20.71 % Condensation attempts : 0
% 0.14/20.71 % Condensation successes : 0
% 0.14/20.71 % Termbank termtop insertions : 194981
% 0.14/20.71 % Search garbage collected termcells : 3175
% 0.14/20.71
% 0.14/20.71 % -------------------------------------------------
% 0.14/20.71 % User time : 0.211 s
% 0.14/20.71 % System time : 0.012 s
% 0.14/20.71 % Total time : 0.223 s
% 0.14/20.71 % Maximum resident set size: 4560 pages
% 0.14/20.71
% 0.14/20.71 % -------------------------------------------------
% 0.14/20.71 % User time : 0.439 s
% 0.14/20.71 % System time : 0.032 s
% 0.14/20.71 % Total time : 0.471 s
% 0.14/20.71 % Maximum resident set size: 5376 pages
% 0.14/20.71 % E exiting
%------------------------------------------------------------------------------