TSTP Solution File: SWW246+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWW246+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:10:51 EDT 2023

% Result   : ContradictoryAxioms 2.49s 0.93s
% Output   : CNFRefutation 2.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   41 (  19 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   45 (  21   ~;  16   |;   3   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :   28 (   5 sgn;  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact__C0_C,axiom,
    ( class_Rings_Oidom(t_a)
   => ~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(t_a,t_a,c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)))) ),
    file('/export/starexec/sandbox/tmp/tmp.WR3hyFMBxa/E---3.1_23071.p',fact__C0_C) ).

fof(fact_order__root,axiom,
    ! [X11,X4,X5] :
      ( class_Rings_Oidom(X5)
     => ( hAPP(c_Polynomial_Opoly(X5,X4),X11) = c_Groups_Ozero__class_Ozero(X5)
      <=> ( X4 = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X5))
          | c_Polynomial_Oorder(X5,X11,X4) != c_Groups_Ozero__class_Ozero(tc_Nat_Onat) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.WR3hyFMBxa/E---3.1_23071.p',fact_order__root) ).

fof(tfree_0,hypothesis,
    class_Rings_Oidom(t_a),
    file('/export/starexec/sandbox/tmp/tmp.WR3hyFMBxa/E---3.1_23071.p',tfree_0) ).

fof(fact_constant__def,axiom,
    ! [X2,X15,X5] :
      ( c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(X5,X15,X2)
    <=> ! [X3,X16] : hAPP(X2,X3) = hAPP(X2,X16) ),
    file('/export/starexec/sandbox/tmp/tmp.WR3hyFMBxa/E---3.1_23071.p',fact_constant__def) ).

fof(c_0_4,plain,
    ( class_Rings_Oidom(t_a)
   => ~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(t_a,t_a,c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)))) ),
    inference(fof_simplification,[status(thm)],[fact__C0_C]) ).

fof(c_0_5,plain,
    ( ~ class_Rings_Oidom(t_a)
    | ~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(t_a,t_a,c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)))) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

fof(c_0_6,plain,
    ! [X325,X326,X327] :
      ( ( hAPP(c_Polynomial_Opoly(X327,X326),X325) != c_Groups_Ozero__class_Ozero(X327)
        | X326 = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X327))
        | c_Polynomial_Oorder(X327,X325,X326) != c_Groups_Ozero__class_Ozero(tc_Nat_Onat)
        | ~ class_Rings_Oidom(X327) )
      & ( X326 != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X327))
        | hAPP(c_Polynomial_Opoly(X327,X326),X325) = c_Groups_Ozero__class_Ozero(X327)
        | ~ class_Rings_Oidom(X327) )
      & ( c_Polynomial_Oorder(X327,X325,X326) = c_Groups_Ozero__class_Ozero(tc_Nat_Onat)
        | hAPP(c_Polynomial_Opoly(X327,X326),X325) = c_Groups_Ozero__class_Ozero(X327)
        | ~ class_Rings_Oidom(X327) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_order__root])])]) ).

cnf(c_0_7,plain,
    ( ~ class_Rings_Oidom(t_a)
    | ~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(t_a,t_a,c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,hypothesis,
    class_Rings_Oidom(t_a),
    inference(split_conjunct,[status(thm)],[tfree_0]) ).

fof(c_0_9,plain,
    ! [X156,X157,X158,X159,X160,X161,X164,X165] :
      ( ( ~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(X158,X157,X156)
        | hAPP(X156,X159) = hAPP(X156,X160) )
      & ( hAPP(X161,esk2_1(X161)) != hAPP(X161,esk3_1(X161))
        | c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(X165,X164,X161) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_constant__def])])])])]) ).

cnf(c_0_10,plain,
    ( hAPP(c_Polynomial_Opoly(X2,X1),X3) = c_Groups_Ozero__class_Ozero(X2)
    | X1 != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X2))
    | ~ class_Rings_Oidom(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(t_a,t_a,c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).

cnf(c_0_12,plain,
    ( c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(X2,X3,X1)
    | hAPP(X1,esk2_1(X1)) != hAPP(X1,esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    ( hAPP(c_Polynomial_Opoly(X1,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))),X2) = c_Groups_Ozero__class_Ozero(X1)
    | ~ class_Rings_Oidom(X1) ),
    inference(er,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    hAPP(c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))),esk2_1(c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))))) != hAPP(c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))),esk3_1(c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,hypothesis,
    hAPP(c_Polynomial_Opoly(t_a,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))),X1) = c_Groups_Ozero__class_Ozero(t_a),
    inference(spm,[status(thm)],[c_0_13,c_0_8]) ).

