TSTP Solution File: SWW246+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWW246+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n021.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  : 600s
% DateTime : Thu Jul 21 01:28:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(98,axiom,
    class_Rings_Oidom(t_a),
    file('SWW246+1.p',unknown),
    [] ).

cnf(114,axiom,
    ( ~ class_Rings_Oidom(u)
    | class_Rings_Ocomm__semiring__0(u) ),
    file('SWW246+1.p',unknown),
    [] ).

cnf(349,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('SWW246+1.p',unknown),
    [] ).

cnf(385,axiom,
    ( ~ class_Rings_Ocomm__semiring__0(u)
    | equal(hAPP(c_Polynomial_Opoly(u,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(u))),v),c_Groups_Ozero__class_Ozero(u)) ),
    file('SWW246+1.p',unknown),
    [] ).

cnf(444,axiom,
    ( ~ equal(hAPP(u,skf24(u)),hAPP(u,skf23(u)))
    | c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(v,w,u) ),
    file('SWW246+1.p',unknown),
    [] ).

cnf(1543,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(mrr,[status(thm)],[349,98]),
    [iquote('0:MRR:349.0,98.0')] ).

cnf(11549,plain,
    ( ~ class_Rings_Ocomm__semiring__0(u)
    | ~ equal(hAPP(c_Polynomial_Opoly(u,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(u))),skf23(c_Polynomial_Opoly(u,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(u))))),c_Groups_Ozero__class_Ozero(u))
    | c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(v,w,c_Polynomial_Opoly(u,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(u)))) ),
    inference(spl,[status(thm),theory(equality)],[385,444]),
    [iquote('0:SpL:385.1,444.0')] ).

cnf(11567,plain,
    ( ~ class_Rings_Ocomm__semiring__0(u)
    | ~ equal(c_Groups_Ozero__class_Ozero(u),c_Groups_Ozero__class_Ozero(u))
    | c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(v,w,c_Polynomial_Opoly(u,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(u)))) ),
    inference(rew,[status(thm),theory(equality)],[385,11549]),
    [iquote('0:Rew:385.1,11549.1')] ).

cnf(11568,plain,
    ( ~ class_Rings_Ocomm__semiring__0(u)
    | c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(v,w,c_Polynomial_Opoly(u,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(u)))) ),
    inference(obv,[status(thm),theory(equality)],[11567]),
    [iquote('0:Obv:11567.1')] ).

cnf(11791,plain,
    ~ class_Rings_Ocomm__semiring__0(t_a),
    inference(res,[status(thm),theory(equality)],[11568,1543]),
    [iquote('0:Res:11568.1,1543.0')] ).

cnf(11793,plain,
    $false,
    inference(ssi,[status(thm)],[11791,114,98]),
    [iquote('0:SSi:11791.0,114.0,98.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : SWW246+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n021.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jun  5 20:37:34 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 3.82/4.02  
% 3.82/4.02  SPASS V 3.9 
% 3.82/4.02  SPASS beiseite: Proof found.
% 3.82/4.02  % SZS status Theorem
% 3.82/4.02  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 3.82/4.02  SPASS derived 8283 clauses, backtracked 0 clauses, performed 1 splits and kept 3361 clauses.
% 3.82/4.02  SPASS allocated 107995 KBytes.
% 3.82/4.02  SPASS spent	0:00:03.55 on the problem.
% 3.82/4.02  		0:00:00.06 for the input.
% 3.82/4.02  		0:00:00.45 for the FLOTTER CNF translation.
% 3.82/4.02  		0:00:00.14 for inferences.
% 3.82/4.02  		0:00:00.01 for the backtracking.
% 3.82/4.02  		0:00:02.67 for the reduction.
% 3.82/4.02  
% 3.82/4.02  
% 3.82/4.02  Here is a proof with depth 2, length 11 :
% 3.82/4.02  % SZS output start Refutation
% See solution above
% 3.82/4.02  Formulae used in the proof : tfree_0 clrel_Rings_Oidom__Rings_Ocomm__semiring__0 fact__C0_C fact_poly__0 fact_constant__def
% 3.82/4.02  
%------------------------------------------------------------------------------