↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : HWV017-2 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:47:22 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.46s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   22
% Syntax   : Number of clauses     :   85 (  38 unt;  29 nHn;  65 RR)
%            Number of literals    :  177 (  41 equ;  61 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-2 aty)
%            Number of variables   :   84 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_71,axiom,
    ( ~ p_LES_EQU_(X1,X2)
    | p_LES_EQU_(X1,X3)
    | p_LES_EQU_(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_71) ).

cnf(axiom_60,axiom,
    ~ p_LES_EQU_(f_ADD_(X1,n1),n0),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_60) ).

cnf(axiom_75,axiom,
    p_LES_EQU_(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_75) ).

cnf(axiom_72,axiom,
    ( ~ p_LES_EQU_(X2,f_ADD_(X1,n1))
    | p_LES_EQU_(X2,X1)
    | f_ADD_(X1,n1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_72) ).

cnf(axiom_59,axiom,
    f_ADD_(X1,n1) != n0,
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_59) ).

cnf(axiom_68,axiom,
    ( ~ p_LES_EQU_(X2,X1)
    | p_LES_EQU_(f_ADD_(X2,n1),X1)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_68) ).

cnf(axiom_67,axiom,
    ( ~ p_LES_EQU_(X1,X2)
    | p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_67) ).

cnf(axiom_7,axiom,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_7) ).

cnf(axiom_77,axiom,
    f_ADD_(n0,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_77) ).

cnf(axiom_43,axiom,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_43) ).

cnf(axiom_5,axiom,
    fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_5) ).

