↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWW272+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:11:51 PM UTC 2026

% Result   : Theorem 2.98s 1.09s
% Output   : CNFRefutation 2.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (  17 unt;   0 def)
%            Number of atoms       :   35 (  19 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  14   ~;   6   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   4 con; 0-3 aty)
%            Number of variables   :   12 (   1 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
    v_s____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(fact_one__poly__def,axiom,
    ! [X5] :
      ( class_Rings_Ocomm__semiring__1(X5)
     => c_Groups_Oone__class_Oone(tc_Polynomial_Opoly(X5)) = c_Polynomial_OpCons(X5,c_Groups_Oone__class_Oone(X5),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X5))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_one__poly__def) ).

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/benchmark/theBenchmark.p',fact_s) ).

fof(arity_Complex__Ocomplex__Rings_Ocomm__semiring__1,axiom,
    class_Rings_Ocomm__semiring__1(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Complex__Ocomplex__Rings_Ocomm__semiring__1) ).

fof(fact_pne,axiom,
    v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_pne) ).

fof(fact_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
    ! [X19,X5] :
      ( class_Rings_Ocomm__semiring__1(X5)
     => hAPP(hAPP(c_Groups_Otimes__class_Otimes(X5),X19),c_Groups_Ozero__class_Ozero(X5)) = c_Groups_Ozero__class_Ozero(X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).

fof(arity_Polynomial__Opoly__Rings_Ocomm__semiring__1,axiom,
    ! [X91] :
      ( class_Rings_Ocomm__semiring__1(X91)
     => class_Rings_Ocomm__semiring__1(tc_Polynomial_Opoly(X91)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Polynomial__Opoly__Rings_Ocomm__semiring__1) ).

fof(c_0_7,negated_conjecture,
    ~ ( v_s____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

fof(c_0_8,negated_conjecture,
    v_s____ = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_9,plain,
    ! [X614] :
      ( c_Groups_Oone__class_Oone(tc_Polynomial_Opoly(X614)) = c_Polynomial_OpCons(X614,c_Groups_Oone__class_Oone(X614),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X614)))
      | ~ class_Rings_Ocomm__semiring__1(X614) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_one__poly__def])])]) ).

cnf(c_0_10,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_11,negated_conjecture,
    v_s____ = c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( ~ class_Rings_Ocomm__semiring__1(X1)
    | c_Groups_Oone__class_Oone(tc_Polynomial_Opoly(X1)) = c_Polynomial_OpCons(X1,c_Groups_Oone__class_Oone(X1),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    class_Rings_Ocomm__semiring__1(tc_Complex_Ocomplex),
    inference(split_conjunct,[status(thm)],[arity_Complex__Ocomplex__Rings_Ocomm__semiring__1]) ).

fof(c_0_14,plain,
    v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(fof_simplification,[status(thm)],[fact_pne]) ).

cnf(c_0_15,plain,
    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____))),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))) = v_pa____,
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    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_Groups_Oone__class_Oone(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_17,plain,
    ! [X1244,X1245] :
      ( hAPP(hAPP(c_Groups_Otimes__class_Otimes(X1245),X1244),c_Groups_Ozero__class_Ozero(X1245)) = c_Groups_Ozero__class_Ozero(X1245)
      | ~ class_Rings_Ocomm__semiring__1(X1245) ),
    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_18,plain,
    v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(fof_nnf,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    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_Groups_Oone__class_Oone(tc_Polynomial_Opoly(tc_Complex_Ocomplex)))),c_Polynomial_Oorder(tc_Complex_Ocomplex,v_a____,v_pa____))),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))) = v_pa____,
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    ( ~ class_Rings_Ocomm__semiring__1(X1)
    | hAPP(hAPP(c_Groups_Otimes__class_Otimes(X1),X2),c_Groups_Ozero__class_Ozero(X1)) = c_Groups_Ozero__class_Ozero(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_21,plain,
    v_pa____ != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_22,plain,
    ! [X2992] :
      ( class_Rings_Ocomm__semiring__1(tc_Polynomial_Opoly(X2992))
      | ~ class_Rings_Ocomm__semiring__1(X2992) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[arity_Polynomial__Opoly__Rings_Ocomm__semiring__1])])]) ).

