↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n003.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:17:12 PM UTC 2026

% Result   : Theorem 0.10s 0.40s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   5 unt;   2 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   45 (  16   ~;  15   |;  10   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   22 (  16   !;   6   ?)

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

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

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

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

fof(f5,plain,
    ( ! [Z] :
        ( ~ q(Z)
        | ~ p(Z) )
    & ( ! [X] : q(X)
      | q(sK0_skl) )
    & ! [X] : p(X) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(Y,sK0_skl)],[f4]) ).

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

fof(f7,plain,
    ! [X0] :
      ( q(X0)
      | q(sK0_skl) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

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

fof(f9,definition,
    ( sQ0_spl
  <=> q(sK0_skl) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f10,plain,
    ( ~ sQ0_spl
    | q(sK0_skl) ),
    inference(component_clause,[status(thm)],[f9]) ).

fof(f12,definition,
    ! [X0] :
      ( sQ1_spl
    <=> q(X0) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f13,plain,
    ! [X0] :
      ( ~ sQ1_spl
      | q(X0) ),
    inference(component_clause,[status(thm)],[f12]) ).

fof(f15,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f7,f9,f12]) ).

fof(f16,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f10,f17]) ).

fof(f17,plain,
    ! [X0] : ~ q(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f8,f6]) ).

fof(f18,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f16]) ).

fof(f19,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f13,f17]) ).

fof(f20,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f19]) ).

fof(f21,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f15,f18,f20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN733+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n003.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 11:15:47 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.10/0.40  % Refutation found
% 0.10/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.42  % Elapsed time: 0.041304 seconds
% 0.10/0.42  % CPU time: 0.106552 seconds
% 0.10/0.42  % Total memory used: 16.437 MB
% 0.10/0.42  % Net memory used: 15.808 MB
%------------------------------------------------------------------------------