cnf(axiom_66,axiom,
    ( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
    | p_LES_EQU_(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_66) ).

cnf(quest_5,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(f_ADD_(t_206,n1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).

cnf(quest_3,negated_conjecture,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).

cnf(quest_2,negated_conjecture,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).

cnf(axiom_47,axiom,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_47) ).

cnf(axiom_70,axiom,
    ( ~ p_LES_EQU_(X2,X1)
    | ~ p_LES_EQU_(X1,X2)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_70) ).

cnf(axiom_61,axiom,
    ( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
    | p_LES_EQU_(X1,n0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_61) ).

cnf(quest_4,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).

cnf(quest_6,negated_conjecture,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_6) ).

cnf(axiom_51,axiom,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_51) ).

cnf(quest_1,negated_conjecture,
    p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).

cnf(c_0_22,plain,
    ( ~ p_LES_EQU_(X1,X2)
    | p_LES_EQU_(X1,X3)
    | p_LES_EQU_(X3,X2) ),
    inference(fof_simplification,[status(thm)],[axiom_71]) ).

cnf(c_0_23,plain,
    ~ p_LES_EQU_(f_ADD_(X1,n1),n0),
    inference(fof_simplification,[status(thm)],[axiom_60]) ).

cnf(c_0_24,plain,
    ( ~ p_LES_EQU_(X1,X2)
    | p_LES_EQU_(X1,X3)
    | p_LES_EQU_(X3,X2) ),
    c_0_22 ).

cnf(c_0_25,axiom,
    p_LES_EQU_(X1,X1),
    axiom_75 ).

cnf(c_0_26,plain,
    ( ~ p_LES_EQU_(X2,f_ADD_(X1,n1))
    | p_LES_EQU_(X2,X1)
    | f_ADD_(X1,n1) = X2 ),
    inference(fof_simplification,[status(thm)],[axiom_72]) ).

cnf(c_0_27,plain,
    ~ p_LES_EQU_(f_ADD_(X1,n1),n0),
    c_0_23 ).

cnf(c_0_28,plain,
    ( p_LES_EQU_(X2,X1)
    | p_LES_EQU_(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    f_ADD_(X1,n1) != n0,
    inference(fof_simplification,[status(thm)],[axiom_59]) ).

cnf(c_0_30,plain,
    ( ~ p_LES_EQU_(X2,X1)
    | p_LES_EQU_(f_ADD_(X2,n1),X1)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[axiom_68]) ).

cnf(c_0_31,plain,
    ( ~ p_LES_EQU_(X2,f_ADD_(X1,n1))
    | p_LES_EQU_(X2,X1)
    | f_ADD_(X1,n1) = X2 ),
    c_0_26 ).

cnf(c_0_32,plain,
    p_LES_EQU_(n0,f_ADD_(X1,n1)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,plain,
    f_ADD_(X1,n1) != n0,
    c_0_29 ).

cnf(c_0_34,plain,
    ( ~ p_LES_EQU_(X1,X2)
    | p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
    inference(fof_simplification,[status(thm)],[axiom_67]) ).

cnf(c_0_35,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
    inference(fof_simplification,[status(thm)],[axiom_7]) ).

cnf(c_0_36,plain,
    ( ~ p_LES_EQU_(X2,X1)
    | p_LES_EQU_(f_ADD_(X2,n1),X1)
    | X1 = X2 ),
    c_0_30 ).

cnf(c_0_37,plain,
    p_LES_EQU_(n0,X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_38,axiom,
    f_ADD_(n0,X1) = X1,
    axiom_77 ).

cnf(c_0_39,plain,
    ( ~ p_LES_EQU_(X1,X2)
    | p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
    c_0_34 ).

cnf(c_0_40,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
    inference(fof_simplification,[status(thm)],[axiom_43]) ).

cnf(c_0_41,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
    c_0_35 ).

cnf(c_0_42,axiom,
    fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
    axiom_5 ).

cnf(c_0_43,plain,
    ( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
    | p_LES_EQU_(X1,X2) ),
    inference(fof_simplification,[status(thm)],[axiom_66]) ).

cnf(c_0_44,plain,
    ( p_LES_EQU_(n1,X1)
    | X1 = n0 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_45,plain,
    ( ~ p_LES_EQU_(n0,X1)
    | p_LES_EQU_(n1,f_ADD_(X1,n1)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_38]) ).

cnf(c_0_46,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
    c_0_40 ).

cnf(c_0_47,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(X1))
    | fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
    inference(rw,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_48,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(f_ADD_(t_206,n1))),
    quest_5 ).

cnf(c_0_49,negated_conjecture,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
    inference(fof_simplification,[status(thm)],[quest_3]) ).

cnf(c_0_50,negated_conjecture,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
    inference(fof_simplification,[status(thm)],[quest_2]) ).

cnf(c_0_51,plain,
    ( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
    | p_LES_EQU_(X1,X2) ),
    c_0_43 ).

cnf(c_0_52,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_47]) ).

cnf(c_0_53,plain,
    ( ~ p_LES_EQU_(X2,X1)
    | ~ p_LES_EQU_(X1,X2)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[axiom_70]) ).

cnf(c_0_54,plain,
    ( p_LES_EQU_(n1,X1)
    | f_ADD_(X1,n1) = n1 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_44]),c_0_33]) ).

cnf(c_0_55,plain,
    p_LES_EQU_(n1,f_ADD_(X1,n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_37])]) ).

cnf(c_0_56,plain,
    ( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
    | p_LES_EQU_(X1,n0) ),
    inference(fof_simplification,[status(thm)],[axiom_61]) ).

cnf(c_0_57,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(X1),n0)
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTlevel_(X1),n1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_42]),c_0_42]),c_0_42]) ).

cnf(c_0_58,negated_conjecture,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
    quest_4 ).

cnf(c_0_59,negated_conjecture,
    fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_60,negated_conjecture,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
    c_0_49 ).

cnf(c_0_61,negated_conjecture,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
    c_0_50 ).

cnf(c_0_62,negated_conjecture,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
    inference(fof_simplification,[status(thm)],[quest_6]) ).

cnf(c_0_63,plain,
    ( ~ p_LES_EQU_(f_ADD_(X1,n1),n1)
    | p_LES_EQU_(X1,n0) ),
    inference(spm,[status(thm)],[c_0_51,c_0_38]) ).

