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

% Computer : n018.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 02:00:00 EDT 2023

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

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

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

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

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

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

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

tff(decl_28,type,
    y_27: $i > $i ).

tff(decl_29,type,
    level: $i > $i ).

tff(decl_30,type,
    int_level: $i > $i ).

tff(decl_31,type,
    fifo_length: $i ).

tff(decl_32,type,
    p_Full: $i > $o ).

tff(decl_33,type,
    p_Empty: $i > $o ).

tff(decl_34,type,
    p_Reset: $i > $o ).

tff(decl_35,type,
    wr_level: $i > $i ).

tff(decl_36,type,
    rd_level: $i > $i ).

tff(decl_37,type,
    p_Wr_error: $i > $o ).

tff(decl_38,type,
    p_Rd_error: $i > $o ).

tff(decl_39,type,
    p_Mem: ( $i * $i * $i ) > $o ).

tff(decl_40,type,
    p_Data_out: ( $i * $i ) > $o ).

tff(decl_41,type,
    p_Wr: $i > $o ).

tff(decl_42,type,
    p_Rd: $i > $o ).

tff(decl_43,type,
    p_Data_in: ( $i * $i ) > $o ).

tff(decl_44,type,
    t_139: $i ).

cnf(axiom_25,axiom,
    ( int_level(X1) = n0
    | ~ p_Empty(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_25) ).

cnf(axiom_21,axiom,
    level(X1) = int_level(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).

cnf(quest_2,negated_conjecture,
    ( p_Empty(t_139)
    | level(t_139) = n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

cnf(quest_1,negated_conjecture,
    ( ~ p_Empty(t_139)
    | level(t_139) != n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

cnf(axiom_24,axiom,
    ( p_Empty(X1)
    | int_level(X1) != n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_24) ).

cnf(c_0_5,axiom,
    ( int_level(X1) = n0
    | ~ p_Empty(X1) ),
    axiom_25 ).

cnf(c_0_6,axiom,
    level(X1) = int_level(X1),
    axiom_21 ).

cnf(c_0_7,plain,
    ( level(X1) = n0
    | ~ p_Empty(X1) ),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    ( p_Empty(t_139)
    | level(t_139) = n0 ),
    quest_2 ).

cnf(c_0_9,negated_conjecture,
    ( ~ p_Empty(t_139)
    | level(t_139) != n0 ),
    quest_1 ).

cnf(c_0_10,negated_conjecture,
    level(t_139) = n0,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,axiom,
    ( p_Empty(X1)
    | int_level(X1) != n0 ),
    axiom_24 ).

cnf(c_0_12,negated_conjecture,
    ~ p_Empty(t_139),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_13,plain,
    ( p_Empty(X1)
    | level(X1) != n0 ),
    inference(rw,[status(thm)],[c_0_11,c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : HWV010-1 : TPTP v8.1.2. Released v2.5.0.
% 0.08/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.36  % Computer : n018.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Tue Aug 29 16:56:48 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 0.21/0.59  start to proof: theBenchmark
% 0.21/0.62  % Version  : CSE_E---1.5
% 0.21/0.62  % Problem  : theBenchmark.p
% 0.21/0.62  % Proof found
% 0.21/0.62  % SZS status Theorem for theBenchmark.p
% 0.21/0.62  % SZS output start Proof
% See solution above
% 0.21/0.62  % Total time : 0.009000 s
% 0.21/0.62  % SZS output end Proof
% 0.21/0.62  % Total time : 0.014000 s
%------------------------------------------------------------------------------