%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : MGT052+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n004.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  : 300s
% DateTime : Thu Aug 31 09:08:41 EDT 2023

% Result   : Theorem 0.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   19 (   6 unt;   9 typ;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :   40 (  18   ~;  15   |;   5   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (   7   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   16 (   0 sgn;  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    smaller_or_equal: ( $i * $i ) > $o ).

tff(decl_23,type,
    smaller: ( $i * $i ) > $o ).

tff(decl_24,type,
    greater_or_equal: ( $i * $i ) > $o ).

tff(decl_25,type,
    greater: ( $i * $i ) > $o ).

tff(decl_26,type,
    dissimilar: ( $i * $i * $i ) > $o ).

tff(decl_27,type,
    organization: $i > $o ).

tff(decl_28,type,
    is_aligned: ( $i * $i ) > $o ).

tff(decl_29,type,
    esk1_0: $i ).

tff(decl_30,type,
    esk2_0: $i ).

fof(background_assumption_1,conjecture,
    ! [X1,X5] : ~ dissimilar(X1,X5,X5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',background_assumption_1) ).

fof(definition_2,axiom,
    ! [X1,X4,X5] :
      ( dissimilar(X1,X4,X5)
    <=> ( organization(X1)
        & ~ ( is_aligned(X1,X4)
          <=> is_aligned(X1,X5) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X5] : ~ dissimilar(X1,X5,X5),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[background_assumption_1])]) ).

fof(c_0_3,plain,
    ! [X19,X20,X21] :
      ( ( organization(X19)
        | ~ dissimilar(X19,X20,X21) )
      & ( ~ is_aligned(X19,X20)
        | ~ is_aligned(X19,X21)
        | ~ dissimilar(X19,X20,X21) )
      & ( is_aligned(X19,X20)
        | is_aligned(X19,X21)
        | ~ dissimilar(X19,X20,X21) )
      & ( ~ is_aligned(X19,X20)
        | is_aligned(X19,X21)
        | ~ organization(X19)
        | dissimilar(X19,X20,X21) )
      & ( ~ is_aligned(X19,X21)
        | is_aligned(X19,X20)
        | ~ organization(X19)
        | dissimilar(X19,X20,X21) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_2])])]) ).

fof(c_0_4,negated_conjecture,
    dissimilar(esk1_0,esk2_0,esk2_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( ~ is_aligned(X1,X2)
    | ~ is_aligned(X1,X3)
    | ~ dissimilar(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    dissimilar(esk1_0,esk2_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( is_aligned(X1,X2)
    | is_aligned(X1,X3)
    | ~ dissimilar(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    ~ is_aligned(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT052+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 28 06:27:37 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.20/0.58  % Version  : CSE_E---1.5
% 0.20/0.58  % Problem  : theBenchmark.p
% 0.20/0.58  % Proof found
% 0.20/0.58  % SZS status Theorem for theBenchmark.p
% 0.20/0.58  % SZS output start Proof
% See solution above
% 0.20/0.58  % Total time : 0.008000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.010000 s
%------------------------------------------------------------------------------