TSTP Solution File: SWW185+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW185+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 : 600s
% DateTime : Thu Jul 21 00:01:41 EDT 2022
% Result : Theorem 8.80s 2.88s
% Output : CNFRefutation 8.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 12 unt; 0 nHn; 16 RR)
% Number of literals : 30 ( 21 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 22 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_182,hypothesis,
c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,c_Polynomial_OpCons(t_a,v_a,v_p),v_h) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_y4woy9/lgb.p',i_0_182) ).
cnf(i_0_1100,plain,
( c_Groups_Oplus__class_Oplus(tc_Polynomial_Opoly(X1),c_Polynomial_Osmult(X1,X2,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X3,X2)),c_Polynomial_OpCons(X1,X4,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X3,X2))) = c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,c_Polynomial_OpCons(X1,X4,X3),X2)
| ~ class_Rings_Ocomm__semiring__0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_y4woy9/lgb.p',i_0_1100) ).
cnf(i_0_1576,hypothesis,
class_Rings_Ocomm__semiring__0(t_a),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_y4woy9/lgb.p',i_0_1576) ).
cnf(i_0_1099,plain,
( X1 = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X2))
| c_Groups_Oplus__class_Oplus(tc_Polynomial_Opoly(X2),c_Polynomial_Osmult(X2,X3,X1),c_Polynomial_OpCons(X2,X4,X1)) != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X2))
| ~ class_Rings_Ocomm__semiring__0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_y4woy9/lgb.p',i_0_1099) ).
cnf(i_0_181,hypothesis,
( c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) = v_p
| c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,v_p,v_h) != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_y4woy9/lgb.p',i_0_181) ).
cnf(i_0_183,negated_conjecture,
c_Polynomial_OpCons(t_a,v_a,v_p) != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_y4woy9/lgb.p',i_0_183) ).
cnf(i_0_1101,plain,
( c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,c_Polynomial_OpCons(X1,X2,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))),X3) = c_Polynomial_OpCons(X1,X2,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)))
| ~ class_Rings_Ocomm__semiring__0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_y4woy9/lgb.p',i_0_1101) ).
cnf(c_0_1584,hypothesis,
c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,c_Polynomial_OpCons(t_a,v_a,v_p),v_h) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
i_0_182 ).
cnf(c_0_1585,plain,
( c_Groups_Oplus__class_Oplus(tc_Polynomial_Opoly(X1),c_Polynomial_Osmult(X1,X2,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X3,X2)),c_Polynomial_OpCons(X1,X4,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X3,X2))) = c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,c_Polynomial_OpCons(X1,X4,X3),X2)
| ~ class_Rings_Ocomm__semiring__0(X1) ),
i_0_1100 ).
cnf(c_0_1586,hypothesis,
class_Rings_Ocomm__semiring__0(t_a),
i_0_1576 ).
cnf(c_0_1587,plain,
( X1 = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X2))
| c_Groups_Oplus__class_Oplus(tc_Polynomial_Opoly(X2),c_Polynomial_Osmult(X2,X3,X1),c_Polynomial_OpCons(X2,X4,X1)) != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X2))
| ~ class_Rings_Ocomm__semiring__0(X2) ),
i_0_1099 ).
cnf(c_0_1588,hypothesis,
c_Groups_Oplus__class_Oplus(tc_Polynomial_Opoly(t_a),c_Polynomial_Osmult(t_a,v_h,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,v_p,v_h)),c_Polynomial_OpCons(t_a,v_a,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,v_p,v_h))) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1584,c_0_1585]),c_0_1586])]) ).
cnf(c_0_1589,hypothesis,
( c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) = v_p
| c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,v_p,v_h) != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
i_0_181 ).
cnf(c_0_1590,plain,
c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,v_p,v_h) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1587,c_0_1588]),c_0_1586])]) ).
cnf(c_0_1591,hypothesis,
v_p = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1589,c_0_1590])]) ).
cnf(c_0_1592,negated_conjecture,
c_Polynomial_OpCons(t_a,v_a,v_p) != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
i_0_183 ).
cnf(c_0_1593,plain,
( c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,c_Polynomial_OpCons(X1,X2,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))),X3) = c_Polynomial_OpCons(X1,X2,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)))
| ~ class_Rings_Ocomm__semiring__0(X1) ),
i_0_1101 ).
cnf(c_0_1594,hypothesis,
c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(t_a,c_Polynomial_OpCons(t_a,v_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))),v_h) = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(rw,[status(thm)],[c_0_1584,c_0_1591]) ).
cnf(c_0_1595,negated_conjecture,
c_Polynomial_OpCons(t_a,v_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(rw,[status(thm)],[c_0_1592,c_0_1591]) ).
cnf(c_0_1596,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1593,c_0_1594]),c_0_1586])]),c_0_1595]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW185+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 5 16:45:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.51 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.51 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.51 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.80/2.88 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.80/2.88 # No SInE strategy applied
% 8.80/2.88 # Trying AutoSched0 for 150 seconds
% 8.80/2.88 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S4d
% 8.80/2.88 # and selection function SelectCQIPrecWNTNp.
% 8.80/2.88 #
% 8.80/2.88 # Preprocessing time : 0.025 s
% 8.80/2.88 # Presaturation interreduction done
% 8.80/2.88
% 8.80/2.88 # Proof found!
% 8.80/2.88 # SZS status Theorem
% 8.80/2.88 # SZS output start CNFRefutation
% See solution above
% 8.80/2.88 # Training examples: 0 positive, 0 negative
% 8.80/2.88
% 8.80/2.88 # -------------------------------------------------
% 8.80/2.88 # User time : 0.060 s
% 8.80/2.88 # System time : 0.006 s
% 8.80/2.88 # Total time : 0.066 s
% 8.80/2.88 # Maximum resident set size: 7372 pages
% 8.80/2.88
%------------------------------------------------------------------------------