↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MGT082+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 : 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 0.30s 1.63s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  15 unt;   0 def)
%            Number of atoms       :   70 (   9 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   63 (  22   ~;  17   |;  21   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;  10 con; 0-0 aty)
%            Number of variables   :   34 (   2 sgn  17   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(odrl411,conjecture,
    ~ ? [X1,X2,X3] :
        ( in_closed(X1,v600,v600)
        & in_closed(X1,v601,v601)
        & less(v300,X2)
        & in_open(X2,v0,v500)
        & leq(v16,X3)
        & in_lopen(X3,v0,v32) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl411) ).

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

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

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(irreflexive,axiom,
    ! [X1] : ~ less(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).

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

fof(c_0_6,negated_conjecture,
    ~ ~ ? [X1,X2,X3] :
          ( in_closed(X1,v600,v600)
          & in_closed(X1,v601,v601)
          & less(v300,X2)
          & in_open(X2,v0,v500)
          & leq(v16,X3)
          & in_lopen(X3,v0,v32) ),
    inference(assume_negation,[status(cth)],[odrl411]) ).

fof(c_0_7,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_8,negated_conjecture,
    ( in_closed(esk4_0,v600,v600)
    & in_closed(esk4_0,v601,v601)
    & less(v300,esk5_0)
    & in_open(esk5_0,v0,v500)
    & leq(v16,esk6_0)
    & in_lopen(esk6_0,v0,v32) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_9,plain,
    ! [X81,X82] :
      ( ~ leq(X81,X82)
      | ~ leq(X82,X81)
      | X81 = X82 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])]) ).

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

cnf(c_0_11,negated_conjecture,
    in_closed(esk4_0,v601,v601),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

cnf(c_0_13,negated_conjecture,
    in_closed(esk4_0,v600,v600),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

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

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

cnf(c_0_17,negated_conjecture,
    leq(esk4_0,v600),
    inference(spm,[status(thm)],[c_0_10,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    esk4_0 = v601,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

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

fof(c_0_20,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_21,plain,
    ! [X1] : ~ less(X1,X1),
    inference(fof_simplification,[status(thm)],[irreflexive]) ).

cnf(c_0_22,negated_conjecture,
    ( v601 = v600
    | ~ leq(v600,v601) ),
    inference(spm,[status(thm)],[c_0_14,c_0_19]) ).

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

cnf(c_0_24,plain,
    less(v600,v601),
    inference(split_conjunct,[status(thm)],[ord_v600_v601]) ).

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

cnf(c_0_26,negated_conjecture,
    v601 = v600,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_27,plain,
    ~ less(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT082+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.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.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 0.30/1.63  % Version  : CSE_E---1.7
% 0.30/1.63  % Problem  : theBenchmark.p
% 0.30/1.63  % SZS status Theorem for theBenchmark.p
% 0.30/1.63  % SZS output start CNFRefutation
% See solution above
% 0.30/1.63  % Total time : 1.271s
%------------------------------------------------------------------------------