TSTP Solution File: SWV626-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWV626-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n009.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:07:33 EDT 2023

% Result   : Unsatisfiable 2.43s 0.83s
% Output   : CNFRefutation 2.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   8 unt;   0 nHn;   6 RR)
%            Number of literals    :   12 (   7 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-3 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),v_n,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_n,tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/tmp/tmp.GrrJyA2hyT/E---3.1_29424.p',cls_conjecture_0) ).

cnf(cls_class__semiring_Opwr__pwr_0,axiom,
    ( c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(X2,X3,X1),X4,X1) = c_Power_Opower__class_Opower(X2,c_HOL_Otimes__class_Otimes(X3,X4,tc_nat),X1)
    | ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.GrrJyA2hyT/E---3.1_29424.p',cls_class__semiring_Opwr__pwr_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/sandbox2/tmp/tmp.GrrJyA2hyT/E---3.1_29424.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1) ).

cnf(cls_nat__mult__commute_0,axiom,
    c_HOL_Otimes__class_Otimes(X1,X2,tc_nat) = c_HOL_Otimes__class_Otimes(X2,X1,tc_nat),
    file('/export/starexec/sandbox2/tmp/tmp.GrrJyA2hyT/E---3.1_29424.p',cls_nat__mult__commute_0) ).

cnf(c_0_4,negated_conjecture,
    c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),v_n,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_n,tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),
    cls_conjecture_0 ).

cnf(c_0_5,axiom,
    ( c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(X2,X3,X1),X4,X1) = c_Power_Opower__class_Opower(X2,c_HOL_Otimes__class_Otimes(X3,X4,tc_nat),X1)
    | ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
    cls_class__semiring_Opwr__pwr_0 ).

cnf(c_0_6,axiom,
    class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
    clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1 ).

cnf(c_0_7,axiom,
    c_HOL_Otimes__class_Otimes(X1,X2,tc_nat) = c_HOL_Otimes__class_Otimes(X2,X1,tc_nat),
    cls_nat__mult__commute_0 ).

cnf(c_0_8,negated_conjecture,
    c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_n,tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),c_HOL_Otimes__class_Otimes(v_n,v_k,tc_nat),tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n),tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),
    inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_5]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SWV626-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.10/0.29  % Computer : n009.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Tue Oct  3 04:05:14 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.14/0.47  Running first-order model finding
