%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SCT136+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n029.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 : Mon Jul 18 22:13:39 EDT 2022

% Result   : Theorem 6.21s 6.45s
% Output   : Refutation 6.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    6 (   6 unt;   0 nHn;   6 RR)
%            Number of literals    :    6 (   0 equ;   2 neg)
%            Maximal clause size   :    1 (   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(29,axiom,
    equal(hAPP(c_COMBI(u),v),v),
    file('SCT136+1.p',unknown),
    [] ).

cnf(66,axiom,
    ~ equal(hAPP(hAPP(c_List_Olist_OCons(u),v),w),w),
    file('SCT136+1.p',unknown),
    [] ).

cnf(328,axiom,
    equal(hAPP(hAPP(hAPP(c_COMBS(u,v,w),x),y),z),hAPP(hAPP(x,z),hAPP(y,z))),
    file('SCT136+1.p',unknown),
    [] ).

cnf(5870,plain,
    equal(hAPP(hAPP(hAPP(c_COMBS(u,v,w),x),c_COMBI(y)),z),hAPP(hAPP(x,z),z)),
    inference(spr,[status(thm),theory(equality)],[29,328]),
    [iquote('0:SpR:29.0,328.0')] ).

cnf(5927,plain,
    ~ equal(hAPP(hAPP(hAPP(c_COMBS(u,v,w),c_List_Olist_OCons(x)),y),z),hAPP(y,z)),
    inference(spl,[status(thm),theory(equality)],[328,66]),
    [iquote('0:SpL:328.0,66.0')] ).

cnf(5959,plain,
    $false,
    inference(unc,[status(thm)],[5870,5927]),
    [iquote('0:UnC:5870.0,5927.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SCT136+1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.15/0.35  % Computer : n029.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Sat Jul  2 00:45:09 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 6.21/6.45  
% 6.21/6.45  SPASS V 3.9 
% 6.21/6.45  SPASS beiseite: Proof found.
% 6.21/6.45  % SZS status Theorem
% 6.21/6.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 6.21/6.45  SPASS derived 4534 clauses, backtracked 0 clauses, performed 0 splits and kept 2401 clauses.
% 6.21/6.45  SPASS allocated 124816 KBytes.
% 6.21/6.45  SPASS spent	0:00:05.99 on the problem.
% 6.21/6.45  		0:00:00.05 for the input.
% 6.21/6.45  		0:00:03.75 for the FLOTTER CNF translation.
% 6.21/6.45  		0:00:00.12 for inferences.
% 6.21/6.45  		0:00:00.00 for the backtracking.
% 6.21/6.45  		0:00:01.74 for the reduction.
% 6.21/6.45  
% 6.21/6.45  
% 6.21/6.45  Here is a proof with depth 1, length 6 :
% 6.21/6.45  % SZS output start Refutation
% See solution above
% 6.21/6.45  Formulae used in the proof : help_c__COMBI__1 fact_not__Cons__self2 help_c__COMBS__1
% 6.21/6.45  
%------------------------------------------------------------------------------