%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ALG421-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 : n005.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:07 PM UTC 2026
% Result : Unsatisfiable 1.30s 0.69s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 11 RR)
% Number of literals : 24 ( 13 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_poly__power_0,axiom,
( ~ class_Ring__and__Field_Ocomm__semiring__1(X1)
| c_Polynomial_Opoly(c_Power_Opower__class_Opower(X2,X3,tc_Polynomial_Opoly(X1)),X4,X1) = c_Power_Opower__class_Opower(c_Polynomial_Opoly(X2,X4,X1),X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_poly__power_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_HOL_Otimes__class_Otimes(c_Polynomial_Opoly(v_s____,v_x,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_u____,v_x,tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Power_Opower__class_Opower(c_Polynomial_Opoly(v_r____,v_x,tc_Complex_Ocomplex),c_Polynomial_Odegree(v_s____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_u_0,axiom,
c_Power_Opower__class_Opower(v_r____,c_Polynomial_Odegree(v_s____,tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = c_HOL_Otimes__class_Otimes(v_s____,v_u____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_u_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1) ).
cnf(cls_poly__mult_0,axiom,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Opoly(c_HOL_Otimes__class_Otimes(X2,X3,tc_Polynomial_Opoly(X1)),X4,X1) = c_HOL_Otimes__class_Otimes(c_Polynomial_Opoly(X2,X4,X1),c_Polynomial_Opoly(X3,X4,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_poly__mult_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0) ).
cnf(c_0_6,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__1(X1)
| c_Polynomial_Opoly(c_Power_Opower__class_Opower(X2,X3,tc_Polynomial_Opoly(X1)),X4,X1) = c_Power_Opower__class_Opower(c_Polynomial_Opoly(X2,X4,X1),X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_poly__power_0]) ).
cnf(c_0_7,negated_conjecture,
c_HOL_Otimes__class_Otimes(c_Polynomial_Opoly(v_s____,v_x,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_u____,v_x,tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Power_Opower__class_Opower(c_Polynomial_Opoly(v_r____,v_x,tc_Complex_Ocomplex),c_Polynomial_Odegree(v_s____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_8,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__1(X1)
| c_Polynomial_Opoly(c_Power_Opower__class_Opower(X2,X3,tc_Polynomial_Opoly(X1)),X4,X1) = c_Power_Opower__class_Opower(c_Polynomial_Opoly(X2,X4,X1),X3,X1) ),
c_0_6 ).
cnf(c_0_9,axiom,
c_Power_Opower__class_Opower(v_r____,c_Polynomial_Odegree(v_s____,tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = c_HOL_Otimes__class_Otimes(v_s____,v_u____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
cls_u_0 ).
cnf(c_0_10,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1 ).
cnf(c_0_11,negated_conjecture,
c_HOL_Otimes__class_Otimes(c_Polynomial_Opoly(v_s____,v_x,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_u____,v_x,tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Power_Opower__class_Opower(c_Polynomial_Opoly(v_r____,v_x,tc_Complex_Ocomplex),c_Polynomial_Odegree(v_s____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
c_0_7 ).
cnf(c_0_12,plain,
c_Power_Opower__class_Opower(c_Polynomial_Opoly(v_r____,X1,tc_Complex_Ocomplex),c_Polynomial_Odegree(v_s____,tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_Polynomial_Opoly(c_HOL_Otimes__class_Otimes(v_s____,v_u____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),X1,tc_Complex_Ocomplex),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Opoly(c_HOL_Otimes__class_Otimes(X2,X3,tc_Polynomial_Opoly(X1)),X4,X1) = c_HOL_Otimes__class_Otimes(c_Polynomial_Opoly(X2,X4,X1),c_Polynomial_Opoly(X3,X4,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_poly__mult_0]) ).
cnf(c_0_14,negated_conjecture,
c_HOL_Otimes__class_Otimes(c_Polynomial_Opoly(v_s____,v_x,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_u____,v_x,tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Polynomial_Opoly(c_HOL_Otimes__class_Otimes(v_s____,v_u____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_x,tc_Complex_Ocomplex),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Opoly(c_HOL_Otimes__class_Otimes(X2,X3,tc_Polynomial_Opoly(X1)),X4,X1) = c_HOL_Otimes__class_Otimes(c_Polynomial_Opoly(X2,X4,X1),c_Polynomial_Opoly(X3,X4,X1),X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG421-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.38 % Computer : n005.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 13:20:48 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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
% 1.30/0.69 % Version: 3.5.1
% 1.30/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.30/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.30/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.30/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.30/0.69 % Starting sh5l with 300s (1) cores
% 1.30/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3573206 completed with status 0
% 1.30/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.30/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.30/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.30/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.30/0.69 % No SInE strategy applied
% 1.30/0.69 % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.30/0.69 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.30/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.30/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.30/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 1.30/0.69 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 1.30/0.69 % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 1.30/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3573218 completed with status 0
% 1.30/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.30/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.30/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.30/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.30/0.69 % No SInE strategy applied
% 1.30/0.69 % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.30/0.69 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.30/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.30/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.30/0.69 % Preprocessing time : 0.012 s
% 1.30/0.69 % Presaturation interreduction done
% 1.30/0.69
% 1.30/0.69 % Proof found!
% 1.30/0.69 % SZS status Unsatisfiable
% 1.30/0.69 % SZS output start CNFRefutation
% See solution above
% 1.30/0.69 % Parsed axioms : 846
% 1.30/0.69 % Removed by relevancy pruning/SinE : 0
% 1.30/0.69 % Initial clauses : 846
% 1.30/0.69 % Removed in clause preprocessing : 3
% 1.30/0.69 % Initial clauses in saturation : 843
% 1.30/0.69 % Processed clauses : 1733
% 1.30/0.69 % ...of these trivial : 47
% 1.30/0.69 % ...subsumed : 332
% 1.30/0.69 % ...remaining for further processing : 1354
% 1.30/0.69 % Other redundant clauses eliminated : 46
% 1.30/0.69 % Clauses deleted for lack of memory : 0
% 1.30/0.69 % Backward-subsumed : 2
% 1.30/0.69 % Backward-rewritten : 8
% 1.30/0.69 % Generated clauses : 4675
% 1.30/0.69 % ...of the previous two non-redundant : 3798
% 1.30/0.69 % ...aggressively subsumed : 0
% 1.30/0.69 % Contextual simplify-reflections : 0
% 1.30/0.69 % Paramodulations : 4616
% 1.30/0.69 % Factorizations : 2
% 1.30/0.69 % NegExts : 0
% 1.30/0.69 % Equation resolutions : 57
% 1.30/0.69 % Disequality decompositions : 0
% 1.30/0.69 % Total rewrite steps : 2463
% 1.30/0.69 % ...of those cached : 2166
% 1.30/0.69 % Propositional unsat checks : 0
% 1.30/0.69 % Propositional check models : 0
% 1.30/0.69 % Propositional check unsatisfiable : 0
% 1.30/0.69 % Propositional clauses : 0
% 1.30/0.69 % Propositional clauses after purity: 0
% 1.30/0.69 % Propositional unsat core size : 0
% 1.30/0.69 % Propositional preprocessing time : 0.000
% 1.30/0.69 % Propositional encoding time : 0.000
% 1.30/0.69 % Propositional solver time : 0.000
% 1.30/0.69 % Success case prop preproc time : 0.000
% 1.30/0.69 % Success case prop encoding time : 0.000
% 1.30/0.69 % Success case prop solver time : 0.000
% 1.30/0.69 % Current number of processed clauses : 642
% 1.30/0.69 % Positive orientable unit clauses : 131
% 1.30/0.69 % Positive unorientable unit clauses: 6
% 1.30/0.69 % Negative unit clauses : 18
% 1.30/0.69 % Non-unit-clauses : 487
% 1.30/0.69 % Current number of unprocessed clauses: 3511
% 1.30/0.69 % ...number of literals in the above : 10164
% 1.30/0.69 % Current number of archived formulas : 0
% 1.30/0.69 % Current number of archived clauses : 714
% 1.30/0.69 % Clause-clause subsumption calls (NU) : 50184
% 1.30/0.69 % Rec. Clause-clause subsumption calls : 29996
% 1.30/0.69 % Non-unit clause-clause subsumptions : 226
% 1.30/0.69 % Unit Clause-clause subsumption calls : 317
% 1.30/0.69 % Rewrite failures with RHS unbound : 0
% 1.30/0.69 % BW rewrite match attempts : 300
% 1.30/0.69 % BW rewrite match successes : 125
% 1.30/0.69 % Condensation attempts : 0
% 1.30/0.69 % Condensation successes : 0
% 1.30/0.69 % Termbank termtop insertions : 104629
% 1.30/0.69 % Search garbage collected termcells : 1521
% 1.30/0.69
% 1.30/0.69 % -------------------------------------------------
% 1.30/0.69 % User time : 0.206 s
% 1.30/0.69 % System time : 0.011 s
% 1.30/0.69 % Total time : 0.217 s
% 1.30/0.69 % Maximum resident set size: 5236 pages
% 1.30/0.69
% 1.30/0.69 % -------------------------------------------------
% 1.30/0.69 % User time : 0.755 s
% 1.30/0.69 % System time : 0.055 s
% 1.30/0.69 % Total time : 0.810 s
% 1.30/0.69 % Maximum resident set size: 5376 pages
% 1.30/0.69 % E exiting
%------------------------------------------------------------------------------