%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW272+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 03:10:12 PM UTC 2026
% Result : Theorem 2.57s 6.48s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 16 unt; 0 def)
% Number of atoms : 22 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 10 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 7 ( 2 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
v_s____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(fact_pne,axiom,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_pne) ).
fof(fact_mult__poly__0__right,axiom,
! [X15,X5] :
( class_Rings_Ocomm__semiring__0(X5)
=> hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(X5)),X15),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X5))) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X5)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_mult__poly__0__right) ).
fof(fact_s,axiom,
v_pa____ = hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),hAPP(hAPP(c_Power_Opower__class_Opower(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),c_Polynomial_OpCons(tc_Complex_Ocomplex,c_Groups_Ouminus__class_Ouminus(tc_Complex_Ocomplex,v_a____),c_Polynomial_OpCons(tc_Complex_Ocomplex,c_Groups_Oone__class_Oone(tc_Complex_Ocomplex),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))))),c_Polynomial_Oorder(tc_Complex_Ocomplex,v_a____,v_pa____))),v_s____),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_s) ).
fof(arity_Complex__Ocomplex__Rings_Ocomm__semiring__0,axiom,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Complex__Ocomplex__Rings_Ocomm__semiring__0) ).
fof(c_0_5,negated_conjecture,
~ ( v_s____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_6,plain,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[fact_pne]) ).
fof(c_0_7,negated_conjecture,
v_s____ = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X631,X632] :
( hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(X632)),X631),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X632))) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X632))
| ~ class_Rings_Ocomm__semiring__0(X632) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mult__poly__0__right])])]) ).
fof(c_0_9,plain,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
v_pa____ = hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),hAPP(hAPP(c_Power_Opower__class_Opower(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),c_Polynomial_OpCons(tc_Complex_Ocomplex,c_Groups_Ouminus__class_Ouminus(tc_Complex_Ocomplex,v_a____),c_Polynomial_OpCons(tc_Complex_Ocomplex,c_Groups_Oone__class_Oone(tc_Complex_Ocomplex),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))))),c_Polynomial_Oorder(tc_Complex_Ocomplex,v_a____,v_pa____))),v_s____),
inference(split_conjunct,[status(thm)],[fact_s]) ).
cnf(c_0_11,negated_conjecture,
v_s____ = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ class_Rings_Ocomm__semiring__0(X1)
| hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(X1)),X2),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[arity_Complex__Ocomplex__Rings_Ocomm__semiring__0]) ).
cnf(c_0_14,plain,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),hAPP(hAPP(c_Power_Opower__class_Opower(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),c_Polynomial_OpCons(tc_Complex_Ocomplex,c_Groups_Ouminus__class_Ouminus(tc_Complex_Ocomplex,v_a____),c_Polynomial_OpCons(tc_Complex_Ocomplex,c_Groups_Oone__class_Oone(tc_Complex_Ocomplex),v_s____))),c_Polynomial_Oorder(tc_Complex_Ocomplex,v_a____,v_pa____))),v_s____) = v_pa____,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),X1),v_s____) = v_s____,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11]),c_0_11]) ).
cnf(c_0_17,plain,
v_s____ != v_pa____,
inference(rw,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWW272+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.70 % Computer : n004.cluster.edu
% 0.18/5.70 % Model : x86_64 x86_64
% 0.18/5.70 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.70 % Memory : 8046.5625MB
% 0.18/5.70 % OS : Linux 6.8.0-71-generic
% 0.21/5.70 % CPULimit : 300
% 0.21/5.70 % WCLimit : 300
% 0.21/5.70 % DateTime : Mon Sep 21 09:44:55 UTC 2026
% 0.21/5.70 % CPUTime :
% 0.21/5.70 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/5.75 Running first-order theorem proving
% 0.21/5.75 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
% 2.57/6.48 % Version: 3.5.1
% 2.57/6.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 2.57/6.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.57/6.48 % Starting new_bool_3 with 300s (1) cores
% 2.57/6.48 % Starting new_bool_1 with 300s (1) cores
% 2.57/6.48 % Starting sh5l with 300s (1) cores
% 2.57/6.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2835943 completed with status 0
% 2.57/6.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.57/6.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 2.57/6.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.57/6.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.57/6.48 % No SInE strategy applied
% 2.57/6.48 % Search class: FGHSM-SSLM32-DFFFFFNN
% 2.57/6.48 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.57/6.48 % Starting SubtermCWHack with 136s (1) cores
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 2.57/6.48 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 2.57/6.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 2835952 completed with status 0
% 2.57/6.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 2.57/6.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 2.57/6.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.57/6.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.57/6.48 % No SInE strategy applied
% 2.57/6.48 % Search class: FGHSM-SSLM32-DFFFFFNN
% 2.57/6.48 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.57/6.48 % Starting SubtermCWHack with 136s (1) cores
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.57/6.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 2.57/6.48 % Preprocessing time : 0.038 s
% 2.57/6.48 % Presaturation interreduction done
% 2.57/6.48
% 2.57/6.48 % Proof found!
% 2.57/6.48 % SZS status Theorem
% 2.57/6.48 % SZS output start CNFRefutation
% See solution above
% 2.57/6.48 % Parsed axioms : 1206
% 2.57/6.48 % Removed by relevancy pruning/SinE : 0
% 2.57/6.48 % Initial clauses : 1588
% 2.57/6.48 % Removed in clause preprocessing : 78
% 2.57/6.48 % Initial clauses in saturation : 1510
% 2.57/6.48 % Processed clauses : 2709
% 2.57/6.48 % ...of these trivial : 30
% 2.57/6.48 % ...subsumed : 456
% 2.57/6.48 % ...remaining for further processing : 2223
% 2.57/6.48 % Other redundant clauses eliminated : 242
% 2.57/6.48 % Clauses deleted for lack of memory : 0
% 2.57/6.48 % Backward-subsumed : 1
% 2.57/6.48 % Backward-rewritten : 4
% 2.57/6.48 % Generated clauses : 3327
% 2.57/6.48 % ...of the previous two non-redundant : 2438
% 2.57/6.48 % ...aggressively subsumed : 0
% 2.57/6.48 % Contextual simplify-reflections : 2
% 2.57/6.48 % Paramodulations : 3098
% 2.57/6.48 % Factorizations : 0
% 2.57/6.48 % NegExts : 0
% 2.57/6.48 % Equation resolutions : 257
% 2.57/6.48 % Disequality decompositions : 0
% 2.57/6.48 % Total rewrite steps : 2037
% 2.57/6.48 % ...of those cached : 1629
% 2.57/6.48 % Propositional unsat checks : 0
% 2.57/6.48 % Propositional check models : 0
% 2.57/6.48 % Propositional check unsatisfiable : 0
% 2.57/6.48 % Propositional clauses : 0
% 2.57/6.48 % Propositional clauses after purity: 0
% 2.57/6.48 % Propositional unsat core size : 0
% 2.57/6.48 % Propositional preprocessing time : 0.000
% 2.57/6.48 % Propositional encoding time : 0.000
% 2.57/6.48 % Propositional solver time : 0.000
% 2.57/6.48 % Success case prop preproc time : 0.000
% 2.57/6.48 % Success case prop encoding time : 0.000
% 2.57/6.48 % Success case prop solver time : 0.000
% 2.57/6.48 % Current number of processed clauses : 859
% 2.57/6.48 % Positive orientable unit clauses : 432
% 2.57/6.48 % Positive unorientable unit clauses: 5
% 2.57/6.48 % Negative unit clauses : 42
% 2.57/6.48 % Non-unit-clauses : 380
% 2.57/6.48 % Current number of unprocessed clauses: 2457
% 2.57/6.48 % ...number of literals in the above : 5375
% 2.57/6.48 % Current number of archived formulas : 0
% 2.57/6.48 % Current number of archived clauses : 1224
% 2.57/6.48 % Clause-clause subsumption calls (NU) : 192914
% 2.57/6.48 % Rec. Clause-clause subsumption calls : 114821
% 2.57/6.48 % Non-unit clause-clause subsumptions : 306
% 2.57/6.48 % Unit Clause-clause subsumption calls : 449
% 2.57/6.48 % Rewrite failures with RHS unbound : 0
% 2.57/6.48 % BW rewrite match attempts : 2961
% 2.57/6.48 % BW rewrite match successes : 198
% 2.57/6.48 % Condensation attempts : 0
% 2.57/6.48 % Condensation successes : 0
% 2.57/6.48 % Termbank termtop insertions : 218590
% 2.57/6.48 % Search garbage collected termcells : 20305
% 2.57/6.48
% 2.57/6.48 % -------------------------------------------------
% 2.57/6.48 % User time : 0.576 s
% 2.57/6.48 % System time : 0.053 s
% 2.57/6.48 % Total time : 0.629 s
% 2.57/6.48 % Maximum resident set size: 9644 pages
% 2.57/6.48
% 2.57/6.48 % -------------------------------------------------
% 2.57/6.48 % User time : 1.491 s
% 2.57/6.48 % System time : 0.129 s
% 2.57/6.48 % Total time : 1.620 s
% 2.57/6.48 % Maximum resident set size: 6144 pages
% 2.57/6.48 % E exiting
%------------------------------------------------------------------------------