TSTP Solution File: SWW272+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW272+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 18:11:28 EDT 2024
% Result : Theorem 0.49s 1.02s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 15 unt; 0 def)
% Number of atoms : 21 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 8 ~; 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(fact_pne,axiom,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/tmp/tmp.mU1HYsjYft/E---3.1_1131.p',fact_pne) ).
fof(conj_0,conjecture,
v_s____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/tmp/tmp.mU1HYsjYft/E---3.1_1131.p',conj_0) ).
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/tmp/tmp.mU1HYsjYft/E---3.1_1131.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/tmp/tmp.mU1HYsjYft/E---3.1_1131.p',fact_s) ).
fof(arity_Complex__Ocomplex__Rings_Ocomm__semiring__0,axiom,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.mU1HYsjYft/E---3.1_1131.p',arity_Complex__Ocomplex__Rings_Ocomm__semiring__0) ).
fof(c_0_5,plain,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[fact_pne]) ).
fof(c_0_6,negated_conjecture,
v_s____ = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
fof(c_0_7,plain,
! [X417,X418] :
( ~ class_Rings_Ocomm__semiring__0(X418)
| hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(X418)),X417),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X418))) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X418)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mult__poly__0__right])])]) ).
fof(c_0_8,plain,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_9,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_10,negated_conjecture,
v_s____ = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( 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))
| ~ class_Rings_Ocomm__semiring__0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[arity_Complex__Ocomplex__Rings_Ocomm__semiring__0]) ).
cnf(c_0_13,plain,
v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,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_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),X1),v_s____) = v_s____,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12])]) ).
cnf(c_0_16,plain,
v_s____ != v_pa____,
inference(rw,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW272+1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 09:28:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.48/0.63 Running first-order theorem proving
% 0.48/0.63 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/tmp/tmp.mU1HYsjYft/E---3.1_1131.p
% 0.49/1.02 # Version: 3.2.0
% 0.49/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.49/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.49/1.02 # Starting new_bool_1 with 300s (1) cores
% 0.49/1.02 # Starting sh5l with 300s (1) cores
% 0.49/1.02 # new_bool_3 with pid 1215 completed with status 0
% 0.49/1.02 # Result found by new_bool_3
% 0.49/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.49/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.49/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.49/1.02 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.49/1.02 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.49/1.02 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.49/1.02 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 1219 completed with status 0
% 0.49/1.02 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.49/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.49/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.49/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.49/1.02 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.49/1.02 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.49/1.02 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.49/1.02 # Preprocessing time : 0.013 s
% 0.49/1.02
% 0.49/1.02 # Proof found!
% 0.49/1.02 # SZS status Theorem
% 0.49/1.02 # SZS output start CNFRefutation
% See solution above
% 0.49/1.02 # Parsed axioms : 1206
% 0.49/1.02 # Removed by relevancy pruning/SinE : 700
% 0.49/1.02 # Initial clauses : 687
% 0.49/1.02 # Removed in clause preprocessing : 46
% 0.49/1.02 # Initial clauses in saturation : 641
% 0.49/1.02 # Processed clauses : 806
% 0.49/1.02 # ...of these trivial : 13
% 0.49/1.02 # ...subsumed : 206
% 0.49/1.02 # ...remaining for further processing : 587
% 0.49/1.02 # Other redundant clauses eliminated : 56
% 0.49/1.02 # Clauses deleted for lack of memory : 0
% 0.49/1.02 # Backward-subsumed : 3
% 0.49/1.02 # Backward-rewritten : 9
% 0.49/1.02 # Generated clauses : 14470
% 0.49/1.02 # ...of the previous two non-redundant : 12871
% 0.49/1.02 # ...aggressively subsumed : 0
% 0.49/1.02 # Contextual simplify-reflections : 0
% 0.49/1.02 # Paramodulations : 14381
% 0.49/1.02 # Factorizations : 8
% 0.49/1.02 # NegExts : 0
% 0.49/1.02 # Equation resolutions : 81
% 0.49/1.02 # Disequality decompositions : 0
% 0.49/1.02 # Total rewrite steps : 11383
% 0.49/1.02 # ...of those cached : 10298
% 0.49/1.02 # Propositional unsat checks : 0
% 0.49/1.02 # Propositional check models : 0
% 0.49/1.02 # Propositional check unsatisfiable : 0
% 0.49/1.02 # Propositional clauses : 0
% 0.49/1.02 # Propositional clauses after purity: 0
% 0.49/1.02 # Propositional unsat core size : 0
% 0.49/1.02 # Propositional preprocessing time : 0.000
% 0.49/1.02 # Propositional encoding time : 0.000
% 0.49/1.02 # Propositional solver time : 0.000
% 0.49/1.02 # Success case prop preproc time : 0.000
% 0.49/1.02 # Success case prop encoding time : 0.000
% 0.49/1.02 # Success case prop solver time : 0.000
% 0.49/1.02 # Current number of processed clauses : 558
% 0.49/1.02 # Positive orientable unit clauses : 105
% 0.49/1.02 # Positive unorientable unit clauses: 8
% 0.49/1.02 # Negative unit clauses : 22
% 0.49/1.02 # Non-unit-clauses : 423
% 0.49/1.02 # Current number of unprocessed clauses: 12704
% 0.49/1.02 # ...number of literals in the above : 33211
% 0.49/1.02 # Current number of archived formulas : 0
% 0.49/1.02 # Current number of archived clauses : 12
% 0.49/1.02 # Clause-clause subsumption calls (NU) : 11009
% 0.49/1.02 # Rec. Clause-clause subsumption calls : 8310
% 0.49/1.02 # Non-unit clause-clause subsumptions : 129
% 0.49/1.02 # Unit Clause-clause subsumption calls : 433
% 0.49/1.02 # Rewrite failures with RHS unbound : 0
% 0.49/1.02 # BW rewrite match attempts : 519
% 0.49/1.02 # BW rewrite match successes : 58
% 0.49/1.02 # Condensation attempts : 0
% 0.49/1.02 # Condensation successes : 0
% 0.49/1.02 # Termbank termtop insertions : 361134
% 0.49/1.02 # Search garbage collected termcells : 12614
% 0.49/1.02
% 0.49/1.02 # -------------------------------------------------
% 0.49/1.02 # User time : 0.317 s
% 0.49/1.02 # System time : 0.016 s
% 0.49/1.02 # Total time : 0.333 s
% 0.49/1.02 # Maximum resident set size: 4892 pages
% 0.49/1.02
% 0.49/1.02 # -------------------------------------------------
% 0.49/1.02 # User time : 0.355 s
% 0.49/1.02 # System time : 0.019 s
% 0.49/1.02 # Total time : 0.374 s
% 0.49/1.02 # Maximum resident set size: 3108 pages
% 0.49/1.02 % E---3.1 exiting
% 0.49/1.02 % E exiting
%------------------------------------------------------------------------------