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

% Computer : n007.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:44 EDT 2022

% Result   : Unsatisfiable 0.18s 0.42s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   6 unt;   0 nHn;  11 RR)
%            Number of literals    :   16 (   0 equ;   6 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(5,axiom,
    equal(sk4,sk2),
    file('SWC103-1.p',unknown),
    [] ).

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

cnf(7,axiom,
    neq(sk2,nil),
    file('SWC103-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ neq(sk1,nil)
    | ~ frontsegP(sk2,sk1) ),
    file('SWC103-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ neq(sk4,nil)
    | neq(sk3,nil) ),
    file('SWC103-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ neq(sk4,nil)
    | frontsegP(sk4,sk3) ),
    file('SWC103-1.p',unknown),
    [] ).

cnf(199,plain,
    ( ~ neq(sk2,nil)
    | frontsegP(sk2,sk1) ),
    inference(rew,[status(thm),theory(equality)],[5,11,6]),
    [iquote('0:Rew:5.0,11.1,6.0,11.1,5.0,11.0')] ).

cnf(200,plain,
    frontsegP(sk2,sk1),
    inference(mrr,[status(thm)],[199,7]),
    [iquote('0:MRR:199.0,7.0')] ).

cnf(201,plain,
    ( ~ neq(sk2,nil)
    | neq(sk1,nil) ),
    inference(rew,[status(thm),theory(equality)],[6,10,5]),
    [iquote('0:Rew:6.0,10.1,5.0,10.0')] ).

cnf(202,plain,
    neq(sk1,nil),
    inference(mrr,[status(thm)],[201,7]),
    [iquote('0:MRR:201.0,7.0')] ).

cnf(204,plain,
    $false,
    inference(mrr,[status(thm)],[9,202,200]),
    [iquote('0:MRR:9.0,9.1,202.0,200.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC103-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 12 21:55:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  
% 0.18/0.42  SPASS V 3.9 
% 0.18/0.42  SPASS beiseite: Proof found.
% 0.18/0.42  % SZS status Theorem
% 0.18/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.42  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 85 clauses.
% 0.18/0.42  SPASS allocated 75861 KBytes.
% 0.18/0.42  SPASS spent	0:00:00.07 on the problem.
% 0.18/0.42  		0:00:00.04 for the input.
% 0.18/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.42  		0:00:00.00 for inferences.
% 0.18/0.42  		0:00:00.00 for the backtracking.
% 0.18/0.42  		0:00:00.00 for the reduction.
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Here is a proof with depth 0, length 11 :
% 0.18/0.42  % SZS output start Refutation
% See solution above
% 0.18/0.42  Formulae used in the proof : co1_5 co1_6 co1_7 co1_9 co1_10 co1_11
% 0.18/0.42  
%------------------------------------------------------------------------------