TSTP Solution File: HWV020-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : HWV020-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 : n010.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:06 EDT 2023

% Result   : Unsatisfiable 0.19s 0.61s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   36
% Syntax   : Number of formulae    :   61 (  15 unt;  23 typ;   0 def)
%            Number of atoms       :   98 (  18 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   92 (  32   ~;  60   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   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   :   24 (   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_24,axiom,
    ( p_Empty(X1)
    | int_level(X1) != n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_24) ).

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

cnf(axiom_76,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Rd(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_76) ).

cnf(axiom_58,axiom,
    ( p_Reset(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Wr(X1)
    | ~ p_Rd(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_58) ).

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

cnf(axiom_78,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | int_level(plus(X1,n1)) = int_level(X1)
    | ~ p_Rd(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_78) ).

cnf(axiom_82,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | int_level(plus(X1,n1)) = int_level(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_82) ).

cnf(quest_5,negated_conjecture,
    ( ~ p_Empty(plus(t_139,n1))
    | ~ p_Rd_error(plus(t_139,n1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).

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

cnf(quest_1,negated_conjecture,
    p_Rd(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

cnf(quest_4,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).

cnf(axiom_17,axiom,
    ~ gt(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_17) ).

cnf(quest_3,negated_conjecture,
    ~ p_Wr(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

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

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

cnf(c_0_15,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Rd(X1) ),
    axiom_76 ).

cnf(c_0_16,axiom,
    ( p_Reset(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Wr(X1)
    | ~ p_Rd(X1) ),
    axiom_58 ).

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

cnf(c_0_18,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | int_level(plus(X1,n1)) = int_level(X1)
    | ~ p_Rd(X1) ),
    axiom_78 ).

cnf(c_0_19,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | int_level(plus(X1,n1)) = int_level(X1) ),
    axiom_82 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p_Empty(plus(t_139,n1))
    | ~ p_Rd_error(plus(t_139,n1)) ),
    quest_5 ).

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

cnf(c_0_22,plain,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd_error(plus(X1,n1))
    | gt(level(X1),n0)
    | ~ p_Rd(X1) ),
    inference(rw,[status(thm)],[c_0_15,c_0_14]) ).

cnf(c_0_23,plain,
    ( p_Reset(X1)
    | p_Rd_error(plus(X1,n1))
    | gt(level(X1),n0)
    | ~ p_Wr(X1)
    | ~ p_Rd(X1) ),
    inference(rw,[status(thm)],[c_0_16,c_0_14]) ).

cnf(c_0_24,plain,
    ( level(X1) = n0
    | ~ p_Empty(X1) ),
    inference(rw,[status(thm)],[c_0_17,c_0_14]) ).

cnf(c_0_25,negated_conjecture,
    p_Empty(t_139),
    quest_2 ).

cnf(c_0_26,plain,
    ( level(plus(X1,n1)) = level(X1)
    | p_Reset(X1)
    | p_Wr(X1)
    | gt(level(X1),n0)
    | ~ p_Rd(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14]),c_0_14]),c_0_14]) ).

cnf(c_0_27,plain,
    ( level(plus(X1,n1)) = level(X1)
    | p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14]),c_0_14]) ).

cnf(c_0_28,negated_conjecture,
    ( level(plus(t_139,n1)) != n0
    | ~ p_Rd_error(plus(t_139,n1)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_29,plain,
    ( p_Rd_error(plus(X1,n1))
    | p_Reset(X1)
    | gt(level(X1),n0)
    | ~ p_Rd(X1) ),
    inference(csr,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_30,negated_conjecture,
    level(t_139) = n0,
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_31,negated_conjecture,
    p_Rd(t_139),
    quest_1 ).

cnf(c_0_32,negated_conjecture,
    ~ p_Reset(t_139),
    quest_4 ).

cnf(c_0_33,axiom,
    ~ gt(X1,X1),
    axiom_17 ).

cnf(c_0_34,plain,
    ( level(plus(X1,n1)) = level(X1)
    | p_Wr(X1)
    | p_Reset(X1)
    | gt(level(X1),n0) ),
    inference(csr,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_35,negated_conjecture,
    level(plus(t_139,n1)) != n0,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ~ p_Wr(t_139),
    quest_3 ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_35]),c_0_36]),c_0_32]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HWV020-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n010.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   : Tue Aug 29 15:24:33 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.19/0.61  % Version  : CSE_E---1.5
% 0.19/0.61  % Problem  : theBenchmark.p
% 0.19/0.61  % Proof found
% 0.19/0.61  % SZS status Theorem for theBenchmark.p
% 0.19/0.61  % SZS output start Proof
% See solution above
% 0.19/0.61  % Total time : 0.027000 s
% 0.19/0.61  % SZS output end Proof
% 0.19/0.61  % Total time : 0.032000 s
%------------------------------------------------------------------------------