cnf(c_0_23,plain,
    ~ class_Rings_Ocomm__semiring__1(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_24,plain,
    ( ~ class_Rings_Ocomm__semiring__1(X1)
    | class_Rings_Ocomm__semiring__1(tc_Polynomial_Opoly(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_25,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWW272+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44  % Computer : n013.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Mon Sep 21 09:44:22 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52  Running first-order theorem proving
% 0.24/0.52  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/benchmark/theBenchmark.p
% 2.98/1.09  % Version: 3.5.1
% 2.98/1.09  % Preprocessing class: FMLMSMSMSSSNFFN.
% 2.98/1.09  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.98/1.09  % Starting new_bool_3 with 300s (1) cores
% 2.98/1.09  % Starting new_bool_1 with 300s (1) cores
% 2.98/1.09  % Starting sh5l with 300s (1) cores
% 2.98/1.09  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 475498 completed with status 0
% 2.98/1.09  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.98/1.09  % Preprocessing class: FMLMSMSMSSSNFFN.
% 2.98/1.09  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.98/1.09  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.98/1.09  % No SInE strategy applied
% 2.98/1.09  % Search class: FGHSM-SSLM32-DFFFFFNN
% 2.98/1.09  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.98/1.09  % Starting SubtermCWHack with 136s (1) cores
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 2.98/1.09  % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 2.98/1.09  % G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 475508 completed with status 0
% 2.98/1.09  % Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 2.98/1.09  % Preprocessing class: FMLMSMSMSSSNFFN.
% 2.98/1.09  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.98/1.09  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.98/1.09  % No SInE strategy applied
% 2.98/1.09  % Search class: FGHSM-SSLM32-DFFFFFNN
% 2.98/1.09  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.98/1.09  % Starting SubtermCWHack with 136s (1) cores
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.98/1.09  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 2.98/1.09  % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 2.98/1.09  % Preprocessing time       : 0.021 s
% 2.98/1.09  % Presaturation interreduction done
% 2.98/1.09  
% 2.98/1.09  % Proof found!
% 2.98/1.09  % SZS status Theorem
% 2.98/1.09  % SZS output start CNFRefutation
% See solution above
% 2.98/1.09  % Parsed axioms                        : 1206
% 2.98/1.09  % Removed by relevancy pruning/SinE    : 0
% 2.98/1.09  % Initial clauses                      : 1588
% 2.98/1.09  % Removed in clause preprocessing      : 78
% 2.98/1.09  % Initial clauses in saturation        : 1510
% 2.98/1.09  % Processed clauses                    : 3203
% 2.98/1.09  % ...of these trivial                  : 16
% 2.98/1.09  % ...subsumed                          : 898
% 2.98/1.09  % ...remaining for further processing  : 2289
% 2.98/1.09  % Other redundant clauses eliminated   : 355
% 2.98/1.09  % Clauses deleted for lack of memory   : 0
% 2.98/1.09  % Backward-subsumed                    : 5
% 2.98/1.09  % Backward-rewritten                   : 6
% 2.98/1.09  % Generated clauses                    : 4475
% 2.98/1.09  % ...of the previous two non-redundant : 3108
% 2.98/1.09  % ...aggressively subsumed             : 0
% 2.98/1.09  % Contextual simplify-reflections      : 3
% 2.98/1.09  % Paramodulations                      : 4128
% 2.98/1.09  % Factorizations                       : 4
% 2.98/1.09  % NegExts                              : 0
% 2.98/1.09  % Equation resolutions                 : 371
% 2.98/1.09  % Disequality decompositions           : 0
% 2.98/1.09  % Total rewrite steps                  : 2960
% 2.98/1.09  % ...of those cached                   : 2416
% 2.98/1.09  % Propositional unsat checks           : 0
% 2.98/1.09  %    Propositional check models        : 0
% 2.98/1.09  %    Propositional check unsatisfiable : 0
% 2.98/1.09  %    Propositional clauses             : 0
% 2.98/1.09  %    Propositional clauses after purity: 0
% 2.98/1.09  %    Propositional unsat core size     : 0
% 2.98/1.09  %    Propositional preprocessing time  : 0.000
% 2.98/1.09  %    Propositional encoding time       : 0.000
% 2.98/1.09  %    Propositional solver time         : 0.000
% 2.98/1.09  %    Success case prop preproc time    : 0.000
% 2.98/1.09  %    Success case prop encoding time   : 0.000
% 2.98/1.09  %    Success case prop solver time     : 0.000
% 2.98/1.09  % Current number of processed clauses  : 919
% 2.98/1.09  %    Positive orientable unit clauses  : 466
% 2.98/1.09  %    Positive unorientable unit clauses: 10
% 2.98/1.09  %    Negative unit clauses             : 58
% 2.98/1.09  %    Non-unit-clauses                  : 385
% 2.98/1.09  % Current number of unprocessed clauses: 2629
% 2.98/1.09  % ...number of literals in the above   : 5434
% 2.98/1.09  % Current number of archived formulas  : 0
% 2.98/1.09  % Current number of archived clauses   : 1230
% 2.98/1.09  % Clause-clause subsumption calls (NU) : 190393
% 2.98/1.09  % Rec. Clause-clause subsumption calls : 113249
% 2.98/1.09  % Non-unit clause-clause subsumptions  : 425
% 2.98/1.09  % Unit Clause-clause subsumption calls : 585
% 2.98/1.09  % Rewrite failures with RHS unbound    : 0
% 2.98/1.09  % BW rewrite match attempts            : 4333
% 2.98/1.09  % BW rewrite match successes           : 204
% 2.98/1.09  % Condensation attempts                : 0
% 2.98/1.09  % Condensation successes               : 0
% 2.98/1.09  % Termbank termtop insertions          : 229689
% 2.98/1.09  % Search garbage collected termcells   : 20305
% 2.98/1.09  
% 2.98/1.09  % -------------------------------------------------
% 2.98/1.09  % User time                : 0.425 s
% 2.98/1.09  % System time              : 0.032 s
% 2.98/1.09  % Total time               : 0.458 s
% 2.98/1.09  % Maximum resident set size: 10156 pages
% 2.98/1.09  
% 2.98/1.09  % -------------------------------------------------
% 2.98/1.09  % User time                : 1.600 s
% 2.98/1.09  % System time              : 0.116 s
% 2.98/1.09  % Total time               : 1.716 s
% 2.98/1.09  % Maximum resident set size: 5888 pages
% 2.98/1.09  % E exiting
%------------------------------------------------------------------------------