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

% Computer : n014.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:01:23 EDT 2022

% Result   : Theorem 4.36s 4.63s
% Output   : Refutation 4.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   16 (   5 unt;   8 nHn;  16 RR)
%            Number of literals    :   37 (   0 equ;  14 neg)
%            Maximal clause size   :    5 (   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;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(51,axiom,
    ssList(skf44(u,v)),
    file('SWC050+1.p',unknown),
    [] ).

cnf(59,axiom,
    ( skP0(u,v)
    | neq(v,nil) ),
    file('SWC050+1.p',unknown),
    [] ).

cnf(68,axiom,
    ( ~ skP0(skc4,skc5)
    | neq(skc5,nil) ),
    file('SWC050+1.p',unknown),
    [] ).

cnf(78,axiom,
    ( ~ neq(skc5,nil)
    | ~ skP0(skc4,skc5) ),
    file('SWC050+1.p',unknown),
    [] ).

cnf(79,axiom,
    ( skP0(u,v)
    | neq(skf44(u,v),nil) ),
    file('SWC050+1.p',unknown),
    [] ).

cnf(80,axiom,
    ( skP0(u,v)
    | rearsegP(v,skf44(u,v)) ),
    file('SWC050+1.p',unknown),
    [] ).

cnf(81,axiom,
    ( skP0(u,v)
    | rearsegP(u,skf44(u,v)) ),
    file('SWC050+1.p',unknown),
    [] ).

cnf(143,axiom,
    ( ~ ssList(u)
    | ~ rearsegP(v,u)
    | ~ rearsegP(w,u)
    | ~ neq(u,nil)
    | skP0(v,w) ),
    file('SWC050+1.p',unknown),
    [] ).

cnf(197,plain,
    neq(skc5,nil),
    inference(mrr,[status(thm)],[68,59]),
    [iquote('0:MRR:68.0,59.1')] ).

cnf(198,plain,
    ~ skP0(skc4,skc5),
    inference(mrr,[status(thm)],[78,197]),
    [iquote('0:MRR:78.0,197.0')] ).

cnf(5866,plain,
    ( ~ ssList(skf44(u,v))
    | ~ rearsegP(w,skf44(u,v))
    | ~ neq(skf44(u,v),nil)
    | skP0(u,v)
    | skP0(u,w) ),
    inference(res,[status(thm),theory(equality)],[81,143]),
    [iquote('0:Res:81.1,143.1')] ).

cnf(5887,plain,
    ( ~ rearsegP(u,skf44(v,w))
    | ~ neq(skf44(v,w),nil)
    | skP0(v,w)
    | skP0(v,u) ),
    inference(ssi,[status(thm)],[5866,51]),
    [iquote('0:SSi:5866.0,51.0')] ).

cnf(5888,plain,
    ( ~ rearsegP(u,skf44(v,w))
    | skP0(v,w)
    | skP0(v,u) ),
    inference(mrr,[status(thm)],[5887,79]),
    [iquote('0:MRR:5887.1,79.1')] ).

cnf(9559,plain,
    ( skP0(u,v)
    | skP0(u,v)
    | skP0(u,v) ),
    inference(res,[status(thm),theory(equality)],[80,5888]),
    [iquote('0:Res:80.1,5888.0')] ).

cnf(9564,plain,
    skP0(u,v),
    inference(obv,[status(thm),theory(equality)],[9559]),
    [iquote('0:Obv:9559.1')] ).

cnf(9565,plain,
    $false,
    inference(unc,[status(thm)],[9564,198]),
    [iquote('0:UnC:9564.0,198.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWC050+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 12 15:58:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 4.36/4.63  
% 4.36/4.63  SPASS V 3.9 
% 4.36/4.63  SPASS beiseite: Proof found.
% 4.36/4.63  % SZS status Theorem
% 4.36/4.63  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 4.36/4.63  SPASS derived 6442 clauses, backtracked 1174 clauses, performed 40 splits and kept 4489 clauses.
% 4.36/4.63  SPASS allocated 106173 KBytes.
% 4.36/4.63  SPASS spent	0:00:04.05 on the problem.
% 4.36/4.63  		0:00:00.04 for the input.
% 4.36/4.63  		0:00:00.07 for the FLOTTER CNF translation.
% 4.36/4.63  		0:00:00.07 for inferences.
% 4.36/4.63  		0:00:00.07 for the backtracking.
% 4.36/4.63  		0:00:03.60 for the reduction.
% 4.36/4.63  
% 4.36/4.63  
% 4.36/4.63  Here is a proof with depth 2, length 16 :
% 4.36/4.63  % SZS output start Refutation
% See solution above
% 4.36/4.63  Formulae used in the proof : co1 ax17
% 4.36/4.63  
%------------------------------------------------------------------------------