cnf(c_0_64,plain,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
    c_0_52 ).

cnf(c_0_65,axiom,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
    axiom_51 ).

cnf(c_0_66,plain,
    ( ~ p_LES_EQU_(X2,X1)
    | ~ p_LES_EQU_(X1,X2)
    | X1 = X2 ),
    c_0_53 ).

cnf(c_0_67,plain,
    ( p_LES_EQU_(X1,X2)
    | p_LES_EQU_(n1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_54]),c_0_55])]) ).

cnf(c_0_68,plain,
    ( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
    | p_LES_EQU_(X1,n0) ),
    c_0_56 ).

cnf(c_0_69,negated_conjecture,
    ( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n0)
    | f_SUB_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),c_0_61]) ).

cnf(c_0_70,negated_conjecture,
    p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
    quest_1 ).

cnf(c_0_71,negated_conjecture,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
    c_0_62 ).

cnf(c_0_72,plain,
    ( p_LES_EQU_(X1,n0)
    | p_LES_EQU_(n1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_54]),c_0_25])]) ).

cnf(c_0_73,plain,
    ( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(X1),n0)
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTlevel_(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_42]),c_0_42]),c_0_42]) ).

cnf(c_0_74,plain,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTlevel_(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_42]),c_0_42]) ).

cnf(c_0_75,plain,
    ( ~ p_LES_EQU_(X1,X2)
    | p_LES_EQU_(n1,X2)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_76,negated_conjecture,
    p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).

cnf(c_0_77,plain,
    ~ p_LES_EQU_(n1,n0),
    inference(spm,[status(thm)],[c_0_27,c_0_38]) ).

cnf(c_0_78,negated_conjecture,
    p_LES_EQU_(n1,fwork_DOTfifo_DOTrtl_DOTfifo__length_),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_79,plain,
    ( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(X1),n0)
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
    | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
    | fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTlevel_(X1) ),
    inference(csr,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_80,negated_conjecture,
    fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).

cnf(c_0_81,negated_conjecture,
    ( p_LES_EQU_(f_ADD_(n1,n1),fwork_DOTfifo_DOTrtl_DOTfifo__length_)
    | fwork_DOTfifo_DOTrtl_DOTfifo__length_ = n1 ),
    inference(spm,[status(thm)],[c_0_36,c_0_78]) ).

cnf(c_0_82,negated_conjecture,
    fwork_DOTfifo_DOTrtl_DOTfifo__length_ = 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_79,c_0_80]),c_0_59]),c_0_25])]),c_0_60]),c_0_61]) ).

cnf(c_0_83,plain,
    n0 != n1,
    inference(spm,[status(thm)],[c_0_33,c_0_38]) ).

