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

% Computer : n022.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:22 EDT 2022

% Result   : Unsatisfiable 1.21s 1.39s
% Output   : Refutation 1.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   22 (  13 unt;   0 nHn;  22 RR)
%            Number of literals    :   44 (   0 equ;  26 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    equal(sk4,sk2),
    file('SWC333-1.p',unknown),
    [] ).

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

cnf(7,axiom,
    segmentP(sk4,sk3),
    file('SWC333-1.p',unknown),
    [] ).

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

cnf(9,axiom,
    ( ~ ssList(u)
    | ~ totalorderedP(u)
    | ~ segmentP(sk4,u)
    | ~ segmentP(u,sk3)
    | ~ neq(sk3,u) ),
    file('SWC333-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1)
    | ssList(sk5) ),
    file('SWC333-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1)
    | neq(sk1,sk5) ),
    file('SWC333-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1)
    | segmentP(sk2,sk5) ),
    file('SWC333-1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1)
    | segmentP(sk5,sk1) ),
    file('SWC333-1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1)
    | totalorderedP(sk5) ),
    file('SWC333-1.p',unknown),
    [] ).

cnf(200,plain,
    totalorderedP(sk1),
    inference(rew,[status(thm),theory(equality)],[6,8]),
    [iquote('0:Rew:6.0,8.0')] ).

cnf(202,plain,
    segmentP(sk4,sk1),
    inference(rew,[status(thm),theory(equality)],[6,7]),
    [iquote('0:Rew:6.0,7.0')] ).

cnf(204,plain,
    segmentP(sk2,sk1),
    inference(rew,[status(thm),theory(equality)],[5,202]),
    [iquote('0:Rew:5.0,202.0')] ).

cnf(205,plain,
    totalorderedP(sk5),
    inference(mrr,[status(thm)],[14,204,200]),
    [iquote('0:MRR:14.0,14.1,204.0,200.0')] ).

cnf(206,plain,
    ssList(sk5),
    inference(mrr,[status(thm)],[10,204,200]),
    [iquote('0:MRR:10.0,10.1,204.0,200.0')] ).

cnf(207,plain,
    segmentP(sk5,sk1),
    inference(mrr,[status(thm)],[13,204,200]),
    [iquote('0:MRR:13.0,13.1,204.0,200.0')] ).

cnf(208,plain,
    segmentP(sk2,sk5),
    inference(mrr,[status(thm)],[12,204,200]),
    [iquote('0:MRR:12.0,12.1,204.0,200.0')] ).

cnf(209,plain,
    neq(sk1,sk5),
    inference(mrr,[status(thm)],[11,204,200]),
    [iquote('0:MRR:11.0,11.1,204.0,200.0')] ).

cnf(210,plain,
    ( ~ totalorderedP(u)
    | ~ ssList(u)
    | ~ segmentP(u,sk1)
    | ~ neq(sk1,u)
    | ~ segmentP(sk2,u) ),
    inference(rew,[status(thm),theory(equality)],[6,9,5]),
    [iquote('0:Rew:6.0,9.4,6.0,9.3,5.0,9.2')] ).

cnf(4184,plain,
    ( ~ totalorderedP(sk5)
    | ~ ssList(sk5)
    | ~ segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk5) ),
    inference(res,[status(thm),theory(equality)],[209,210]),
    [iquote('0:Res:209.0,210.3')] ).

cnf(4186,plain,
    ( ~ segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk5) ),
    inference(ssi,[status(thm)],[4184,205,206]),
    [iquote('0:SSi:4184.1,4184.0,205.0,206.0,205.0,206.0')] ).

cnf(4187,plain,
    $false,
    inference(mrr,[status(thm)],[4186,207,208]),
    [iquote('0:MRR:4186.0,4186.1,207.0,208.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : SWC333-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n022.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 14:17:33 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.21/1.39  
% 1.21/1.39  SPASS V 3.9 
% 1.21/1.39  SPASS beiseite: Proof found.
% 1.21/1.39  % SZS status Theorem
% 1.21/1.39  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.21/1.39  SPASS derived 2724 clauses, backtracked 1234 clauses, performed 29 splits and kept 2744 clauses.
% 1.21/1.39  SPASS allocated 78959 KBytes.
% 1.21/1.39  SPASS spent	0:00:01.01 on the problem.
% 1.21/1.39  		0:00:00.04 for the input.
% 1.21/1.39  		0:00:00.00 for the FLOTTER CNF translation.
% 1.21/1.39  		0:00:00.02 for inferences.
% 1.21/1.39  		0:00:00.02 for the backtracking.
% 1.21/1.39  		0:00:00.74 for the reduction.
% 1.21/1.39  
% 1.21/1.39  
% 1.21/1.39  Here is a proof with depth 1, length 22 :
% 1.21/1.39  % SZS output start Refutation
% See solution above
% 1.21/1.39  Formulae used in the proof : co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 co1_13 co1_14
% 1.21/1.39  
%------------------------------------------------------------------------------