TSTP Solution File: SWW278+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW278+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n005.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:14:02 EDT 2024
% Result : Theorem 3.72s 1.09s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 15 unt; 0 def)
% Number of atoms : 27 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 4 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 20 ( 3 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
! [X15,X5] :
( class_Rings_Ocomm__semiring__1(X5)
=> hAPP(hAPP(c_Groups_Otimes__class_Otimes(X5),X15),c_Groups_Ozero__class_Ozero(X5)) = c_Groups_Ozero__class_Ozero(X5) ),
file('/export/starexec/sandbox/tmp/tmp.FVCEY1FLNr/E---3.1_32472.p',fact_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).
fof(fact_poly__mult,axiom,
! [X4,X11,X12,X5] :
( class_Rings_Ocomm__semiring__0(X5)
=> hAPP(c_Polynomial_Opoly(X5,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(X5)),X12),X11)),X4) = hAPP(hAPP(c_Groups_Otimes__class_Otimes(X5),hAPP(c_Polynomial_Opoly(X5,X12),X4)),hAPP(c_Polynomial_Opoly(X5,X11),X4)) ),
file('/export/starexec/sandbox/tmp/tmp.FVCEY1FLNr/E---3.1_32472.p',fact_poly__mult) ).
fof(arity_Complex__Ocomplex__Rings_Ocomm__semiring__1,axiom,
class_Rings_Ocomm__semiring__1(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.FVCEY1FLNr/E---3.1_32472.p',arity_Complex__Ocomplex__Rings_Ocomm__semiring__1) ).
fof(conj_0,conjecture,
hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_pa____),v_x____) = c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.FVCEY1FLNr/E---3.1_32472.p',conj_0) ).
fof(fact_h,axiom,
hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_s____),v_x____) = c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.FVCEY1FLNr/E---3.1_32472.p',fact_h) ).
fof(arity_Complex__Ocomplex__Rings_Ocomm__semiring__0,axiom,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.FVCEY1FLNr/E---3.1_32472.p',arity_Complex__Ocomplex__Rings_Ocomm__semiring__0) ).
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.FVCEY1FLNr/E---3.1_32472.p',fact_s) ).
fof(c_0_7,plain,
! [X176,X177] :
( ~ class_Rings_Ocomm__semiring__1(X177)
| hAPP(hAPP(c_Groups_Otimes__class_Otimes(X177),X176),c_Groups_Ozero__class_Ozero(X177)) = c_Groups_Ozero__class_Ozero(X177) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J])])]) ).
fof(c_0_8,plain,
! [X109,X110,X111,X112] :
( ~ class_Rings_Ocomm__semiring__0(X112)
| hAPP(c_Polynomial_Opoly(X112,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(X112)),X111),X110)),X109) = hAPP(hAPP(c_Groups_Otimes__class_Otimes(X112),hAPP(c_Polynomial_Opoly(X112,X111),X109)),hAPP(c_Polynomial_Opoly(X112,X110),X109)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_poly__mult])])]) ).
cnf(c_0_9,plain,
( hAPP(hAPP(c_Groups_Otimes__class_Otimes(X1),X2),c_Groups_Ozero__class_Ozero(X1)) = c_Groups_Ozero__class_Ozero(X1)
| ~ class_Rings_Ocomm__semiring__1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
class_Rings_Ocomm__semiring__1(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[arity_Complex__Ocomplex__Rings_Ocomm__semiring__1]) ).
fof(c_0_11,negated_conjecture,
hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_pa____),v_x____) != c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
cnf(c_0_12,plain,
( hAPP(c_Polynomial_Opoly(X1,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(X1)),X2),X3)),X4) = hAPP(hAPP(c_Groups_Otimes__class_Otimes(X1),hAPP(c_Polynomial_Opoly(X1,X2),X4)),hAPP(c_Polynomial_Opoly(X1,X3),X4))
| ~ class_Rings_Ocomm__semiring__0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_s____),v_x____) = c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[fact_h]) ).
cnf(c_0_14,plain,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[arity_Complex__Ocomplex__Rings_Ocomm__semiring__0]) ).
cnf(c_0_15,plain,
hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),X1),c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex)) = c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_16,negated_conjecture,
hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_pa____),v_x____) != c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),X1),v_s____)),v_x____) = c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_18,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_19,negated_conjecture,
hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_pa____),v_x____) != c_Groups_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW278+1 : TPTP v8.2.0. Released v5.2.0.
% 0.00/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n005.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:36:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.42/0.59 Running first-order model finding
% 0.42/0.59 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.FVCEY1FLNr/E---3.1_32472.p
% 3.72/1.09 # Version: 3.2.0
% 3.72/1.09 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.72/1.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.72/1.09 # Starting new_bool_3 with 300s (1) cores
% 3.72/1.09 # Starting new_bool_1 with 300s (1) cores
% 3.72/1.09 # Starting sh5l with 300s (1) cores
% 3.72/1.09 # new_bool_3 with pid 32550 completed with status 0
% 3.72/1.09 # Result found by new_bool_3
% 3.72/1.09 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.72/1.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.72/1.09 # Starting new_bool_3 with 300s (1) cores
% 3.72/1.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.72/1.09 # Search class: FGHSM-FSLM32-DFFFFFNN
% 3.72/1.09 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.72/1.09 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 3.72/1.09 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 32553 completed with status 0
% 3.72/1.09 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 3.72/1.09 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.72/1.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/1.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.72/1.09 # Starting new_bool_3 with 300s (1) cores
% 3.72/1.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.72/1.09 # Search class: FGHSM-FSLM32-DFFFFFNN
% 3.72/1.09 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.72/1.09 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 3.72/1.09 # Preprocessing time : 0.016 s
% 3.72/1.09
% 3.72/1.09 # Proof found!
% 3.72/1.09 # SZS status Theorem
% 3.72/1.09 # SZS output start CNFRefutation
% See solution above
% 3.72/1.09 # Parsed axioms : 1200
% 3.72/1.09 # Removed by relevancy pruning/SinE : 684
% 3.72/1.09 # Initial clauses : 718
% 3.72/1.09 # Removed in clause preprocessing : 52
% 3.72/1.09 # Initial clauses in saturation : 666
% 3.72/1.09 # Processed clauses : 1823
% 3.72/1.09 # ...of these trivial : 92
% 3.72/1.09 # ...subsumed : 770
% 3.72/1.09 # ...remaining for further processing : 961
% 3.72/1.09 # Other redundant clauses eliminated : 60
% 3.72/1.09 # Clauses deleted for lack of memory : 0
% 3.72/1.09 # Backward-subsumed : 21
% 3.72/1.09 # Backward-rewritten : 9
% 3.72/1.09 # Generated clauses : 22472
% 3.72/1.09 # ...of the previous two non-redundant : 20102
% 3.72/1.09 # ...aggressively subsumed : 0
% 3.72/1.09 # Contextual simplify-reflections : 7
% 3.72/1.09 # Paramodulations : 22354
% 3.72/1.09 # Factorizations : 8
% 3.72/1.09 # NegExts : 0
% 3.72/1.09 # Equation resolutions : 110
% 3.72/1.09 # Disequality decompositions : 0
% 3.72/1.09 # Total rewrite steps : 15399
% 3.72/1.09 # ...of those cached : 13856
% 3.72/1.09 # Propositional unsat checks : 0
% 3.72/1.09 # Propositional check models : 0
% 3.72/1.09 # Propositional check unsatisfiable : 0
% 3.72/1.09 # Propositional clauses : 0
% 3.72/1.09 # Propositional clauses after purity: 0
% 3.72/1.09 # Propositional unsat core size : 0
% 3.72/1.09 # Propositional preprocessing time : 0.000
% 3.72/1.09 # Propositional encoding time : 0.000
% 3.72/1.09 # Propositional solver time : 0.000
% 3.72/1.09 # Success case prop preproc time : 0.000
% 3.72/1.09 # Success case prop encoding time : 0.000
% 3.72/1.09 # Success case prop solver time : 0.000
% 3.72/1.09 # Current number of processed clauses : 914
% 3.72/1.09 # Positive orientable unit clauses : 150
% 3.72/1.09 # Positive unorientable unit clauses: 12
% 3.72/1.09 # Negative unit clauses : 53
% 3.72/1.09 # Non-unit-clauses : 699
% 3.72/1.09 # Current number of unprocessed clauses: 18830
% 3.72/1.09 # ...number of literals in the above : 53785
% 3.72/1.09 # Current number of archived formulas : 0
% 3.72/1.09 # Current number of archived clauses : 30
% 3.72/1.09 # Clause-clause subsumption calls (NU) : 29927
% 3.72/1.09 # Rec. Clause-clause subsumption calls : 20516
% 3.72/1.09 # Non-unit clause-clause subsumptions : 444
% 3.72/1.09 # Unit Clause-clause subsumption calls : 1985
% 3.72/1.09 # Rewrite failures with RHS unbound : 0
% 3.72/1.09 # BW rewrite match attempts : 1003
% 3.72/1.09 # BW rewrite match successes : 64
% 3.72/1.09 # Condensation attempts : 0
% 3.72/1.09 # Condensation successes : 0
% 3.72/1.09 # Termbank termtop insertions : 521305
% 3.72/1.09 # Search garbage collected termcells : 12935
% 3.72/1.09
% 3.72/1.09 # -------------------------------------------------
% 3.72/1.09 # User time : 0.440 s
% 3.72/1.09 # System time : 0.022 s
% 3.72/1.09 # Total time : 0.462 s
% 3.72/1.09 # Maximum resident set size: 4948 pages
% 3.72/1.09
% 3.72/1.09 # -------------------------------------------------
% 3.72/1.09 # User time : 0.461 s
% 3.72/1.09 # System time : 0.025 s
% 3.72/1.09 # Total time : 0.486 s
% 3.72/1.09 # Maximum resident set size: 3096 pages
% 3.72/1.09 % E---3.1 exiting
% 3.72/1.09 % E exiting
%------------------------------------------------------------------------------