↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MGT079+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n027.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 : Tue May  5 04:48:26 PM UTC 2026

% Result   : Theorem 22.73s 23.41s
% Output   : CNFRefutation 22.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   89 (  19 unt;   0 def)
%            Number of atoms       :  257 (   4 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  299 ( 131   ~; 127   |;  31   &)
%                                         (   6 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-4 aty)
%            Number of variables   :  252 (  17 sgn  80   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(leq_trans,axiom,
    ! [X1,X2,X3] :
      ( ( leq(X1,X2)
        & leq(X2,X3) )
     => leq(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).

fof(leq_def,axiom,
    ! [X1,X2] :
      ( leq(X1,X2)
    <=> ( less(X1,X2)
        | X1 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).

fof(in_closed,axiom,
    ! [X1,X4,X5] :
      ( in_closed(X1,X4,X5)
    <=> ( leq(X4,X1)
        & leq(X1,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_closed) ).

fof(axis_compatible_def,axiom,
    ! [X6,X7,X8,X9] :
      ( axis_compatible(X6,X7,X8,X9)
    <=> ? [X1] :
          ( in_closed(X1,X6,X7)
          & in_closed(X1,X8,X9) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).

fof(axis_conflict_def,axiom,
    ! [X6,X7,X8,X9] :
      ( axis_conflict(X6,X7,X8,X9)
    <=> ~ ? [X1] :
            ( in_closed(X1,X6,X7)
            & in_closed(X1,X8,X9) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',axis_conflict_def) ).

fof(irreflexive,axiom,
    ! [X1] : ~ less(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).

fof(less_leq_trans,axiom,
    ! [X1,X2,X3] :
      ( ( less(X1,X2)
        & leq(X2,X3) )
     => less(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).

fof(odrl350,conjecture,
    ? [X1,X2,X3] :
      ( in_lopen(X1,v0,v600)
      & in_lopen(X2,v0,v400)
      & in_lopen(X3,v0,v32)
      & ~ ( in_lopen(X1,v0,v1200)
          & in_lopen(X2,v0,v800)
          & in_lopen(X3,v0,v16) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl350) ).

fof(leq_less_trans,axiom,
    ! [X1,X2,X3] :
      ( ( leq(X1,X2)
        & less(X2,X3) )
     => less(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).

fof(axis_subsumes_def,axiom,
    ! [X6,X7,X8,X9] :
      ( axis_subsumes(X6,X7,X8,X9)
    <=> ! [X1] :
          ( in_closed(X1,X6,X7)
         => in_closed(X1,X8,X9) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',axis_subsumes_def) ).

fof(in_lopen,axiom,
    ! [X1,X4,X5] :
      ( in_lopen(X1,X4,X5)
    <=> ( less(X4,X1)
        & leq(X1,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).

fof(ord_v32_v400,axiom,
    less(v32,v400),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v32_v400) ).

fof(ord_v16_v32,axiom,
    less(v16,v32),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v16_v32) ).

fof(ord_v0_v400,axiom,
    less(v0,v400),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).

fof(ord_v0_v16,axiom,
    less(v0,v16),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v16) ).

fof(ord_v400_v600,axiom,
    less(v400,v600),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v600) ).

fof(ord_v0_v32,axiom,
    less(v0,v32),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v32) ).

fof(c_0_17,plain,
    ! [X91,X92,X93] :
      ( ~ leq(X91,X92)
      | ~ leq(X92,X93)
      | leq(X91,X93) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])]) ).

fof(c_0_18,plain,
    ! [X79,X80] :
      ( ( ~ leq(X79,X80)
        | less(X79,X80)
        | X79 = X80 )
      & ( ~ less(X79,X80)
        | leq(X79,X80) )
      & ( X79 != X80
        | leq(X79,X80) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).

fof(c_0_19,plain,
    ! [X94,X95,X96] :
      ( ( leq(X95,X94)
        | ~ in_closed(X94,X95,X96) )
      & ( leq(X94,X96)
        | ~ in_closed(X94,X95,X96) )
      & ( ~ leq(X95,X94)
        | ~ leq(X94,X96)
        | in_closed(X94,X95,X96) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])]) ).

fof(c_0_20,plain,
    ! [X116,X117,X118,X119,X121,X122,X123,X124,X125] :
      ( ( in_closed(esk2_4(X116,X117,X118,X119),X116,X117)
        | ~ axis_compatible(X116,X117,X118,X119) )
      & ( in_closed(esk2_4(X116,X117,X118,X119),X118,X119)
        | ~ axis_compatible(X116,X117,X118,X119) )
      & ( ~ in_closed(X125,X121,X122)
        | ~ in_closed(X125,X123,X124)
        | axis_compatible(X121,X122,X123,X124) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axis_compatible_def])])])])])]) ).

fof(c_0_21,plain,
    ! [X106,X107,X108,X109,X110,X111,X112,X113,X114] :
      ( ( ~ axis_conflict(X106,X107,X108,X109)
        | ~ in_closed(X110,X106,X107)
        | ~ in_closed(X110,X108,X109) )
      & ( in_closed(esk1_4(X111,X112,X113,X114),X111,X112)
        | axis_conflict(X111,X112,X113,X114) )
      & ( in_closed(esk1_4(X111,X112,X113,X114),X113,X114)
        | axis_conflict(X111,X112,X113,X114) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axis_conflict_def])])])])])]) ).

