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

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

% Result   : Theorem 0.19s 0.54s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   10 (   7 unt;   0 nHn;  10 RR)
%            Number of literals    :   13 (   0 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 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(1,axiom,
    ssList(skc5),
    file('SWC328+1.p',unknown),
    [] ).

cnf(12,axiom,
    equalelemsP(nil),
    file('SWC328+1.p',unknown),
    [] ).

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

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

cnf(67,axiom,
    ( ~ segmentP(skc5,skc4)
    | ~ equalelemsP(skc4) ),
    file('SWC328+1.p',unknown),
    [] ).

cnf(191,plain,
    equalelemsP(skc4),
    inference(rew,[status(thm),theory(equality)],[13,12]),
    [iquote('0:Rew:13.0,12.0')] ).

cnf(200,plain,
    ( ~ ssList(u)
    | segmentP(u,skc4) ),
    inference(rew,[status(thm),theory(equality)],[13,65]),
    [iquote('0:Rew:13.0,65.1')] ).

cnf(211,plain,
    ~ segmentP(skc5,skc4),
    inference(mrr,[status(thm)],[67,191]),
    [iquote('0:MRR:67.1,191.0')] ).

cnf(502,plain,
    segmentP(skc5,skc4),
    inference(res,[status(thm),theory(equality)],[1,200]),
    [iquote('0:Res:1.0,200.0')] ).

cnf(591,plain,
    $false,
    inference(mrr,[status(thm)],[502,211]),
    [iquote('0:MRR:502.0,211.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWC328+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n017.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 08:56:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.54  
% 0.19/0.54  SPASS V 3.9 
% 0.19/0.54  SPASS beiseite: Proof found.
% 0.19/0.54  % SZS status Theorem
% 0.19/0.54  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.54  SPASS derived 351 clauses, backtracked 0 clauses, performed 0 splits and kept 204 clauses.
% 0.19/0.54  SPASS allocated 98380 KBytes.
% 0.19/0.54  SPASS spent	0:00:00.18 on the problem.
% 0.19/0.54  		0:00:00.04 for the input.
% 0.19/0.54  		0:00:00.07 for the FLOTTER CNF translation.
% 0.19/0.54  		0:00:00.00 for inferences.
% 0.19/0.54  		0:00:00.00 for the backtracking.
% 0.19/0.54  		0:00:00.02 for the reduction.
% 0.19/0.54  
% 0.19/0.54  
% 0.19/0.54  Here is a proof with depth 1, length 10 :
% 0.19/0.54  % SZS output start Refutation
% See solution above
% 0.19/0.54  Formulae used in the proof : co1 ax74 ax57
% 0.19/0.54  
%------------------------------------------------------------------------------