%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG438-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 : 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:06 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 12 ( 6 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_a,c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_mult__pCons__left_0,axiom,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(X2,X3,X1),X4,tc_Polynomial_Opoly(X1)) = c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(X2,X4,X1),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Otimes__class_Otimes(X3,X4,tc_Polynomial_Opoly(X1)),X1),tc_Polynomial_Opoly(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mult__pCons__left_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_3,negated_conjecture,
c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_a,c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_4,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(X2,X3,X1),X4,tc_Polynomial_Opoly(X1)) = c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(X2,X4,X1),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Otimes__class_Otimes(X3,X4,tc_Polynomial_Opoly(X1)),X1),tc_Polynomial_Opoly(X1)) ),
inference(fof_simplification,[status(thm)],[cls_mult__pCons__left_0]) ).
cnf(c_0_5,negated_conjecture,
c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_a,c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
c_0_3 ).
cnf(c_0_6,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(X2,X3,X1),X4,tc_Polynomial_Opoly(X1)) = c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(X2,X4,X1),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Otimes__class_Otimes(X3,X4,tc_Polynomial_Opoly(X1)),X1),tc_Polynomial_Opoly(X1)) ),
c_0_4 ).
cnf(c_0_7,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0 ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG438-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.12/0.37 % Computer : n013.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 13:20:50 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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
% 0.18/0.50 % Version: 3.5.1
% 0.18/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 % Starting sh5l with 300s (1) cores
% 0.18/0.50 % new_bool_3 with pid 853318 completed with status 0
% 0.18/0.50 % Result found by new_bool_3
% 0.18/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 % Search class: FGUSF-FFMS32-MFFFFFNN
% 0.18/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.50 % SubtermCWHack with pid 853322 completed with status 0
% 0.18/0.50 % Result found by SubtermCWHack
% 0.18/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 % Search class: FGUSF-FFMS32-MFFFFFNN
% 0.18/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.50 % Preprocessing time : 0.002 s
% 0.18/0.50
% 0.18/0.50 % Proof found!
% 0.18/0.50 % SZS status Unsatisfiable
% 0.18/0.50 % SZS output start CNFRefutation
% See solution above
% 0.18/0.50 % Parsed axioms : 392
% 0.18/0.50 % Removed by relevancy pruning/SinE : 309
% 0.18/0.50 % Initial clauses : 83
% 0.18/0.50 % Removed in clause preprocessing : 0
% 0.18/0.50 % Initial clauses in saturation : 83
% 0.18/0.50 % Processed clauses : 605
% 0.18/0.50 % ...of these trivial : 25
% 0.18/0.50 % ...subsumed : 443
% 0.18/0.50 % ...remaining for further processing : 137
% 0.18/0.50 % Other redundant clauses eliminated : 3
% 0.18/0.50 % Clauses deleted for lack of memory : 0
% 0.18/0.50 % Backward-subsumed : 0
% 0.18/0.50 % Backward-rewritten : 0
% 0.18/0.50 % Generated clauses : 3700
% 0.18/0.50 % ...of the previous two non-redundant : 3274
% 0.18/0.50 % ...aggressively subsumed : 0
% 0.18/0.50 % Contextual simplify-reflections : 0
% 0.18/0.50 % Paramodulations : 3697
% 0.18/0.50 % Factorizations : 0
% 0.18/0.50 % NegExts : 0
% 0.18/0.50 % Equation resolutions : 3
% 0.18/0.50 % Disequality decompositions : 0
% 0.18/0.50 % Total rewrite steps : 3276
% 0.18/0.50 % ...of those cached : 2938
% 0.18/0.50 % Propositional unsat checks : 0
% 0.18/0.50 % Propositional check models : 0
% 0.18/0.50 % Propositional check unsatisfiable : 0
% 0.18/0.50 % Propositional clauses : 0
% 0.18/0.50 % Propositional clauses after purity: 0
% 0.18/0.50 % Propositional unsat core size : 0
% 0.18/0.50 % Propositional preprocessing time : 0.000
% 0.18/0.50 % Propositional encoding time : 0.000
% 0.18/0.50 % Propositional solver time : 0.000
% 0.18/0.50 % Success case prop preproc time : 0.000
% 0.18/0.50 % Success case prop encoding time : 0.000
% 0.18/0.50 % Success case prop solver time : 0.000
% 0.18/0.50 % Current number of processed clauses : 137
% 0.18/0.50 % Positive orientable unit clauses : 20
% 0.18/0.50 % Positive unorientable unit clauses: 10
% 0.18/0.50 % Negative unit clauses : 1
% 0.18/0.50 % Non-unit-clauses : 106
% 0.18/0.50 % Current number of unprocessed clauses: 2750
% 0.18/0.50 % ...number of literals in the above : 7000
% 0.18/0.50 % Current number of archived formulas : 0
% 0.18/0.50 % Current number of archived clauses : 0
% 0.18/0.50 % Clause-clause subsumption calls (NU) : 1038
% 0.18/0.50 % Rec. Clause-clause subsumption calls : 1020
% 0.18/0.50 % Non-unit clause-clause subsumptions : 189
% 0.18/0.50 % Unit Clause-clause subsumption calls : 11
% 0.18/0.50 % Rewrite failures with RHS unbound : 0
% 0.18/0.50 % BW rewrite match attempts : 165
% 0.18/0.50 % BW rewrite match successes : 34
% 0.18/0.50 % Condensation attempts : 0
% 0.18/0.50 % Condensation successes : 0
% 0.18/0.50 % Termbank termtop insertions : 61292
% 0.18/0.50 % Search garbage collected termcells : 1167
% 0.18/0.50
% 0.18/0.50 % -------------------------------------------------
% 0.18/0.50 % User time : 0.050 s
% 0.18/0.50 % System time : 0.008 s
% 0.18/0.50 % Total time : 0.058 s
% 0.18/0.50 % Maximum resident set size: 3912 pages
% 0.18/0.50
% 0.18/0.50 % -------------------------------------------------
% 0.18/0.50 % User time : 0.063 s
% 0.18/0.50 % System time : 0.010 s
% 0.18/0.50 % Total time : 0.073 s
% 0.18/0.50 % Maximum resident set size: 4864 pages
% 0.18/0.50 % E exiting
%------------------------------------------------------------------------------