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

% Computer : n023.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 01:50:01 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    f: $i > $i ).

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

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

tff(decl_25,type,
    esk2_1: $i > $i ).

tff(decl_26,type,
    esk3_0: $i ).

fof(pel60,conjecture,
    ! [X1] :
      ( big_f(X1,f(X1))
    <=> ? [X2] :
          ( ! [X3] :
              ( big_f(X3,X2)
             => big_f(X3,f(X1)) )
          & big_f(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel60) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( big_f(X1,f(X1))
      <=> ? [X2] :
            ( ! [X3] :
                ( big_f(X3,X2)
               => big_f(X3,f(X1)) )
            & big_f(X1,X2) ) ),
    inference(assume_negation,[status(cth)],[pel60]) ).

fof(c_0_2,negated_conjecture,
    ! [X5,X8] :
      ( ( big_f(esk2_1(X5),X5)
        | ~ big_f(esk1_0,X5)
        | ~ big_f(esk1_0,f(esk1_0)) )
      & ( ~ big_f(esk2_1(X5),f(esk1_0))
        | ~ big_f(esk1_0,X5)
        | ~ big_f(esk1_0,f(esk1_0)) )
      & ( ~ big_f(X8,esk3_0)
        | big_f(X8,f(esk1_0))
        | big_f(esk1_0,f(esk1_0)) )
      & ( big_f(esk1_0,esk3_0)
        | big_f(esk1_0,f(esk1_0)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( ~ big_f(esk2_1(X1),f(esk1_0))
    | ~ big_f(esk1_0,X1)
    | ~ big_f(esk1_0,f(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    ( big_f(X1,f(esk1_0))
    | big_f(esk1_0,f(esk1_0))
    | ~ big_f(X1,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ~ big_f(esk1_0,f(esk1_0)),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( big_f(esk1_0,esk3_0)
    | big_f(esk1_0,f(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( big_f(X1,f(esk1_0))
    | ~ big_f(X1,esk3_0) ),
    inference(sr,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    big_f(esk1_0,esk3_0),
    inference(sr,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN082+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sat Aug 26 19:04:26 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.20/0.55  start to proof: theBenchmark
% 0.54/0.57  % Version  : CSE_E---1.5
% 0.54/0.57  % Problem  : theBenchmark.p
% 0.54/0.57  % Proof found
% 0.54/0.57  % SZS status Theorem for theBenchmark.p
% 0.54/0.57  % SZS output start Proof
% See solution above
% 0.54/0.57  % Total time : 0.004000 s
% 0.54/0.57  % SZS output end Proof
% 0.54/0.57  % Total time : 0.007000 s
%------------------------------------------------------------------------------