↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n009.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 02:46:43 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X,Y,Z] :
      ( ( leq(Y,Z)
        & leq(X,Y) )
     => 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(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
      & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
      & leq(pv1325,n3)
      & leq(s_worst7,n3)
      & leq(s_sworst7,n3)
      & leq(s_best7,n3)
      & leq(n2,pv1325)
      & leq(n0,s_worst7)
      & leq(n0,s_sworst7)
      & leq(n0,s_best7) )
   => leq(n0,pv1325) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
        & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
        & leq(pv1325,n3)
        & leq(s_worst7,n3)
        & leq(s_sworst7,n3)
        & leq(s_best7,n3)
        & leq(n2,pv1325)
        & leq(n0,s_worst7)
        & leq(n0,s_sworst7)
        & leq(n0,s_best7) )
     => 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,Z)
      | ~ leq(Y,Z)
      | ~ leq(X,Y) ),
    inference(pre_NNF_transformation,[status(thm)],[f5]) ).

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

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

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

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

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

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

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

fof(f266,plain,
    gt(n2,n0),
    inference(cnf_transformation,[status(thm)],[f65]) ).

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

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

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

fof(f375,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f368,f266]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV137+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44  % Computer : n009.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 21 08:32:42 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.47  % Drodi V4.1.1
% 0.26/0.54  % Refutation found
% 0.26/0.54  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.26/0.54  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.26/0.58  % Elapsed time: 0.129222 seconds
% 0.26/0.58  % CPU time: 0.153766 seconds
% 0.26/0.58  % Total memory used: 27.536 MB
% 0.26/0.58  % Net memory used: 27.466 MB
%------------------------------------------------------------------------------