%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC399+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n006.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 : Tue Jul 19 22:03:49 EDT 2022

% Result   : Theorem 27.48s 27.67s
% Output   : Refutation 27.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  20 RR)
%            Number of literals    :   49 (   0 equ;  32 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssItem(skc11),
    file('SWC399+1.p',unknown),
    [] ).

cnf(2,axiom,
    ssList(skc10),
    file('SWC399+1.p',unknown),
    [] ).

cnf(3,axiom,
    ssList(skc9),
    file('SWC399+1.p',unknown),
    [] ).

cnf(5,axiom,
    ssList(skc7),
    file('SWC399+1.p',unknown),
    [] ).

cnf(6,axiom,
    equalelemsP(skc7),
    file('SWC399+1.p',unknown),
    [] ).

cnf(17,axiom,
    memberP(skc7,skc11),
    file('SWC399+1.p',unknown),
    [] ).

cnf(56,axiom,
    ~ memberP(skc8,skc11),
    file('SWC399+1.p',unknown),
    [] ).

cnf(72,axiom,
    equal(app(app(skc9,skc7),skc10),skc8),
    file('SWC399+1.p',unknown),
    [] ).

cnf(93,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ssList(app(v,u)) ),
    file('SWC399+1.p',unknown),
    [] ).

cnf(147,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssItem(w)
    | ~ memberP(v,w)
    | memberP(app(v,u),w) ),
    file('SWC399+1.p',unknown),
    [] ).

cnf(148,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssItem(w)
    | ~ memberP(u,w)
    | memberP(app(v,u),w) ),
    file('SWC399+1.p',unknown),
    [] ).

cnf(332,plain,
    ( ~ ssList(u)
    | ssList(app(u,skc7)) ),
    inference(res,[status(thm),theory(equality)],[5,93]),
    [iquote('0:Res:5.0,93.1')] ).

cnf(3524,plain,
    ( ~ ssList(skc10)
    | ~ ssList(app(skc9,skc7))
    | ~ ssItem(u)
    | ~ memberP(app(skc9,skc7),u)
    | memberP(skc8,u) ),
    inference(spr,[status(thm),theory(equality)],[72,147]),
    [iquote('0:SpR:72.0,147.4')] ).

cnf(3531,plain,
    ( ~ ssItem(u)
    | ~ memberP(app(skc9,skc7),u)
    | memberP(skc8,u) ),
    inference(ssi,[status(thm)],[3524,332,3,2]),
    [iquote('0:SSi:3524.1,3524.0,332.0,3.0,2.1')] ).

cnf(11890,plain,
    ( ~ ssList(skc7)
    | ~ ssList(skc9)
    | ~ ssItem(u)
    | ~ ssItem(u)
    | ~ memberP(skc7,u)
    | memberP(skc8,u) ),
    inference(res,[status(thm),theory(equality)],[148,3531]),
    [iquote('0:Res:148.4,3531.1')] ).

cnf(11892,plain,
    ( ~ ssList(skc7)
    | ~ ssList(skc9)
    | ~ ssItem(u)
    | ~ memberP(skc7,u)
    | memberP(skc8,u) ),
    inference(obv,[status(thm),theory(equality)],[11890]),
    [iquote('0:Obv:11890.2')] ).

cnf(30399,plain,
    ( ~ ssItem(u)
    | ~ memberP(skc7,u)
    | memberP(skc8,u) ),
    inference(ssi,[status(thm)],[11892,3,5,6]),
    [iquote('0:SSi:11892.1,11892.0,3.0,5.0,6.0')] ).

cnf(34070,plain,
    ( ~ ssItem(skc11)
    | ~ memberP(skc7,skc11) ),
    inference(res,[status(thm),theory(equality)],[30399,56]),
    [iquote('0:Res:30399.2,56.0')] ).

cnf(34071,plain,
    ~ memberP(skc7,skc11),
    inference(ssi,[status(thm)],[34070,1]),
    [iquote('0:SSi:34070.0,1.0')] ).

cnf(34072,plain,
    $false,
    inference(mrr,[status(thm)],[34071,17]),
    [iquote('0:MRR:34071.0,17.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC399+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n006.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 : Sun Jun 12 09:36:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 27.48/27.67  
% 27.48/27.67  SPASS V 3.9 
% 27.48/27.67  SPASS beiseite: Proof found.
% 27.48/27.67  % SZS status Theorem
% 27.48/27.67  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 27.48/27.67  SPASS derived 23992 clauses, backtracked 5706 clauses, performed 93 splits and kept 12074 clauses.
% 27.48/27.67  SPASS allocated 124822 KBytes.
% 27.48/27.67  SPASS spent	0:0:22.92 on the problem.
% 27.48/27.67  		0:00:00.04 for the input.
% 27.48/27.67  		0:00:00.07 for the FLOTTER CNF translation.
% 27.48/27.67  		0:00:00.29 for inferences.
% 27.48/27.67  		0:00:00.45 for the backtracking.
% 27.48/27.67  		0:0:21.76 for the reduction.
% 27.48/27.67  
% 27.48/27.67  
% 27.48/27.67  Here is a proof with depth 3, length 20 :
% 27.48/27.67  % SZS output start Refutation
% See solution above
% 27.48/27.67  Formulae used in the proof : co1 ax26 ax36
% 27.48/27.67  
%------------------------------------------------------------------------------