%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : MGT049+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 : Sun Jul 17 22:26:26 EDT 2022

% Result   : Theorem 0.18s 0.43s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   12 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    organization(skc3),
    file('MGT049+1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ equal(position(skc3,skc5),position(skc3,skc4)),
    file('MGT049+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ organization(u)
    | equal(external_ties(u,v),external_ties(u,w)) ),
    file('MGT049+1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ organization(u)
    | ~ equal(external_ties(u,v),external_ties(u,w))
    | equal(position(u,v),position(u,w)) ),
    file('MGT049+1.p',unknown),
    [] ).

cnf(20,plain,
    equal(external_ties(skc3,u),external_ties(skc3,v)),
    inference(res,[status(thm),theory(equality)],[1,12]),
    [iquote('0:Res:1.0,12.0')] ).

cnf(24,plain,
    ( ~ organization(skc3)
    | ~ equal(external_ties(skc3,skc5),external_ties(skc3,skc4)) ),
    inference(res,[status(thm),theory(equality)],[17,9]),
    [iquote('0:Res:17.2,9.0')] ).

cnf(33,plain,
    ~ equal(external_ties(skc3,skc5),external_ties(skc3,skc4)),
    inference(mrr,[status(thm)],[24,1]),
    [iquote('0:MRR:24.0,1.0')] ).

cnf(34,plain,
    $false,
    inference(unc,[status(thm)],[33,20]),
    [iquote('0:UnC:33.0,20.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : MGT049+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.11/0.32  % Computer : n017.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Thu Jun  9 10:02:19 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 15 clauses, backtracked 0 clauses, performed 0 splits and kept 20 clauses.
% 0.18/0.43  SPASS allocated 97638 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.43  		0:00:00.04 for the input.
% 0.18/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.00 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 1, length 8 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : lemma_6 assumption_11 assumption_6
% 0.18/0.43  
%------------------------------------------------------------------------------