↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n012.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:33 PM UTC 2026

% Result   : Theorem 0.07s 0.91s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   8 unt;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   76 (  28   ~;  20   |;  26   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( leq(pv43,minus(n5,n1))
      & leq(pv41,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n0,pv43)
      & leq(n0,pv41)
      & leq(n0,pv10) )
   => ( leq(pv43,minus(n5,n1))
      & leq(pv41,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n0,pv43)
      & leq(n0,pv41)
      & leq(n0,pv10) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv43,minus(n5,n1))
        & leq(pv41,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n0,pv43)
        & leq(n0,pv41)
        & leq(n0,pv10) )
     => ( leq(pv43,minus(n5,n1))
        & leq(pv41,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n0,pv43)
        & leq(n0,pv41)
        & leq(n0,pv10) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f251,plain,
    ( ( ~ leq(pv43,minus(n5,n1))
      | ~ leq(pv41,minus(n5,n1))
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(n0,pv43)
      | ~ leq(n0,pv41)
      | ~ leq(n0,pv10) )
    & leq(pv43,minus(n5,n1))
    & leq(pv41,minus(n5,n1))
    & leq(pv10,minus(n135300,n1))
    & leq(n0,pv43)
    & leq(n0,pv41)
    & leq(n0,pv10) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f252,plain,
    leq(n0,pv10),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f253,plain,
    leq(n0,pv41),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f254,plain,
    leq(n0,pv43),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f255,plain,
    leq(pv10,minus(n135300,n1)),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f256,plain,
    leq(pv41,minus(n5,n1)),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f257,plain,
    leq(pv43,minus(n5,n1)),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f258,plain,
    ( ~ leq(pv43,minus(n5,n1))
    | ~ leq(pv41,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv43)
    | ~ leq(n0,pv41)
    | ~ leq(n0,pv10) ),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f346,plain,
    ( ~ leq(pv43,minus(n5,n1))
    | ~ leq(pv41,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv43)
    | ~ leq(n0,pv41) ),
    inference(forward_subsumption_resolution,[status(thm)],[f258,f252]) ).

fof(f347,plain,
    ( ~ leq(pv43,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv43)
    | ~ leq(n0,pv41) ),
    inference(resolution,[status(thm)],[f346,f256]) ).

fof(f351,plain,
    ( ~ leq(pv43,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv43) ),
    inference(forward_subsumption_resolution,[status(thm)],[f347,f253]) ).

fof(f360,plain,
    ( ~ leq(pv43,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1)) ),
    inference(forward_subsumption_resolution,[status(thm)],[f351,f254]) ).

fof(f361,plain,
    ~ leq(pv10,minus(n135300,n1)),
    inference(resolution,[status(thm)],[f360,f257]) ).

fof(f363,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f361,f255]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWV062+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.02  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.88  % Computer : n012.cluster.edu
% 0.03/0.88  % Model    : x86_64 x86_64
% 0.03/0.88  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.88  % Memory   : 8046.5625MB
% 0.03/0.88  % OS       : Linux 6.8.0-71-generic
% 0.03/0.88  % CPULimit : 300
% 0.03/0.88  % WCLimit  : 300
% 0.03/0.88  % DateTime : Mon Sep 21 08:29:08 UTC 2026
% 0.03/0.88  % CPUTime  : 
% 0.03/0.89  % Drodi V4.1.1
% 0.07/0.91  % Refutation found
% 0.07/0.91  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.91  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.94  % Elapsed time: 0.041876 seconds
% 0.07/0.94  % CPU time: 0.092698 seconds
% 0.07/0.94  % Total memory used: 108.773 MB
% 0.07/0.94  % Net memory used: 108.610 MB
%------------------------------------------------------------------------------