TSTP Solution File: ALG432-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG432-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Sat May 4 07:16:41 EDT 2024
% Result : Unsatisfiable 0.44s 0.72s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 12 unt; 0 nHn; 10 RR)
% Number of literals : 30 ( 16 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 26 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_class__semiring_Osemiring__rules_I10_J_0,axiom,
( c_HOL_Otimes__class_Otimes(X2,c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8wUXgdTP6V/E---3.1_8359.p',cls_class__semiring_Osemiring__rules_I10_J_0) ).
cnf(cls_class__semiring_Osemiring__rules_I6_J_0,axiom,
( c_HOL_Oplus__class_Oplus(X2,c_HOL_Ozero__class_Ozero(X1),X1) = X2
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8wUXgdTP6V/E---3.1_8359.p',cls_class__semiring_Osemiring__rules_I6_J_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_Polynomial_Opoly(c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),v_p,tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.8wUXgdTP6V/E---3.1_8359.p',cls_conjecture_1) ).
cnf(cls_poly__pCons_0,axiom,
( c_Polynomial_Opoly(c_Polynomial_OpCons(X2,X3,X1),X4,X1) = c_HOL_Oplus__class_Oplus(X2,c_HOL_Otimes__class_Otimes(X4,c_Polynomial_Opoly(X3,X4,X1),X1),X1)
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8wUXgdTP6V/E---3.1_8359.p',cls_poly__pCons_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.8wUXgdTP6V/E---3.1_8359.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Polynomial_Opoly(v_p,v_x,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.8wUXgdTP6V/E---3.1_8359.p',cls_conjecture_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.8wUXgdTP6V/E---3.1_8359.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0) ).
cnf(c_0_7,plain,
( c_HOL_Otimes__class_Otimes(X2,c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
inference(fof_simplification,[status(thm)],[cls_class__semiring_Osemiring__rules_I10_J_0]) ).
cnf(c_0_8,plain,
( c_HOL_Oplus__class_Oplus(X2,c_HOL_Ozero__class_Ozero(X1),X1) = X2
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
inference(fof_simplification,[status(thm)],[cls_class__semiring_Osemiring__rules_I6_J_0]) ).
cnf(c_0_9,negated_conjecture,
c_Polynomial_Opoly(c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),v_p,tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_10,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(X2,X3,X1),X4,X1) = c_HOL_Oplus__class_Oplus(X2,c_HOL_Otimes__class_Otimes(X4,c_Polynomial_Opoly(X3,X4,X1),X1),X1)
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
inference(fof_simplification,[status(thm)],[cls_poly__pCons_0]) ).
cnf(c_0_11,plain,
( c_HOL_Otimes__class_Otimes(X2,c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
c_0_7 ).
cnf(c_0_12,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1 ).
cnf(c_0_13,plain,
( c_HOL_Oplus__class_Oplus(X2,c_HOL_Ozero__class_Ozero(X1),X1) = X2
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
c_Polynomial_Opoly(c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),v_p,tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
c_0_9 ).
cnf(c_0_15,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(X2,X3,X1),X4,X1) = c_HOL_Oplus__class_Oplus(X2,c_HOL_Otimes__class_Otimes(X4,c_Polynomial_Opoly(X3,X4,X1),X1),X1)
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
c_Polynomial_Opoly(v_p,v_x,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
cls_conjecture_0 ).
cnf(c_0_17,plain,
c_HOL_Otimes__class_Otimes(X1,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
c_HOL_Oplus__class_Oplus(X1,c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.20 % Problem : ALG432-1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.21 % Command : run_E %s %d THM
% 0.20/0.41 % Computer : n022.cluster.edu
% 0.20/0.41 % Model : x86_64 x86_64
% 0.20/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.41 % Memory : 8042.1875MB
% 0.20/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.41 % CPULimit : 300
% 0.20/0.41 % WCLimit : 300
% 0.20/0.41 % DateTime : Fri May 3 13:48:42 EDT 2024
% 0.20/0.41 % CPUTime :
% 0.44/0.60 Running first-order theorem proving
% 0.44/0.60 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.8wUXgdTP6V/E---3.1_8359.p
% 0.44/0.72 # Version: 3.1.0
% 0.44/0.72 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.44/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.72 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.44/0.72 # Starting new_bool_3 with 600s (2) cores
% 0.44/0.72 # Starting new_bool_1 with 600s (2) cores
% 0.44/0.72 # Starting sh5l with 300s (1) cores
% 0.44/0.72 # new_bool_3 with pid 8438 completed with status 0
% 0.44/0.72 # Result found by new_bool_3
% 0.44/0.72 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.44/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.72 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.44/0.72 # Starting new_bool_3 with 600s (2) cores
% 0.44/0.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/0.72 # Search class: FGUSM-FSLM32-MFFFFFNN
% 0.44/0.72 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.44/0.72 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.44/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.44/0.72 # SAT001_MinMin_p005000_rr_RG with pid 8441 completed with status 0
% 0.44/0.72 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.44/0.72 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.44/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.72 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.44/0.72 # Starting new_bool_3 with 600s (2) cores
% 0.44/0.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/0.72 # Search class: FGUSM-FSLM32-MFFFFFNN
% 0.44/0.72 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.44/0.72 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.44/0.72 # Preprocessing time : 0.005 s
% 0.44/0.72 # Presaturation interreduction done
% 0.44/0.72
% 0.44/0.72 # Proof found!
% 0.44/0.72 # SZS status Unsatisfiable
% 0.44/0.72 # SZS output start CNFRefutation
% See solution above
% 0.44/0.72 # Parsed axioms : 938
% 0.44/0.72 # Removed by relevancy pruning/SinE : 610
% 0.44/0.72 # Initial clauses : 328
% 0.44/0.72 # Removed in clause preprocessing : 0
% 0.44/0.72 # Initial clauses in saturation : 328
% 0.44/0.72 # Processed clauses : 721
% 0.44/0.72 # ...of these trivial : 17
% 0.44/0.72 # ...subsumed : 97
% 0.44/0.72 # ...remaining for further processing : 607
% 0.44/0.72 # Other redundant clauses eliminated : 0
% 0.44/0.72 # Clauses deleted for lack of memory : 0
% 0.44/0.72 # Backward-subsumed : 2
% 0.44/0.72 # Backward-rewritten : 3
% 0.44/0.72 # Generated clauses : 2316
% 0.44/0.72 # ...of the previous two non-redundant : 1798
% 0.44/0.72 # ...aggressively subsumed : 0
% 0.44/0.72 # Contextual simplify-reflections : 3
% 0.44/0.72 # Paramodulations : 2313
% 0.44/0.72 # Factorizations : 0
% 0.44/0.72 # NegExts : 0
% 0.44/0.72 # Equation resolutions : 3
% 0.44/0.72 # Disequality decompositions : 0
% 0.44/0.72 # Total rewrite steps : 1304
% 0.44/0.72 # ...of those cached : 1131
% 0.44/0.72 # Propositional unsat checks : 0
% 0.44/0.72 # Propositional check models : 0
% 0.44/0.72 # Propositional check unsatisfiable : 0
% 0.44/0.72 # Propositional clauses : 0
% 0.44/0.72 # Propositional clauses after purity: 0
% 0.44/0.72 # Propositional unsat core size : 0
% 0.44/0.72 # Propositional preprocessing time : 0.000
% 0.44/0.72 # Propositional encoding time : 0.000
% 0.44/0.72 # Propositional solver time : 0.000
% 0.44/0.72 # Success case prop preproc time : 0.000
% 0.44/0.72 # Success case prop encoding time : 0.000
% 0.44/0.72 # Success case prop solver time : 0.000
% 0.44/0.72 # Current number of processed clauses : 314
% 0.44/0.72 # Positive orientable unit clauses : 73
% 0.44/0.72 # Positive unorientable unit clauses: 1
% 0.44/0.72 # Negative unit clauses : 1
% 0.44/0.72 # Non-unit-clauses : 239
% 0.44/0.72 # Current number of unprocessed clauses: 1662
% 0.44/0.72 # ...number of literals in the above : 6075
% 0.44/0.72 # Current number of archived formulas : 0
% 0.44/0.72 # Current number of archived clauses : 293
% 0.44/0.72 # Clause-clause subsumption calls (NU) : 22165
% 0.44/0.72 # Rec. Clause-clause subsumption calls : 9719
% 0.44/0.72 # Non-unit clause-clause subsumptions : 101
% 0.44/0.72 # Unit Clause-clause subsumption calls : 109
% 0.44/0.72 # Rewrite failures with RHS unbound : 0
% 0.44/0.72 # BW rewrite match attempts : 136
% 0.44/0.72 # BW rewrite match successes : 6
% 0.44/0.72 # Condensation attempts : 0
% 0.44/0.72 # Condensation successes : 0
% 0.44/0.72 # Termbank termtop insertions : 56419
% 0.44/0.72 # Search garbage collected termcells : 2548
% 0.44/0.72
% 0.44/0.72 # -------------------------------------------------
% 0.44/0.72 # User time : 0.079 s
% 0.44/0.72 # System time : 0.010 s
% 0.44/0.72 # Total time : 0.089 s
% 0.44/0.72 # Maximum resident set size: 2872 pages
% 0.44/0.72
% 0.44/0.72 # -------------------------------------------------
% 0.44/0.72 # User time : 0.171 s
% 0.44/0.72 # System time : 0.015 s
% 0.44/0.72 # Total time : 0.186 s
% 0.44/0.72 # Maximum resident set size: 2352 pages
% 0.44/0.72 % E---3.1 exiting
% 0.44/0.72 % E exiting
%------------------------------------------------------------------------------