TSTP Solution File: SWW213+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW213+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:08:49 EDT 2023
% Result : Theorem 131.68s 17.45s
% Output : CNFRefutation 131.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 32 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 10 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 28 ( 1 sgn; 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,hypothesis,
! [X19] :
( c_Polynomial_Odegree(tc_Complex_Ocomplex,X19) = c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p)
=> ( ! [X3] : hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X19),X3) = hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,X3))
=> v_thesis____ ) ),
file('/export/starexec/sandbox/tmp/tmp.dDopoTmd8x/E---3.1_32089.p',conj_0) ).
fof(conj_1,conjecture,
v_thesis____,
file('/export/starexec/sandbox/tmp/tmp.dDopoTmd8x/E---3.1_32089.p',conj_1) ).
fof(fact_poly__offset__poly,axiom,
! [X4,X8,X6,X7] :
( class_Rings_Ocomm__semiring__0(X7)
=> hAPP(c_Polynomial_Opoly(X7,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X7,X6,X8)),X4) = hAPP(c_Polynomial_Opoly(X7,X6),c_Groups_Oplus__class_Oplus(X7,X8,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.dDopoTmd8x/E---3.1_32089.p',fact_poly__offset__poly) ).
fof(arity_Complex__Ocomplex__Rings_Ocomm__semiring__0,axiom,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.dDopoTmd8x/E---3.1_32089.p',arity_Complex__Ocomplex__Rings_Ocomm__semiring__0) ).
fof(fact_degree__offset__poly,axiom,
! [X8,X6,X7] :
( class_Rings_Ocomm__semiring__0(X7)
=> c_Polynomial_Odegree(X7,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X7,X6,X8)) = c_Polynomial_Odegree(X7,X6) ),
file('/export/starexec/sandbox/tmp/tmp.dDopoTmd8x/E---3.1_32089.p',fact_degree__offset__poly) ).
fof(c_0_5,hypothesis,
! [X90] :
( c_Polynomial_Odegree(tc_Complex_Ocomplex,X90) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p)
| hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X90),esk1_1(X90)) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk1_1(X90)))
| v_thesis____ ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).
fof(c_0_6,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).
cnf(c_0_7,hypothesis,
( v_thesis____
| c_Polynomial_Odegree(tc_Complex_Ocomplex,X1) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p)
| hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X1),esk1_1(X1)) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk1_1(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
~ v_thesis____,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X595,X596,X597,X598] :
( ~ class_Rings_Ocomm__semiring__0(X598)
| hAPP(c_Polynomial_Opoly(X598,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X598,X597,X596)),X595) = hAPP(c_Polynomial_Opoly(X598,X597),c_Groups_Oplus__class_Oplus(X598,X596,X595)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_poly__offset__poly])]) ).
cnf(c_0_10,hypothesis,
( hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X1),esk1_1(X1)) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk1_1(X1)))
| c_Polynomial_Odegree(tc_Complex_Ocomplex,X1) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p) ),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( hAPP(c_Polynomial_Opoly(X1,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,X3)),X4) = hAPP(c_Polynomial_Opoly(X1,X2),c_Groups_Oplus__class_Oplus(X1,X3,X4))
| ~ class_Rings_Ocomm__semiring__0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
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,hypothesis,
( hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X1),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,X2,esk1_1(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,X1,X2)))) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk1_1(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,X1,X2))))
| c_Polynomial_Odegree(tc_Complex_Ocomplex,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,X1,X2)) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
fof(c_0_14,plain,
! [X1936,X1937,X1938] :
( ~ class_Rings_Ocomm__semiring__0(X1938)
| c_Polynomial_Odegree(X1938,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1938,X1937,X1936)) = c_Polynomial_Odegree(X1938,X1937) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_degree__offset__poly])]) ).
cnf(c_0_15,hypothesis,
c_Polynomial_Odegree(tc_Complex_Ocomplex,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,v_p,v_z)) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( c_Polynomial_Odegree(X1,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,X3)) = c_Polynomial_Odegree(X1,X2)
| ~ class_Rings_Ocomm__semiring__0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.21 % Problem : SWW213+1 : TPTP v8.1.2. Released v5.2.0.
% 0.09/0.22 % Command : run_E %s %d THM
% 0.22/0.42 % Computer : n014.cluster.edu
% 0.22/0.42 % Model : x86_64 x86_64
% 0.22/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.42 % Memory : 8042.1875MB
% 0.22/0.42 % OS : Linux 3.10.0-693.el7.x86_64
% 0.22/0.42 % CPULimit : 2400
% 0.22/0.42 % WCLimit : 300
% 0.22/0.42 % DateTime : Mon Oct 2 22:44:04 EDT 2023
% 0.22/0.42 % CPUTime :
% 0.45/0.65 Running first-order theorem proving
% 0.45/0.65 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.dDopoTmd8x/E---3.1_32089.p
% 131.68/17.45 # Version: 3.1pre001
% 131.68/17.45 # Preprocessing class: FMLMSMSMSSSNFFN.
% 131.68/17.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.68/17.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 131.68/17.45 # Starting new_bool_3 with 300s (1) cores
% 131.68/17.45 # Starting new_bool_1 with 300s (1) cores
% 131.68/17.45 # Starting sh5l with 300s (1) cores
% 131.68/17.45 # sh5l with pid 32171 completed with status 0
% 131.68/17.45 # Result found by sh5l
% 131.68/17.45 # Preprocessing class: FMLMSMSMSSSNFFN.
% 131.68/17.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.68/17.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 131.68/17.45 # Starting new_bool_3 with 300s (1) cores
% 131.68/17.45 # Starting new_bool_1 with 300s (1) cores
% 131.68/17.45 # Starting sh5l with 300s (1) cores
% 131.68/17.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 131.68/17.45 # Search class: FGHSM-SSLM32-DFFFFFNN
% 131.68/17.45 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 131.68/17.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 131.68/17.45 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 32174 completed with status 0
% 131.68/17.45 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 131.68/17.45 # Preprocessing class: FMLMSMSMSSSNFFN.
% 131.68/17.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.68/17.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 131.68/17.45 # Starting new_bool_3 with 300s (1) cores
% 131.68/17.45 # Starting new_bool_1 with 300s (1) cores
% 131.68/17.45 # Starting sh5l with 300s (1) cores
% 131.68/17.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 131.68/17.45 # Search class: FGHSM-SSLM32-DFFFFFNN
% 131.68/17.45 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 131.68/17.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 131.68/17.45 # Preprocessing time : 0.015 s
% 131.68/17.45 # Presaturation interreduction done
% 131.68/17.45
% 131.68/17.45 # Proof found!
% 131.68/17.45 # SZS status Theorem
% 131.68/17.45 # SZS output start CNFRefutation
% See solution above
% 131.68/17.45 # Parsed axioms : 1264
% 131.68/17.45 # Removed by relevancy pruning/SinE : 293
% 131.68/17.45 # Initial clauses : 1281
% 131.68/17.45 # Removed in clause preprocessing : 72
% 131.68/17.45 # Initial clauses in saturation : 1209
% 131.68/17.45 # Processed clauses : 56251
% 131.68/17.45 # ...of these trivial : 659
% 131.68/17.45 # ...subsumed : 47345
% 131.68/17.45 # ...remaining for further processing : 8247
% 131.68/17.45 # Other redundant clauses eliminated : 9011
% 131.68/17.45 # Clauses deleted for lack of memory : 0
% 131.68/17.45 # Backward-subsumed : 104
% 131.68/17.45 # Backward-rewritten : 68
% 131.68/17.45 # Generated clauses : 683695
% 131.68/17.45 # ...of the previous two non-redundant : 637063
% 131.68/17.45 # ...aggressively subsumed : 0
% 131.68/17.45 # Contextual simplify-reflections : 116
% 131.68/17.45 # Paramodulations : 674524
% 131.68/17.45 # Factorizations : 21
% 131.68/17.45 # NegExts : 0
% 131.68/17.45 # Equation resolutions : 9175
% 131.68/17.45 # Total rewrite steps : 448430
% 131.68/17.45 # Propositional unsat checks : 1
% 131.68/17.45 # Propositional check models : 0
% 131.68/17.45 # Propositional check unsatisfiable : 0
% 131.68/17.45 # Propositional clauses : 0
% 131.68/17.45 # Propositional clauses after purity: 0
% 131.68/17.45 # Propositional unsat core size : 0
% 131.68/17.45 # Propositional preprocessing time : 0.000
% 131.68/17.45 # Propositional encoding time : 0.309
% 131.68/17.45 # Propositional solver time : 0.196
% 131.68/17.45 # Success case prop preproc time : 0.000
% 131.68/17.45 # Success case prop encoding time : 0.000
% 131.68/17.45 # Success case prop solver time : 0.000
% 131.68/17.45 # Current number of processed clauses : 6975
% 131.68/17.45 # Positive orientable unit clauses : 698
% 131.68/17.45 # Positive unorientable unit clauses: 71
% 131.68/17.45 # Negative unit clauses : 414
% 131.68/17.45 # Non-unit-clauses : 5792
% 131.68/17.45 # Current number of unprocessed clauses: 582200
% 131.68/17.45 # ...number of literals in the above : 1585275
% 131.68/17.45 # Current number of archived formulas : 0
% 131.68/17.45 # Current number of archived clauses : 1148
% 131.68/17.45 # Clause-clause subsumption calls (NU) : 4145062
% 131.68/17.45 # Rec. Clause-clause subsumption calls : 2641564
% 131.68/17.45 # Non-unit clause-clause subsumptions : 18845
% 131.68/17.45 # Unit Clause-clause subsumption calls : 192653
% 131.68/17.45 # Rewrite failures with RHS unbound : 0
% 131.68/17.45 # BW rewrite match attempts : 24186
% 131.68/17.45 # BW rewrite match successes : 616
% 131.68/17.45 # Condensation attempts : 0
% 131.68/17.45 # Condensation successes : 0
% 131.68/17.45 # Termbank termtop insertions : 15294525
% 131.68/17.45
% 131.68/17.45 # -------------------------------------------------
% 131.68/17.45 # User time : 15.473 s
% 131.68/17.45 # System time : 0.489 s
% 131.68/17.45 # Total time : 15.963 s
% 131.68/17.45 # Maximum resident set size: 6932 pages
% 131.68/17.45
% 131.68/17.45 # -------------------------------------------------
% 131.68/17.45 # User time : 15.511 s
% 131.68/17.45 # System time : 0.491 s
% 131.68/17.45 # Total time : 16.002 s
% 131.68/17.45 # Maximum resident set size: 3100 pages
% 131.68/17.45 % E---3.1 exiting
% 131.68/17.45 % E---3.1 exiting
%------------------------------------------------------------------------------