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

% Computer : n008.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:36 EDT 2022

% Result   : Theorem 0.67s 0.91s
% Output   : Refutation 0.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   17 (  11 unt;   4 nHn;  17 RR)
%            Number of literals    :   35 (   0 equ;  16 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssList(skc5),
    file('SWC367+1.p',unknown),
    [] ).

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

cnf(51,axiom,
    ~ rearsegP(skc5,skc4),
    file('SWC367+1.p',unknown),
    [] ).

cnf(60,axiom,
    ( skP0(u,v)
    | equal(nil,u) ),
    file('SWC367+1.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ ssList(u)
    | rearsegP(u,nil) ),
    file('SWC367+1.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ skP0(skc4,skc5)
    | rearsegP(skc5,skc4) ),
    file('SWC367+1.p',unknown),
    [] ).

cnf(185,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ equal(tl(u),tl(v))
    | ~ equal(hd(u),hd(v))
    | equal(u,v)
    | equal(nil,v)
    | equal(nil,u) ),
    file('SWC367+1.p',unknown),
    [] ).

cnf(194,plain,
    ~ skP0(skc4,skc5),
    inference(mrr,[status(thm)],[70,51]),
    [iquote('0:MRR:70.1,51.0')] ).

cnf(283,plain,
    ( ~ ssList(u)
    | ~ equal(tl(skc4),tl(u))
    | ~ equal(hd(skc4),hd(u))
    | equal(nil,u)
    | equal(skc4,u)
    | equal(skc4,nil) ),
    inference(res,[status(thm),theory(equality)],[2,185]),
    [iquote('0:Res:2.0,185.1')] ).

cnf(451,plain,
    rearsegP(skc5,nil),
    inference(res,[status(thm),theory(equality)],[1,65]),
    [iquote('0:Res:1.0,65.0')] ).

cnf(550,plain,
    equal(skc4,nil),
    inference(spt,[spt(split,[position(s1)])],[283]),
    [iquote('1:Spt:283.5')] ).

cnf(660,plain,
    ~ rearsegP(skc5,nil),
    inference(rew,[status(thm),theory(equality)],[550,51]),
    [iquote('1:Rew:550.0,51.0')] ).

cnf(703,plain,
    $false,
    inference(mrr,[status(thm)],[660,451]),
    [iquote('1:MRR:660.0,451.0')] ).

cnf(807,plain,
    ~ equal(skc4,nil),
    inference(spt,[spt(split,[position(sa)])],[703,550]),
    [iquote('1:Spt:703.0,283.5,550.0')] ).

cnf(808,plain,
    ( ~ ssList(u)
    | ~ equal(tl(skc4),tl(u))
    | ~ equal(hd(skc4),hd(u))
    | equal(nil,u)
    | equal(skc4,u) ),
    inference(spt,[spt(split,[position(s2)])],[283]),
    [iquote('1:Spt:703.0,283.0,283.1,283.2,283.3,283.4')] ).

cnf(1134,plain,
    equal(skc4,nil),
    inference(res,[status(thm),theory(equality)],[60,194]),
    [iquote('0:Res:60.0,194.0')] ).

cnf(1135,plain,
    $false,
    inference(mrr,[status(thm)],[1134,807]),
    [iquote('1:MRR:1134.0,807.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SWC367+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n008.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 12:47:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.67/0.91  
% 0.67/0.91  SPASS V 3.9 
% 0.67/0.91  SPASS beiseite: Proof found.
% 0.67/0.91  % SZS status Theorem
% 0.67/0.91  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.67/0.91  SPASS derived 697 clauses, backtracked 356 clauses, performed 21 splits and kept 1071 clauses.
% 0.67/0.91  SPASS allocated 98897 KBytes.
% 0.67/0.91  SPASS spent	0:00:00.57 on the problem.
% 0.67/0.91  		0:00:00.04 for the input.
% 0.67/0.91  		0:00:00.07 for the FLOTTER CNF translation.
% 0.67/0.91  		0:00:00.00 for inferences.
% 0.67/0.91  		0:00:00.01 for the backtracking.
% 0.67/0.91  		0:00:00.30 for the reduction.
% 0.67/0.91  
% 0.67/0.91  
% 0.67/0.91  Here is a proof with depth 2, length 17 :
% 0.67/0.91  % SZS output start Refutation
% See solution above
% 0.67/0.91  Formulae used in the proof : co1 ax51 ax77
% 0.67/0.91  
%------------------------------------------------------------------------------