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

% Computer : n010.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 0.21s 0.53s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   6 unt;   0 nHn;  11 RR)
%            Number of literals    :   19 (   0 equ;  10 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ssList(skc4),
    file('SWC051+1.p',unknown),
    [] ).

cnf(13,axiom,
    neq(skc5,nil),
    file('SWC051+1.p',unknown),
    [] ).

cnf(62,axiom,
    ( ~ ssList(u)
    | rearsegP(u,u) ),
    file('SWC051+1.p',unknown),
    [] ).

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

cnf(69,axiom,
    ( ~ neq(skc5,nil)
    | rearsegP(skc5,skc4) ),
    file('SWC051+1.p',unknown),
    [] ).

cnf(125,axiom,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ rearsegP(skc4,u)
    | ~ rearsegP(skc5,u) ),
    file('SWC051+1.p',unknown),
    [] ).

cnf(194,plain,
    rearsegP(skc5,skc4),
    inference(mrr,[status(thm)],[69,13]),
    [iquote('0:MRR:69.0,13.0')] ).

cnf(195,plain,
    neq(skc4,nil),
    inference(mrr,[status(thm)],[68,13]),
    [iquote('0:MRR:68.0,13.0')] ).

cnf(244,plain,
    ( ~ neq(skc4,nil)
    | ~ rearsegP(skc5,skc4)
    | ~ rearsegP(skc4,skc4) ),
    inference(res,[status(thm),theory(equality)],[2,125]),
    [iquote('0:Res:2.0,125.0')] ).

cnf(281,plain,
    rearsegP(skc4,skc4),
    inference(res,[status(thm),theory(equality)],[2,62]),
    [iquote('0:Res:2.0,62.0')] ).

cnf(548,plain,
    $false,
    inference(mrr,[status(thm)],[244,195,194,281]),
    [iquote('0:MRR:244.0,244.1,244.2,195.0,194.0,281.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC051+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n010.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 : Sat Jun 11 23:29:40 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.21/0.53  
% 0.21/0.53  SPASS V 3.9 
% 0.21/0.53  SPASS beiseite: Proof found.
% 0.21/0.53  % SZS status Theorem
% 0.21/0.53  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.53  SPASS derived 344 clauses, backtracked 0 clauses, performed 0 splits and kept 277 clauses.
% 0.21/0.53  SPASS allocated 98345 KBytes.
% 0.21/0.53  SPASS spent	0:00:00.17 on the problem.
% 0.21/0.53  		0:00:00.04 for the input.
% 0.21/0.53  		0:00:00.06 for the FLOTTER CNF translation.
% 0.21/0.53  		0:00:00.00 for inferences.
% 0.21/0.53  		0:00:00.00 for the backtracking.
% 0.21/0.53  		0:00:00.02 for the reduction.
% 0.21/0.53  
% 0.21/0.53  
% 0.21/0.53  Here is a proof with depth 1, length 11 :
% 0.21/0.53  % SZS output start Refutation
% See solution above
% 0.21/0.53  Formulae used in the proof : co1 ax49
% 0.21/0.53  
%------------------------------------------------------------------------------