↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SYN407+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/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 03:16:00 PM UTC 2026

% Result   : Theorem 0.09s 0.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   43 (  15   ~;  14   |;   8   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   14 (  11   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X] :
        ( f(X)
       => ( h(X)
          | g(X) ) )
   => ( ? [Z] :
          ( h(Z)
          & f(Z) )
      | ! [Y] :
          ( f(Y)
         => g(Y) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ! [X] :
          ( f(X)
         => ( h(X)
            | g(X) ) )
     => ( ? [Z] :
            ( h(Z)
            & f(Z) )
        | ! [Y] :
            ( f(Y)
           => g(Y) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

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

fof(f4,plain,
    ( ! [Z] :
        ( ~ h(Z)
        | ~ f(Z) )
    & ~ g(sK0_skl)
    & f(sK0_skl)
    & ! [X] :
        ( h(X)
        | g(X)
        | ~ f(X) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(Y,sK0_skl)],[f3]) ).

fof(f5,plain,
    ! [X0] :
      ( h(X0)
      | g(X0)
      | ~ f(X0) ),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f6,plain,
    f(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f7,plain,
    ~ g(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f8,plain,
    ! [X0] :
      ( ~ h(X0)
      | ~ f(X0) ),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f9,plain,
    ! [X0] :
      ( g(X0)
      | ~ f(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f5,f8]) ).

fof(f10,plain,
    ~ f(sK0_skl),
    inference(resolution,[status(thm)],[f9,f7]) ).

fof(f11,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f10,f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN407+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 10:53:43 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.39  % Refutation found
% 0.09/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.41  % Elapsed time: 0.040426 seconds
% 0.09/0.41  % CPU time: 0.103048 seconds
% 0.09/0.41  % Total memory used: 16.444 MB
% 0.09/0.41  % Net memory used: 15.839 MB
%------------------------------------------------------------------------------