↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n026.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 01:25:34 PM UTC 2026

% Result   : Theorem 0.12s 0.39s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   9 unt;   0 def)
%            Number of atoms       :   46 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   47 (  19   ~;  17   |;   9   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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   :   32 (  30   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X,Y] :
      ( leq(X,Y)
    <=> ( X = Y
        | less(X,Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,axiom,
    ! [X,A,B] :
      ( in_lopen(X,A,B)
    <=> ( leq(X,B)
        & less(A,X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f35,conjecture,
    ? [X] : in_lopen(X,v0,v600),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f36,negated_conjecture,
    ~ ? [X] : in_lopen(X,v0,v600),
    inference(negated_conjecture,[status(cth)],[f35]) ).

fof(f42,plain,
    ! [X,Y] :
      ( ( ( X != Y
          & ~ less(X,Y) )
        | leq(X,Y) )
      & ( X = Y
        | less(X,Y)
        | ~ leq(X,Y) ) ),
    inference(NNF_transformation,[status(thm)],[f4]) ).

fof(f43,plain,
    ( ! [X,Y] :
        ( ( X != Y
          & ~ less(X,Y) )
        | leq(X,Y) )
    & ! [X,Y] :
        ( X = Y
        | less(X,Y)
        | ~ leq(X,Y) ) ),
    inference(miniscoping,[status(thm)],[f42]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( X0 != X1
      | leq(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f43]) ).

fof(f65,plain,
    ! [X,A,B] :
      ( ( ~ leq(X,B)
        | ~ less(A,X)
        | in_lopen(X,A,B) )
      & ( ( leq(X,B)
          & less(A,X) )
        | ~ in_lopen(X,A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f11]) ).

fof(f66,plain,
    ( ! [X,A,B] :
        ( ~ leq(X,B)
        | ~ less(A,X)
        | in_lopen(X,A,B) )
    & ! [X,A,B] :
        ( ( leq(X,B)
          & less(A,X) )
        | ~ in_lopen(X,A,B) ) ),
    inference(miniscoping,[status(thm)],[f65]) ).

fof(f69,plain,
    ! [X0,X1,X2] :
      ( ~ leq(X0,X2)
      | ~ less(X1,X0)
      | in_lopen(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f66]) ).

fof(f122,plain,
    less(v0,v600),
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f127,plain,
    ! [X] : ~ in_lopen(X,v0,v600),
    inference(pre_NNF_transformation,[status(thm)],[f36]) ).

fof(f128,plain,
    ! [X0] : ~ in_lopen(X0,v0,v600),
    inference(cnf_transformation,[status(thm)],[f127]) ).

fof(f129,plain,
    ! [X0] : leq(X0,X0),
    inference(destructive_equality_resolution,[status(thm)],[f46]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | in_lopen(X0,X1,X0) ),
    inference(resolution,[status(thm)],[f129,f69]) ).

fof(f139,plain,
    in_lopen(v600,v0,v600),
    inference(resolution,[status(thm)],[f138,f122]) ).

fof(f141,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f139,f128]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n026.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 01:28:21 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  % Drodi V4.1.1
% 0.12/0.39  % Refutation found
% 0.12/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.42  % Elapsed time: 0.062277 seconds
% 0.12/0.42  % CPU time: 0.150678 seconds
% 0.12/0.42  % Total memory used: 81.249 MB
% 0.12/0.42  % Net memory used: 81.168 MB
%------------------------------------------------------------------------------