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

% Computer : n009.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:40 EDT 2022

% Result   : Theorem 5.63s 5.85s
% Output   : Refutation 5.63s
% 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    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(67,axiom,
    ~ equal(hAPP(hAPP(c_List_Olist_OCons(u),v),w),w),
    file('SCT141+1.p',unknown),
    [] ).

cnf(267,axiom,
    equal(hAPP(hAPP(hAPP(c_COMBC(u,v,w),x),y),z),hAPP(hAPP(x,z),y)),
    file('SCT141+1.p',unknown),
    [] ).

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

cnf(4806,plain,
    equal(hAPP(hAPP(hAPP(c_COMBS(u,v,w),hAPP(c_COMBC(x,y,z),x1)),x2),x3),hAPP(hAPP(x1,hAPP(x2,x3)),x3)),
    inference(spr,[status(thm),theory(equality)],[320,267]),
    [iquote('0:SpR:320.0,267.0')] ).

cnf(4899,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)],[320,67]),
    [iquote('0:SpL:320.0,67.0')] ).

cnf(4944,plain,
    $false,
    inference(unc,[status(thm)],[4806,4899]),
    [iquote('0:UnC:4806.0,4899.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SCT141+1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.32  % Computer : n009.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sat Jul  2 01:40:22 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 5.63/5.85  
% 5.63/5.85  SPASS V 3.9 
% 5.63/5.85  SPASS beiseite: Proof found.
% 5.63/5.85  % SZS status Theorem
% 5.63/5.85  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 5.63/5.85  SPASS derived 3653 clauses, backtracked 5 clauses, performed 6 splits and kept 2504 clauses.
% 5.63/5.85  SPASS allocated 125694 KBytes.
% 5.63/5.85  SPASS spent	0:00:05.43 on the problem.
% 5.63/5.85  		0:00:00.05 for the input.
% 5.63/5.85  		0:00:03.40 for the FLOTTER CNF translation.
% 5.63/5.85  		0:00:00.10 for inferences.
% 5.63/5.85  		0:00:00.00 for the backtracking.
% 5.63/5.85  		0:00:01.68 for the reduction.
% 5.63/5.85  
% 5.63/5.85  
% 5.63/5.85  Here is a proof with depth 1, length 6 :
% 5.63/5.85  % SZS output start Refutation
% See solution above
% 5.63/5.85  Formulae used in the proof : fact_not__Cons__self help_c__COMBC__1 help_c__COMBS__1
% 5.63/5.85  
%------------------------------------------------------------------------------