%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG383-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 : n007.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:00 AM UTC 2026
% Result : Unsatisfiable 5.23s 1.25s
% Output : CNFRefutation 5.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_real__le__trans_0,axiom,
( ~ c_lessequals(X1,X3,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_real__le__trans_0) ).
cnf(cls_th2_0,axiom,
c_lessequals(c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_th2_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(v_da____,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_th1_0,axiom,
c_lessequals(v_da____,c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_th1_0) ).
cnf(c_0_4,plain,
( ~ c_lessequals(X1,X3,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_real__le__trans_0]) ).
cnf(c_0_5,plain,
( ~ c_lessequals(X1,X3,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
c_0_4 ).
cnf(c_0_6,axiom,
c_lessequals(c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_th2_0 ).
cnf(c_0_7,negated_conjecture,
~ c_lessequals(v_da____,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X1,c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(X1,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
c_lessequals(v_da____,c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal),
cls_th1_0 ).
cnf(c_0_10,negated_conjecture,
~ c_lessequals(v_da____,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
c_0_7 ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG383-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 13:16:21 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 5.23/1.25 % Version: 3.5.1
% 5.23/1.25 % Preprocessing class: FSLMSMSMSSSNFFN.
% 5.23/1.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.23/1.25 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 5.23/1.25 % Starting new_bool_3 with 600s (2) cores
% 5.23/1.25 % Starting new_bool_1 with 300s (1) cores
% 5.23/1.25 % Starting sh5l with 300s (1) cores
% 5.23/1.25 % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 1170608 completed with status 0
% 5.23/1.25 % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 5.23/1.25 % Preprocessing class: FSLMSMSMSSSNFFN.
% 5.23/1.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.23/1.25 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 5.23/1.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.23/1.25 % No SInE strategy applied
% 5.23/1.25 % Search class: FGHSM-FSLM32-MFFFFFNN
% 5.23/1.25 % Scheduled 11 strats onto 4 cores with 1200 seconds (1200 total)
% 5.23/1.25 % Starting SubtermCWHack with 121s (1) cores
% 5.23/1.25 % Starting G-E--_303_C18_F1_URBAN_S0Y with 110s (1) cores
% 5.23/1.25 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 110s (1) cores
% 5.23/1.25 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 110s (1) cores
% 5.23/1.25 % G-E--_303_C18_F1_URBAN_S0Y with pid 1170622 completed with status 0
% 5.23/1.25 % Result found by G-E--_303_C18_F1_URBAN_S0Y
% 5.23/1.25 % Preprocessing class: FSLMSMSMSSSNFFN.
% 5.23/1.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.23/1.25 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 5.23/1.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.23/1.25 % No SInE strategy applied
% 5.23/1.25 % Search class: FGHSM-FSLM32-MFFFFFNN
% 5.23/1.25 % Scheduled 11 strats onto 4 cores with 1200 seconds (1200 total)
% 5.23/1.25 % Starting SubtermCWHack with 121s (1) cores
% 5.23/1.25 % Starting G-E--_303_C18_F1_URBAN_S0Y with 110s (1) cores
% 5.23/1.25 % Preprocessing time : 0.064 s
% 5.23/1.25
% 5.23/1.25 % Proof found!
% 5.23/1.25 % SZS status Unsatisfiable
% 5.23/1.25 % SZS output start CNFRefutation
% See solution above
% 5.23/1.25 % Parsed axioms : 987
% 5.23/1.25 % Removed by relevancy pruning/SinE : 0
% 5.23/1.25 % Initial clauses : 987
% 5.23/1.25 % Removed in clause preprocessing : 0
% 5.23/1.25 % Initial clauses in saturation : 987
% 5.23/1.25 % Processed clauses : 1332
% 5.23/1.25 % ...of these trivial : 19
% 5.23/1.25 % ...subsumed : 307
% 5.23/1.25 % ...remaining for further processing : 1006
% 5.23/1.25 % Other redundant clauses eliminated : 3
% 5.23/1.25 % Clauses deleted for lack of memory : 0
% 5.23/1.25 % Backward-subsumed : 2
% 5.23/1.25 % Backward-rewritten : 5
% 5.23/1.25 % Generated clauses : 10109
% 5.23/1.25 % ...of the previous two non-redundant : 9483
% 5.23/1.25 % ...aggressively subsumed : 0
% 5.23/1.25 % Contextual simplify-reflections : 0
% 5.23/1.25 % Paramodulations : 10092
% 5.23/1.25 % Factorizations : 6
% 5.23/1.25 % NegExts : 0
% 5.23/1.25 % Equation resolutions : 11
% 5.23/1.25 % Disequality decompositions : 0
% 5.23/1.25 % Total rewrite steps : 4605
% 5.23/1.25 % ...of those cached : 4382
% 5.23/1.25 % Propositional unsat checks : 0
% 5.23/1.25 % Propositional check models : 0
% 5.23/1.25 % Propositional check unsatisfiable : 0
% 5.23/1.25 % Propositional clauses : 0
% 5.23/1.25 % Propositional clauses after purity: 0
% 5.23/1.25 % Propositional unsat core size : 0
% 5.23/1.25 % Propositional preprocessing time : 0.000
% 5.23/1.25 % Propositional encoding time : 0.000
% 5.23/1.25 % Propositional solver time : 0.000
% 5.23/1.25 % Success case prop preproc time : 0.000
% 5.23/1.25 % Success case prop encoding time : 0.000
% 5.23/1.25 % Success case prop solver time : 0.000
% 5.23/1.25 % Current number of processed clauses : 999
% 5.23/1.25 % Positive orientable unit clauses : 206
% 5.23/1.25 % Positive unorientable unit clauses: 2
% 5.23/1.25 % Negative unit clauses : 40
% 5.23/1.25 % Non-unit-clauses : 751
% 5.23/1.25 % Current number of unprocessed clauses: 9119
% 5.23/1.25 % ...number of literals in the above : 26095
% 5.23/1.25 % Current number of archived formulas : 0
% 5.23/1.25 % Current number of archived clauses : 7
% 5.23/1.25 % Clause-clause subsumption calls (NU) : 64055
% 5.23/1.25 % Rec. Clause-clause subsumption calls : 39702
% 5.23/1.25 % Non-unit clause-clause subsumptions : 173
% 5.23/1.25 % Unit Clause-clause subsumption calls : 1537
% 5.23/1.25 % Rewrite failures with RHS unbound : 0
% 5.23/1.25 % BW rewrite match attempts : 344
% 5.23/1.25 % BW rewrite match successes : 33
% 5.23/1.25 % Condensation attempts : 0
% 5.23/1.25 % Condensation successes : 0
% 5.23/1.25 % Termbank termtop insertions : 191481
% 5.23/1.25 % Search garbage collected termcells : 1690
% 5.23/1.25
% 5.23/1.25 % -------------------------------------------------
% 5.23/1.25 % User time : 0.553 s
% 5.23/1.25 % System time : 0.037 s
% 5.23/1.25 % Total time : 0.590 s
% 5.23/1.25 % Maximum resident set size: 5016 pages
% 5.23/1.25
% 5.23/1.25 % -------------------------------------------------
% 5.23/1.25 % User time : 2.647 s
% 5.23/1.25 % System time : 0.138 s
% 5.23/1.25 % Total time : 2.785 s
% 5.23/1.25 % Maximum resident set size: 5120 pages
% 5.23/1.25 % E exiting
%------------------------------------------------------------------------------