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

% Computer : n022.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:25 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(792,axiom,
    ( ~ class_Ring__and__Field_Ocomm__semiring__0(u)
    | equal(c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v,w,u),x,u),c_Polynomial_Opoly(v,c_HOL_Oplus__class_Oplus(w,x,u),u)) ),
    file('ALG348-1.p',unknown),
    [] ).

cnf(909,axiom,
    class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
    file('ALG348-1.p',unknown),
    [] ).

cnf(980,axiom,
    ~ equal(c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v,v_a,tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex),c_Polynomial_Opoly(v,c_HOL_Oplus__class_Oplus(v_a,v_x,tc_Complex_Ocomplex),tc_Complex_Ocomplex)),
    file('ALG348-1.p',unknown),
    [] ).

cnf(1032,plain,
    ~ class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
    inference(res,[status(thm),theory(equality)],[792,980]),
    [iquote('0:Res:792.1,980.0')] ).

cnf(1066,plain,
    $false,
    inference(mrr,[status(thm)],[1032,909]),
    [iquote('0:MRR:1032.0,909.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ALG348-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun  8 18:18:20 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.37/0.62  
% 0.37/0.62  SPASS V 3.9 
% 0.37/0.62  SPASS beiseite: Proof found.
% 0.37/0.62  % SZS status Theorem
% 0.37/0.62  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.37/0.62  SPASS derived 20 clauses, backtracked 0 clauses, performed 0 splits and kept 866 clauses.
% 0.37/0.62  SPASS allocated 77179 KBytes.
% 0.37/0.62  SPASS spent	0:00:00.27 on the problem.
% 0.37/0.62  		0:00:00.08 for the input.
% 0.37/0.62  		0:00:00.00 for the FLOTTER CNF translation.
% 0.37/0.62  		0:00:00.00 for inferences.
% 0.37/0.62  		0:00:00.00 for the backtracking.
% 0.37/0.62  		0:00:00.11 for the reduction.
% 0.37/0.62  
% 0.37/0.62  
% 0.37/0.62  Here is a proof with depth 1, length 5 :
% 0.37/0.62  % SZS output start Refutation
% See solution above
% 0.37/0.62  Formulae used in the proof : cls_poly__offset__poly_0 clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0 cls_conjecture_0
% 0.37/0.62  
%------------------------------------------------------------------------------