%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : ITP019+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n017.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 : Sun Jul 17 00:37:48 EDT 2022

% Result   : Theorem 0.20s 0.47s
% Output   : Refutation 0.20s
% 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;   4 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    mem(skc1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)),
    file('ITP019+2.p',unknown),
    [] ).

cnf(12,axiom,
    ~ equal(ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),skc1),
    file('ITP019+2.p',unknown),
    [] ).

cnf(13,axiom,
    equal(ap(c_2Ecomplex_2Ecomplex__inv,skc1),ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)),
    file('ITP019+2.p',unknown),
    [] ).

cnf(35,axiom,
    ( ~ mem(u,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
    | ~ equal(ap(c_2Ecomplex_2Ecomplex__inv,u),ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0))
    | equal(u,ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)) ),
    file('ITP019+2.p',unknown),
    [] ).

cnf(66,plain,
    ( ~ mem(skc1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
    | equal(ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),skc1) ),
    inference(res,[status(thm),theory(equality)],[13,35]),
    [iquote('0:Res:13.0,35.0')] ).

cnf(70,plain,
    $false,
    inference(mrr,[status(thm)],[66,10,12]),
    [iquote('0:MRR:66.0,66.1,10.0,12.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ITP019+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jun  3 10:42:13 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.47  
% 0.20/0.47  SPASS V 3.9 
% 0.20/0.47  SPASS beiseite: Proof found.
% 0.20/0.47  % SZS status Theorem
% 0.20/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.47  SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.20/0.47  SPASS allocated 97925 KBytes.
% 0.20/0.47  SPASS spent	0:00:00.11 on the problem.
% 0.20/0.47  		0:00:00.04 for the input.
% 0.20/0.47  		0:00:00.05 for the FLOTTER CNF translation.
% 0.20/0.47  		0:00:00.00 for inferences.
% 0.20/0.47  		0:00:00.00 for the backtracking.
% 0.20/0.47  		0:00:00.00 for the reduction.
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  Here is a proof with depth 1, length 6 :
% 0.20/0.47  % SZS output start Refutation
% See solution above
% 0.20/0.47  Formulae used in the proof : conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0
% 0.20/0.47  
%------------------------------------------------------------------------------