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

% Computer : n013.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:52 EDT 2022

% Result   : Theorem 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   10 (   4 unt;   3 nHn;  10 RR)
%            Number of literals    :   17 (   0 equ;   6 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    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(58,axiom,
    ( skP0(u,v)
    | neq(v,nil) ),
    file('SWC121+1.p',unknown),
    [] ).

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

cnf(60,axiom,
    ( skP0(u,v)
    | segmentP(v,u) ),
    file('SWC121+1.p',unknown),
    [] ).

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

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

cnf(97,axiom,
    ( ~ neq(u,nil)
    | ~ segmentP(v,u)
    | skP0(u,v) ),
    file('SWC121+1.p',unknown),
    [] ).

cnf(195,plain,
    neq(skc5,nil),
    inference(mrr,[status(thm)],[69,58]),
    [iquote('0:MRR:69.0,58.1')] ).

cnf(196,plain,
    ~ skP0(skc4,skc5),
    inference(mrr,[status(thm)],[79,195]),
    [iquote('0:MRR:79.0,195.0')] ).

cnf(197,plain,
    skP0(u,v),
    inference(mrr,[status(thm)],[97,59,60]),
    [iquote('0:MRR:97.0,97.1,59.0,60.0')] ).

cnf(198,plain,
    $false,
    inference(unc,[status(thm)],[197,196]),
    [iquote('0:UnC:197.0,196.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWC121+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 12 06:07:14 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.48  
% 0.19/0.48  SPASS V 3.9 
% 0.19/0.48  SPASS beiseite: Proof found.
% 0.19/0.48  % SZS status Theorem
% 0.19/0.48  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.48  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 102 clauses.
% 0.19/0.48  SPASS allocated 98238 KBytes.
% 0.19/0.48  SPASS spent	0:00:00.14 on the problem.
% 0.19/0.48  		0:00:00.04 for the input.
% 0.19/0.48  		0:00:00.07 for the FLOTTER CNF translation.
% 0.19/0.48  		0:00:00.00 for inferences.
% 0.19/0.48  		0:00:00.00 for the backtracking.
% 0.19/0.48  		0:00:00.00 for the reduction.
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  Here is a proof with depth 0, length 10 :
% 0.19/0.48  % SZS output start Refutation
% See solution above
% 0.19/0.48  Formulae used in the proof : co1
% 0.19/0.48  
%------------------------------------------------------------------------------