↑ Up

Drodi---4.1.1.THM-CRf.s

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

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

% Result   : Theorem 0.11s 0.40s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   67 (  22   ~;  14   |;  25   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   46 (  36   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [A,B,C] :
      ( ( ! [X,Y] :
            ( r(X,Y)
           => q(X,Y) )
        & ! [X] :
            ( s(X)
           => p(X) )
        & r(B,C)
        & s(B)
        & s(A) )
     => ? [X,Y] :
          ( q(X,Y)
          & p(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ! [A,B,C] :
        ( ( ! [X,Y] :
              ( r(X,Y)
             => q(X,Y) )
          & ! [X] :
              ( s(X)
             => p(X) )
          & r(B,C)
          & s(B)
          & s(A) )
       => ? [X,Y] :
            ( q(X,Y)
            & p(X) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [A,B,C] :
      ( ! [X,Y] :
          ( ~ q(X,Y)
          | ~ p(X) )
      & ! [X,Y] :
          ( q(X,Y)
          | ~ r(X,Y) )
      & ! [X] :
          ( p(X)
          | ~ s(X) )
      & r(B,C)
      & s(B)
      & s(A) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    ( ! [X] :
        ( ! [Y] : ~ q(X,Y)
        | ~ p(X) )
    & ! [X,Y] :
        ( q(X,Y)
        | ~ r(X,Y) )
    & ! [X] :
        ( p(X)
        | ~ s(X) )
    & ? [B] :
        ( ? [C] : r(B,C)
        & s(B)
        & ? [A] : s(A) ) ),
    inference(miniscoping,[status(thm)],[f3]) ).

fof(f5,plain,
    ( ! [X] :
        ( ! [Y] : ~ q(X,Y)
        | ~ p(X) )
    & ! [X,Y] :
        ( q(X,Y)
        | ~ r(X,Y) )
    & ! [X] :
        ( p(X)
        | ~ s(X) )
    & r(sK0_skl,sK2_skl)
    & s(sK0_skl)
    & s(sK1_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl]),skolemize(B,sK0_skl),skolemize(A,sK1_skl),skolemize(C,sK2_skl)],[f4]) ).

fof(f7,plain,
    s(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f8,plain,
    r(sK0_skl,sK2_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f9,plain,
    ! [X0] :
      ( p(X0)
      | ~ s(X0) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( q(X0,X1)
      | ~ r(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ q(X0,X1)
      | ~ p(X0) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ s(X0)
      | ~ q(X0,X1) ),
    inference(resolution,[status(thm)],[f11,f9]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ r(X0,X1)
      | ~ s(X0) ),
    inference(resolution,[status(thm)],[f12,f10]) ).

fof(f14,plain,
    ~ s(sK0_skl),
    inference(resolution,[status(thm)],[f13,f8]) ).

fof(f15,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f14,f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN944+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n019.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 11:30:51 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.37  % Drodi V4.1.1
% 0.11/0.40  % Refutation found
% 0.11/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.42  % Elapsed time: 0.047695 seconds
% 0.11/0.42  % CPU time: 0.134286 seconds
% 0.11/0.42  % Total memory used: 55.304 MB
% 0.11/0.42  % Net memory used: 54.729 MB
%------------------------------------------------------------------------------