↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWW238+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 : n002.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:10:08 PM UTC 2026

% Result   : Theorem 4.39s 6.13s
% Output   : CNFRefutation 4.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  15 unt;   0 def)
%            Number of atoms       :   21 (   5 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   6   ~;   2   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :   13 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
    c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_aa____,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____))),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(fact_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
    ! [X26,X11,X8] :
      ( class_Rings_Ocomm__semiring__1(X8)
     => c_Groups_Oplus__class_Oplus(X8,X11,X26) = c_Groups_Oplus__class_Oplus(X8,X26,X11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).

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(arity_RealDef__Oreal__Rings_Ocomm__semiring__1,axiom,
    class_Rings_Ocomm__semiring__1(tc_RealDef_Oreal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_RealDef__Oreal__Rings_Ocomm__semiring__1) ).

fof(fact__096cmod_A_Iz_A_K_Ac_J_A_060_061_Acmod_A_Iz_A_K_Ac_A_L_Aa_J_A_L_Acmod_Aa_096,axiom,
    c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____),v_aa____)),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact__096cmod_A_Iz_A_K_Ac_J_A_060_061_Acmod_A_Iz_A_K_Ac_A_L_Aa_J_A_L_Acmod_Aa_096) ).

fof(c_0_5,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_aa____,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____))),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),
    inference(assume_negation,[status(cth)],[conj_0]) ).

fof(c_0_6,plain,
    ! [X740,X741,X742] :
      ( c_Groups_Oplus__class_Oplus(X742,X741,X740) = c_Groups_Oplus__class_Oplus(X742,X740,X741)
      | ~ class_Rings_Ocomm__semiring__1(X742) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J])])]) ).

fof(c_0_7,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_aa____,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____))),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( ~ class_Rings_Ocomm__semiring__1(X1)
    | c_Groups_Oplus__class_Oplus(X1,X2,X3) = c_Groups_Oplus__class_Oplus(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_10,plain,
    class_Rings_Ocomm__semiring__1(tc_RealDef_Oreal),
    inference(split_conjunct,[status(thm)],[arity_RealDef__Oreal__Rings_Ocomm__semiring__1]) ).

fof(c_0_11,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_aa____,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____))),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____),v_aa____)),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),
    inference(split_conjunct,[status(thm)],[fact__096cmod_A_Iz_A_K_Ac_J_A_060_061_Acmod_A_Iz_A_K_Ac_A_L_Aa_J_A_L_Acmod_Aa_096]) ).

cnf(c_0_13,plain,
    c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,X1,X2) = c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,X2,X1),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,X1,X2) = c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,X2,X1),
    inference(spm,[status(thm)],[c_0_8,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_aa____,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____))),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____)),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_aa____,hAPP(hAPP(c_Groups_Otimes__class_Otimes(tc_Complex_Ocomplex),v_z____),v_c____))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW238+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.37  % Computer : n002.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Mon Sep 21 09:46:08 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42  Running first-order theorem proving
