TSTP Solution File: SWV135+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n025.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 : Wed May 31 12:40:45 EDT 2023

% Result   : Theorem 0.16s 0.44s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   51 (  15   ~;   9   |;  23   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   19 (;  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X,Y,Z] :
      ( ( leq(X,Y)
        & leq(Y,Z) )
     => leq(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [X,Y] :
      ( gt(Y,X)
     => leq(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    ( ( leq(n0,s_best7)
      & leq(n0,s_sworst7)
      & leq(n0,s_worst7)
      & leq(n2,pv1325)
      & leq(s_best7,n3)
      & leq(s_sworst7,n3)
      & leq(s_worst7,n3)
      & leq(pv1325,n3) )
   => leq(n0,pv1325) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,s_best7)
        & leq(n0,s_sworst7)
        & leq(n0,s_worst7)
        & leq(n2,pv1325)
        & leq(s_best7,n3)
        & leq(s_sworst7,n3)
        & leq(s_worst7,n3)
        & leq(pv1325,n3) )
     => leq(n0,pv1325) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f65,axiom,
    gt(n2,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f93,plain,
    ! [X,Y,Z] :
      ( ~ leq(X,Y)
      | ~ leq(Y,Z)
      | leq(X,Z) ),
    inference(pre_NNF_transformation,[status(esa)],[f5]) ).

fof(f94,plain,
    ! [X,Z] :
      ( ! [Y] :
          ( ~ leq(X,Y)
          | ~ leq(Y,Z) )
      | leq(X,Z) ),
    inference(miniscoping,[status(esa)],[f93]) ).

fof(f95,plain,
    ! [X0,X1,X2] :
      ( ~ leq(X0,X1)
      | ~ leq(X1,X2)
      | leq(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f94]) ).

fof(f104,plain,
    ! [X,Y] :
      ( ~ gt(Y,X)
      | leq(X,Y) ),
    inference(pre_NNF_transformation,[status(esa)],[f8]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( ~ gt(X0,X1)
      | leq(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f104]) ).

fof(f244,plain,
    ( leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n2,pv1325)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv1325,n3)
    & ~ leq(n0,pv1325) ),
    inference(pre_NNF_transformation,[status(esa)],[f54]) ).

fof(f248,plain,
    leq(n2,pv1325),
    inference(cnf_transformation,[status(esa)],[f244]) ).

fof(f253,plain,
    ~ leq(n0,pv1325),
    inference(cnf_transformation,[status(esa)],[f244]) ).

fof(f264,plain,
    gt(n2,n0),
    inference(cnf_transformation,[status(esa)],[f65]) ).

fof(f321,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,pv1325) ),
    inference(resolution,[status(thm)],[f95,f253]) ).

fof(f322,plain,
    ~ leq(n0,n2),
    inference(resolution,[status(thm)],[f321,f248]) ).

fof(f353,plain,
    ~ gt(n2,n0),
    inference(resolution,[status(thm)],[f105,f322]) ).

fof(f354,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f353,f264]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n025.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31  % CPULimit : 300
% 0.16/0.31  % WCLimit  : 300
% 0.16/0.31  % DateTime : Tue May 30 11:46:42 EDT 2023
% 0.16/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.5.1
% 0.16/0.44  % Refutation found
% 0.16/0.44  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.44  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.45  % Elapsed time: 0.128497 seconds
% 0.16/0.45  % CPU time: 0.356648 seconds
% 0.16/0.45  % Memory used: 63.261 MB
%------------------------------------------------------------------------------