%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC019+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:01:08 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   6 unt;   1 nHn;  11 RR)
%            Number of literals    :   20 (   0 equ;  12 neg)
%            Maximal clause size   :    4 (   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(skc3),
    file('SWC019+1.p',unknown),
    [] ).

cnf(4,axiom,
    ssList(nil),
    file('SWC019+1.p',unknown),
    [] ).

cnf(50,axiom,
    ~ equal(skc3,nil),
    file('SWC019+1.p',unknown),
    [] ).

cnf(59,axiom,
    ( ~ ssList(u)
    | frontsegP(u,u) ),
    file('SWC019+1.p',unknown),
    [] ).

cnf(92,axiom,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ frontsegP(skc3,u) ),
    file('SWC019+1.p',unknown),
    [] ).

cnf(102,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | neq(v,u)
    | equal(v,u) ),
    file('SWC019+1.p',unknown),
    [] ).

cnf(250,plain,
    ( ~ neq(skc3,nil)
    | ~ frontsegP(skc3,skc3) ),
    inference(res,[status(thm),theory(equality)],[1,92]),
    [iquote('0:Res:1.0,92.0')] ).

cnf(273,plain,
    frontsegP(skc3,skc3),
    inference(res,[status(thm),theory(equality)],[1,59]),
    [iquote('0:Res:1.0,59.0')] ).

cnf(380,plain,
    ( ~ ssList(skc3)
    | ~ ssList(nil)
    | neq(skc3,nil) ),
    inference(res,[status(thm),theory(equality)],[102,50]),
    [iquote('0:Res:102.2,50.0')] ).

cnf(421,plain,
    ~ neq(skc3,nil),
    inference(mrr,[status(thm)],[250,273]),
    [iquote('0:MRR:250.1,273.0')] ).

cnf(423,plain,
    $false,
    inference(mrr,[status(thm)],[380,1,4,421]),
    [iquote('0:MRR:380.0,380.1,380.2,1.0,4.0,421.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SWC019+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.11/0.32  % Computer : n008.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jun 12 22:19:22 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.50  
% 0.19/0.50  SPASS V 3.9 
% 0.19/0.50  SPASS beiseite: Proof found.
% 0.19/0.50  % SZS status Theorem
% 0.19/0.50  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.50  SPASS derived 221 clauses, backtracked 0 clauses, performed 0 splits and kept 222 clauses.
% 0.19/0.50  SPASS allocated 98251 KBytes.
% 0.19/0.50  SPASS spent	0:00:00.16 on the problem.
% 0.19/0.50  		0:00:00.04 for the input.
% 0.19/0.50  		0:00:00.07 for the FLOTTER CNF translation.
% 0.19/0.50  		0:00:00.00 for inferences.
% 0.19/0.50  		0:00:00.00 for the backtracking.
% 0.19/0.50  		0:00:00.02 for the reduction.
% 0.19/0.50  
% 0.19/0.50  
% 0.19/0.50  Here is a proof with depth 1, length 11 :
% 0.19/0.50  % SZS output start Refutation
% See solution above
% 0.19/0.50  Formulae used in the proof : co1 ax17 ax42 ax15
% 0.19/0.50  
%------------------------------------------------------------------------------