% 0.15/5.42  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
% 4.39/6.13  % Version: 3.5.1
% 4.39/6.13  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.39/6.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/6.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.39/6.13  % Starting new_bool_3 with 300s (1) cores
% 4.39/6.13  % Starting new_bool_1 with 300s (1) cores
% 4.39/6.13  % Starting sh5l with 300s (1) cores
% 4.39/6.13  % new_bool_1 with pid 2997736 completed with status 0
% 4.39/6.13  % Result found by new_bool_1
% 4.39/6.13  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.39/6.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/6.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.39/6.13  % Starting new_bool_3 with 300s (1) cores
% 4.39/6.13  % Starting new_bool_1 with 300s (1) cores
% 4.39/6.13  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.39/6.13  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.39/6.13  % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.39/6.13  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.39/6.13  % Starting SubtermCWHack with 28s (1) cores
% 4.39/6.13  % SubtermCWHack with pid 2997739 completed with status 0
% 4.39/6.13  % Result found by SubtermCWHack
% 4.39/6.13  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.39/6.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/6.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.39/6.13  % Starting new_bool_3 with 300s (1) cores
% 4.39/6.13  % Starting new_bool_1 with 300s (1) cores
% 4.39/6.13  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.39/6.13  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.39/6.13  % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.39/6.13  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.39/6.13  % Starting SubtermCWHack with 28s (1) cores
% 4.39/6.13  % Preprocessing time       : 0.010 s
% 4.39/6.13  
% 4.39/6.13  % Proof found!
% 4.39/6.13  % SZS status Theorem
% 4.39/6.13  % SZS output start CNFRefutation
% See solution above
% 4.39/6.13  % Parsed axioms                        : 1272
% 4.39/6.13  % Removed by relevancy pruning/SinE    : 746
% 4.39/6.13  % Initial clauses                      : 693
% 4.39/6.13  % Removed in clause preprocessing      : 37
% 4.39/6.13  % Initial clauses in saturation        : 656
% 4.39/6.13  % Processed clauses                    : 4774
% 4.39/6.13  % ...of these trivial                  : 221
% 4.39/6.13  % ...subsumed                          : 3210
% 4.39/6.13  % ...remaining for further processing  : 1342
% 4.39/6.13  % Other redundant clauses eliminated   : 278
% 4.39/6.13  % Clauses deleted for lack of memory   : 0
% 4.39/6.13  % Backward-subsumed                    : 21
% 4.39/6.13  % Backward-rewritten                   : 33
% 4.39/6.13  % Generated clauses                    : 38627
% 4.39/6.13  % ...of the previous two non-redundant : 30800
% 4.39/6.13  % ...aggressively subsumed             : 0
% 4.39/6.13  % Contextual simplify-reflections      : 0
% 4.39/6.13  % Paramodulations                      : 38300
% 4.39/6.13  % Factorizations                       : 34
% 4.39/6.13  % NegExts                              : 0
% 4.39/6.13  % Equation resolutions                 : 299
% 4.39/6.13  % Disequality decompositions           : 0
% 4.39/6.13  % Total rewrite steps                  : 35341
% 4.39/6.13  % ...of those cached                   : 32977
% 4.39/6.13  % Propositional unsat checks           : 0
% 4.39/6.13  %    Propositional check models        : 0
% 4.39/6.13  %    Propositional check unsatisfiable : 0
% 4.39/6.13  %    Propositional clauses             : 0
% 4.39/6.13  %    Propositional clauses after purity: 0
% 4.39/6.13  %    Propositional unsat core size     : 0
% 4.39/6.13  %    Propositional preprocessing time  : 0.000
% 4.39/6.13  %    Propositional encoding time       : 0.000
% 4.39/6.13  %    Propositional solver time         : 0.000
% 4.39/6.13  %    Success case prop preproc time    : 0.000
% 4.39/6.13  %    Success case prop encoding time   : 0.000
% 4.39/6.13  %    Success case prop solver time     : 0.000
% 4.39/6.13  % Current number of processed clauses  : 1229
% 4.39/6.13  %    Positive orientable unit clauses  : 304
% 4.39/6.13  %    Positive unorientable unit clauses: 11
% 4.39/6.13  %    Negative unit clauses             : 93
% 4.39/6.13  %    Non-unit-clauses                  : 821
% 4.39/6.13  % Current number of unprocessed clauses: 26631
% 4.39/6.13  % ...number of literals in the above   : 64459
% 4.39/6.13  % Current number of archived formulas  : 0
% 4.39/6.13  % Current number of archived clauses   : 54
% 4.39/6.13  % Clause-clause subsumption calls (NU) : 82133
% 4.39/6.13  % Rec. Clause-clause subsumption calls : 55301
% 4.39/6.13  % Non-unit clause-clause subsumptions  : 1788
% 4.39/6.13  % Unit Clause-clause subsumption calls : 2062
% 4.39/6.13  % Rewrite failures with RHS unbound    : 20
% 4.39/6.13  % BW rewrite match attempts            : 3031
% 4.39/6.13  % BW rewrite match successes           : 92
% 4.39/6.13  % Condensation attempts                : 0
% 4.39/6.13  % Condensation successes               : 0
% 4.39/6.13  % Termbank termtop insertions          : 710139
% 4.39/6.13  % Search garbage collected termcells   : 13080
% 4.39/6.13  
% 4.39/6.13  % -------------------------------------------------
% 4.39/6.13  % User time                : 0.606 s
% 4.39/6.13  % System time              : 0.030 s
% 4.39/6.13  % Total time               : 0.636 s
% 4.39/6.13  % Maximum resident set size: 6856 pages
% 4.39/6.13  
% 4.39/6.13  % -------------------------------------------------
% 4.39/6.13  % User time                : 0.652 s
% 4.39/6.13  % System time              : 0.032 s
% 4.39/6.13  % Total time               : 0.683 s
% 4.39/6.13  % Maximum resident set size: 6144 pages
% 4.39/6.13  % E exiting
%------------------------------------------------------------------------------