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

% Computer : n027.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:30 EDT 2022

% Result   : Unsatisfiable 5.92s 6.15s
% Output   : Refutation 5.92s
% 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('SWC351-1.p',unknown),
    [] ).

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

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

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

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

cnf(10,axiom,
    strictorderedP(sk3),
    file('SWC351-1.p',unknown),
    [] ).

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

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

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

cnf(199,plain,
    strictorderedP(sk1),
    inference(rew,[status(thm),theory(equality)],[6,10]),
    [iquote('0:Rew:6.0,10.0')] ).

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

cnf(5226,plain,
    ( ~ ssList(sk1)
    | ~ ssList(u)
    | ~ ssList(sk5)
    | ~ frontsegP(sk1,u)
    | frontsegP(sk2,u) ),
    inference(spr,[status(thm),theory(equality)],[202,150]),
    [iquote('0:SpR:202.0,150.4')] ).

cnf(10447,plain,
    ( ~ ssList(u)
    | ~ frontsegP(sk1,u)
    | frontsegP(sk2,u) ),
    inference(ssi,[status(thm)],[5226,8,199,1]),
    [iquote('0:SSi:5226.2,5226.0,8.0,199.0,1.0')] ).

cnf(11108,plain,
    ( ~ ssList(sk1)
    | ~ frontsegP(sk1,sk1) ),
    inference(res,[status(thm),theory(equality)],[10447,12]),
    [iquote('0:Res:10447.2,12.0')] ).

cnf(11109,plain,
    ~ frontsegP(sk1,sk1),
    inference(ssi,[status(thm)],[11108,199,1]),
    [iquote('0:SSi:11108.0,199.0,1.0')] ).

cnf(11114,plain,
    ~ ssList(sk1),
    inference(res,[status(thm),theory(equality)],[74,11109]),
    [iquote('0:Res:74.1,11109.0')] ).

cnf(11115,plain,
    $false,
    inference(ssi,[status(thm)],[11114,199,1]),
    [iquote('0:SSi:11114.0,199.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC351-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n027.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 01:34:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 5.92/6.15  
% 5.92/6.15  SPASS V 3.9 
% 5.92/6.15  SPASS beiseite: Proof found.
% 5.92/6.15  % SZS status Theorem
% 5.92/6.15  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 5.92/6.15  SPASS derived 7173 clauses, backtracked 2698 clauses, performed 66 splits and kept 5970 clauses.
% 5.92/6.15  SPASS allocated 84870 KBytes.
% 5.92/6.15  SPASS spent	0:00:05.34 on the problem.
% 5.92/6.15  		0:00:00.04 for the input.
% 5.92/6.15  		0:00:00.00 for the FLOTTER CNF translation.
% 5.92/6.15  		0:00:00.08 for inferences.
% 5.92/6.15  		0:00:00.18 for the backtracking.
% 5.92/6.15  		0:00:04.83 for the reduction.
% 5.92/6.15  
% 5.92/6.15  
% 5.92/6.15  Here is a proof with depth 3, length 17 :
% 5.92/6.15  % SZS output start Refutation
% See solution above
% 5.92/6.15  Formulae used in the proof : co1_1 co1_5 co1_6 co1_8 co1_9 co1_10 co1_12 clause61 clause137
% 5.92/6.15  
%------------------------------------------------------------------------------