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

% Computer : n024.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:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(509,axiom,
    ( ~ c_SEQ_Osubseq(u)
    | ~ c_SEQ_Omonoseq(c_COMBB(c_Complex_ORe,c_COMBB(v_s,u,tc_nat,tc_Complex_Ocomplex,tc_nat),tc_Complex_Ocomplex,tc_RealDef_Oreal,tc_nat))
    | v_thesis____ ),
    file('ALG361-1.p',unknown),
    [] ).

cnf(511,axiom,
    c_SEQ_Omonoseq(c_COMBB(c_Complex_ORe,c_COMBB(v_s,v_sko__CHAINED__1(v_s),tc_nat,tc_Complex_Ocomplex,tc_nat),tc_Complex_Ocomplex,tc_RealDef_Oreal,tc_nat)),
    file('ALG361-1.p',unknown),
    [] ).

cnf(512,axiom,
    c_SEQ_Osubseq(v_sko__CHAINED__1(v_s)),
    file('ALG361-1.p',unknown),
    [] ).

cnf(595,axiom,
    ~ v_thesis____,
    file('ALG361-1.p',unknown),
    [] ).

cnf(610,plain,
    ( ~ c_SEQ_Osubseq(u)
    | ~ c_SEQ_Omonoseq(c_COMBB(c_Complex_ORe,c_COMBB(v_s,u,tc_nat,tc_Complex_Ocomplex,tc_nat),tc_Complex_Ocomplex,tc_RealDef_Oreal,tc_nat)) ),
    inference(mrr,[status(thm)],[509,595]),
    [iquote('0:MRR:509.2,595.0')] ).

cnf(623,plain,
    ~ c_SEQ_Osubseq(v_sko__CHAINED__1(v_s)),
    inference(res,[status(thm),theory(equality)],[511,610]),
    [iquote('0:Res:511.0,610.1')] ).

cnf(624,plain,
    $false,
    inference(mrr,[status(thm)],[623,512]),
    [iquote('0:MRR:623.0,512.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ALG361-1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun  9 03:44:49 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.52  
% 0.19/0.52  SPASS V 3.9 
% 0.19/0.52  SPASS beiseite: Proof found.
% 0.19/0.52  % SZS status Theorem
% 0.19/0.52  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.52  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 514 clauses.
% 0.19/0.52  SPASS allocated 76603 KBytes.
% 0.19/0.52  SPASS spent	0:00:00.17 on the problem.
% 0.19/0.52  		0:00:00.05 for the input.
% 0.19/0.52  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.52  		0:00:00.00 for inferences.
% 0.19/0.52  		0:00:00.00 for the backtracking.
% 0.19/0.52  		0:00:00.07 for the reduction.
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  Here is a proof with depth 1, length 7 :
% 0.19/0.52  % SZS output start Refutation
% See solution above
% 0.19/0.52  Formulae used in the proof : cls_that_0 cls_CHAINED_1 cls_CHAINED_0 cls_conjecture_0
% 0.19/0.52  
%------------------------------------------------------------------------------