%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC353-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:31 EDT 2022

% Result   : Unsatisfiable 5.96s 6.17s
% Output   : Refutation 5.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   17 (  12 unt;   0 nHn;  17 RR)
%            Number of literals    :   29 (   0 equ;  16 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssList(sk1),
    file('SWC353-1.p',unknown),
    [] ).

cnf(5,axiom,
    equal(sk4,sk2),
    file('SWC353-1.p',unknown),
    [] ).

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

cnf(7,axiom,
    ssList(sk5),
    file('SWC353-1.p',unknown),
    [] ).

cnf(8,axiom,
    equal(app(sk3,sk5),sk4),
    file('SWC353-1.p',unknown),
    [] ).

cnf(9,axiom,
    totalorderedP(sk3),
    file('SWC353-1.p',unknown),
    [] ).

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

cnf(73,axiom,
    ( ~ ssList(u)
    | frontsegP(u,u) ),
    file('SWC353-1.p',unknown),
    [] ).

cnf(149,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ frontsegP(u,v)
    | frontsegP(app(u,w),v) ),
    file('SWC353-1.p',unknown),
    [] ).

cnf(198,plain,
    totalorderedP(sk1),
    inference(rew,[status(thm),theory(equality)],[6,9]),
    [iquote('0:Rew:6.0,9.0')] ).

cnf(201,plain,
    equal(app(sk1,sk5),sk2),
    inference(rew,[status(thm),theory(equality)],[6,8,5]),
    [iquote('0:Rew:6.0,8.0,5.0,8.0')] ).

cnf(4919,plain,
    ( ~ ssList(sk1)
    | ~ ssList(u)
    | ~ ssList(sk5)
    | ~ frontsegP(sk1,u)
    | frontsegP(sk2,u) ),
    inference(spr,[status(thm),theory(equality)],[201,149]),
    [iquote('0:SpR:201.0,149.4')] ).

cnf(10322,plain,
    ( ~ ssList(u)
    | ~ frontsegP(sk1,u)
    | frontsegP(sk2,u) ),
    inference(ssi,[status(thm)],[4919,7,198,1]),
    [iquote('0:SSi:4919.2,4919.0,7.0,198.0,1.0')] ).

cnf(10996,plain,
    ( ~ ssList(sk1)
    | ~ frontsegP(sk1,sk1) ),
    inference(res,[status(thm),theory(equality)],[10322,11]),
    [iquote('0:Res:10322.2,11.0')] ).

cnf(10997,plain,
    ~ frontsegP(sk1,sk1),
    inference(ssi,[status(thm)],[10996,198,1]),
    [iquote('0:SSi:10996.0,198.0,1.0')] ).

cnf(11002,plain,
    ~ ssList(sk1),
    inference(res,[status(thm),theory(equality)],[73,10997]),
    [iquote('0:Res:73.1,10997.0')] ).

cnf(11003,plain,
    $false,
    inference(ssi,[status(thm)],[11002,198,1]),
    [iquote('0:SSi:11002.0,198.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem  : SWC353-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 12 02:48:51 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 5.96/6.17  
% 5.96/6.17  SPASS V 3.9 
% 5.96/6.17  SPASS beiseite: Proof found.
% 5.96/6.17  % SZS status Theorem
% 5.96/6.17  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 5.96/6.17  SPASS derived 7145 clauses, backtracked 2547 clauses, performed 66 splits and kept 5799 clauses.
% 5.96/6.17  SPASS allocated 84769 KBytes.
% 5.96/6.17  SPASS spent	0:00:05.38 on the problem.
% 5.96/6.17  		0:00:00.04 for the input.
% 5.96/6.17  		0:00:00.00 for the FLOTTER CNF translation.
% 5.96/6.17  		0:00:00.08 for inferences.
% 5.96/6.17  		0:00:00.18 for the backtracking.
% 5.96/6.17  		0:00:04.87 for the reduction.
% 5.96/6.17  
% 5.96/6.17  
% 5.96/6.17  Here is a proof with depth 3, length 17 :
% 5.96/6.17  % SZS output start Refutation
% See solution above
% 5.96/6.17  Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_11 clause61 clause137
% 5.96/6.17  
%------------------------------------------------------------------------------