↑ Up

CSE_E---1.7.THM-CRf.s

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

% Computer : n031.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:27 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(odrl500,conjecture,
    ? [X1] : in_lopen(X1,v0,v600),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl500) ).

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

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

fof(ord_v0_v600,axiom,
    less(v0,v600),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X1] : in_lopen(X1,v0,v600),
    inference(assume_negation,[status(cth)],[odrl500]) ).

fof(c_0_5,negated_conjecture,
    ! [X143] : ~ in_lopen(X143,v0,v600),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

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

fof(c_0_7,plain,
    ! [X77,X78] :
      ( ( ~ leq(X77,X78)
        | less(X77,X78)
        | X77 = X78 )
      & ( ~ less(X77,X78)
        | leq(X77,X78) )
      & ( X77 != X78
        | leq(X77,X78) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).

cnf(c_0_8,negated_conjecture,
    ~ in_lopen(X1,v0,v600),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

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

cnf(c_0_11,negated_conjecture,
    ( ~ leq(X1,v600)
    | ~ less(v0,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    leq(X1,X1),
    inference(er,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    less(v0,v600),
    inference(split_conjunct,[status(thm)],[ord_v0_v600]) ).

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

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