%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN399+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %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  : 300s
% DateTime : Fri Sep  1 01:51:36 EDT 2023

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

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

tff(decl_23,type,
    p: $o ).

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

fof(kalish223,conjecture,
    ( ! [X1] :
        ( f(X1)
      <=> p )
   => ( ! [X2] : f(X2)
    <=> p ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish223) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
          ( f(X1)
        <=> p )
     => ( ! [X2] : f(X2)
      <=> p ) ),
    inference(assume_negation,[status(cth)],[kalish223]) ).

fof(c_0_2,negated_conjecture,
    ! [X3,X5] :
      ( ( ~ f(X3)
        | p )
      & ( ~ p
        | f(X3) )
      & ( ~ f(esk1_0)
        | ~ p )
      & ( f(X5)
        | p ) ),
    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,
    ( f(X1)
    | p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

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

cnf(c_0_6,negated_conjecture,
    p,
    inference(csr,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( f(X1)
    | ~ p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ~ f(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).

cnf(c_0_9,negated_conjecture,
    f(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN399+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 16:53:11 EDT 2023
% 0.13/0.34  % 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.003000 s
% 0.21/0.58  % SZS output end Proof
% 0.21/0.58  % Total time : 0.006000 s
%------------------------------------------------------------------------------