TSTP Solution File: SWW277+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW277+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n027.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 0.47s 1.13s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 32 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 8 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 16 ( 2 sgn 9 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
v_thesis____,
file('/export/starexec/sandbox2/tmp/tmp.Cx5bKFz8kB/E---3.1_22769.p',conj_1) ).
fof(conj_0,hypothesis,
( ? [X94] : v_s____ = hAPP(hAPP(c_Groups_Otimes__class_Otimes(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))))),X94)
=> v_thesis____ ),
file('/export/starexec/sandbox2/tmp/tmp.Cx5bKFz8kB/E---3.1_22769.p',conj_0) ).
fof(fact_dvd__mult__div__cancel,axiom,
! [X14,X12,X4] :
( class_Divides_Osemiring__div(X4)
=> ( hBOOL(hAPP(hAPP(c_Rings_Odvd__class_Odvd(X4),X12),X14))
=> hAPP(hAPP(c_Groups_Otimes__class_Otimes(X4),X12),c_Divides_Odiv__class_Odiv(X4,X14,X12)) = X14 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Cx5bKFz8kB/E---3.1_22769.p',fact_dvd__mult__div__cancel) ).
fof(fact__096_091_058_N_Aa_M_A1_058_093_Advd_As_096,axiom,
hBOOL(hAPP(hAPP(c_Rings_Odvd__class_Odvd(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))))),v_s____)),
file('/export/starexec/sandbox2/tmp/tmp.Cx5bKFz8kB/E---3.1_22769.p',fact__096_091_058_N_Aa_M_A1_058_093_Advd_As_096) ).
fof(arity_Polynomial__Opoly__Divides_Osemiring__div,axiom,
! [X91] :
( class_Fields_Ofield(X91)
=> class_Divides_Osemiring__div(tc_Polynomial_Opoly(X91)) ),
file('/export/starexec/sandbox2/tmp/tmp.Cx5bKFz8kB/E---3.1_22769.p',arity_Polynomial__Opoly__Divides_Osemiring__div) ).
fof(arity_Complex__Ocomplex__Fields_Ofield,axiom,
class_Fields_Ofield(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/tmp/tmp.Cx5bKFz8kB/E---3.1_22769.p',arity_Complex__Ocomplex__Fields_Ofield) ).
fof(c_0_6,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).
fof(c_0_7,hypothesis,
! [X3000] :
( v_s____ != hAPP(hAPP(c_Groups_Otimes__class_Otimes(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))))),X3000)
| v_thesis____ ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])])]) ).
fof(c_0_8,negated_conjecture,
~ v_thesis____,
inference(fof_nnf,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X2688,X2689,X2690] :
( ~ class_Divides_Osemiring__div(X2690)
| ~ hBOOL(hAPP(hAPP(c_Rings_Odvd__class_Odvd(X2690),X2689),X2688))
| hAPP(hAPP(c_Groups_Otimes__class_Otimes(X2690),X2689),c_Divides_Odiv__class_Odiv(X2690,X2688,X2689)) = X2688 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_dvd__mult__div__cancel])])]) ).
cnf(c_0_10,hypothesis,
( v_thesis____
| v_s____ != hAPP(hAPP(c_Groups_Otimes__class_Otimes(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))))),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
~ v_thesis____,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( hAPP(hAPP(c_Groups_Otimes__class_Otimes(X1),X2),c_Divides_Odiv__class_Odiv(X1,X3,X2)) = X3
| ~ class_Divides_Osemiring__div(X1)
| ~ hBOOL(hAPP(hAPP(c_Rings_Odvd__class_Odvd(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
hBOOL(hAPP(hAPP(c_Rings_Odvd__class_Odvd(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))))),v_s____)),
inference(split_conjunct,[status(thm)],[fact__096_091_058_N_Aa_M_A1_058_093_Advd_As_096]) ).
cnf(c_0_14,hypothesis,
hAPP(hAPP(c_Groups_Otimes__class_Otimes(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))))),X1) != v_s____,
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,plain,
! [X2967] :
( ~ class_Fields_Ofield(X2967)
| class_Divides_Osemiring__div(tc_Polynomial_Opoly(X2967)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[arity_Polynomial__Opoly__Divides_Osemiring__div])])]) ).
cnf(c_0_16,plain,
~ class_Divides_Osemiring__div(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,plain,
( class_Divides_Osemiring__div(tc_Polynomial_Opoly(X1))
| ~ class_Fields_Ofield(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
class_Fields_Ofield(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[arity_Complex__Ocomplex__Fields_Ofield]) ).
cnf(c_0_19,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWW277+1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.13 % Command : run_E %s %d SAT
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 05:22:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.42/0.62 Running first-order model finding
% 0.42/0.62 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Cx5bKFz8kB/E---3.1_22769.p
% 0.47/1.13 # Version: 3.2.0
% 0.47/1.13 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.47/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/1.13 # Starting new_bool_3 with 300s (1) cores
% 0.47/1.13 # Starting new_bool_1 with 300s (1) cores
% 0.47/1.13 # Starting sh5l with 300s (1) cores
% 0.47/1.13 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22941 completed with status 0
% 0.47/1.13 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.47/1.13 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.47/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/1.13 # No SInE strategy applied
% 0.47/1.13 # Search class: FGHSM-SMLM32-DFFFFFNN
% 0.47/1.13 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.47/1.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 0.47/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.47/1.13 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 0.47/1.13 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.47/1.13 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 0.47/1.13 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22993 completed with status 0
% 0.47/1.13 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.47/1.13 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.47/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/1.13 # No SInE strategy applied
% 0.47/1.13 # Search class: FGHSM-SMLM32-DFFFFFNN
% 0.47/1.13 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.47/1.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 0.47/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.47/1.13 # Preprocessing time : 0.028 s
% 0.47/1.13 # Presaturation interreduction done
% 0.47/1.13
% 0.47/1.13 # Proof found!
% 0.47/1.13 # SZS status Theorem
% 0.47/1.13 # SZS output start CNFRefutation
% See solution above
% 0.47/1.13 # Parsed axioms : 1209
% 0.47/1.13 # Removed by relevancy pruning/SinE : 0
% 0.47/1.13 # Initial clauses : 1698
% 0.47/1.13 # Removed in clause preprocessing : 78
% 0.47/1.13 # Initial clauses in saturation : 1620
% 0.47/1.13 # Processed clauses : 3214
% 0.47/1.13 # ...of these trivial : 31
% 0.47/1.13 # ...subsumed : 687
% 0.47/1.13 # ...remaining for further processing : 2496
% 0.47/1.13 # Other redundant clauses eliminated : 326
% 0.47/1.13 # Clauses deleted for lack of memory : 0
% 0.47/1.13 # Backward-subsumed : 2
% 0.47/1.13 # Backward-rewritten : 5
% 0.47/1.13 # Generated clauses : 12216
% 0.47/1.13 # ...of the previous two non-redundant : 10163
% 0.47/1.13 # ...aggressively subsumed : 0
% 0.47/1.13 # Contextual simplify-reflections : 2
% 0.47/1.13 # Paramodulations : 11891
% 0.47/1.13 # Factorizations : 8
% 0.47/1.13 # NegExts : 0
% 0.47/1.13 # Equation resolutions : 344
% 0.47/1.13 # Disequality decompositions : 0
% 0.47/1.13 # Total rewrite steps : 7529
% 0.47/1.13 # ...of those cached : 6758
% 0.47/1.13 # Propositional unsat checks : 0
% 0.47/1.13 # Propositional check models : 0
% 0.47/1.13 # Propositional check unsatisfiable : 0
% 0.47/1.13 # Propositional clauses : 0
% 0.47/1.13 # Propositional clauses after purity: 0
% 0.47/1.13 # Propositional unsat core size : 0
% 0.47/1.13 # Propositional preprocessing time : 0.000
% 0.47/1.13 # Propositional encoding time : 0.000
% 0.47/1.13 # Propositional solver time : 0.000
% 0.47/1.13 # Success case prop preproc time : 0.000
% 0.47/1.13 # Success case prop encoding time : 0.000
% 0.47/1.13 # Success case prop solver time : 0.000
% 0.47/1.13 # Current number of processed clauses : 1022
% 0.47/1.13 # Positive orientable unit clauses : 266
% 0.47/1.13 # Positive unorientable unit clauses: 9
% 0.47/1.13 # Negative unit clauses : 48
% 0.47/1.13 # Non-unit-clauses : 699
% 0.47/1.13 # Current number of unprocessed clauses: 9873
% 0.47/1.13 # ...number of literals in the above : 27376
% 0.47/1.13 # Current number of archived formulas : 0
% 0.47/1.13 # Current number of archived clauses : 1312
% 0.47/1.13 # Clause-clause subsumption calls (NU) : 191555
% 0.47/1.13 # Rec. Clause-clause subsumption calls : 114435
% 0.47/1.13 # Non-unit clause-clause subsumptions : 342
% 0.47/1.13 # Unit Clause-clause subsumption calls : 2369
% 0.47/1.13 # Rewrite failures with RHS unbound : 0
% 0.47/1.13 # BW rewrite match attempts : 1057
% 0.47/1.13 # BW rewrite match successes : 172
% 0.47/1.13 # Condensation attempts : 0
% 0.47/1.13 # Condensation successes : 0
% 0.47/1.13 # Termbank termtop insertions : 371229
% 0.47/1.13 # Search garbage collected termcells : 21656
% 0.47/1.13
% 0.47/1.13 # -------------------------------------------------
% 0.47/1.13 # User time : 0.422 s
% 0.47/1.13 # System time : 0.025 s
% 0.47/1.13 # Total time : 0.447 s
% 0.47/1.13 # Maximum resident set size: 8524 pages
% 0.47/1.13
% 0.47/1.13 # -------------------------------------------------
% 0.47/1.13 # User time : 1.786 s
% 0.47/1.13 # System time : 0.100 s
% 0.47/1.13 # Total time : 1.886 s
% 0.47/1.13 # Maximum resident set size: 3136 pages
% 0.47/1.13 % E---3.1 exiting
% 0.47/1.13 % E exiting
%------------------------------------------------------------------------------