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

% Computer : n025.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:20 EDT 2022

% Result   : Theorem 0.37s 0.55s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   14 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   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('SWC044+1.p',unknown),
    [] ).

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

cnf(14,axiom,
    rearsegP(skc5,skc4),
    file('SWC044+1.p',unknown),
    [] ).

cnf(53,axiom,
    ~ equal(nil,skc4),
    file('SWC044+1.p',unknown),
    [] ).

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

cnf(201,plain,
    ~ equal(skc5,skc4),
    inference(rew,[status(thm),theory(equality)],[13,53]),
    [iquote('0:Rew:13.0,53.0')] ).

cnf(222,plain,
    ( ~ ssList(u)
    | ~ rearsegP(skc5,u)
    | equal(skc5,u) ),
    inference(rew,[status(thm),theory(equality)],[13,91]),
    [iquote('0:Rew:13.0,91.2,13.0,91.1')] ).

cnf(319,plain,
    ( ~ rearsegP(skc5,skc4)
    | equal(skc5,skc4) ),
    inference(res,[status(thm),theory(equality)],[2,222]),
    [iquote('0:Res:2.0,222.0')] ).

cnf(595,plain,
    $false,
    inference(mrr,[status(thm)],[319,14,201]),
    [iquote('0:MRR:319.0,319.1,14.0,201.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 12 05:17:07 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.37/0.55  
% 0.37/0.55  SPASS V 3.9 
% 0.37/0.55  SPASS beiseite: Proof found.
% 0.37/0.55  % SZS status Theorem
% 0.37/0.55  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.37/0.55  SPASS derived 351 clauses, backtracked 0 clauses, performed 0 splits and kept 217 clauses.
% 0.37/0.55  SPASS allocated 98383 KBytes.
% 0.37/0.55  SPASS spent	0:00:00.19 on the problem.
% 0.37/0.55  		0:00:00.04 for the input.
% 0.37/0.55  		0:00:00.07 for the FLOTTER CNF translation.
% 0.37/0.55  		0:00:00.00 for inferences.
% 0.37/0.55  		0:00:00.00 for the backtracking.
% 0.37/0.55  		0:00:00.02 for the reduction.
% 0.37/0.55  
% 0.37/0.55  
% 0.37/0.55  Here is a proof with depth 1, length 9 :
% 0.37/0.55  % SZS output start Refutation
% See solution above
% 0.37/0.55  Formulae used in the proof : co1 ax52
% 0.37/0.55  
%------------------------------------------------------------------------------