%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG391-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 11:56:01 AM UTC 2026
% Result : Unsatisfiable 0.24s 5.72s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of clauses : 7 ( 4 unt; 0 nHn; 7 RR)
% Number of literals : 13 ( 12 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
( c_Polynomial_Odegree(X1,t_a) != c_Polynomial_Odegree(v_cs____,t_a)
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,X1),t_a) != c_Polynomial_Opoly(X1,hAPP(v_x,X1),t_a)
| X1 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_2,negated_conjecture,
( c_Polynomial_Odegree(X1,t_a) != c_Polynomial_Odegree(v_cs____,t_a)
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,X1),t_a) != c_Polynomial_Opoly(X1,hAPP(v_x,X1),t_a)
| X1 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_3,negated_conjecture,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_4,negated_conjecture,
( c_Polynomial_Odegree(X1,t_a) != c_Polynomial_Odegree(v_cs____,t_a)
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,X1),t_a) != c_Polynomial_Opoly(X1,hAPP(v_x,X1),t_a)
| X1 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
c_0_2 ).
cnf(c_0_5,negated_conjecture,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
c_0_3 ).
cnf(c_0_6,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_4]),c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ALG391-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/5.47 % Computer : n013.cluster.edu
% 0.20/5.47 % Model : x86_64 x86_64
% 0.20/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.47 % Memory : 8046.5625MB
% 0.20/5.47 % OS : Linux 6.8.0-71-generic
% 0.20/5.47 % CPULimit : 300
% 0.20/5.47 % WCLimit : 300
% 0.20/5.47 % DateTime : Mon Sep 21 13:18:20 UTC 2026
% 0.20/5.48 % CPUTime :
% 0.20/5.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/5.54 Running first-order theorem proving
% 0.24/5.54 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.24/5.72 % Version: 3.5.1
% 0.24/5.72 % Preprocessing class: FMLMSMSSSSSNFFN.
% 0.24/5.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.72 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 1500s (5) cores
% 0.24/5.72 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.72 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.72 % Starting sh5l with 300s (1) cores
% 0.24/5.72 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 849718 completed with status 0
% 0.24/5.72 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 0.24/5.72 % Preprocessing class: FMLMSMSSSSSNFFN.
% 0.24/5.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.72 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 1500s (5) cores
% 0.24/5.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.72 % SinE strategy is gf600_h_gu_R05_F100_L20000
% 0.24/5.72 % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.24/5.72 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.72 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.72 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 151s (1) cores
% 0.24/5.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 0.24/5.72 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 0.24/5.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 0.24/5.72 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 849726 completed with status 0
% 0.24/5.72 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 0.24/5.72 % Preprocessing class: FMLMSMSSSSSNFFN.
% 0.24/5.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.72 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 1500s (5) cores
% 0.24/5.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.72 % SinE strategy is gf600_h_gu_R05_F100_L20000
% 0.24/5.72 % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.24/5.72 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.72 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.72 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 151s (1) cores
% 0.24/5.72 % Preprocessing time : 0.012 s
% 0.24/5.72
% 0.24/5.72 % Proof found!
% 0.24/5.72 % SZS status Unsatisfiable
% 0.24/5.72 % SZS output start CNFRefutation
% See solution above
% 0.24/5.72 % Parsed axioms : 1282
% 0.24/5.72 % Removed by relevancy pruning/SinE : 162
% 0.24/5.72 % Initial clauses : 1120
% 0.24/5.72 % Removed in clause preprocessing : 2
% 0.24/5.72 % Initial clauses in saturation : 1118
% 0.24/5.72 % Processed clauses : 133
% 0.24/5.72 % ...of these trivial : 1
% 0.24/5.72 % ...subsumed : 9
% 0.24/5.72 % ...remaining for further processing : 123
% 0.24/5.72 % Other redundant clauses eliminated : 0
% 0.24/5.72 % Clauses deleted for lack of memory : 0
% 0.24/5.72 % Backward-subsumed : 0
% 0.24/5.72 % Backward-rewritten : 0
% 0.24/5.72 % Generated clauses : 6
% 0.24/5.72 % ...of the previous two non-redundant : 4
% 0.24/5.72 % ...aggressively subsumed : 0
% 0.24/5.72 % Contextual simplify-reflections : 0
% 0.24/5.72 % Paramodulations : 3
% 0.24/5.72 % Factorizations : 0
% 0.24/5.72 % NegExts : 0
% 0.24/5.72 % Equation resolutions : 3
% 0.24/5.72 % Disequality decompositions : 0
% 0.24/5.72 % Total rewrite steps : 7
% 0.24/5.72 % ...of those cached : 5
% 0.24/5.72 % Propositional unsat checks : 0
% 0.24/5.72 % Propositional check models : 0
% 0.24/5.72 % Propositional check unsatisfiable : 0
% 0.24/5.72 % Propositional clauses : 0
% 0.24/5.72 % Propositional clauses after purity: 0
% 0.24/5.72 % Propositional unsat core size : 0
% 0.24/5.72 % Propositional preprocessing time : 0.000
% 0.24/5.72 % Propositional encoding time : 0.000
% 0.24/5.72 % Propositional solver time : 0.000
% 0.24/5.72 % Success case prop preproc time : 0.000
% 0.24/5.72 % Success case prop encoding time : 0.000
% 0.24/5.72 % Success case prop solver time : 0.000
% 0.24/5.72 % Current number of processed clauses : 123
% 0.24/5.72 % Positive orientable unit clauses : 60
% 0.24/5.72 % Positive unorientable unit clauses: 0
% 0.24/5.72 % Negative unit clauses : 11
% 0.24/5.72 % Non-unit-clauses : 52
% 0.24/5.72 % Current number of unprocessed clauses: 989
% 0.24/5.72 % ...number of literals in the above : 2935
% 0.24/5.72 % Current number of archived formulas : 0
% 0.24/5.72 % Current number of archived clauses : 1
% 0.24/5.72 % Clause-clause subsumption calls (NU) : 522
% 0.24/5.72 % Rec. Clause-clause subsumption calls : 479
% 0.24/5.72 % Non-unit clause-clause subsumptions : 1
% 0.24/5.72 % Unit Clause-clause subsumption calls : 36
% 0.24/5.72 % Rewrite failures with RHS unbound : 0
% 0.24/5.72 % BW rewrite match attempts : 1
% 0.24/5.72 % BW rewrite match successes : 0
% 0.24/5.72 % Condensation attempts : 0
% 0.24/5.72 % Condensation successes : 0
% 0.24/5.72 % Termbank termtop insertions : 38660
% 0.24/5.72 % Search garbage collected termcells : 2647
% 0.24/5.72
% 0.24/5.72 % -------------------------------------------------
% 0.24/5.72 % User time : 0.055 s
% 0.24/5.72 % System time : 0.013 s
% 0.24/5.72 % Total time : 0.069 s
% 0.24/5.72 % Maximum resident set size: 6260 pages
% 0.24/5.72
% 0.24/5.72 % -------------------------------------------------
% 0.24/5.72 % User time : 0.199 s
% 0.24/5.72 % System time : 0.044 s
% 0.24/5.72 % Total time : 0.244 s
% 0.24/5.72 % Maximum resident set size: 5632 pages
% 0.24/5.72 % E exiting
%------------------------------------------------------------------------------