↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SYN325+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 : n018.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:45 PM UTC 2026

% Result   : Theorem 0.10s 0.38s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   3 unt;   1 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   54 (  18   ~;  15   |;  14   &)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   28 (  24   !;   4   ?)

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

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

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

fof(f4,definition,
    ! [X,Y] :
      ( sP0_prd(Y,X)
    <=> ( ~ big_f(Y,Y)
        & big_f(X,X) ) ),
    introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).

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

fof(f6,plain,
    ! [X] :
      ( ~ big_g(sK0_skl(X))
      & ( ( big_g(X)
          & big_f(X,sK0_skl(X)) )
        | sP0_prd(sK0_skl(X),X) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(Y,sK0_skl(X))],[f5]) ).

fof(f8,plain,
    ! [X0] :
      ( big_g(X0)
      | sP0_prd(sK0_skl(X0),X0) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f9,plain,
    ! [X0] : ~ big_g(sK0_skl(X0)),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f10,plain,
    ! [X,Y] :
      ( ( big_f(Y,Y)
        | ~ big_f(X,X)
        | sP0_prd(Y,X) )
      & ( ( ~ big_f(Y,Y)
          & big_f(X,X) )
        | ~ sP0_prd(Y,X) ) ),
    inference(NNF_transformation,[status(thm)],[f4]) ).

fof(f11,plain,
    ( ! [X,Y] :
        ( big_f(Y,Y)
        | ~ big_f(X,X)
        | sP0_prd(Y,X) )
    & ! [X,Y] :
        ( ( ~ big_f(Y,Y)
          & big_f(X,X) )
        | ~ sP0_prd(Y,X) ) ),
    inference(miniscoping,[status(thm)],[f10]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( big_f(X1,X1)
      | ~ sP0_prd(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ big_f(X0,X0)
      | ~ sP0_prd(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ big_f(sK0_skl(X0),sK0_skl(X0))
      | big_g(X0) ),
    inference(resolution,[status(thm)],[f8,f13]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ sP0_prd(X1,sK0_skl(X0))
      | big_g(X0) ),
    inference(resolution,[status(thm)],[f15,f12]) ).

fof(f17,plain,
    ! [X0] :
      ( big_g(sK0_skl(X0))
      | big_g(X0) ),
    inference(resolution,[status(thm)],[f16,f8]) ).

fof(f18,plain,
    ! [X0] : big_g(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f17,f9]) ).

fof(f20,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f9,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN325+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n018.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Sep 21 10:51:29 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.36  % Drodi V4.1.1
% 0.10/0.38  % Refutation found
% 0.10/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41  % Elapsed time: 0.042323 seconds
% 0.13/0.41  % CPU time: 0.117963 seconds
% 0.13/0.41  % Total memory used: 16.000 MB
% 0.13/0.41  % Net memory used: 15.430 MB
%------------------------------------------------------------------------------