↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n017.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:15:47 PM UTC 2026

% Result   : Theorem 0.24s 0.58s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   71 (  30   ~;  20   |;  17   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   0 con; 1-2 aty)
%            Number of variables   :   43 (  34   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [X,Y] :
    ! [Z] :
      ( big_f(X,Y)
     => ( ( ( big_g(X,Y)
            & big_f(X,Y) )
         => ( big_g(Z,Z)
            & big_g(X,Z) ) )
        & big_f(Z,Z)
        & big_f(Y,Z) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ? [X,Y] :
      ! [Z] :
        ( big_f(X,Y)
       => ( ( ( big_g(X,Y)
              & big_f(X,Y) )
           => ( big_g(Z,Z)
              & big_g(X,Z) ) )
          & big_f(Z,Z)
          & big_f(Y,Z) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ! [X,Y] :
    ? [Z] :
      ( ( ( ( ~ big_g(Z,Z)
            | ~ big_g(X,Z) )
          & big_g(X,Y)
          & big_f(X,Y) )
        | ~ big_f(Z,Z)
        | ~ big_f(Y,Z) )
      & big_f(X,Y) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    ( ! [Y] :
        ( ( ( ? [Z] : ~ big_g(Z,Z)
            | ! [X] :
              ? [Z] : ~ big_g(X,Z) )
          & ! [X] : big_g(X,Y)
          & ! [X] : big_f(X,Y) )
        | ? [Z] : ~ big_f(Z,Z)
        | ? [Z] : ~ big_f(Y,Z) )
    & ! [X,Y] : big_f(X,Y) ),
    inference(miniscoping,[status(thm)],[f3]) ).

fof(f5,plain,
    ( ! [Y] :
        ( ( ( ~ big_g(sK3_skl(Y),sK3_skl(Y))
            | ! [X] : ~ big_g(X,sK2_skl(X,Y)) )
          & ! [X] : big_g(X,Y)
          & ! [X] : big_f(X,Y) )
        | ~ big_f(sK1_skl(Y),sK1_skl(Y))
        | ~ big_f(Y,sK0_skl(Y)) )
    & ! [X,Y] : big_f(X,Y) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl]),skolemize(Z,sK0_skl(Y)),skolemize(Z,sK1_skl(Y)),skolemize(Z,sK2_skl(X,Y)),skolemize(Z,sK3_skl(Y))],[f4]) ).

fof(f6,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( big_g(X1,X0)
      | ~ big_f(sK1_skl(X0),sK1_skl(X0))
      | ~ big_f(X0,sK0_skl(X0)) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( ~ big_g(sK3_skl(X0),sK3_skl(X0))
      | ~ big_g(X1,sK2_skl(X1,X0))
      | ~ big_f(sK1_skl(X0),sK1_skl(X0))
      | ~ big_f(X0,sK0_skl(X0)) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( big_g(X1,X0)
      | ~ big_f(sK1_skl(X0),sK1_skl(X0)) ),
    inference(forward_subsumption_resolution,[status(thm)],[f8,f6]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ big_g(sK3_skl(X0),sK3_skl(X0))
      | ~ big_g(X1,sK2_skl(X1,X0))
      | ~ big_f(sK1_skl(X0),sK1_skl(X0)) ),
    inference(forward_subsumption_resolution,[status(thm)],[f9,f6]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ big_f(sK1_skl(sK3_skl(X0)),sK1_skl(sK3_skl(X0)))
      | ~ big_g(X1,sK2_skl(X1,X0))
      | ~ big_f(sK1_skl(X0),sK1_skl(X0)) ),
    inference(resolution,[status(thm)],[f11,f10]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ big_f(sK1_skl(sK3_skl(X1)),sK1_skl(sK3_skl(X1)))
      | ~ big_g(X0,sK2_skl(X0,X1)) ),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f6]) ).

fof(f14,plain,
    ! [X0,X1] : ~ big_g(X0,sK2_skl(X0,X1)),
    inference(forward_subsumption_resolution,[status(thm)],[f13,f6]) ).

fof(f15,plain,
    ! [X0,X1] : ~ big_f(sK1_skl(sK2_skl(X0,X1)),sK1_skl(sK2_skl(X0,X1))),
    inference(resolution,[status(thm)],[f14,f10]) ).

fof(f16,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f15,f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : SYN333+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.08  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.54  % Computer : n017.cluster.edu
% 0.24/0.54  % Model    : x86_64 x86_64
% 0.24/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.54  % Memory   : 8046.5625MB
% 0.24/0.54  % OS       : Linux 6.8.0-71-generic
% 0.24/0.54  % CPULimit : 300
% 0.24/0.54  % WCLimit  : 300
% 0.24/0.54  % DateTime : Mon Sep 21 10:45:12 UTC 2026
% 0.24/0.54  % CPUTime  : 
% 0.24/0.56  % Drodi V4.1.1
% 0.24/0.58  % Refutation found
% 0.24/0.58  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.24/0.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.24/0.65  % Elapsed time: 0.099074 seconds
% 0.24/0.65  % CPU time: 0.140558 seconds
% 0.24/0.65  % Total memory used: 1.729 MB
% 0.24/0.65  % Net memory used: 1.717 MB
%------------------------------------------------------------------------------