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

% Computer : n026.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:29 EDT 2022

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   7 unt;   0 nHn;   9 RR)
%            Number of literals    :   11 (   0 equ;   3 neg)
%            Maximal clause size   :    2 (   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(2,axiom,
    ssList(sk2),
    file('SWC349-1.p',unknown),
    [] ).

cnf(5,axiom,
    equal(nil,sk3),
    file('SWC349-1.p',unknown),
    [] ).

cnf(7,axiom,
    equal(sk3,sk1),
    file('SWC349-1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ frontsegP(sk2,sk1),
    file('SWC349-1.p',unknown),
    [] ).

cnf(69,axiom,
    ( ~ ssList(u)
    | frontsegP(u,nil) ),
    file('SWC349-1.p',unknown),
    [] ).

cnf(197,plain,
    equal(nil,sk1),
    inference(rew,[status(thm),theory(equality)],[7,5]),
    [iquote('0:Rew:7.0,5.0')] ).

cnf(208,plain,
    ( ~ ssList(u)
    | frontsegP(u,sk1) ),
    inference(rew,[status(thm),theory(equality)],[197,69]),
    [iquote('0:Rew:197.0,69.1')] ).

cnf(341,plain,
    frontsegP(sk2,sk1),
    inference(res,[status(thm),theory(equality)],[2,208]),
    [iquote('0:Res:2.0,208.0')] ).

cnf(597,plain,
    $false,
    inference(mrr,[status(thm)],[341,9]),
    [iquote('0:MRR:341.0,9.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC349-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n026.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 09:33:05 EDT 2022
% 0.13/0.34  % 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/sandbox/benchmark/theBenchmark.p 
% 0.19/0.48  SPASS derived 354 clauses, backtracked 0 clauses, performed 0 splits and kept 205 clauses.
% 0.19/0.48  SPASS allocated 76385 KBytes.
% 0.19/0.48  SPASS spent	0:00:00.12 on the problem.
% 0.19/0.48  		0:00:00.04 for the input.
% 0.19/0.48  		0:00:00.00 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.03 for the reduction.
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  Here is a proof with depth 1, length 9 :
% 0.19/0.48  % SZS output start Refutation
% See solution above
% 0.19/0.48  Formulae used in the proof : co1_2 co1_5 co1_7 co1_9 clause60
% 0.19/0.48  
%------------------------------------------------------------------------------