%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG372-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 : n001.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:55:59 AM UTC 2026
% Result : Unsatisfiable 0.58s 0.79s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 28 ( 12 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_norm__zero_0,axiom,
( ~ class_RealVector_Oreal__normed__vector(X1)
| c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_norm__zero_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal)
| c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector,axiom,
class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector) ).
cnf(cls_equation__minus__iff_1,axiom,
( ~ class_OrderedGroup_Ogroup__add(X1)
| X2 = c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(X2,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_equation__minus__iff_1) ).
cnf(cls_rp_0,axiom,
c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_rp_0) ).
cnf(clsarity_RealDef__Oreal__OrderedGroup_Ogroup__add,axiom,
class_OrderedGroup_Ogroup__add(tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_RealDef__Oreal__OrderedGroup_Ogroup__add) ).
cnf(c_0_6,plain,
( ~ class_RealVector_Oreal__normed__vector(X1)
| c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_norm__zero_0]) ).
cnf(c_0_7,negated_conjecture,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal)
| c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_8,plain,
( ~ class_RealVector_Oreal__normed__vector(X1)
| c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal) ),
c_0_6 ).
cnf(c_0_9,axiom,
class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector ).
cnf(c_0_10,plain,
( ~ class_OrderedGroup_Ogroup__add(X1)
| X2 = c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(X2,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_equation__minus__iff_1]) ).
cnf(c_0_11,negated_conjecture,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal)
| c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal) ),
c_0_7 ).
cnf(c_0_12,plain,
c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
cls_rp_0 ).
cnf(c_0_14,plain,
( ~ class_OrderedGroup_Ogroup__add(X1)
| X2 = c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(X2,X1),X1) ),
c_0_10 ).
cnf(c_0_15,axiom,
class_OrderedGroup_Ogroup__add(tc_RealDef_Oreal),
clsarity_RealDef__Oreal__OrderedGroup_Ogroup__add ).
cnf(c_0_16,negated_conjecture,
c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal) != c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_p,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
c_HOL_Ouminus__class_Ouminus(c_HOL_Ouminus__class_Ouminus(X1,tc_RealDef_Oreal),tc_RealDef_Oreal) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG372-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 13:23:45 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.58/0.79 % Version: 3.5.1
% 0.58/0.79 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.58/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.79 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.58/0.79 % Starting new_bool_3 with 600s (2) cores
% 0.58/0.79 % Starting new_bool_1 with 600s (2) cores
% 0.58/0.79 % Starting sh5l with 300s (1) cores
% 0.58/0.79 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 3217109 completed with status 0
% 0.58/0.79 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.58/0.79 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.58/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.79 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.58/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.58/0.79 % No SInE strategy applied
% 0.58/0.79 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.58/0.79 % Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 0.58/0.79 % Starting SubtermCWHack with 82s (1) cores
% 0.58/0.79 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 0.58/0.79 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 74s (1) cores
% 0.58/0.79 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 3217119 completed with status 0
% 0.58/0.79 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.58/0.79 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.58/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.79 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.58/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.58/0.79 % No SInE strategy applied
% 0.58/0.79 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.58/0.79 % Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 0.58/0.79 % Starting SubtermCWHack with 82s (1) cores
% 0.58/0.79 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 0.58/0.79 % Preprocessing time : 0.019 s
% 0.58/0.79 % Presaturation interreduction done
% 0.58/0.79
% 0.58/0.79 % Proof found!
% 0.58/0.79 % SZS status Unsatisfiable
% 0.58/0.79 % SZS output start CNFRefutation
% See solution above
% 0.58/0.79 % Parsed axioms : 952
% 0.58/0.79 % Removed by relevancy pruning/SinE : 0
% 0.58/0.79 % Initial clauses : 952
% 0.58/0.79 % Removed in clause preprocessing : 0
% 0.58/0.79 % Initial clauses in saturation : 952
% 0.58/0.79 % Processed clauses : 1268
% 0.58/0.79 % ...of these trivial : 4
% 0.58/0.79 % ...subsumed : 107
% 0.58/0.79 % ...remaining for further processing : 1157
% 0.58/0.79 % Other redundant clauses eliminated : 1
% 0.58/0.79 % Clauses deleted for lack of memory : 0
% 0.58/0.79 % Backward-subsumed : 1
% 0.58/0.79 % Backward-rewritten : 6
% 0.58/0.79 % Generated clauses : 156
% 0.58/0.79 % ...of the previous two non-redundant : 114
% 0.58/0.79 % ...aggressively subsumed : 0
% 0.58/0.79 % Contextual simplify-reflections : 0
% 0.58/0.79 % Paramodulations : 153
% 0.58/0.79 % Factorizations : 2
% 0.58/0.79 % NegExts : 0
% 0.58/0.79 % Equation resolutions : 1
% 0.58/0.79 % Disequality decompositions : 0
% 0.58/0.79 % Total rewrite steps : 76
% 0.58/0.79 % ...of those cached : 48
% 0.58/0.79 % Propositional unsat checks : 0
% 0.58/0.79 % Propositional check models : 0
% 0.58/0.79 % Propositional check unsatisfiable : 0
% 0.58/0.79 % Propositional clauses : 0
% 0.58/0.79 % Propositional clauses after purity: 0
% 0.58/0.79 % Propositional unsat core size : 0
% 0.58/0.79 % Propositional preprocessing time : 0.000
% 0.58/0.79 % Propositional encoding time : 0.000
% 0.58/0.79 % Propositional solver time : 0.000
% 0.58/0.79 % Success case prop preproc time : 0.000
% 0.58/0.79 % Success case prop encoding time : 0.000
% 0.58/0.79 % Success case prop solver time : 0.000
% 0.58/0.79 % Current number of processed clauses : 302
% 0.58/0.79 % Positive orientable unit clauses : 189
% 0.58/0.79 % Positive unorientable unit clauses: 1
% 0.58/0.79 % Negative unit clauses : 3
% 0.58/0.79 % Non-unit-clauses : 109
% 0.58/0.79 % Current number of unprocessed clauses: 646
% 0.58/0.79 % ...number of literals in the above : 2038
% 0.58/0.79 % Current number of archived formulas : 0
% 0.58/0.79 % Current number of archived clauses : 855
% 0.58/0.79 % Clause-clause subsumption calls (NU) : 108913
% 0.58/0.79 % Rec. Clause-clause subsumption calls : 46429
% 0.58/0.79 % Non-unit clause-clause subsumptions : 104
% 0.58/0.79 % Unit Clause-clause subsumption calls : 40
% 0.58/0.79 % Rewrite failures with RHS unbound : 0
% 0.58/0.79 % BW rewrite match attempts : 76
% 0.58/0.79 % BW rewrite match successes : 18
% 0.58/0.79 % Condensation attempts : 0
% 0.58/0.79 % Condensation successes : 0
% 0.58/0.79 % Termbank termtop insertions : 43083
% 0.58/0.79 % Search garbage collected termcells : 1777
% 0.58/0.79
% 0.58/0.79 % -------------------------------------------------
% 0.58/0.79 % User time : 0.197 s
% 0.58/0.79 % System time : 0.019 s
% 0.58/0.79 % Total time : 0.216 s
% 0.58/0.79 % Maximum resident set size: 5040 pages
% 0.58/0.79
% 0.58/0.79 % -------------------------------------------------
% 0.58/0.79 % User time : 0.467 s
% 0.58/0.79 % System time : 0.044 s
% 0.58/0.79 % Total time : 0.511 s
% 0.58/0.79 % Maximum resident set size: 5376 pages
% 0.58/0.79 % E exiting
%------------------------------------------------------------------------------