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

% Computer : n007.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:41 EDT 2022

% Result   : Theorem 5.66s 5.87s
% Output   : Refutation 5.66s
% 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(25,axiom,
    equal(hAPP(c_COMBI(u),v),v),
    file('SCT143+1.p',unknown),
    [] ).

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

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

cnf(5747,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)],[25,318]),
    [iquote('0:SpR:25.0,318.0')] ).

cnf(5804,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)],[318,62]),
    [iquote('0:SpL:318.0,62.0')] ).

cnf(5836,plain,
    $false,
    inference(unc,[status(thm)],[5747,5804]),
    [iquote('0:UnC:5747.0,5804.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SCT143+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.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 : Sat Jul  2 00:24:09 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 5.66/5.87  
% 5.66/5.87  SPASS V 3.9 
% 5.66/5.87  SPASS beiseite: Proof found.
% 5.66/5.87  % SZS status Theorem
% 5.66/5.87  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 5.66/5.87  SPASS derived 4427 clauses, backtracked 0 clauses, performed 0 splits and kept 2378 clauses.
% 5.66/5.87  SPASS allocated 124785 KBytes.
% 5.66/5.87  SPASS spent	0:00:05.44 on the problem.
% 5.66/5.87  		0:00:00.05 for the input.
% 5.66/5.87  		0:00:03.40 for the FLOTTER CNF translation.
% 5.66/5.87  		0:00:00.11 for inferences.
% 5.66/5.87  		0:00:00.00 for the backtracking.
% 5.66/5.87  		0:00:01.69 for the reduction.
% 5.66/5.87  
% 5.66/5.87  
% 5.66/5.87  Here is a proof with depth 1, length 6 :
% 5.66/5.87  % SZS output start Refutation
% See solution above
% 5.66/5.87  Formulae used in the proof : help_c__COMBI__1 fact_not__Cons__self help_c__COMBS__1
% 5.66/5.87  
%------------------------------------------------------------------------------