↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MGT080+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 : 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 : Tue May  5 04:48:26 PM UTC 2026

% Result   : Theorem 0.27s 1.61s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  17 unt;   0 def)
%            Number of atoms       :   66 (   6 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   56 (  18   ~;  11   |;  25   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;  13 con; 0-0 aty)
%            Number of variables   :   30 (   2 sgn  13   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(odrl365,conjecture,
    ~ ? [X1,X2,X3,X13] :
        ( in_closed(X1,v600,v600)
        & in_closed(X1,v800,v800)
        & less(v100,X2)
        & in_open(X2,v0,v500)
        & leq(v8,X3)
        & in_lopen(X3,v0,v32)
        & in_lopen(X13,v0,v300)
        & leq(v150,X13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl365) ).

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(leq_antisym,axiom,
    ! [X1,X2] :
      ( ( leq(X1,X2)
        & leq(X2,X1) )
     => X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).

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

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

fof(c_0_5,negated_conjecture,
    ~ ~ ? [X1,X2,X3,X13] :
          ( in_closed(X1,v600,v600)
          & in_closed(X1,v800,v800)
          & less(v100,X2)
          & in_open(X2,v0,v500)
          & leq(v8,X3)
          & in_lopen(X3,v0,v32)
          & in_lopen(X13,v0,v300)
          & leq(v150,X13) ),
    inference(assume_negation,[status(cth)],[odrl365]) ).

fof(c_0_6,plain,
    ! [X96,X97,X98] :
      ( ( leq(X97,X96)
        | ~ in_closed(X96,X97,X98) )
      & ( leq(X96,X98)
        | ~ in_closed(X96,X97,X98) )
      & ( ~ leq(X97,X96)
        | ~ leq(X96,X98)
        | in_closed(X96,X97,X98) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])]) ).

fof(c_0_7,negated_conjecture,
    ( in_closed(esk4_0,v600,v600)
    & in_closed(esk4_0,v800,v800)
    & less(v100,esk5_0)
    & in_open(esk5_0,v0,v500)
    & leq(v8,esk6_0)
    & in_lopen(esk6_0,v0,v32)
    & in_lopen(esk7_0,v0,v300)
    & leq(v150,esk7_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,plain,
    ! [X83,X84] :
      ( ~ leq(X83,X84)
      | ~ leq(X84,X83)
      | X83 = X84 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])]) ).

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

cnf(c_0_10,negated_conjecture,
    in_closed(esk4_0,v800,v800),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_12,negated_conjecture,
    in_closed(esk4_0,v600,v600),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    leq(esk4_0,v800),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    leq(v800,esk4_0),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    leq(v600,esk4_0),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    esk4_0 = v800,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_18,negated_conjecture,
    leq(v600,v800),
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    in_closed(v800,v600,v600),
    inference(rw,[status(thm)],[c_0_12,c_0_17]) ).

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

cnf(c_0_21,negated_conjecture,
    ( v800 = v600
    | ~ leq(v800,v600) ),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    leq(v800,v600),
    inference(spm,[status(thm)],[c_0_9,c_0_19]) ).

fof(c_0_23,plain,
    ! [X75] : ~ less(X75,X75),
    inference(variable_rename,[status(thm)],[c_0_20]) ).

cnf(c_0_24,plain,
    less(v600,v800),
    inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).

cnf(c_0_25,negated_conjecture,
    v800 = v600,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).

cnf(c_0_26,plain,
    ~ less(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_27,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT080+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.15/0.32  % Computer : n018.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 23:32:17 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 0.27/1.61  % Version  : CSE_E---1.7
% 0.27/1.61  % Problem  : theBenchmark.p
% 0.27/1.61  % SZS status Theorem for theBenchmark.p
% 0.27/1.61  % SZS output start CNFRefutation
% See solution above
% 0.27/1.61  % Total time : 1.269s
%------------------------------------------------------------------------------