cnf(c_0_84,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_82]),c_0_83]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV017-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n020.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 20:49:18 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.46  % Version: 3.5.1
% 0.09/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46  % Starting sh5l with 300s (1) cores
% 0.09/0.46  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1205442 completed with status 0
% 0.09/0.46  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.09/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46  % No SInE strategy applied
% 0.09/0.46  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.09/0.46  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.09/0.46  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.09/0.46  % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.09/0.46  % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.09/0.46  % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 1205451 completed with status 0
% 0.09/0.46  % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.09/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46  % No SInE strategy applied
% 0.09/0.46  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.09/0.46  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.09/0.46  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.09/0.46  % Preprocessing time       : 0.002 s
% 0.09/0.46  % Presaturation interreduction done
% 0.09/0.46  
% 0.09/0.46  % Proof found!
% 0.09/0.46  % SZS status Unsatisfiable
% 0.09/0.46  % SZS output start CNFRefutation
% See solution above
% 0.09/0.46  % Parsed axioms                        : 139
% 0.09/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.46  % Initial clauses                      : 139
% 0.09/0.46  % Removed in clause preprocessing      : 1
% 0.09/0.46  % Initial clauses in saturation        : 138
% 0.09/0.46  % Processed clauses                    : 510
% 0.09/0.46  % ...of these trivial                  : 5
% 0.09/0.46  % ...subsumed                          : 110
% 0.09/0.46  % ...remaining for further processing  : 395
% 0.09/0.46  % Other redundant clauses eliminated   : 9
% 0.09/0.46  % Clauses deleted for lack of memory   : 0
% 0.09/0.46  % Backward-subsumed                    : 23
% 0.09/0.46  % Backward-rewritten                   : 66
% 0.09/0.46  % Generated clauses                    : 854
% 0.09/0.46  % ...of the previous two non-redundant : 687
% 0.09/0.46  % ...aggressively subsumed             : 0
% 0.09/0.46  % Contextual simplify-reflections      : 29
% 0.09/0.46  % Paramodulations                      : 830
% 0.09/0.46  % Factorizations                       : 14
% 0.09/0.46  % NegExts                              : 0
% 0.09/0.46  % Equation resolutions                 : 10
% 0.09/0.46  % Disequality decompositions           : 0
% 0.09/0.46  % Total rewrite steps                  : 291
% 0.09/0.46  % ...of those cached                   : 238
% 0.09/0.46  % Propositional unsat checks           : 0
% 0.09/0.46  %    Propositional check models        : 0
% 0.09/0.46  %    Propositional check unsatisfiable : 0
% 0.09/0.46  %    Propositional clauses             : 0
% 0.09/0.46  %    Propositional clauses after purity: 0
% 0.09/0.46  %    Propositional unsat core size     : 0
% 0.09/0.46  %    Propositional preprocessing time  : 0.000
% 0.09/0.46  %    Propositional encoding time       : 0.000
% 0.09/0.46  %    Propositional solver time         : 0.000
% 0.09/0.46  %    Success case prop preproc time    : 0.000
% 0.09/0.46  %    Success case prop encoding time   : 0.000
% 0.09/0.46  %    Success case prop solver time     : 0.000
% 0.09/0.46  % Current number of processed clauses  : 174
% 0.09/0.46  %    Positive orientable unit clauses  : 31
% 0.09/0.46  %    Positive unorientable unit clauses: 0
% 0.09/0.46  %    Negative unit clauses             : 9
% 0.09/0.46  %    Non-unit-clauses                  : 134
% 0.09/0.46  % Current number of unprocessed clauses: 421
% 0.09/0.46  % ...number of literals in the above   : 1325
% 0.09/0.46  % Current number of archived formulas  : 0
% 0.09/0.46  % Current number of archived clauses   : 217
% 0.09/0.46  % Clause-clause subsumption calls (NU) : 12776
% 0.09/0.46  % Rec. Clause-clause subsumption calls : 4054
% 0.09/0.46  % Non-unit clause-clause subsumptions  : 129
% 0.09/0.46  % Unit Clause-clause subsumption calls : 191
% 0.09/0.46  % Rewrite failures with RHS unbound    : 0
% 0.09/0.46  % BW rewrite match attempts            : 26
% 0.09/0.46  % BW rewrite match successes           : 11
% 0.09/0.46  % Condensation attempts                : 0
% 0.09/0.46  % Condensation successes               : 0
% 0.09/0.46  % Termbank termtop insertions          : 18307
% 0.09/0.46  % Search garbage collected termcells   : 244
% 0.09/0.46  
% 0.09/0.46  % -------------------------------------------------
% 0.09/0.46  % User time                : 0.029 s
% 0.09/0.46  % System time              : 0.005 s
% 0.09/0.46  % Total time               : 0.034 s
% 0.09/0.46  % Maximum resident set size: 3744 pages
% 0.09/0.46  
% 0.09/0.46  % -------------------------------------------------
% 0.09/0.46  % User time                : 0.129 s
% 0.09/0.46  % System time              : 0.018 s
% 0.09/0.46  % Total time               : 0.147 s
% 0.09/0.46  % Maximum resident set size: 4864 pages
% 0.09/0.46  % E exiting
%------------------------------------------------------------------------------