%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ALG386-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 : n010.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 12:02:04 PM UTC 2026
% Result : Unsatisfiable 0.18s 10.64s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 7 unt; 2 nHn; 12 RR)
% Number of literals : 23 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 11 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_CHAINED_0,axiom,
( ~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_4,negated_conjecture,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_5,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_6,negated_conjecture,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
c_0_4 ).
cnf(c_0_7,negated_conjecture,
~ v_thesis____,
c_0_5 ).
cnf(c_0_8,plain,
( ~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( ~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
( c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
cls_conjecture_1 ).
cnf(c_0_12,negated_conjecture,
~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(sr,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG386-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.40 % Computer : n010.cluster.edu
% 0.13/10.40 % Model : x86_64 x86_64
% 0.13/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.40 % Memory : 8046.5625MB
% 0.13/10.40 % OS : Linux 6.8.0-71-generic
% 0.04/10.40 % CPULimit : 300
% 0.04/10.40 % WCLimit : 300
% 0.04/10.40 % DateTime : Mon Sep 21 13:19:21 UTC 2026
% 0.04/10.40 % CPUTime :
% 0.04/10.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/10.48 Running first-order theorem proving
% 0.04/10.48 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.18/10.64 % Version: 3.5.1
% 0.18/10.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/10.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/10.64 % Starting new_bool_3 with 300s (1) cores
% 0.18/10.64 % Starting new_bool_1 with 300s (1) cores
% 0.18/10.64 % Starting sh5l with 300s (1) cores
% 0.18/10.64 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 954503 completed with status 0
% 0.18/10.64 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/10.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/10.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/10.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/10.64 % No SInE strategy applied
% 0.18/10.64 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.18/10.64 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/10.64 % Starting SubtermCWHack with 136s (1) cores
% 0.18/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/10.64 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.18/10.64 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.18/10.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.18/10.64 % U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 954513 completed with status 0
% 0.18/10.64 % Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 0.18/10.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/10.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/10.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/10.64 % No SInE strategy applied
% 0.18/10.64 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.18/10.64 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/10.64 % Starting SubtermCWHack with 136s (1) cores
% 0.18/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/10.64 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.18/10.64 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.18/10.64 % Preprocessing time : 0.009 s
% 0.18/10.64 % Presaturation interreduction done
% 0.18/10.64
% 0.18/10.64 % Proof found!
% 0.18/10.64 % SZS status Unsatisfiable
% 0.18/10.64 % SZS output start CNFRefutation
% See solution above
% 0.18/10.65 % Parsed axioms : 594
% 0.18/10.65 % Removed by relevancy pruning/SinE : 0
% 0.18/10.65 % Initial clauses : 594
% 0.18/10.65 % Removed in clause preprocessing : 0
% 0.18/10.65 % Initial clauses in saturation : 594
% 0.18/10.65 % Processed clauses : 796
% 0.18/10.65 % ...of these trivial : 1
% 0.18/10.65 % ...subsumed : 55
% 0.18/10.65 % ...remaining for further processing : 740
% 0.18/10.65 % Other redundant clauses eliminated : 0
% 0.18/10.65 % Clauses deleted for lack of memory : 0
% 0.18/10.65 % Backward-subsumed : 1
% 0.18/10.65 % Backward-rewritten : 1
% 0.18/10.65 % Generated clauses : 28
% 0.18/10.65 % ...of the previous two non-redundant : 15
% 0.18/10.65 % ...aggressively subsumed : 0
% 0.18/10.65 % Contextual simplify-reflections : 0
% 0.18/10.65 % Paramodulations : 28
% 0.18/10.65 % Factorizations : 0
% 0.18/10.65 % NegExts : 0
% 0.18/10.65 % Equation resolutions : 0
% 0.18/10.65 % Disequality decompositions : 0
% 0.18/10.65 % Total rewrite steps : 24
% 0.18/10.65 % ...of those cached : 12
% 0.18/10.65 % Propositional unsat checks : 0
% 0.18/10.65 % Propositional check models : 0
% 0.18/10.65 % Propositional check unsatisfiable : 0
% 0.18/10.65 % Propositional clauses : 0
% 0.18/10.65 % Propositional clauses after purity: 0
% 0.18/10.65 % Propositional unsat core size : 0
% 0.18/10.65 % Propositional preprocessing time : 0.000
% 0.18/10.65 % Propositional encoding time : 0.000
% 0.18/10.65 % Propositional solver time : 0.000
% 0.18/10.65 % Success case prop preproc time : 0.000
% 0.18/10.65 % Success case prop encoding time : 0.000
% 0.18/10.65 % Success case prop solver time : 0.000
% 0.18/10.65 % Current number of processed clauses : 200
% 0.18/10.65 % Positive orientable unit clauses : 139
% 0.18/10.65 % Positive unorientable unit clauses: 1
% 0.18/10.65 % Negative unit clauses : 5
% 0.18/10.65 % Non-unit-clauses : 55
% 0.18/10.65 % Current number of unprocessed clauses: 351
% 0.18/10.65 % ...number of literals in the above : 1030
% 0.18/10.65 % Current number of archived formulas : 0
% 0.18/10.65 % Current number of archived clauses : 540
% 0.18/10.65 % Clause-clause subsumption calls (NU) : 43881
% 0.18/10.65 % Rec. Clause-clause subsumption calls : 24367
% 0.18/10.65 % Non-unit clause-clause subsumptions : 56
% 0.18/10.65 % Unit Clause-clause subsumption calls : 5
% 0.18/10.65 % Rewrite failures with RHS unbound : 0
% 0.18/10.65 % BW rewrite match attempts : 23
% 0.18/10.65 % BW rewrite match successes : 11
% 0.18/10.65 % Condensation attempts : 0
% 0.18/10.65 % Condensation successes : 0
% 0.18/10.65 % Termbank termtop insertions : 22644
% 0.18/10.65 % Search garbage collected termcells : 987
% 0.18/10.65
% 0.18/10.65 % -------------------------------------------------
% 0.18/10.65 % User time : 0.062 s
% 0.18/10.65 % System time : 0.011 s
% 0.18/10.65 % Total time : 0.073 s
% 0.18/10.65 % Maximum resident set size: 4820 pages
% 0.18/10.65
% 0.18/10.65 % -------------------------------------------------
% 0.18/10.65 % User time : 0.298 s
% 0.18/10.65 % System time : 0.044 s
% 0.18/10.65 % Total time : 0.343 s
% 0.18/10.65 % Maximum resident set size: 5120 pages
% 0.18/10.65 % E exiting
%------------------------------------------------------------------------------