%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL826-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 01:16:32 PM UTC 2026
% Result : Unsatisfiable 0.51s 0.52s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 27 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 17 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Cons_I1_J_0,axiom,
( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),X3),X2),v_T____)),v_a____),X4))
| ~ hBOOL(hAPP(c_InductTermi_OIT,X1))
| ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,X3),X1),v_T____))
| hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),X1),X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Cons_I1_J_0) ).
cnf(cls_conjecture_1,negated_conjecture,
hBOOL(hAPP(c_InductTermi_OIT,v_xb)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,v_x),v_xb),v_T____)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),v_xb),v_xc))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_0,negated_conjecture,
hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),v_x),v_xc),v_T____)),v_a____),v_xa)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_5,plain,
( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),X3),X2),v_T____)),v_a____),X4))
| ~ hBOOL(hAPP(c_InductTermi_OIT,X1))
| ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,X3),X1),v_T____))
| hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),X1),X2))) ),
inference(fof_simplification,[status(thm)],[cls_Cons_I1_J_0]) ).
cnf(c_0_6,plain,
( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),X3),X2),v_T____)),v_a____),X4))
| ~ hBOOL(hAPP(c_InductTermi_OIT,X1))
| ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,X3),X1),v_T____))
| hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),X1),X2))) ),
c_0_5 ).
cnf(c_0_7,negated_conjecture,
hBOOL(hAPP(c_InductTermi_OIT,v_xb)),
cls_conjecture_1 ).
cnf(c_0_8,negated_conjecture,
( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,X2),v_xb),v_T____))
| ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),X2),X1),v_T____)),v_a____),X3))
| hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),v_xb),X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,v_x),v_xb),v_T____)),
cls_conjecture_2 ).
cnf(c_0_10,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),v_xb),v_xc))),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_11,negated_conjecture,
( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),v_x),X1),v_T____)),v_a____),X2))
| hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),v_xb),X1))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),v_x),v_xc),v_T____)),v_a____),v_xa)),
cls_conjecture_0 ).
cnf(c_0_13,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),v_xb),v_xc))),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL826-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.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:06:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.51/0.52 % Version: 3.5.1
% 0.51/0.52 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.51/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.52 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.51/0.52 % Starting new_bool_3 with 600s (2) cores
% 0.51/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.51/0.52 % Starting sh5l with 300s (1) cores
% 0.51/0.52 % new_bool_3 with pid 1365623 completed with status 0
% 0.51/0.52 % Result found by new_bool_3
% 0.51/0.52 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.51/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.52 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.51/0.52 % Starting new_bool_3 with 600s (2) cores
% 0.51/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.51/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.51/0.52 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.51/0.52 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 0.51/0.52 % Starting SubtermCWHack with 55s (1) cores
% 0.51/0.52 % Starting new_bool_3 with 61s (1) cores
% 0.51/0.52 % new_bool_3 with pid 1365631 completed with status 0
% 0.51/0.52 % Result found by new_bool_3
% 0.51/0.52 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.51/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.52 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.51/0.52 % Starting new_bool_3 with 600s (2) cores
% 0.51/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.51/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.51/0.52 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.51/0.52 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 0.51/0.52 % Starting SubtermCWHack with 55s (1) cores
% 0.51/0.52 % Starting new_bool_3 with 61s (1) cores
% 0.51/0.52 % Preprocessing time : 0.005 s
% 0.51/0.52 % Presaturation interreduction done
% 0.51/0.52
% 0.51/0.52 % Proof found!
% 0.51/0.52 % SZS status Unsatisfiable
% 0.51/0.52 % SZS output start CNFRefutation
% See solution above
% 0.51/0.52 % Parsed axioms : 413
% 0.51/0.52 % Removed by relevancy pruning/SinE : 189
% 0.51/0.52 % Initial clauses : 224
% 0.51/0.52 % Removed in clause preprocessing : 0
% 0.51/0.52 % Initial clauses in saturation : 224
% 0.51/0.52 % Processed clauses : 762
% 0.51/0.52 % ...of these trivial : 28
% 0.51/0.52 % ...subsumed : 274
% 0.51/0.52 % ...remaining for further processing : 460
% 0.51/0.52 % Other redundant clauses eliminated : 4
% 0.51/0.52 % Clauses deleted for lack of memory : 0
% 0.51/0.52 % Backward-subsumed : 2
% 0.51/0.52 % Backward-rewritten : 9
% 0.51/0.52 % Generated clauses : 1834
% 0.51/0.52 % ...of the previous two non-redundant : 1541
% 0.51/0.52 % ...aggressively subsumed : 0
% 0.51/0.52 % Contextual simplify-reflections : 0
% 0.51/0.52 % Paramodulations : 1814
% 0.51/0.52 % Factorizations : 2
% 0.51/0.52 % NegExts : 0
% 0.51/0.52 % Equation resolutions : 18
% 0.51/0.52 % Disequality decompositions : 0
% 0.51/0.52 % Total rewrite steps : 877
% 0.51/0.52 % ...of those cached : 640
% 0.51/0.52 % Propositional unsat checks : 0
% 0.51/0.52 % Propositional check models : 0
% 0.51/0.52 % Propositional check unsatisfiable : 0
% 0.51/0.52 % Propositional clauses : 0
% 0.51/0.52 % Propositional clauses after purity: 0
% 0.51/0.52 % Propositional unsat core size : 0
% 0.51/0.52 % Propositional preprocessing time : 0.000
% 0.51/0.52 % Propositional encoding time : 0.000
% 0.51/0.52 % Propositional solver time : 0.000
% 0.51/0.52 % Success case prop preproc time : 0.000
% 0.51/0.52 % Success case prop encoding time : 0.000
% 0.51/0.52 % Success case prop solver time : 0.000
% 0.51/0.52 % Current number of processed clauses : 280
% 0.51/0.52 % Positive orientable unit clauses : 138
% 0.51/0.52 % Positive unorientable unit clauses: 4
% 0.51/0.52 % Negative unit clauses : 82
% 0.51/0.52 % Non-unit-clauses : 56
% 0.51/0.52 % Current number of unprocessed clauses: 1171
% 0.51/0.52 % ...number of literals in the above : 1749
% 0.51/0.52 % Current number of archived formulas : 0
% 0.51/0.52 % Current number of archived clauses : 179
% 0.51/0.52 % Clause-clause subsumption calls (NU) : 2112
% 0.51/0.52 % Rec. Clause-clause subsumption calls : 1742
% 0.51/0.52 % Non-unit clause-clause subsumptions : 56
% 0.51/0.52 % Unit Clause-clause subsumption calls : 1377
% 0.51/0.52 % Rewrite failures with RHS unbound : 0
% 0.51/0.52 % BW rewrite match attempts : 1206
% 0.51/0.52 % BW rewrite match successes : 69
% 0.51/0.52 % Condensation attempts : 0
% 0.51/0.52 % Condensation successes : 0
% 0.51/0.52 % Termbank termtop insertions : 41722
% 0.51/0.52 % Search garbage collected termcells : 1406
% 0.51/0.52
% 0.51/0.52 % -------------------------------------------------
% 0.51/0.52 % User time : 0.077 s
% 0.51/0.52 % System time : 0.013 s
% 0.51/0.52 % Total time : 0.091 s
% 0.51/0.52 % Maximum resident set size: 4232 pages
% 0.51/0.52
% 0.51/0.52 % -------------------------------------------------
% 0.51/0.52 % User time : 0.164 s
% 0.51/0.52 % System time : 0.025 s
% 0.51/0.52 % Total time : 0.189 s
% 0.51/0.52 % Maximum resident set size: 5120 pages
% 0.51/0.52 % E exiting
%------------------------------------------------------------------------------