%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : ALG439-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:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(734,axiom,
    equal(c_Polynomial_Opoly(c_Polynomial_OpCons(u,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v,tc_Complex_Ocomplex),u),
    file('ALG439-1.p',unknown),
    [] ).

cnf(915,axiom,
    ( ~ equal(v_y,v_c)
    | ~ equal(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex),v_y) ),
    file('ALG439-1.p',unknown),
    [] ).

cnf(916,axiom,
    ( equal(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex),v_y)
    | equal(v_y,v_c) ),
    file('ALG439-1.p',unknown),
    [] ).

cnf(918,plain,
    ( equal(v_y,v_c)
    | equal(v_y,v_c) ),
    inference(rew,[status(thm),theory(equality)],[734,916]),
    [iquote('0:Rew:734.0,916.0')] ).

cnf(919,plain,
    equal(v_y,v_c),
    inference(obv,[status(thm),theory(equality)],[918]),
    [iquote('0:Obv:918.0')] ).

cnf(923,plain,
    ( ~ equal(v_c,v_c)
    | ~ equal(v_c,v_c) ),
    inference(rew,[status(thm),theory(equality)],[734,915,919]),
    [iquote('0:Rew:734.0,915.1,919.0,915.1,919.0,915.0')] ).

cnf(924,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[923]),
    [iquote('0:Obv:923.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ALG439-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n022.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:11:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.54  
% 0.19/0.54  SPASS V 3.9 
% 0.19/0.54  SPASS beiseite: Proof found.
% 0.19/0.54  % SZS status Theorem
% 0.19/0.54  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.54  SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 428 clauses.
% 0.19/0.54  SPASS allocated 76997 KBytes.
% 0.19/0.54  SPASS spent	0:00:00.19 on the problem.
% 0.19/0.54  		0:00:00.07 for the input.
% 0.19/0.54  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.54  		0:00:00.00 for inferences.
% 0.19/0.54  		0:00:00.00 for the backtracking.
% 0.19/0.54  		0:00:00.04 for the reduction.
% 0.19/0.54  
% 0.19/0.54  
% 0.19/0.54  Here is a proof with depth 0, length 7 :
% 0.19/0.54  % SZS output start Refutation
% See solution above
% 0.19/0.54  Formulae used in the proof : cls_mpoly__base__conv_I2_J_0 cls_conjecture_0 cls_conjecture_1
% 0.19/0.54  
%------------------------------------------------------------------------------