%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN957+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n031.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 : Fri Sep  1 02:00:21 EDT 2023

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

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

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

fof(prove_this,conjecture,
    ~ ? [X1] :
      ! [X2] :
        ( a(X2,X1)
      <=> ~ a(X2,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(c_0_1,negated_conjecture,
    ~ ~ ? [X1] :
        ! [X2] :
          ( a(X2,X1)
        <=> ~ a(X2,X2) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_this])]) ).

fof(c_0_2,negated_conjecture,
    ! [X4] :
      ( ( ~ a(X4,esk1_0)
        | ~ a(X4,X4) )
      & ( a(X4,X4)
        | a(X4,esk1_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).

cnf(c_0_3,negated_conjecture,
    ( a(X1,X1)
    | a(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ a(X1,esk1_0)
    | ~ a(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    a(esk1_0,esk1_0),
    inference(ef,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN957+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n031.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   : Sat Aug 26 19:18:08 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 0.21/0.58  % Version  : CSE_E---1.5
% 0.21/0.58  % Problem  : theBenchmark.p
% 0.21/0.58  % Proof found
% 0.21/0.58  % SZS status Theorem for theBenchmark.p
% 0.21/0.58  % SZS output start Proof
% See solution above
% 0.21/0.58  % Total time : 0.004000 s
% 0.21/0.58  % SZS output end Proof
% 0.21/0.58  % Total time : 0.007000 s
%------------------------------------------------------------------------------