cnf(c_0_22,plain,
    ( leq(X1,X3)
    | ~ leq(X1,X2)
    | ~ leq(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,plain,
    ( leq(X1,X2)
    | ~ less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_24,plain,
    ! [X1] : ~ less(X1,X1),
    inference(fof_simplification,[status(thm)],[irreflexive]) ).

fof(c_0_25,plain,
    ! [X88,X89,X90] :
      ( ~ less(X88,X89)
      | ~ leq(X89,X90)
      | less(X88,X90) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_leq_trans])]) ).

cnf(c_0_26,plain,
    ( leq(X1,X2)
    | ~ in_closed(X2,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_27,plain,
    ( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
    | ~ axis_compatible(X1,X2,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    ( in_closed(esk1_4(X1,X2,X3,X4),X3,X4)
    | axis_conflict(X1,X2,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

fof(c_0_29,negated_conjecture,
    ~ ? [X1,X2,X3] :
        ( in_lopen(X1,v0,v600)
        & in_lopen(X2,v0,v400)
        & in_lopen(X3,v0,v32)
        & ~ ( in_lopen(X1,v0,v1200)
            & in_lopen(X2,v0,v800)
            & in_lopen(X3,v0,v16) ) ),
    inference(assume_negation,[status(cth)],[odrl350]) ).

cnf(c_0_30,plain,
    ( leq(X1,X2)
    | ~ leq(X1,X3)
    | ~ less(X3,X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

fof(c_0_31,plain,
    ! [X73] : ~ less(X73,X73),
    inference(variable_rename,[status(thm)],[c_0_24]) ).

cnf(c_0_32,plain,
    ( less(X1,X3)
    | ~ less(X1,X2)
    | ~ leq(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_33,plain,
    ( leq(X1,esk2_4(X2,X3,X1,X4))
    | ~ axis_compatible(X2,X3,X1,X4) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

fof(c_0_34,plain,
    ! [X85,X86,X87] :
      ( ~ leq(X85,X86)
      | ~ less(X86,X87)
      | less(X85,X87) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_less_trans])]) ).

cnf(c_0_35,plain,
    ( leq(X1,X2)
    | ~ in_closed(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

fof(c_0_36,plain,
    ! [X126,X127,X128,X129,X130,X131,X132,X133,X134] :
      ( ( ~ axis_subsumes(X126,X127,X128,X129)
        | ~ in_closed(X130,X126,X127)
        | in_closed(X130,X128,X129) )
      & ( in_closed(esk3_4(X131,X132,X133,X134),X131,X132)
        | axis_subsumes(X131,X132,X133,X134) )
      & ( ~ in_closed(esk3_4(X131,X132,X133,X134),X133,X134)
        | axis_subsumes(X131,X132,X133,X134) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axis_subsumes_def])])])])])]) ).

cnf(c_0_37,plain,
    ( axis_conflict(X1,X2,X3,X4)
    | leq(X3,esk1_4(X1,X2,X3,X4)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_28]) ).

fof(c_0_38,negated_conjecture,
    ! [X145,X146,X147] :
      ( ( in_lopen(X145,v0,v1200)
        | ~ in_lopen(X145,v0,v600)
        | ~ in_lopen(X146,v0,v400)
        | ~ in_lopen(X147,v0,v32) )
      & ( in_lopen(X146,v0,v800)
        | ~ in_lopen(X145,v0,v600)
        | ~ in_lopen(X146,v0,v400)
        | ~ in_lopen(X147,v0,v32) )
      & ( in_lopen(X147,v0,v16)
        | ~ in_lopen(X145,v0,v600)
        | ~ in_lopen(X146,v0,v400)
        | ~ in_lopen(X147,v0,v32) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).

fof(c_0_39,plain,
    ! [X97,X98,X99] :
      ( ( less(X98,X97)
        | ~ in_lopen(X97,X98,X99) )
      & ( leq(X97,X99)
        | ~ in_lopen(X97,X98,X99) )
      & ( ~ less(X98,X97)
        | ~ leq(X97,X99)
        | in_lopen(X97,X98,X99) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])]) ).

cnf(c_0_40,plain,
    ( leq(X1,X2)
    | ~ less(X3,X2)
    | ~ less(X1,X3) ),
    inference(spm,[status(thm)],[c_0_30,c_0_23]) ).

cnf(c_0_41,plain,
    less(v32,v400),
    inference(split_conjunct,[status(thm)],[ord_v32_v400]) ).

cnf(c_0_42,plain,
    ~ less(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_43,plain,
    ( less(X1,esk2_4(X2,X3,X4,X5))
    | ~ axis_compatible(X2,X3,X4,X5)
    | ~ less(X1,X4) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_44,plain,
    ( less(X1,X3)
    | ~ leq(X1,X2)
    | ~ less(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_45,plain,
    ( leq(esk2_4(X1,X2,X3,X4),X4)
    | ~ axis_compatible(X1,X2,X3,X4) ),
    inference(spm,[status(thm)],[c_0_35,c_0_27]) ).

cnf(c_0_46,plain,
    ( axis_compatible(X2,X3,X4,X5)
    | ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_47,plain,
    ( in_closed(esk3_4(X1,X2,X3,X4),X1,X2)
    | axis_subsumes(X1,X2,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_48,plain,
    ( axis_conflict(X1,X2,X3,X4)
    | less(X5,esk1_4(X1,X2,X3,X4))
    | ~ less(X5,X3) ),
    inference(spm,[status(thm)],[c_0_32,c_0_37]) ).

cnf(c_0_49,plain,
    ( axis_conflict(X1,X2,X3,X4)
    | leq(esk1_4(X1,X2,X3,X4),X4) ),
    inference(spm,[status(thm)],[c_0_35,c_0_28]) ).

cnf(c_0_50,negated_conjecture,
    ( in_lopen(X1,v0,v16)
    | ~ in_lopen(X2,v0,v600)
    | ~ in_lopen(X3,v0,v400)
    | ~ in_lopen(X1,v0,v32) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_51,plain,
    ( in_lopen(X2,X1,X3)
    | ~ less(X1,X2)
    | ~ leq(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_52,plain,
    ( leq(X1,v400)
    | ~ less(X1,v32) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_53,plain,
    ( ~ axis_compatible(X1,X2,X3,X4)
    | ~ less(esk2_4(X1,X2,X3,X4),X3) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_54,plain,
    ( less(esk2_4(X1,X2,X3,X4),X5)
    | ~ axis_compatible(X1,X2,X3,X4)
    | ~ less(X4,X5) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_55,plain,
    ( axis_subsumes(X1,X2,X3,X4)
    | axis_compatible(X5,X6,X1,X2)
    | ~ in_closed(esk3_4(X1,X2,X3,X4),X5,X6) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_56,plain,
    ( axis_conflict(X1,X2,X3,X4)
    | ~ less(esk1_4(X1,X2,X3,X4),X3) ),
    inference(spm,[status(thm)],[c_0_42,c_0_48]) ).

cnf(c_0_57,plain,
    ( axis_conflict(X1,X2,X3,X4)
    | less(esk1_4(X1,X2,X3,X4),X5)
    | ~ less(X4,X5) ),
    inference(spm,[status(thm)],[c_0_44,c_0_49]) ).

cnf(c_0_58,negated_conjecture,
    ( in_lopen(X1,v0,v16)
    | ~ in_lopen(X2,v0,v600)
    | ~ in_lopen(X1,v0,v32)
    | ~ leq(X3,v400)
    | ~ less(v0,X3) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_59,plain,
    ( leq(X1,v400)
    | ~ leq(X1,X2)
    | ~ less(X2,v32) ),
    inference(spm,[status(thm)],[c_0_22,c_0_52]) ).

cnf(c_0_60,plain,
    less(v16,v32),
    inference(split_conjunct,[status(thm)],[ord_v16_v32]) ).

cnf(c_0_61,plain,
    ( leq(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_62,plain,
    ( ~ axis_compatible(X1,X2,X3,X4)
    | ~ less(X4,X3) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_63,plain,
    ( axis_subsumes(X1,X2,X3,X4)
    | axis_compatible(X1,X2,X1,X2) ),
    inference(spm,[status(thm)],[c_0_55,c_0_47]) ).

cnf(c_0_64,plain,
    ( ~ axis_conflict(X1,X2,X3,X4)
    | ~ in_closed(X5,X1,X2)
    | ~ in_closed(X5,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_65,plain,
    ( axis_conflict(X1,X2,X3,X4)
    | ~ less(X4,X3) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_66,negated_conjecture,
    ( in_lopen(X1,v0,v16)
    | ~ in_lopen(X1,v0,v32)
    | ~ leq(X2,v400)
    | ~ leq(X3,v600)
    | ~ less(v0,X2)
    | ~ less(v0,X3) ),
    inference(spm,[status(thm)],[c_0_58,c_0_51]) ).

cnf(c_0_67,plain,
    ( leq(X1,v400)
    | ~ leq(X1,v16) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_68,plain,
    leq(X1,X1),
    inference(er,[status(thm)],[c_0_61]) ).

cnf(c_0_69,plain,
    ( in_closed(X5,X3,X4)
    | ~ axis_subsumes(X1,X2,X3,X4)
    | ~ in_closed(X5,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_70,plain,
    ( axis_subsumes(X1,X2,X3,X4)
    | ~ less(X2,X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_71,plain,
    ( ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5)
    | ~ less(X3,X2) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_72,negated_conjecture,
    ( in_lopen(X1,v0,v16)
    | ~ leq(X2,v400)
    | ~ leq(X3,v600)
    | ~ leq(X1,v32)
    | ~ less(v0,X2)
    | ~ less(v0,X3)
    | ~ less(v0,X1) ),
    inference(spm,[status(thm)],[c_0_66,c_0_51]) ).

cnf(c_0_73,plain,
    less(v0,v400),
    inference(split_conjunct,[status(thm)],[ord_v0_v400]) ).

cnf(c_0_74,plain,
    leq(v16,v400),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_75,plain,
    ( ~ in_closed(X1,X2,X3)
    | ~ less(X3,X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).

cnf(c_0_76,plain,
    ( in_closed(X2,X1,X3)
    | ~ leq(X1,X2)
    | ~ leq(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_77,negated_conjecture,
    ( in_lopen(X1,v0,v16)
    | ~ leq(X2,v600)
    | ~ leq(X1,v32)
    | ~ less(v0,X2)
    | ~ less(v0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_68]),c_0_73])]) ).

cnf(c_0_78,plain,
    ( leq(v16,X1)
    | ~ less(v400,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_74]) ).

cnf(c_0_79,plain,
    less(v0,v16),
    inference(split_conjunct,[status(thm)],[ord_v0_v16]) ).

cnf(c_0_80,plain,
    less(v400,v600),
    inference(split_conjunct,[status(thm)],[ord_v400_v600]) ).

cnf(c_0_81,plain,
    ( ~ leq(X1,X2)
    | ~ leq(X3,X1)
    | ~ less(X2,X3) ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_82,plain,
    ( leq(X1,X2)
    | ~ in_lopen(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_83,negated_conjecture,
    ( in_lopen(X1,v0,v16)
    | ~ leq(X1,v32)
    | ~ less(v0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80])]) ).

cnf(c_0_84,plain,
    ( ~ leq(X1,X2)
    | ~ less(X2,X1) ),
    inference(spm,[status(thm)],[c_0_81,c_0_68]) ).

cnf(c_0_85,negated_conjecture,
    ( leq(X1,v16)
    | ~ leq(X1,v32)
    | ~ less(v0,X1) ),
    inference(spm,[status(thm)],[c_0_82,c_0_83]) ).

cnf(c_0_86,negated_conjecture,
    ( ~ leq(X1,v32)
    | ~ less(v16,X1)
    | ~ less(v0,X1) ),
    inference(spm,[status(thm)],[c_0_84,c_0_85]) ).

cnf(c_0_87,plain,
    less(v0,v32),
    inference(split_conjunct,[status(thm)],[ord_v0_v32]) ).

cnf(c_0_88,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_68]),c_0_60]),c_0_87])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT079+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n027.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Mon May  4 23:32:20 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 22.73/23.41  % Version  : CSE_E---1.7
% 22.73/23.41  % Problem  : theBenchmark.p
% 22.73/23.41  % SZS status Theorem for theBenchmark.p
% 22.73/23.41  % SZS output start CNFRefutation
% See solution above
% 22.83/23.59  % Total time : 17.303s
%------------------------------------------------------------------------------