%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC254+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:02:51 EDT 2022

% Result   : Theorem 1.14s 1.36s
% Output   : Refutation 1.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   17 (   7 unt;   2 nHn;  17 RR)
%            Number of literals    :   31 (   0 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(52,axiom,
    ssItem(skf45(u,v)),
    file('SWC254+1.p',unknown),
    [] ).

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

cnf(61,axiom,
    ( ~ singletonP(u)
    | skP0(u,v) ),
    file('SWC254+1.p',unknown),
    [] ).

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

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

cnf(87,axiom,
    ( skP0(u,v)
    | equal(cons(skf45(u,v),nil),u) ),
    file('SWC254+1.p',unknown),
    [] ).

cnf(122,axiom,
    ( ~ ssList(u)
    | ~ ssItem(v)
    | ~ equal(cons(v,nil),u)
    | singletonP(u) ),
    file('SWC254+1.p',unknown),
    [] ).

cnf(197,plain,
    neq(skc5,nil),
    inference(mrr,[status(thm)],[70,60]),
    [iquote('0:MRR:70.0,60.1')] ).

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

cnf(323,plain,
    ( ~ ssItem(u)
    | ~ equal(cons(u,nil),skc4)
    | singletonP(skc4) ),
    inference(res,[status(thm),theory(equality)],[2,122]),
    [iquote('0:Res:2.0,122.1')] ).

cnf(1892,plain,
    ~ singletonP(skc4),
    inference(res,[status(thm),theory(equality)],[61,198]),
    [iquote('0:Res:61.1,198.0')] ).

cnf(1896,plain,
    ( ~ ssItem(u)
    | ~ equal(cons(u,nil),skc4) ),
    inference(mrr,[status(thm)],[323,1892]),
    [iquote('0:MRR:323.2,1892.0')] ).

cnf(1948,plain,
    ( ~ ssItem(skf45(u,v))
    | ~ equal(u,skc4)
    | skP0(u,v) ),
    inference(spl,[status(thm),theory(equality)],[87,1896]),
    [iquote('0:SpL:87.1,1896.1')] ).

cnf(1949,plain,
    ( ~ equal(u,skc4)
    | skP0(u,v) ),
    inference(ssi,[status(thm)],[1948,52]),
    [iquote('0:SSi:1948.0,52.0')] ).

cnf(1950,plain,
    ~ equal(skc4,skc4),
    inference(res,[status(thm),theory(equality)],[1949,198]),
    [iquote('0:Res:1949.1,198.0')] ).

cnf(1951,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[1950]),
    [iquote('0:Obv:1950.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SWC254+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10  % Command  : run_spass %d %s
% 0.10/0.30  % Computer : n017.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sun Jun 12 05:43:36 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 1.14/1.36  
% 1.14/1.36  SPASS V 3.9 
% 1.14/1.36  SPASS beiseite: Proof found.
% 1.14/1.36  % SZS status Theorem
% 1.14/1.36  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.14/1.36  SPASS derived 1335 clauses, backtracked 660 clauses, performed 22 splits and kept 1630 clauses.
% 1.14/1.36  SPASS allocated 99432 KBytes.
% 1.14/1.36  SPASS spent	0:00:01.03 on the problem.
% 1.14/1.36  		0:00:00.03 for the input.
% 1.14/1.36  		0:00:00.06 for the FLOTTER CNF translation.
% 1.14/1.36  		0:00:00.01 for inferences.
% 1.14/1.36  		0:00:00.01 for the backtracking.
% 1.14/1.36  		0:00:00.70 for the reduction.
% 1.14/1.36  
% 1.14/1.36  
% 1.14/1.36  Here is a proof with depth 3, length 17 :
% 1.14/1.36  % SZS output start Refutation
% See solution above
% 1.14/1.36  Formulae used in the proof : co1 ax2 ax17 ax4
% 1.14/1.36  
%------------------------------------------------------------------------------