cnf(c_0_16,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : SWW246+1 : TPTP v8.1.2. Released v5.2.0.
% 0.06/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n013.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 22:38:44 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.16/0.55  Running first-order model finding
% 0.16/0.55  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.WR3hyFMBxa/E---3.1_23071.p
% 2.49/0.93  # Version: 3.1pre001
% 2.49/0.93  # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.49/0.93  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.49/0.93  # Starting new_bool_3 with 300s (1) cores
% 2.49/0.93  # Starting new_bool_1 with 300s (1) cores
% 2.49/0.93  # Starting sh5l with 300s (1) cores
% 2.49/0.93  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23148 completed with status 0
% 2.49/0.93  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.49/0.93  # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.49/0.93  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.49/0.93  # No SInE strategy applied
% 2.49/0.93  # Search class: FGHSM-SSLM32-DFFFFFNN
% 2.49/0.93  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 113s (1) cores
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.49/0.93  # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 2.49/0.93  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 113s (1) cores
% 2.49/0.93  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 23158 completed with status 0
% 2.49/0.93  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 2.49/0.93  # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.49/0.93  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.49/0.93  # No SInE strategy applied
% 2.49/0.93  # Search class: FGHSM-SSLM32-DFFFFFNN
% 2.49/0.93  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 113s (1) cores
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.49/0.93  # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 2.49/0.93  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 2.49/0.93  # Preprocessing time       : 0.021 s
% 2.49/0.93  # Presaturation interreduction done
% 2.49/0.93  
% 2.49/0.93  # Proof found!
% 2.49/0.93  # SZS status ContradictoryAxioms
% 2.49/0.93  # SZS output start CNFRefutation
% See solution above
% 2.49/0.93  # Parsed axioms                        : 1199
% 2.49/0.93  # Removed by relevancy pruning/SinE    : 0
% 2.49/0.93  # Initial clauses                      : 1592
% 2.49/0.93  # Removed in clause preprocessing      : 85
% 2.49/0.93  # Initial clauses in saturation        : 1507
% 2.49/0.93  # Processed clauses                    : 2598
% 2.49/0.93  # ...of these trivial                  : 17
% 2.49/0.93  # ...subsumed                          : 372
% 2.49/0.93  # ...remaining for further processing  : 2209
% 2.49/0.93  # Other redundant clauses eliminated   : 190
% 2.49/0.93  # Clauses deleted for lack of memory   : 0
% 2.49/0.93  # Backward-subsumed                    : 2
% 2.49/0.93  # Backward-rewritten                   : 10
% 2.49/0.93  # Generated clauses                    : 1975
% 2.49/0.93  # ...of the previous two non-redundant : 1641
% 2.49/0.93  # ...aggressively subsumed             : 0
% 2.49/0.93  # Contextual simplify-reflections      : 1
% 2.49/0.93  # Paramodulations                      : 1813
% 2.49/0.93  # Factorizations                       : 0
% 2.49/0.93  # NegExts                              : 0
% 2.49/0.93  # Equation resolutions                 : 195
% 2.49/0.93  # Total rewrite steps                  : 716
% 2.49/0.93  # Propositional unsat checks           : 0
% 2.49/0.93  #    Propositional check models        : 0
% 2.49/0.93  #    Propositional check unsatisfiable : 0
% 2.49/0.93  #    Propositional clauses             : 0
% 2.49/0.93  #    Propositional clauses after purity: 0
% 2.49/0.93  #    Propositional unsat core size     : 0
% 2.49/0.93  #    Propositional preprocessing time  : 0.000
% 2.49/0.93  #    Propositional encoding time       : 0.000
% 2.49/0.93  #    Propositional solver time         : 0.000
% 2.49/0.93  #    Success case prop preproc time    : 0.000
% 2.49/0.93  #    Success case prop encoding time   : 0.000
% 2.49/0.93  #    Success case prop solver time     : 0.000
% 2.49/0.93  # Current number of processed clauses  : 800
% 2.49/0.93  #    Positive orientable unit clauses  : 268
% 2.49/0.93  #    Positive unorientable unit clauses: 0
% 2.49/0.93  #    Negative unit clauses             : 126
% 2.49/0.93  #    Non-unit-clauses                  : 406
% 2.49/0.93  # Current number of unprocessed clauses: 1791
% 2.49/0.93  # ...number of literals in the above   : 3953
% 2.49/0.93  # Current number of archived formulas  : 0
% 2.49/0.93  # Current number of archived clauses   : 1253
% 2.49/0.93  # Clause-clause subsumption calls (NU) : 216867
% 2.49/0.93  # Rec. Clause-clause subsumption calls : 129157
% 2.49/0.93  # Non-unit clause-clause subsumptions  : 247
% 2.49/0.93  # Unit Clause-clause subsumption calls : 508
% 2.49/0.93  # Rewrite failures with RHS unbound    : 0
% 2.49/0.93  # BW rewrite match attempts            : 1208
% 2.49/0.93  # BW rewrite match successes           : 71
% 2.49/0.93  # Condensation attempts                : 0
% 2.49/0.93  # Condensation successes               : 0
% 2.49/0.93  # Termbank termtop insertions          : 187734
% 2.49/0.93  
% 2.49/0.93  # -------------------------------------------------
% 2.49/0.93  # User time                : 0.308 s
% 2.49/0.93  # System time              : 0.014 s
% 2.49/0.93  # Total time               : 0.322 s
% 2.49/0.93  # Maximum resident set size: 8780 pages
% 2.49/0.93  
% 2.49/0.93  # -------------------------------------------------
% 2.49/0.93  # User time                : 1.162 s
% 2.49/0.93  # System time              : 0.054 s
% 2.49/0.93  # Total time               : 1.216 s
% 2.49/0.93  # Maximum resident set size: 3216 pages
% 2.49/0.93  % E---3.1 exiting
%------------------------------------------------------------------------------