TSTP Solution File: SWW219+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW219+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:46 EDT 2022
% Result : Theorem 8.01s 2.64s
% Output : CNFRefutation 8.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 10 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 2 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_269,hypothesis,
( v_thesis____
| ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X1,esk1_1(X1))),v_r)
| ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X1,esk2_1(X1)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,esk2_1(X1),c_Groups_Oone__class_Oone(tc_Nat_Onat)))))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-64rlccsw/input.p',i_0_269) ).
cnf(i_0_1457,plain,
c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealDef_Oreal(tc_Nat_Onat,X1),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)) = c_RealDef_Oreal(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,X1,c_Groups_Oone__class_Oone(tc_Nat_Onat))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-64rlccsw/input.p',i_0_1457) ).
cnf(i_0_270,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-64rlccsw/input.p',i_0_270) ).
cnf(i_0_279,plain,
c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(esk5_0,X1))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,X1,c_Groups_Oone__class_Oone(tc_Nat_Onat)))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-64rlccsw/input.p',i_0_279) ).
cnf(i_0_280,plain,
c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(esk5_0,X1)),v_r),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-64rlccsw/input.p',i_0_280) ).
cnf(c_0_1463,hypothesis,
( v_thesis____
| ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X1,esk1_1(X1))),v_r)
| ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X1,esk2_1(X1)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,esk2_1(X1),c_Groups_Oone__class_Oone(tc_Nat_Onat)))))) ),
i_0_269 ).
cnf(c_0_1464,plain,
c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealDef_Oreal(tc_Nat_Onat,X1),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)) = c_RealDef_Oreal(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,X1,c_Groups_Oone__class_Oone(tc_Nat_Onat))),
i_0_1457 ).
cnf(c_0_1465,negated_conjecture,
~ v_thesis____,
i_0_270 ).
cnf(c_0_1466,plain,
c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(esk5_0,X1))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,X1,c_Groups_Oone__class_Oone(tc_Nat_Onat)))))),
i_0_279 ).
cnf(c_0_1467,hypothesis,
( ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X1,esk2_1(X1)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealDef_Oreal(tc_Nat_Onat,esk2_1(X1)),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)))))
| ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X1,esk1_1(X1))),v_r) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_1463,c_0_1464]),c_0_1465]) ).
cnf(c_0_1468,plain,
c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(esk5_0,X1))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealDef_Oreal(tc_Nat_Onat,X1),c_Groups_Oone__class_Oone(tc_RealDef_Oreal))))),
inference(rw,[status(thm)],[c_0_1466,c_0_1464]) ).
cnf(c_0_1469,plain,
c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(esk5_0,X1)),v_r),
i_0_280 ).
cnf(c_0_1470,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1467,c_0_1468]),c_0_1469])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW219+1 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jun 5 22:12:35 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.15/0.40 # ENIGMATIC: Selected SinE mode:
% 0.15/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.15/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.15/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.01/2.64 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.01/2.64 # Version: 2.1pre011
% 8.01/2.64 # Preprocessing time : 0.059 s
% 8.01/2.64
% 8.01/2.64 # Proof found!
% 8.01/2.64 # SZS status Theorem
% 8.01/2.64 # SZS output start CNFRefutation
% See solution above
% 8.01/2.64 # Proof object total steps : 13
% 8.01/2.64 # Proof object clause steps : 8
% 8.01/2.64 # Proof object formula steps : 5
% 8.01/2.64 # Proof object conjectures : 2
% 8.01/2.64 # Proof object clause conjectures : 1
% 8.01/2.64 # Proof object formula conjectures : 1
% 8.01/2.64 # Proof object initial clauses used : 5
% 8.01/2.64 # Proof object initial formulas used : 5
% 8.01/2.64 # Proof object generating inferences : 1
% 8.01/2.64 # Proof object simplifying inferences : 5
% 8.01/2.64 # Training examples: 0 positive, 0 negative
% 8.01/2.64 # Parsed axioms : 1784
% 8.01/2.64 # Removed by relevancy pruning/SinE : 0
% 8.01/2.64 # Initial clauses : 1784
% 8.01/2.64 # Removed in clause preprocessing : 0
% 8.01/2.64 # Initial clauses in saturation : 1784
% 8.01/2.64 # Processed clauses : 728
% 8.01/2.64 # ...of these trivial : 5
% 8.01/2.64 # ...subsumed : 78
% 8.01/2.64 # ...remaining for further processing : 645
% 8.01/2.64 # Other redundant clauses eliminated : 35
% 8.01/2.64 # Clauses deleted for lack of memory : 0
% 8.01/2.64 # Backward-subsumed : 2
% 8.01/2.64 # Backward-rewritten : 11
% 8.01/2.64 # Generated clauses : 2128
% 8.01/2.64 # ...of the previous two non-trivial : 1765
% 8.01/2.64 # Contextual simplify-reflections : 0
% 8.01/2.64 # Paramodulations : 2064
% 8.01/2.64 # Factorizations : 10
% 8.01/2.64 # Equation resolutions : 54
% 8.01/2.64 # Propositional unsat checks : 0
% 8.01/2.64 # Propositional unsat check successes : 0
% 8.01/2.64 # Current number of processed clauses : 605
% 8.01/2.64 # Positive orientable unit clauses : 271
% 8.01/2.64 # Positive unorientable unit clauses: 2
% 8.01/2.64 # Negative unit clauses : 11
% 8.01/2.64 # Non-unit-clauses : 321
% 8.01/2.64 # Current number of unprocessed clauses: 2741
% 8.01/2.64 # ...number of literals in the above : 7213
% 8.01/2.64 # Current number of archived formulas : 0
% 8.01/2.64 # Current number of archived clauses : 13
% 8.01/2.64 # Clause-clause subsumption calls (NU) : 10952
% 8.01/2.64 # Rec. Clause-clause subsumption calls : 9057
% 8.01/2.64 # Non-unit clause-clause subsumptions : 70
% 8.01/2.64 # Unit Clause-clause subsumption calls : 48
% 8.01/2.64 # Rewrite failures with RHS unbound : 0
% 8.01/2.64 # BW rewrite match attempts : 187
% 8.01/2.64 # BW rewrite match successes : 46
% 8.01/2.64 # Condensation attempts : 0
% 8.01/2.64 # Condensation successes : 0
% 8.01/2.64 # Termbank termtop insertions : 73810
% 8.01/2.64
% 8.01/2.64 # -------------------------------------------------
% 8.01/2.64 # User time : 0.095 s
% 8.01/2.64 # System time : 0.006 s
% 8.01/2.64 # Total time : 0.101 s
% 8.01/2.64 # ...preprocessing : 0.059 s
% 8.01/2.64 # ...main loop : 0.042 s
% 8.01/2.64 # Maximum resident set size: 10512 pages
% 8.01/2.64
%------------------------------------------------------------------------------