%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN387+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 : n032.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:32 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    p: $o ).

fof(pel6,conjecture,
    ( p
    | ~ p ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel6) ).

fof(c_0_1,negated_conjecture,
    ~ ( p
      | ~ p ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel6])]) ).

fof(c_0_2,negated_conjecture,
    ( ~ p
    & p ),
    inference(fof_nnf,[status(thm)],[c_0_1]) ).

cnf(c_0_3,negated_conjecture,
    ~ p,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    p,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SYN387+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.10  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.08/0.29  % Computer : n032.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit   : 300
% 0.08/0.29  % WCLimit    : 300
% 0.08/0.29  % DateTime   : Sat Aug 26 20:24:44 EDT 2023
% 0.08/0.30  % CPUTime  : 
% 0.14/0.48  start to proof: theBenchmark
% 0.14/0.50  % Version  : CSE_E---1.5
% 0.14/0.50  % Problem  : theBenchmark.p
% 0.14/0.50  % Proof found
% 0.14/0.50  % SZS status Theorem for theBenchmark.p
% 0.14/0.50  % SZS output start Proof
% See solution above
% 0.14/0.50  % Total time : 0.003000 s
% 0.14/0.50  % SZS output end Proof
% 0.14/0.50  % Total time : 0.005000 s
%------------------------------------------------------------------------------