% 0.14/0.47  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.GrrJyA2hyT/E---3.1_29424.p
% 2.43/0.83  # Version: 3.1pre001
% 2.43/0.83  # Preprocessing class: FMLSSMSSSSSNFFN.
% 2.43/0.83  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.83  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 2.43/0.83  # Starting new_bool_3 with 600s (2) cores
% 2.43/0.83  # Starting new_bool_1 with 600s (2) cores
% 2.43/0.83  # Starting sh5l with 300s (1) cores
% 2.43/0.83  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 29501 completed with status 0
% 2.43/0.83  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 2.43/0.83  # Preprocessing class: FMLSSMSSSSSNFFN.
% 2.43/0.83  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.83  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 2.43/0.83  # No SInE strategy applied
% 2.43/0.83  # Search class: FGHSM-SSLM32-DFFFFFNN
% 2.43/0.83  # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 2.43/0.83  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 68s (1) cores
% 2.43/0.83  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 91s (1) cores
% 2.43/0.83  # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 68s (1) cores
% 2.43/0.83  # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 29512 completed with status 0
% 2.43/0.83  # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 2.43/0.83  # Preprocessing class: FMLSSMSSSSSNFFN.
% 2.43/0.83  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.83  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 2.43/0.83  # No SInE strategy applied
% 2.43/0.83  # Search class: FGHSM-SSLM32-DFFFFFNN
% 2.43/0.83  # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 2.43/0.83  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 68s (1) cores
% 2.43/0.83  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 91s (1) cores
% 2.43/0.83  # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 68s (1) cores
% 2.43/0.83  # Preprocessing time       : 0.010 s
% 2.43/0.83  # Presaturation interreduction done
% 2.43/0.83  
% 2.43/0.83  # Proof found!
% 2.43/0.83  # SZS status Unsatisfiable
% 2.43/0.83  # SZS output start CNFRefutation
% See solution above
% 2.43/0.83  # Parsed axioms                        : 1041
% 2.43/0.83  # Removed by relevancy pruning/SinE    : 0
% 2.43/0.83  # Initial clauses                      : 1041
% 2.43/0.83  # Removed in clause preprocessing      : 0
% 2.43/0.83  # Initial clauses in saturation        : 1041
% 2.43/0.83  # Processed clauses                    : 3522
% 2.43/0.83  # ...of these trivial                  : 162
% 2.43/0.83  # ...subsumed                          : 1517
% 2.43/0.83  # ...remaining for further processing  : 1843
% 2.43/0.83  # Other redundant clauses eliminated   : 389
% 2.43/0.83  # Clauses deleted for lack of memory   : 0
% 2.43/0.83  # Backward-subsumed                    : 6
% 2.43/0.83  # Backward-rewritten                   : 40
% 2.43/0.83  # Generated clauses                    : 10333
% 2.43/0.83  # ...of the previous two non-redundant : 7974
% 2.43/0.83  # ...aggressively subsumed             : 0
% 2.43/0.83  # Contextual simplify-reflections      : 0
% 2.43/0.83  # Paramodulations                      : 9914
% 2.43/0.83  # Factorizations                       : 8
% 2.43/0.83  # NegExts                              : 0
% 2.43/0.83  # Equation resolutions                 : 411
% 2.43/0.83  # Total rewrite steps                  : 7613
% 2.43/0.83  # Propositional unsat checks           : 0
% 2.43/0.83  #    Propositional check models        : 0
% 2.43/0.83  #    Propositional check unsatisfiable : 0
% 2.43/0.83  #    Propositional clauses             : 0
% 2.43/0.83  #    Propositional clauses after purity: 0
% 2.43/0.83  #    Propositional unsat core size     : 0
% 2.43/0.83  #    Propositional preprocessing time  : 0.000
% 2.43/0.83  #    Propositional encoding time       : 0.000
% 2.43/0.83  #    Propositional solver time         : 0.000
% 2.43/0.83  #    Success case prop preproc time    : 0.000
% 2.43/0.83  #    Success case prop encoding time   : 0.000
% 2.43/0.83  #    Success case prop solver time     : 0.000
% 2.43/0.83  # Current number of processed clauses  : 893
% 2.43/0.83  #    Positive orientable unit clauses  : 257
% 2.43/0.83  #    Positive unorientable unit clauses: 1
% 2.43/0.83  #    Negative unit clauses             : 43
% 2.43/0.83  #    Non-unit-clauses                  : 592
% 2.43/0.83  # Current number of unprocessed clauses: 6355
% 2.43/0.83  # ...number of literals in the above   : 19388
% 2.43/0.83  # Current number of archived formulas  : 0
% 2.43/0.83  # Current number of archived clauses   : 950
% 2.43/0.83  # Clause-clause subsumption calls (NU) : 214347
% 2.43/0.83  # Rec. Clause-clause subsumption calls : 92667
% 2.43/0.83  # Non-unit clause-clause subsumptions  : 860
% 2.43/0.83  # Unit Clause-clause subsumption calls : 2563
% 2.43/0.83  # Rewrite failures with RHS unbound    : 0
% 2.43/0.83  # BW rewrite match attempts            : 193
% 2.43/0.83  # BW rewrite match successes           : 55
% 2.43/0.83  # Condensation attempts                : 0
% 2.43/0.83  # Condensation successes               : 0
% 2.43/0.83  # Termbank termtop insertions          : 160113
% 2.43/0.83  
% 2.43/0.83  # -------------------------------------------------
% 2.43/0.83  # User time                : 0.311 s
% 2.43/0.83  # System time              : 0.009 s
% 2.43/0.83  # Total time               : 0.320 s
% 2.43/0.83  # Maximum resident set size: 3568 pages
% 2.43/0.83  
% 2.43/0.83  # -------------------------------------------------
% 2.43/0.83  # User time                : 0.933 s
% 2.43/0.83  # System time              : 0.029 s
% 2.43/0.83  # Total time               : 0.962 s
% 2.43/0.83  # Maximum resident set size: 2400 pages
% 2.43/0.83  % E---3.1 exiting
%------------------------------------------------------------------------------