%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : ALG434-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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 14 18:03:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(367,axiom,
    ( ~ class_Ring__and__Field_Ocomm__semiring__1(u)
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v,w,tc_Polynomial_Opoly(u))
    | c_Ring__and__Field_Odvd__class_Odvd(v,c_Polynomial_Osmult(x,w,u),tc_Polynomial_Opoly(u)) ),
    file('ALG434-1.p',unknown),
    [] ).

cnf(374,axiom,
    c_Ring__and__Field_Odvd__class_Odvd(v,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    file('ALG434-1.p',unknown),
    [] ).

cnf(382,axiom,
    class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
    file('ALG434-1.p',unknown),
    [] ).

cnf(441,axiom,
    ~ c_Ring__and__Field_Odvd__class_Odvd(v,c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    file('ALG434-1.p',unknown),
    [] ).

cnf(473,plain,
    ( ~ class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex)
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    inference(res,[status(thm),theory(equality)],[367,441]),
    [iquote('0:Res:367.2,441.0')] ).

cnf(491,plain,
    $false,
    inference(mrr,[status(thm)],[473,382,374]),
    [iquote('0:MRR:473.0,473.1,382.0,374.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : ALG434-1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun  8 02:53:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.48  
% 0.17/0.48  SPASS V 3.9 
% 0.17/0.48  SPASS beiseite: Proof found.
% 0.17/0.48  % SZS status Theorem
% 0.17/0.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.17/0.48  SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 390 clauses.
% 0.17/0.48  SPASS allocated 76386 KBytes.
% 0.17/0.48  SPASS spent	0:00:00.14 on the problem.
% 0.17/0.48  		0:00:00.05 for the input.
% 0.17/0.48  		0:00:00.00 for the FLOTTER CNF translation.
% 0.17/0.48  		0:00:00.00 for inferences.
% 0.17/0.48  		0:00:00.00 for the backtracking.
% 0.17/0.48  		0:00:00.05 for the reduction.
% 0.17/0.48  
% 0.17/0.48  
% 0.17/0.48  Here is a proof with depth 1, length 6 :
% 0.17/0.48  % SZS output start Refutation
% See solution above
% 0.17/0.48  Formulae used in the proof : cls_dvd__smult_0 cls_CHAINED_0_01 clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1 cls_conjecture_0
% 0.17/0.48  
%------------------------------------------------------------------------------